About the Execution of LTSMin+red for DoubleLock-PT-p1s3
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1142.880 | 685721.00 | 764000.00 | 2583.50 | ?FFFFFFFFFFF??F? | 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-167819418700524.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-p1s3, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r137-smll-167819418700524
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.7M
-rw-r--r-- 1 mcc users 5.8K Feb 25 14:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 25 14:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 14:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 14:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 14:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 25 14:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 25 14:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 25 14:21 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-p1s3-LTLFireability-00
FORMULA_NAME DoubleLock-PT-p1s3-LTLFireability-01
FORMULA_NAME DoubleLock-PT-p1s3-LTLFireability-02
FORMULA_NAME DoubleLock-PT-p1s3-LTLFireability-03
FORMULA_NAME DoubleLock-PT-p1s3-LTLFireability-04
FORMULA_NAME DoubleLock-PT-p1s3-LTLFireability-05
FORMULA_NAME DoubleLock-PT-p1s3-LTLFireability-06
FORMULA_NAME DoubleLock-PT-p1s3-LTLFireability-07
FORMULA_NAME DoubleLock-PT-p1s3-LTLFireability-08
FORMULA_NAME DoubleLock-PT-p1s3-LTLFireability-09
FORMULA_NAME DoubleLock-PT-p1s3-LTLFireability-10
FORMULA_NAME DoubleLock-PT-p1s3-LTLFireability-11
FORMULA_NAME DoubleLock-PT-p1s3-LTLFireability-12
FORMULA_NAME DoubleLock-PT-p1s3-LTLFireability-13
FORMULA_NAME DoubleLock-PT-p1s3-LTLFireability-14
FORMULA_NAME DoubleLock-PT-p1s3-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678920101402
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-p1s3
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-15 22:41:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-15 22:41:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 22:41:44] [INFO ] Load time of PNML (sax parser for PT used): 583 ms
[2023-03-15 22:41:44] [INFO ] Transformed 570 places.
[2023-03-15 22:41:44] [INFO ] Transformed 7568 transitions.
[2023-03-15 22:41:44] [INFO ] Parsed PT model containing 570 places and 7568 transitions and 30656 arcs in 768 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 132 places in 28 ms
Reduce places removed 132 places and 256 transitions.
FORMULA DoubleLock-PT-p1s3-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p1s3-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p1s3-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p1s3-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 438 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 438/438 places, 7312/7312 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 7312
Applied a total of 4 rules in 160 ms. Remains 434 /438 variables (removed 4) and now considering 7312/7312 (removed 0) transitions.
[2023-03-15 22:41:45] [INFO ] Flow matrix only has 4971 transitions (discarded 2341 similar events)
// Phase 1: matrix 4971 rows 434 cols
[2023-03-15 22:41:45] [INFO ] Computed 2 place invariants in 98 ms
[2023-03-15 22:41:46] [INFO ] Implicit Places using invariants in 1116 ms returned []
[2023-03-15 22:41:46] [INFO ] Flow matrix only has 4971 transitions (discarded 2341 similar events)
[2023-03-15 22:41:46] [INFO ] Invariant cache hit.
[2023-03-15 22:41:47] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-15 22:41:48] [INFO ] Implicit Places using invariants and state equation in 2545 ms returned []
Implicit Place search using SMT with State Equation took 3707 ms to find 0 implicit places.
[2023-03-15 22:41:48] [INFO ] Flow matrix only has 4971 transitions (discarded 2341 similar events)
[2023-03-15 22:41:48] [INFO ] Invariant cache hit.
[2023-03-15 22:41:52] [INFO ] Dead Transitions using invariants and state equation in 3986 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 434/438 places, 7312/7312 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7862 ms. Remains : 434/438 places, 7312/7312 transitions.
Support contains 41 out of 434 places after structural reductions.
[2023-03-15 22:41:53] [INFO ] Flatten gal took : 610 ms
[2023-03-15 22:41:54] [INFO ] Flatten gal took : 352 ms
[2023-03-15 22:41:55] [INFO ] Input system was already deterministic with 7312 transitions.
Incomplete random walk after 10008 steps, including 92 resets, run finished after 625 ms. (steps per millisecond=16 ) properties (out of 25) seen :6
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) 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 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) 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 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) 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 16) 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 16) 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 16) 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 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) 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 15) seen :0
Running SMT prover for 15 properties.
[2023-03-15 22:41:55] [INFO ] Flow matrix only has 4971 transitions (discarded 2341 similar events)
[2023-03-15 22:41:55] [INFO ] Invariant cache hit.
[2023-03-15 22:41:56] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-15 22:41:56] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-15 22:42:21] [INFO ] After 24561ms SMT Verify possible using state equation in real domain returned unsat :3 sat :1 real:10
[2023-03-15 22:42:21] [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:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.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 22:42:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 22:42:21] [INFO ] After 25062ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 15 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 19 out of 434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 7312/7312 transitions.
Drop transitions removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 434 transition count 7191
Applied a total of 121 rules in 470 ms. Remains 434 /434 variables (removed 0) and now considering 7191/7312 (removed 121) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 476 ms. Remains : 434/434 places, 7191/7312 transitions.
Incomplete random walk after 10008 steps, including 92 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-15 22:42:22] [INFO ] Flow matrix only has 4850 transitions (discarded 2341 similar events)
// Phase 1: matrix 4850 rows 434 cols
[2023-03-15 22:42:22] [INFO ] Computed 2 place invariants in 64 ms
[2023-03-15 22:42:22] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:42:22] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-15 22:42:33] [INFO ] After 10660ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-15 22:42:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:42:33] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-15 22:42:46] [INFO ] After 13179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-15 22:42:46] [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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:644)
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 22:42:58] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 22:42:58] [INFO ] After 25025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Parikh walk visited 0 properties in 613 ms.
Support contains 15 out of 434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 7191/7191 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 434 transition count 7188
Applied a total of 3 rules in 261 ms. Remains 434 /434 variables (removed 0) and now considering 7188/7191 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 264 ms. Remains : 434/434 places, 7188/7191 transitions.
Incomplete random walk after 10000 steps, including 95 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-15 22:42:59] [INFO ] Flow matrix only has 4847 transitions (discarded 2341 similar events)
// Phase 1: matrix 4847 rows 434 cols
[2023-03-15 22:42:59] [INFO ] Computed 2 place invariants in 36 ms
[2023-03-15 22:43:00] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:43:00] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-15 22:43:09] [INFO ] After 9760ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-15 22:43:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-15 22:43:09] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-15 22:43:20] [INFO ] After 10752ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-15 22:43:20] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-15 22:43:34] [INFO ] After 14029ms SMT Verify possible using 400 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-15 22:43:34] [INFO ] After 14030ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-15 22:43:34] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 343 ms.
Support contains 11 out of 434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 7188/7188 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 434 transition count 7186
Applied a total of 2 rules in 262 ms. Remains 434 /434 variables (removed 0) and now considering 7186/7188 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 263 ms. Remains : 434/434 places, 7186/7188 transitions.
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA DoubleLock-PT-p1s3-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 10 stabilizing places and 2144 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)))'
Support contains 2 out of 434 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 434/434 places, 7312/7312 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 433 transition count 7184
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 433 transition count 7184
Applied a total of 2 rules in 441 ms. Remains 433 /434 variables (removed 1) and now considering 7184/7312 (removed 128) transitions.
[2023-03-15 22:43:36] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
// Phase 1: matrix 4843 rows 433 cols
[2023-03-15 22:43:36] [INFO ] Computed 2 place invariants in 32 ms
[2023-03-15 22:43:36] [INFO ] Implicit Places using invariants in 785 ms returned []
[2023-03-15 22:43:36] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
[2023-03-15 22:43:36] [INFO ] Invariant cache hit.
[2023-03-15 22:43:37] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-15 22:43:39] [INFO ] Implicit Places using invariants and state equation in 2692 ms returned []
Implicit Place search using SMT with State Equation took 3480 ms to find 0 implicit places.
[2023-03-15 22:43:40] [INFO ] Redundant transitions in 1022 ms returned []
[2023-03-15 22:43:40] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
[2023-03-15 22:43:40] [INFO ] Invariant cache hit.
[2023-03-15 22:43:44] [INFO ] Dead Transitions using invariants and state equation in 3857 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 433/434 places, 7184/7312 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8814 ms. Remains : 433/434 places, 7184/7312 transitions.
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleLock-PT-p1s3-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s88 1) (LT s385 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 1461 reset in 1296 ms.
Product exploration explored 100000 steps with 1416 reset in 1090 ms.
Computed a total of 10 stabilizing places and 2144 stable transitions
Computed a total of 10 stabilizing places and 2144 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 141 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 82 ms :[(NOT p0), (NOT p0)]
Finished random walk after 6469 steps, including 56 resets, run visited all 1 properties in 33 ms. (steps per millisecond=196 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 156 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 :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 433/433 places, 7184/7184 transitions.
Applied a total of 0 rules in 232 ms. Remains 433 /433 variables (removed 0) and now considering 7184/7184 (removed 0) transitions.
[2023-03-15 22:43:48] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
[2023-03-15 22:43:48] [INFO ] Invariant cache hit.
[2023-03-15 22:43:48] [INFO ] Implicit Places using invariants in 734 ms returned []
[2023-03-15 22:43:48] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
[2023-03-15 22:43:48] [INFO ] Invariant cache hit.
[2023-03-15 22:43:49] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-15 22:43:51] [INFO ] Implicit Places using invariants and state equation in 2578 ms returned []
Implicit Place search using SMT with State Equation took 3321 ms to find 0 implicit places.
[2023-03-15 22:43:52] [INFO ] Redundant transitions in 983 ms returned []
[2023-03-15 22:43:52] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
[2023-03-15 22:43:52] [INFO ] Invariant cache hit.
[2023-03-15 22:43:56] [INFO ] Dead Transitions using invariants and state equation in 3849 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8399 ms. Remains : 433/433 places, 7184/7184 transitions.
Computed a total of 10 stabilizing places and 2144 stable transitions
Computed a total of 10 stabilizing places and 2144 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 124 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 :[(NOT p0), (NOT p0)]
Incomplete random walk after 10006 steps, including 86 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 1) seen :0
Finished Best-First random walk after 2134 steps, including 3 resets, run visited all 1 properties in 5 ms. (steps per millisecond=426 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 141 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 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1430 reset in 1003 ms.
Product exploration explored 100000 steps with 1441 reset in 994 ms.
Support contains 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 433/433 places, 7184/7184 transitions.
Applied a total of 0 rules in 207 ms. Remains 433 /433 variables (removed 0) and now considering 7184/7184 (removed 0) transitions.
[2023-03-15 22:43:59] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
[2023-03-15 22:43:59] [INFO ] Invariant cache hit.
[2023-03-15 22:43:59] [INFO ] Implicit Places using invariants in 814 ms returned []
[2023-03-15 22:43:59] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
[2023-03-15 22:43:59] [INFO ] Invariant cache hit.
[2023-03-15 22:44:00] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-15 22:44:02] [INFO ] Implicit Places using invariants and state equation in 2506 ms returned []
Implicit Place search using SMT with State Equation took 3322 ms to find 0 implicit places.
[2023-03-15 22:44:03] [INFO ] Redundant transitions in 639 ms returned []
[2023-03-15 22:44:03] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
[2023-03-15 22:44:03] [INFO ] Invariant cache hit.
[2023-03-15 22:44:06] [INFO ] Dead Transitions using invariants and state equation in 3797 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7975 ms. Remains : 433/433 places, 7184/7184 transitions.
Treatment of property DoubleLock-PT-p1s3-LTLFireability-00 finished in 31928 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||F(p1)) U (G((p0||F(p1)))||((p0||F(p1))&&(!p1||X(G(p0))))))))'
Support contains 4 out of 434 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 434/434 places, 7312/7312 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 433 transition count 7184
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 433 transition count 7184
Applied a total of 2 rules in 245 ms. Remains 433 /434 variables (removed 1) and now considering 7184/7312 (removed 128) transitions.
[2023-03-15 22:44:07] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
[2023-03-15 22:44:07] [INFO ] Invariant cache hit.
[2023-03-15 22:44:08] [INFO ] Implicit Places using invariants in 743 ms returned []
[2023-03-15 22:44:08] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
[2023-03-15 22:44:08] [INFO ] Invariant cache hit.
[2023-03-15 22:44:09] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-15 22:44:11] [INFO ] Implicit Places using invariants and state equation in 2466 ms returned []
Implicit Place search using SMT with State Equation took 3211 ms to find 0 implicit places.
[2023-03-15 22:44:11] [INFO ] Redundant transitions in 637 ms returned []
[2023-03-15 22:44:11] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
[2023-03-15 22:44:11] [INFO ] Invariant cache hit.
[2023-03-15 22:44:15] [INFO ] Dead Transitions using invariants and state equation in 3860 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 433/434 places, 7184/7312 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7969 ms. Remains : 433/434 places, 7184/7312 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleLock-PT-p1s3-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(AND (GEQ s37 1) (GEQ s384 1)), p0:(AND (GEQ s75 1) (GEQ s391 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 70 steps with 0 reset in 1 ms.
FORMULA DoubleLock-PT-p1s3-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p1s3-LTLFireability-02 finished in 8091 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 434 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 434/434 places, 7312/7312 transitions.
Applied a total of 0 rules in 222 ms. Remains 434 /434 variables (removed 0) and now considering 7312/7312 (removed 0) transitions.
[2023-03-15 22:44:15] [INFO ] Flow matrix only has 4971 transitions (discarded 2341 similar events)
// Phase 1: matrix 4971 rows 434 cols
[2023-03-15 22:44:15] [INFO ] Computed 2 place invariants in 33 ms
[2023-03-15 22:44:16] [INFO ] Implicit Places using invariants in 905 ms returned []
[2023-03-15 22:44:16] [INFO ] Flow matrix only has 4971 transitions (discarded 2341 similar events)
[2023-03-15 22:44:16] [INFO ] Invariant cache hit.
[2023-03-15 22:44:17] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-15 22:44:19] [INFO ] Implicit Places using invariants and state equation in 2444 ms returned []
Implicit Place search using SMT with State Equation took 3359 ms to find 0 implicit places.
[2023-03-15 22:44:19] [INFO ] Redundant transitions in 662 ms returned []
[2023-03-15 22:44:19] [INFO ] Flow matrix only has 4971 transitions (discarded 2341 similar events)
[2023-03-15 22:44:19] [INFO ] Invariant cache hit.
[2023-03-15 22:44:23] [INFO ] Dead Transitions using invariants and state equation in 3638 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7891 ms. Remains : 434/434 places, 7312/7312 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : DoubleLock-PT-p1s3-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s316 1) (GEQ s432 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 65 steps with 0 reset in 1 ms.
FORMULA DoubleLock-PT-p1s3-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p1s3-LTLFireability-03 finished in 7955 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))'
Support contains 2 out of 434 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 434/434 places, 7312/7312 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 433 transition count 7184
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 433 transition count 7184
Applied a total of 2 rules in 235 ms. Remains 433 /434 variables (removed 1) and now considering 7184/7312 (removed 128) transitions.
[2023-03-15 22:44:23] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
// Phase 1: matrix 4843 rows 433 cols
[2023-03-15 22:44:23] [INFO ] Computed 2 place invariants in 32 ms
[2023-03-15 22:44:24] [INFO ] Implicit Places using invariants in 843 ms returned []
[2023-03-15 22:44:24] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
[2023-03-15 22:44:24] [INFO ] Invariant cache hit.
[2023-03-15 22:44:25] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-15 22:44:27] [INFO ] Implicit Places using invariants and state equation in 2512 ms returned []
Implicit Place search using SMT with State Equation took 3357 ms to find 0 implicit places.
[2023-03-15 22:44:27] [INFO ] Redundant transitions in 659 ms returned []
[2023-03-15 22:44:27] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
[2023-03-15 22:44:27] [INFO ] Invariant cache hit.
[2023-03-15 22:44:31] [INFO ] Dead Transitions using invariants and state equation in 3477 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 433/434 places, 7184/7312 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7738 ms. Remains : 433/434 places, 7184/7312 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0)]
Running random walk in product with property : DoubleLock-PT-p1s3-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s85 1) (GEQ s420 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 92 steps with 0 reset in 1 ms.
FORMULA DoubleLock-PT-p1s3-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p1s3-LTLFireability-05 finished in 7876 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 434 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 434/434 places, 7312/7312 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 433 transition count 7184
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 433 transition count 7184
Applied a total of 2 rules in 229 ms. Remains 433 /434 variables (removed 1) and now considering 7184/7312 (removed 128) transitions.
[2023-03-15 22:44:31] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
[2023-03-15 22:44:31] [INFO ] Invariant cache hit.
[2023-03-15 22:44:32] [INFO ] Implicit Places using invariants in 841 ms returned []
[2023-03-15 22:44:32] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
[2023-03-15 22:44:32] [INFO ] Invariant cache hit.
[2023-03-15 22:44:33] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-15 22:44:35] [INFO ] Implicit Places using invariants and state equation in 2548 ms returned []
Implicit Place search using SMT with State Equation took 3391 ms to find 0 implicit places.
[2023-03-15 22:44:35] [INFO ] Redundant transitions in 612 ms returned []
[2023-03-15 22:44:35] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
[2023-03-15 22:44:35] [INFO ] Invariant cache hit.
[2023-03-15 22:44:39] [INFO ] Dead Transitions using invariants and state equation in 3388 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 433/434 places, 7184/7312 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7630 ms. Remains : 433/434 places, 7184/7312 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : DoubleLock-PT-p1s3-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s35 1) (GEQ s432 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 64 steps with 0 reset in 1 ms.
FORMULA DoubleLock-PT-p1s3-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p1s3-LTLFireability-06 finished in 7694 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 434 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 434/434 places, 7312/7312 transitions.
Applied a total of 0 rules in 23 ms. Remains 434 /434 variables (removed 0) and now considering 7312/7312 (removed 0) transitions.
[2023-03-15 22:44:39] [INFO ] Flow matrix only has 4971 transitions (discarded 2341 similar events)
// Phase 1: matrix 4971 rows 434 cols
[2023-03-15 22:44:39] [INFO ] Computed 2 place invariants in 30 ms
[2023-03-15 22:44:40] [INFO ] Implicit Places using invariants in 929 ms returned []
[2023-03-15 22:44:40] [INFO ] Flow matrix only has 4971 transitions (discarded 2341 similar events)
[2023-03-15 22:44:40] [INFO ] Invariant cache hit.
[2023-03-15 22:44:40] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-15 22:44:42] [INFO ] Implicit Places using invariants and state equation in 2455 ms returned []
Implicit Place search using SMT with State Equation took 3386 ms to find 0 implicit places.
[2023-03-15 22:44:42] [INFO ] Flow matrix only has 4971 transitions (discarded 2341 similar events)
[2023-03-15 22:44:42] [INFO ] Invariant cache hit.
[2023-03-15 22:44:46] [INFO ] Dead Transitions using invariants and state equation in 3418 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6829 ms. Remains : 434/434 places, 7312/7312 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleLock-PT-p1s3-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s374 1) (GEQ s432 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][false, false]]
Stuttering criterion allowed to conclude after 124 steps with 0 reset in 2 ms.
FORMULA DoubleLock-PT-p1s3-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p1s3-LTLFireability-07 finished in 6933 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(p1))))'
Support contains 4 out of 434 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 434/434 places, 7312/7312 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 433 transition count 7184
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 433 transition count 7184
Applied a total of 2 rules in 51 ms. Remains 433 /434 variables (removed 1) and now considering 7184/7312 (removed 128) transitions.
[2023-03-15 22:44:46] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
// Phase 1: matrix 4843 rows 433 cols
[2023-03-15 22:44:46] [INFO ] Computed 2 place invariants in 32 ms
[2023-03-15 22:44:47] [INFO ] Implicit Places using invariants in 888 ms returned []
[2023-03-15 22:44:47] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
[2023-03-15 22:44:47] [INFO ] Invariant cache hit.
[2023-03-15 22:44:47] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-15 22:44:49] [INFO ] Implicit Places using invariants and state equation in 2523 ms returned []
Implicit Place search using SMT with State Equation took 3418 ms to find 0 implicit places.
[2023-03-15 22:44:49] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
[2023-03-15 22:44:49] [INFO ] Invariant cache hit.
[2023-03-15 22:44:52] [INFO ] Dead Transitions using invariants and state equation in 3366 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 433/434 places, 7184/7312 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6837 ms. Remains : 433/434 places, 7184/7312 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleLock-PT-p1s3-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s72 1) (GEQ s386 1)), p1:(OR (LT s125 1) (LT s412 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 661 steps with 8 reset in 10 ms.
FORMULA DoubleLock-PT-p1s3-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p1s3-LTLFireability-08 finished in 6984 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((!p0||G(p1)) U p2))))'
Support contains 6 out of 434 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 434/434 places, 7312/7312 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 433 transition count 7184
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 433 transition count 7184
Applied a total of 2 rules in 245 ms. Remains 433 /434 variables (removed 1) and now considering 7184/7312 (removed 128) transitions.
[2023-03-15 22:44:53] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
[2023-03-15 22:44:53] [INFO ] Invariant cache hit.
[2023-03-15 22:44:54] [INFO ] Implicit Places using invariants in 824 ms returned []
[2023-03-15 22:44:54] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
[2023-03-15 22:44:54] [INFO ] Invariant cache hit.
[2023-03-15 22:44:54] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-15 22:44:56] [INFO ] Implicit Places using invariants and state equation in 2460 ms returned []
Implicit Place search using SMT with State Equation took 3286 ms to find 0 implicit places.
[2023-03-15 22:44:57] [INFO ] Redundant transitions in 639 ms returned []
[2023-03-15 22:44:57] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
[2023-03-15 22:44:57] [INFO ] Invariant cache hit.
[2023-03-15 22:45:00] [INFO ] Dead Transitions using invariants and state equation in 3522 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 433/434 places, 7184/7312 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7702 ms. Remains : 433/434 places, 7184/7312 transitions.
Stuttering acceptance computed with spot in 283 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DoubleLock-PT-p1s3-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR p2 (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) p1)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={1} source=0 dest: 2}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={1} source=1 dest: 2}], [{ cond=(OR (AND p2 (NOT p1)) (AND (NOT p0) (NOT p1))), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(OR (AND p2 p1) (AND (NOT p0) p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={1} source=2 dest: 3}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={1} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s4 1) (GEQ s394 1)), p0:(AND (GEQ s30 1) (GEQ s388 1)), p1:(AND (GEQ s38 1) (GEQ s385 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 95 steps with 0 reset in 2 ms.
FORMULA DoubleLock-PT-p1s3-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p1s3-LTLFireability-10 finished in 8018 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(p1))))'
Support contains 4 out of 434 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 434/434 places, 7312/7312 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 433 transition count 7184
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 433 transition count 7184
Applied a total of 2 rules in 246 ms. Remains 433 /434 variables (removed 1) and now considering 7184/7312 (removed 128) transitions.
[2023-03-15 22:45:01] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
[2023-03-15 22:45:01] [INFO ] Invariant cache hit.
[2023-03-15 22:45:02] [INFO ] Implicit Places using invariants in 825 ms returned []
[2023-03-15 22:45:02] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
[2023-03-15 22:45:02] [INFO ] Invariant cache hit.
[2023-03-15 22:45:02] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-15 22:45:04] [INFO ] Implicit Places using invariants and state equation in 2406 ms returned []
Implicit Place search using SMT with State Equation took 3238 ms to find 0 implicit places.
[2023-03-15 22:45:05] [INFO ] Redundant transitions in 638 ms returned []
[2023-03-15 22:45:05] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
[2023-03-15 22:45:05] [INFO ] Invariant cache hit.
[2023-03-15 22:45:09] [INFO ] Dead Transitions using invariants and state equation in 4060 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 433/434 places, 7184/7312 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8194 ms. Remains : 433/434 places, 7184/7312 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DoubleLock-PT-p1s3-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s60 1) (LT s419 1)), p1:(OR (LT s118 1) (LT s384 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1326 reset in 1064 ms.
Product exploration explored 100000 steps with 1318 reset in 1036 ms.
Computed a total of 10 stabilizing places and 2144 stable transitions
Computed a total of 10 stabilizing places and 2144 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 211 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10003 steps, including 90 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-15 22:45:12] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
[2023-03-15 22:45:12] [INFO ] Invariant cache hit.
[2023-03-15 22:45:12] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-15 22:45:12] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-15 22:45:19] [INFO ] After 7060ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:45:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:45:19] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-15 22:45:24] [INFO ] After 4997ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:45:24] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-15 22:45:33] [INFO ] After 9165ms SMT Verify possible using 400 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-15 22:45:33] [INFO ] After 14283ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 28 ms.
Support contains 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7184/7184 transitions.
Drop transitions removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 433 transition count 7057
Applied a total of 127 rules in 216 ms. Remains 433 /433 variables (removed 0) and now considering 7057/7184 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 217 ms. Remains : 433/433 places, 7057/7184 transitions.
Incomplete random walk after 10000 steps, including 95 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 132028 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 132028 steps, saw 102729 distinct states, run finished after 3004 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 22:45:36] [INFO ] Flow matrix only has 4716 transitions (discarded 2341 similar events)
// Phase 1: matrix 4716 rows 433 cols
[2023-03-15 22:45:36] [INFO ] Computed 2 place invariants in 28 ms
[2023-03-15 22:45:36] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:45:36] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-15 22:45:41] [INFO ] After 4414ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:45:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:45:41] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-15 22:45:46] [INFO ] After 4756ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:45:46] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-15 22:45:55] [INFO ] After 9170ms SMT Verify possible using 400 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-15 22:45:55] [INFO ] After 14029ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 22 ms.
Support contains 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7057/7057 transitions.
Applied a total of 0 rules in 207 ms. Remains 433 /433 variables (removed 0) and now considering 7057/7057 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 207 ms. Remains : 433/433 places, 7057/7057 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7057/7057 transitions.
Applied a total of 0 rules in 199 ms. Remains 433 /433 variables (removed 0) and now considering 7057/7057 (removed 0) transitions.
[2023-03-15 22:45:55] [INFO ] Flow matrix only has 4716 transitions (discarded 2341 similar events)
[2023-03-15 22:45:55] [INFO ] Invariant cache hit.
[2023-03-15 22:45:56] [INFO ] Implicit Places using invariants in 863 ms returned []
[2023-03-15 22:45:56] [INFO ] Flow matrix only has 4716 transitions (discarded 2341 similar events)
[2023-03-15 22:45:56] [INFO ] Invariant cache hit.
[2023-03-15 22:45:57] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-15 22:45:58] [INFO ] Implicit Places using invariants and state equation in 2349 ms returned []
Implicit Place search using SMT with State Equation took 3222 ms to find 0 implicit places.
[2023-03-15 22:45:59] [INFO ] Redundant transitions in 588 ms returned []
[2023-03-15 22:45:59] [INFO ] Flow matrix only has 4716 transitions (discarded 2341 similar events)
[2023-03-15 22:45:59] [INFO ] Invariant cache hit.
[2023-03-15 22:46:02] [INFO ] Dead Transitions using invariants and state equation in 3056 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7072 ms. Remains : 433/433 places, 7057/7057 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 4716
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 2341 place count 433 transition count 4706
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 2361 place count 423 transition count 4706
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 2367 place count 420 transition count 4703
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2368 place count 419 transition count 4575
Iterating global reduction 1 with 1 rules applied. Total rules applied 2369 place count 419 transition count 4575
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2370 place count 419 transition count 4574
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2371 place count 418 transition count 4574
Applied a total of 2371 rules in 348 ms. Remains 418 /433 variables (removed 15) and now considering 4574/7057 (removed 2483) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4574 rows 418 cols
[2023-03-15 22:46:02] [INFO ] Computed 2 place invariants in 29 ms
[2023-03-15 22:46:03] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-15 22:46:03] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-15 22:46:06] [INFO ] After 3175ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:46:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:46:06] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-15 22:46:09] [INFO ] After 3067ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:46:10] [INFO ] After 4076ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1119 ms.
[2023-03-15 22:46:11] [INFO ] After 5295ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 223 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 433 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 433/433 places, 7184/7184 transitions.
Applied a total of 0 rules in 208 ms. Remains 433 /433 variables (removed 0) and now considering 7184/7184 (removed 0) transitions.
[2023-03-15 22:46:12] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
// Phase 1: matrix 4843 rows 433 cols
[2023-03-15 22:46:12] [INFO ] Computed 2 place invariants in 30 ms
[2023-03-15 22:46:13] [INFO ] Implicit Places using invariants in 980 ms returned []
[2023-03-15 22:46:13] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
[2023-03-15 22:46:13] [INFO ] Invariant cache hit.
[2023-03-15 22:46:13] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-15 22:46:15] [INFO ] Implicit Places using invariants and state equation in 2398 ms returned []
Implicit Place search using SMT with State Equation took 3381 ms to find 0 implicit places.
[2023-03-15 22:46:16] [INFO ] Redundant transitions in 627 ms returned []
[2023-03-15 22:46:16] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
[2023-03-15 22:46:16] [INFO ] Invariant cache hit.
[2023-03-15 22:46:20] [INFO ] Dead Transitions using invariants and state equation in 4129 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8358 ms. Remains : 433/433 places, 7184/7184 transitions.
Computed a total of 10 stabilizing places and 2144 stable transitions
Computed a total of 10 stabilizing places and 2144 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 222 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 89 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-15 22:46:20] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
[2023-03-15 22:46:20] [INFO ] Invariant cache hit.
[2023-03-15 22:46:20] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:46:20] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-15 22:46:27] [INFO ] After 7128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:46:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:46:28] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-15 22:46:33] [INFO ] After 4997ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:46:33] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-15 22:46:42] [INFO ] After 9164ms SMT Verify possible using 400 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-15 22:46:42] [INFO ] After 14267ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 28 ms.
Support contains 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7184/7184 transitions.
Drop transitions removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 433 transition count 7057
Applied a total of 127 rules in 218 ms. Remains 433 /433 variables (removed 0) and now considering 7057/7184 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 218 ms. Remains : 433/433 places, 7057/7184 transitions.
Incomplete random walk after 10000 steps, including 89 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 132682 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 132682 steps, saw 103214 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 22:46:45] [INFO ] Flow matrix only has 4716 transitions (discarded 2341 similar events)
// Phase 1: matrix 4716 rows 433 cols
[2023-03-15 22:46:45] [INFO ] Computed 2 place invariants in 37 ms
[2023-03-15 22:46:45] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:46:45] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-15 22:46:50] [INFO ] After 4504ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:46:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:46:50] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-15 22:46:54] [INFO ] After 4754ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:46:54] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-15 22:47:04] [INFO ] After 9168ms SMT Verify possible using 400 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-15 22:47:04] [INFO ] After 14024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 23 ms.
Support contains 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7057/7057 transitions.
Applied a total of 0 rules in 204 ms. Remains 433 /433 variables (removed 0) and now considering 7057/7057 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 204 ms. Remains : 433/433 places, 7057/7057 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7057/7057 transitions.
Applied a total of 0 rules in 211 ms. Remains 433 /433 variables (removed 0) and now considering 7057/7057 (removed 0) transitions.
[2023-03-15 22:47:04] [INFO ] Flow matrix only has 4716 transitions (discarded 2341 similar events)
[2023-03-15 22:47:04] [INFO ] Invariant cache hit.
[2023-03-15 22:47:05] [INFO ] Implicit Places using invariants in 918 ms returned []
[2023-03-15 22:47:05] [INFO ] Flow matrix only has 4716 transitions (discarded 2341 similar events)
[2023-03-15 22:47:05] [INFO ] Invariant cache hit.
[2023-03-15 22:47:06] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-15 22:47:07] [INFO ] Implicit Places using invariants and state equation in 2434 ms returned []
Implicit Place search using SMT with State Equation took 3362 ms to find 0 implicit places.
[2023-03-15 22:47:08] [INFO ] Redundant transitions in 608 ms returned []
[2023-03-15 22:47:08] [INFO ] Flow matrix only has 4716 transitions (discarded 2341 similar events)
[2023-03-15 22:47:08] [INFO ] Invariant cache hit.
[2023-03-15 22:47:12] [INFO ] Dead Transitions using invariants and state equation in 3967 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8156 ms. Remains : 433/433 places, 7057/7057 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 4716
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 2341 place count 433 transition count 4706
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 2361 place count 423 transition count 4706
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 2367 place count 420 transition count 4703
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2368 place count 419 transition count 4575
Iterating global reduction 1 with 1 rules applied. Total rules applied 2369 place count 419 transition count 4575
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2370 place count 419 transition count 4574
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2371 place count 418 transition count 4574
Applied a total of 2371 rules in 273 ms. Remains 418 /433 variables (removed 15) and now considering 4574/7057 (removed 2483) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4574 rows 418 cols
[2023-03-15 22:47:12] [INFO ] Computed 2 place invariants in 35 ms
[2023-03-15 22:47:12] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:47:12] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-15 22:47:16] [INFO ] After 3223ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:47:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:47:16] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-15 22:47:19] [INFO ] After 3047ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:47:20] [INFO ] After 4030ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1146 ms.
[2023-03-15 22:47:21] [INFO ] After 5266ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 232 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 1334 reset in 995 ms.
Product exploration explored 100000 steps with 1321 reset in 1020 ms.
Support contains 4 out of 433 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 433/433 places, 7184/7184 transitions.
Applied a total of 0 rules in 198 ms. Remains 433 /433 variables (removed 0) and now considering 7184/7184 (removed 0) transitions.
[2023-03-15 22:47:24] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
// Phase 1: matrix 4843 rows 433 cols
[2023-03-15 22:47:24] [INFO ] Computed 2 place invariants in 29 ms
[2023-03-15 22:47:25] [INFO ] Implicit Places using invariants in 892 ms returned []
[2023-03-15 22:47:25] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
[2023-03-15 22:47:25] [INFO ] Invariant cache hit.
[2023-03-15 22:47:25] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-15 22:47:27] [INFO ] Implicit Places using invariants and state equation in 2561 ms returned []
Implicit Place search using SMT with State Equation took 3455 ms to find 0 implicit places.
[2023-03-15 22:47:28] [INFO ] Redundant transitions in 614 ms returned []
[2023-03-15 22:47:28] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
[2023-03-15 22:47:28] [INFO ] Invariant cache hit.
[2023-03-15 22:47:32] [INFO ] Dead Transitions using invariants and state equation in 4239 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8514 ms. Remains : 433/433 places, 7184/7184 transitions.
Treatment of property DoubleLock-PT-p1s3-LTLFireability-12 finished in 151562 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(G(p1)))))'
Support contains 4 out of 434 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 434/434 places, 7312/7312 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 433 transition count 7184
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 433 transition count 7184
Applied a total of 2 rules in 230 ms. Remains 433 /434 variables (removed 1) and now considering 7184/7312 (removed 128) transitions.
[2023-03-15 22:47:32] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
[2023-03-15 22:47:32] [INFO ] Invariant cache hit.
[2023-03-15 22:47:33] [INFO ] Implicit Places using invariants in 825 ms returned []
[2023-03-15 22:47:33] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
[2023-03-15 22:47:33] [INFO ] Invariant cache hit.
[2023-03-15 22:47:34] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-15 22:47:36] [INFO ] Implicit Places using invariants and state equation in 2627 ms returned []
Implicit Place search using SMT with State Equation took 3454 ms to find 0 implicit places.
[2023-03-15 22:47:37] [INFO ] Redundant transitions in 635 ms returned []
[2023-03-15 22:47:37] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
[2023-03-15 22:47:37] [INFO ] Invariant cache hit.
[2023-03-15 22:47:40] [INFO ] Dead Transitions using invariants and state equation in 3470 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 433/434 places, 7184/7312 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7796 ms. Remains : 433/434 places, 7184/7312 transitions.
Stuttering acceptance computed with spot in 76 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DoubleLock-PT-p1s3-LTLFireability-13 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=p1, acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s104 1) (LT s428 1)), p1:(OR (LT s6 1) (LT s393 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1261 reset in 1018 ms.
Product exploration explored 100000 steps with 1266 reset in 1039 ms.
Computed a total of 10 stabilizing places and 2144 stable transitions
Computed a total of 10 stabilizing places and 2144 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 332 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10005 steps, including 96 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :2
Running SMT prover for 2 properties.
[2023-03-15 22:47:43] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
[2023-03-15 22:47:43] [INFO ] Invariant cache hit.
[2023-03-15 22:47:43] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:47:43] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-15 22:47:50] [INFO ] After 7199ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-15 22:47:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:47:50] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-15 22:47:55] [INFO ] After 5158ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-15 22:47:55] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-15 22:48:04] [INFO ] After 9155ms SMT Verify possible using 400 Read/Feed constraints in natural domain returned unsat :1 sat :0
[2023-03-15 22:48:04] [INFO ] After 14420ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 14 ms.
Support contains 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7184/7184 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 7056
Applied a total of 128 rules in 210 ms. Remains 433 /433 variables (removed 0) and now considering 7056/7184 (removed 128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 213 ms. Remains : 433/433 places, 7056/7184 transitions.
Incomplete random walk after 10000 steps, including 93 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 134283 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 134283 steps, saw 104405 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 22:48:08] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
// Phase 1: matrix 4715 rows 433 cols
[2023-03-15 22:48:08] [INFO ] Computed 3 place invariants in 27 ms
[2023-03-15 22:48:08] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-15 22:48:14] [INFO ] After 6183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:48:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-15 22:48:20] [INFO ] After 6068ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:48:20] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-15 22:48:29] [INFO ] After 9164ms SMT Verify possible using 400 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-15 22:48:29] [INFO ] After 15340ms 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, 7056/7056 transitions.
Applied a total of 0 rules in 205 ms. Remains 433 /433 variables (removed 0) and now considering 7056/7056 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 206 ms. Remains : 433/433 places, 7056/7056 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7056/7056 transitions.
Applied a total of 0 rules in 199 ms. Remains 433 /433 variables (removed 0) and now considering 7056/7056 (removed 0) transitions.
[2023-03-15 22:48:30] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2023-03-15 22:48:30] [INFO ] Invariant cache hit.
[2023-03-15 22:48:31] [INFO ] Implicit Places using invariants in 1274 ms returned []
[2023-03-15 22:48:31] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2023-03-15 22:48:31] [INFO ] Invariant cache hit.
[2023-03-15 22:48:33] [INFO ] Implicit Places using invariants and state equation in 2061 ms returned []
Implicit Place search using SMT with State Equation took 3340 ms to find 0 implicit places.
[2023-03-15 22:48:34] [INFO ] Redundant transitions in 619 ms returned []
[2023-03-15 22:48:34] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2023-03-15 22:48:34] [INFO ] Invariant cache hit.
[2023-03-15 22:48:38] [INFO ] Dead Transitions using invariants and state equation in 4078 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8245 ms. Remains : 433/433 places, 7056/7056 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 4715
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 4704
Deduced a syphon composed of 11 places in 1 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 4704
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 4701
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2370 place count 418 transition count 4573
Iterating global reduction 1 with 1 rules applied. Total rules applied 2371 place count 418 transition count 4573
Applied a total of 2371 rules in 180 ms. Remains 418 /433 variables (removed 15) and now considering 4573/7056 (removed 2483) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4573 rows 418 cols
[2023-03-15 22:48:38] [INFO ] Computed 3 place invariants in 27 ms
[2023-03-15 22:48:38] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-15 22:48:42] [INFO ] After 3843ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:48:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-15 22:48:45] [INFO ] After 3328ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:48:46] [INFO ] After 3551ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 134 ms.
[2023-03-15 22:48:46] [INFO ] After 3778ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 420 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 433 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 433/433 places, 7184/7184 transitions.
Applied a total of 0 rules in 208 ms. Remains 433 /433 variables (removed 0) and now considering 7184/7184 (removed 0) transitions.
[2023-03-15 22:48:46] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
// Phase 1: matrix 4843 rows 433 cols
[2023-03-15 22:48:47] [INFO ] Computed 2 place invariants in 29 ms
[2023-03-15 22:48:47] [INFO ] Implicit Places using invariants in 932 ms returned []
[2023-03-15 22:48:47] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
[2023-03-15 22:48:47] [INFO ] Invariant cache hit.
[2023-03-15 22:48:48] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-15 22:48:50] [INFO ] Implicit Places using invariants and state equation in 2505 ms returned []
Implicit Place search using SMT with State Equation took 3439 ms to find 0 implicit places.
[2023-03-15 22:48:51] [INFO ] Redundant transitions in 633 ms returned []
[2023-03-15 22:48:51] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
[2023-03-15 22:48:51] [INFO ] Invariant cache hit.
[2023-03-15 22:48:54] [INFO ] Dead Transitions using invariants and state equation in 3657 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7942 ms. Remains : 433/433 places, 7184/7184 transitions.
Computed a total of 10 stabilizing places and 2144 stable transitions
Computed a total of 10 stabilizing places and 2144 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), true, (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 212 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 93 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Finished Best-First random walk after 1569 steps, including 2 resets, run visited all 1 properties in 3 ms. (steps per millisecond=523 )
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), true, (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 6 factoid took 243 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Product exploration explored 100000 steps with 1282 reset in 990 ms.
Product exploration explored 100000 steps with 1279 reset in 1015 ms.
Support contains 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 433/433 places, 7184/7184 transitions.
Applied a total of 0 rules in 197 ms. Remains 433 /433 variables (removed 0) and now considering 7184/7184 (removed 0) transitions.
[2023-03-15 22:48:57] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
[2023-03-15 22:48:57] [INFO ] Invariant cache hit.
[2023-03-15 22:48:58] [INFO ] Implicit Places using invariants in 845 ms returned []
[2023-03-15 22:48:58] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
[2023-03-15 22:48:58] [INFO ] Invariant cache hit.
[2023-03-15 22:48:59] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-15 22:49:01] [INFO ] Implicit Places using invariants and state equation in 2548 ms returned []
Implicit Place search using SMT with State Equation took 3395 ms to find 0 implicit places.
[2023-03-15 22:49:01] [INFO ] Redundant transitions in 643 ms returned []
[2023-03-15 22:49:01] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
[2023-03-15 22:49:01] [INFO ] Invariant cache hit.
[2023-03-15 22:49:06] [INFO ] Dead Transitions using invariants and state equation in 4497 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8740 ms. Remains : 433/433 places, 7184/7184 transitions.
Treatment of property DoubleLock-PT-p1s3-LTLFireability-13 finished in 93737 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((G(p1)||G(p0))))))'
Support contains 3 out of 434 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 434/434 places, 7312/7312 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 433 transition count 7184
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 433 transition count 7184
Applied a total of 2 rules in 338 ms. Remains 433 /434 variables (removed 1) and now considering 7184/7312 (removed 128) transitions.
[2023-03-15 22:49:06] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
[2023-03-15 22:49:06] [INFO ] Invariant cache hit.
[2023-03-15 22:49:07] [INFO ] Implicit Places using invariants in 853 ms returned []
[2023-03-15 22:49:07] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
[2023-03-15 22:49:07] [INFO ] Invariant cache hit.
[2023-03-15 22:49:08] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-15 22:49:10] [INFO ] Implicit Places using invariants and state equation in 2526 ms returned []
Implicit Place search using SMT with State Equation took 3382 ms to find 0 implicit places.
[2023-03-15 22:49:10] [INFO ] Redundant transitions in 645 ms returned []
[2023-03-15 22:49:10] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
[2023-03-15 22:49:10] [INFO ] Invariant cache hit.
[2023-03-15 22:49:14] [INFO ] Dead Transitions using invariants and state equation in 3713 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 433/434 places, 7184/7312 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8086 ms. Remains : 433/434 places, 7184/7312 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleLock-PT-p1s3-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s284 1) (LT s401 1)), p1:(OR (LT s351 1) (LT s401 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1275 reset in 1049 ms.
Product exploration explored 100000 steps with 1264 reset in 1014 ms.
Computed a total of 10 stabilizing places and 2144 stable transitions
Computed a total of 10 stabilizing places and 2144 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 453 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter insensitive) to 3 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10003 steps, including 91 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 89077 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 89077 steps, saw 69828 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-15 22:49:20] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
[2023-03-15 22:49:20] [INFO ] Invariant cache hit.
[2023-03-15 22:49:20] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:49:20] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-15 22:49:25] [INFO ] After 4955ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:5
[2023-03-15 22:49:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:49:25] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-15 22:49:38] [INFO ] After 12898ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-15 22:49:38] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-15 22:49:47] [INFO ] After 8653ms SMT Verify possible using 400 Read/Feed constraints in natural domain returned unsat :1 sat :5
[2023-03-15 22:49:50] [INFO ] After 11947ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-15 22:49:50] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 40 ms.
Support contains 3 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7184/7184 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 7056
Applied a total of 128 rules in 209 ms. Remains 433 /433 variables (removed 0) and now considering 7056/7184 (removed 128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 209 ms. Remains : 433/433 places, 7056/7184 transitions.
Incomplete random walk after 10008 steps, including 92 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 95457 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 95457 steps, saw 74862 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-15 22:49:54] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
// Phase 1: matrix 4715 rows 433 cols
[2023-03-15 22:49:54] [INFO ] Computed 3 place invariants in 29 ms
[2023-03-15 22:49:54] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2023-03-15 22:50:08] [INFO ] After 14055ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-15 22:50:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-15 22:50:20] [INFO ] After 11395ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-15 22:50:20] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-15 22:50:29] [INFO ] After 9212ms SMT Verify possible using 400 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-15 22:50:33] [INFO ] After 13432ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-15 22:50:33] [INFO ] After 25016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 17 ms.
Support contains 3 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7056/7056 transitions.
Applied a total of 0 rules in 198 ms. Remains 433 /433 variables (removed 0) and now considering 7056/7056 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 199 ms. Remains : 433/433 places, 7056/7056 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7056/7056 transitions.
Applied a total of 0 rules in 204 ms. Remains 433 /433 variables (removed 0) and now considering 7056/7056 (removed 0) transitions.
[2023-03-15 22:50:33] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2023-03-15 22:50:33] [INFO ] Invariant cache hit.
[2023-03-15 22:50:35] [INFO ] Implicit Places using invariants in 1247 ms returned []
[2023-03-15 22:50:35] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2023-03-15 22:50:35] [INFO ] Invariant cache hit.
[2023-03-15 22:50:37] [INFO ] Implicit Places using invariants and state equation in 1962 ms returned []
Implicit Place search using SMT with State Equation took 3222 ms to find 0 implicit places.
[2023-03-15 22:50:37] [INFO ] Redundant transitions in 619 ms returned []
[2023-03-15 22:50:37] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2023-03-15 22:50:37] [INFO ] Invariant cache hit.
[2023-03-15 22:50:42] [INFO ] Dead Transitions using invariants and state equation in 4770 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8831 ms. Remains : 433/433 places, 7056/7056 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 4715
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 2341 place count 433 transition count 4705
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 2361 place count 423 transition count 4705
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 2367 place count 420 transition count 4702
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2368 place count 419 transition count 4574
Iterating global reduction 1 with 1 rules applied. Total rules applied 2369 place count 419 transition count 4574
Applied a total of 2369 rules in 176 ms. Remains 419 /433 variables (removed 14) and now considering 4574/7056 (removed 2482) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 4574 rows 419 cols
[2023-03-15 22:50:42] [INFO ] Computed 3 place invariants in 30 ms
[2023-03-15 22:50:42] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-15 22:50:49] [INFO ] After 6551ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-15 22:50:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-15 22:50:52] [INFO ] After 3067ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-15 22:50:56] [INFO ] After 6547ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1751 ms.
[2023-03-15 22:50:57] [INFO ] After 8458ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 516 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter insensitive) to 3 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 239 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 433 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 433/433 places, 7184/7184 transitions.
Applied a total of 0 rules in 202 ms. Remains 433 /433 variables (removed 0) and now considering 7184/7184 (removed 0) transitions.
[2023-03-15 22:50:58] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
// Phase 1: matrix 4843 rows 433 cols
[2023-03-15 22:50:58] [INFO ] Computed 2 place invariants in 30 ms
[2023-03-15 22:50:59] [INFO ] Implicit Places using invariants in 877 ms returned []
[2023-03-15 22:50:59] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
[2023-03-15 22:50:59] [INFO ] Invariant cache hit.
[2023-03-15 22:51:00] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-15 22:51:02] [INFO ] Implicit Places using invariants and state equation in 2507 ms returned []
Implicit Place search using SMT with State Equation took 3386 ms to find 0 implicit places.
[2023-03-15 22:51:02] [INFO ] Redundant transitions in 631 ms returned []
[2023-03-15 22:51:02] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
[2023-03-15 22:51:02] [INFO ] Invariant cache hit.
[2023-03-15 22:51:06] [INFO ] Dead Transitions using invariants and state equation in 3570 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7795 ms. Remains : 433/433 places, 7184/7184 transitions.
Computed a total of 10 stabilizing places and 2144 stable transitions
Computed a total of 10 stabilizing places and 2144 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 590 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter insensitive) to 3 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 91 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 89544 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 89544 steps, saw 70198 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-15 22:51:10] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
[2023-03-15 22:51:10] [INFO ] Invariant cache hit.
[2023-03-15 22:51:10] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:51:10] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-15 22:51:15] [INFO ] After 4951ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:5
[2023-03-15 22:51:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:51:15] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-15 22:51:30] [INFO ] After 14099ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-15 22:51:30] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-15 22:51:38] [INFO ] After 8770ms SMT Verify possible using 400 Read/Feed constraints in natural domain returned unsat :1 sat :5
[2023-03-15 22:51:40] [INFO ] After 10738ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-15 22:51:40] [INFO ] After 25016ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 30 ms.
Support contains 3 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7184/7184 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 7056
Applied a total of 128 rules in 209 ms. Remains 433 /433 variables (removed 0) and now considering 7056/7184 (removed 128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 210 ms. Remains : 433/433 places, 7056/7184 transitions.
Incomplete random walk after 10000 steps, including 94 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 93174 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 93174 steps, saw 73064 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-15 22:51:44] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
// Phase 1: matrix 4715 rows 433 cols
[2023-03-15 22:51:44] [INFO ] Computed 3 place invariants in 35 ms
[2023-03-15 22:51:44] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2023-03-15 22:51:58] [INFO ] After 14105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-15 22:51:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-15 22:52:09] [INFO ] After 11229ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-15 22:52:09] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-15 22:52:19] [INFO ] After 9171ms SMT Verify possible using 400 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-15 22:52:23] [INFO ] After 13607ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-15 22:52:23] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 19 ms.
Support contains 3 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7056/7056 transitions.
Applied a total of 0 rules in 207 ms. Remains 433 /433 variables (removed 0) and now considering 7056/7056 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 208 ms. Remains : 433/433 places, 7056/7056 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7056/7056 transitions.
Applied a total of 0 rules in 199 ms. Remains 433 /433 variables (removed 0) and now considering 7056/7056 (removed 0) transitions.
[2023-03-15 22:52:24] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2023-03-15 22:52:24] [INFO ] Invariant cache hit.
[2023-03-15 22:52:25] [INFO ] Implicit Places using invariants in 1425 ms returned []
[2023-03-15 22:52:25] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2023-03-15 22:52:25] [INFO ] Invariant cache hit.
[2023-03-15 22:52:27] [INFO ] Implicit Places using invariants and state equation in 2085 ms returned []
Implicit Place search using SMT with State Equation took 3512 ms to find 0 implicit places.
[2023-03-15 22:52:28] [INFO ] Redundant transitions in 606 ms returned []
[2023-03-15 22:52:28] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2023-03-15 22:52:28] [INFO ] Invariant cache hit.
[2023-03-15 22:52:33] [INFO ] Dead Transitions using invariants and state equation in 5000 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9326 ms. Remains : 433/433 places, 7056/7056 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 4715
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 2341 place count 433 transition count 4705
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 2361 place count 423 transition count 4705
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 2367 place count 420 transition count 4702
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2368 place count 419 transition count 4574
Iterating global reduction 1 with 1 rules applied. Total rules applied 2369 place count 419 transition count 4574
Applied a total of 2369 rules in 199 ms. Remains 419 /433 variables (removed 14) and now considering 4574/7056 (removed 2482) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 4574 rows 419 cols
[2023-03-15 22:52:33] [INFO ] Computed 3 place invariants in 30 ms
[2023-03-15 22:52:33] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-15 22:52:39] [INFO ] After 6553ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-15 22:52:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-15 22:52:43] [INFO ] After 3038ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-15 22:52:46] [INFO ] After 6577ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1939 ms.
[2023-03-15 22:52:48] [INFO ] After 8673ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 524 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter insensitive) to 3 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1265 reset in 1060 ms.
Product exploration explored 100000 steps with 1253 reset in 1066 ms.
Support contains 3 out of 433 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 433/433 places, 7184/7184 transitions.
Applied a total of 0 rules in 200 ms. Remains 433 /433 variables (removed 0) and now considering 7184/7184 (removed 0) transitions.
[2023-03-15 22:52:51] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
// Phase 1: matrix 4843 rows 433 cols
[2023-03-15 22:52:51] [INFO ] Computed 2 place invariants in 31 ms
[2023-03-15 22:52:52] [INFO ] Implicit Places using invariants in 914 ms returned []
[2023-03-15 22:52:52] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
[2023-03-15 22:52:52] [INFO ] Invariant cache hit.
[2023-03-15 22:52:54] [INFO ] Implicit Places using invariants and state equation in 1678 ms returned []
Implicit Place search using SMT with State Equation took 2593 ms to find 0 implicit places.
[2023-03-15 22:52:55] [INFO ] Redundant transitions in 665 ms returned []
[2023-03-15 22:52:55] [INFO ] Flow matrix only has 4843 transitions (discarded 2341 similar events)
[2023-03-15 22:52:55] [INFO ] Invariant cache hit.
[2023-03-15 22:52:58] [INFO ] Dead Transitions using invariants and state equation in 3561 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7034 ms. Remains : 433/433 places, 7184/7184 transitions.
Treatment of property DoubleLock-PT-p1s3-LTLFireability-15 finished in 232476 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)))'
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(p1))))'
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(G(p1)))))'
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((G(p1)||G(p0))))))'
[2023-03-15 22:52:59] [INFO ] Flatten gal took : 271 ms
[2023-03-15 22:52:59] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-15 22:52:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 434 places, 7312 transitions and 29120 arcs took 59 ms.
Total runtime 676042 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1702/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1702/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1702/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1702/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : DoubleLock-PT-p1s3-LTLFireability-00
Could not compute solution for formula : DoubleLock-PT-p1s3-LTLFireability-12
Could not compute solution for formula : DoubleLock-PT-p1s3-LTLFireability-13
Could not compute solution for formula : DoubleLock-PT-p1s3-LTLFireability-15
BK_STOP 1678920787123
--------------------
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-p1s3-LTLFireability-00
ltl formula formula --ltl=/tmp/1702/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 434 places, 7312 transitions and 29120 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.790 real 0.260 user 0.300 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1702/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1702/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1702/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1702/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
ltl formula name DoubleLock-PT-p1s3-LTLFireability-12
ltl formula formula --ltl=/tmp/1702/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 434 places, 7312 transitions and 29120 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.810 real 0.240 user 0.270 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1702/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1702/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1702/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1702/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 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:
malloc_consolidate(): invalid chunk size
ltl formula name DoubleLock-PT-p1s3-LTLFireability-13
ltl formula formula --ltl=/tmp/1702/ltl_2_
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
Warning: program compiled against libxml 210 using older 209
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
pnml2lts-mc( 0/ 4): Petri net has 434 places, 7312 transitions and 29120 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.940 real 0.210 user 0.320 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1702/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1702/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1702/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1702/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name DoubleLock-PT-p1s3-LTLFireability-15
ltl formula formula --ltl=/tmp/1702/ltl_3_
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 434 places, 7312 transitions and 29120 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.850 real 0.230 user 0.260 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1702/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1702/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1702/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1702/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
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-p1s3"
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-p1s3, 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-167819418700524"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleLock-PT-p1s3.tgz
mv DoubleLock-PT-p1s3 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 ;