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.r391-oct2-167903715400500.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is ShieldPPPs-PT-050A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903715400500
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 900K
-rw-r--r-- 1 mcc users 7.2K Feb 26 02:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 02:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 02:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 02:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 02:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 26 02:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 02:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 26 02:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 447K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-00
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-01
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-02
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-03
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-04
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-05
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-06
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-07
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-08
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-09
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-10
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-11
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-12
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-13
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-14
FORMULA_NAME ShieldPPPs-PT-050A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679276779427

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-050A
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 01:46:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 01:46:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 01:46:22] [INFO ] Load time of PNML (sax parser for PT used): 195 ms
[2023-03-20 01:46:22] [INFO ] Transformed 1553 places.
[2023-03-20 01:46:22] [INFO ] Transformed 1303 transitions.
[2023-03-20 01:46:22] [INFO ] Found NUPN structural information;
[2023-03-20 01:46:22] [INFO ] Parsed PT model containing 1553 places and 1303 transitions and 5006 arcs in 408 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ShieldPPPs-PT-050A-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050A-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050A-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050A-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050A-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 58 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 204 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2023-03-20 01:46:23] [INFO ] Computed 551 place invariants in 27 ms
[2023-03-20 01:46:24] [INFO ] Implicit Places using invariants in 1804 ms returned []
[2023-03-20 01:46:24] [INFO ] Invariant cache hit.
[2023-03-20 01:46:27] [INFO ] Implicit Places using invariants and state equation in 2817 ms returned []
Implicit Place search using SMT with State Equation took 4649 ms to find 0 implicit places.
[2023-03-20 01:46:27] [INFO ] Invariant cache hit.
[2023-03-20 01:46:28] [INFO ] Dead Transitions using invariants and state equation in 1016 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5877 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Support contains 58 out of 1553 places after structural reductions.
[2023-03-20 01:46:29] [INFO ] Flatten gal took : 204 ms
[2023-03-20 01:46:29] [INFO ] Flatten gal took : 82 ms
[2023-03-20 01:46:29] [INFO ] Input system was already deterministic with 1303 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 466 ms. (steps per millisecond=21 ) properties (out of 31) seen :28
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-20 01:46:30] [INFO ] Invariant cache hit.
[2023-03-20 01:46:30] [INFO ] [Real]Absence check using 551 positive place invariants in 135 ms returned sat
[2023-03-20 01:46:32] [INFO ] After 1834ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 01:46:32] [INFO ] [Nat]Absence check using 551 positive place invariants in 347 ms returned sat
[2023-03-20 01:46:34] [INFO ] After 1507ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 01:46:36] [INFO ] Deduced a trap composed of 18 places in 149 ms of which 55 ms to minimize.
[2023-03-20 01:46:36] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2023-03-20 01:46:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 464 ms
[2023-03-20 01:46:36] [INFO ] After 3808ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 590 ms.
[2023-03-20 01:46:37] [INFO ] After 5248ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 400 ms.
Support contains 9 out of 1553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1551 transition count 1301
Partial Free-agglomeration rule applied 444 times.
Drop transitions removed 444 transitions
Iterating global reduction 0 with 444 rules applied. Total rules applied 448 place count 1551 transition count 1301
Applied a total of 448 rules in 200 ms. Remains 1551 /1553 variables (removed 2) and now considering 1301/1303 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 200 ms. Remains : 1551/1553 places, 1301/1303 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1301 rows 1551 cols
[2023-03-20 01:46:38] [INFO ] Computed 551 place invariants in 116 ms
[2023-03-20 01:46:38] [INFO ] [Real]Absence check using 518 positive place invariants in 99 ms returned sat
[2023-03-20 01:46:38] [INFO ] [Real]Absence check using 518 positive and 33 generalized place invariants in 15 ms returned sat
[2023-03-20 01:46:39] [INFO ] After 1388ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:46:40] [INFO ] [Nat]Absence check using 518 positive place invariants in 314 ms returned sat
[2023-03-20 01:46:40] [INFO ] [Nat]Absence check using 518 positive and 33 generalized place invariants in 10 ms returned sat
[2023-03-20 01:46:41] [INFO ] After 1038ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:46:41] [INFO ] Deduced a trap composed of 6 places in 296 ms of which 1 ms to minimize.
[2023-03-20 01:46:42] [INFO ] Deduced a trap composed of 5 places in 401 ms of which 27 ms to minimize.
[2023-03-20 01:46:42] [INFO ] Deduced a trap composed of 6 places in 389 ms of which 0 ms to minimize.
[2023-03-20 01:46:43] [INFO ] Deduced a trap composed of 5 places in 351 ms of which 14 ms to minimize.
[2023-03-20 01:46:44] [INFO ] Deduced a trap composed of 6 places in 261 ms of which 0 ms to minimize.
[2023-03-20 01:46:44] [INFO ] Deduced a trap composed of 7 places in 220 ms of which 1 ms to minimize.
[2023-03-20 01:46:44] [INFO ] Deduced a trap composed of 5 places in 199 ms of which 0 ms to minimize.
[2023-03-20 01:46:44] [INFO ] Deduced a trap composed of 6 places in 230 ms of which 2 ms to minimize.
[2023-03-20 01:46:45] [INFO ] Deduced a trap composed of 6 places in 174 ms of which 1 ms to minimize.
[2023-03-20 01:46:45] [INFO ] Deduced a trap composed of 7 places in 192 ms of which 0 ms to minimize.
[2023-03-20 01:46:45] [INFO ] Deduced a trap composed of 5 places in 260 ms of which 1 ms to minimize.
[2023-03-20 01:46:45] [INFO ] Deduced a trap composed of 7 places in 190 ms of which 1 ms to minimize.
[2023-03-20 01:46:46] [INFO ] Deduced a trap composed of 6 places in 287 ms of which 1 ms to minimize.
[2023-03-20 01:46:49] [INFO ] Deduced a trap composed of 6 places in 226 ms of which 0 ms to minimize.
[2023-03-20 01:46:50] [INFO ] Deduced a trap composed of 6 places in 226 ms of which 1 ms to minimize.
[2023-03-20 01:46:50] [INFO ] Deduced a trap composed of 6 places in 285 ms of which 1 ms to minimize.
[2023-03-20 01:46:50] [INFO ] Deduced a trap composed of 5 places in 212 ms of which 1 ms to minimize.
[2023-03-20 01:46:51] [INFO ] Deduced a trap composed of 6 places in 316 ms of which 1 ms to minimize.
[2023-03-20 01:46:51] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 0 ms to minimize.
[2023-03-20 01:46:51] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 0 ms to minimize.
[2023-03-20 01:46:51] [INFO ] Deduced a trap composed of 7 places in 247 ms of which 0 ms to minimize.
[2023-03-20 01:46:53] [INFO ] Deduced a trap composed of 5 places in 338 ms of which 1 ms to minimize.
[2023-03-20 01:46:53] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 1 ms to minimize.
[2023-03-20 01:46:53] [INFO ] Deduced a trap composed of 5 places in 180 ms of which 0 ms to minimize.
[2023-03-20 01:46:54] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 1 ms to minimize.
[2023-03-20 01:46:54] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 0 ms to minimize.
[2023-03-20 01:46:54] [INFO ] Deduced a trap composed of 6 places in 157 ms of which 2 ms to minimize.
[2023-03-20 01:46:54] [INFO ] Deduced a trap composed of 7 places in 381 ms of which 17 ms to minimize.
[2023-03-20 01:46:55] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 1 ms to minimize.
[2023-03-20 01:46:55] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 0 ms to minimize.
[2023-03-20 01:46:55] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 4 ms to minimize.
[2023-03-20 01:46:55] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2023-03-20 01:46:55] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 19 ms to minimize.
[2023-03-20 01:46:56] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 0 ms to minimize.
[2023-03-20 01:46:56] [INFO ] Deduced a trap composed of 5 places in 174 ms of which 1 ms to minimize.
[2023-03-20 01:46:56] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 0 ms to minimize.
[2023-03-20 01:46:56] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 5 ms to minimize.
[2023-03-20 01:46:58] [INFO ] Deduced a trap composed of 5 places in 434 ms of which 1 ms to minimize.
[2023-03-20 01:46:59] [INFO ] Deduced a trap composed of 7 places in 928 ms of which 1 ms to minimize.
[2023-03-20 01:47:01] [INFO ] Deduced a trap composed of 5 places in 433 ms of which 65 ms to minimize.
[2023-03-20 01:47:02] [INFO ] Deduced a trap composed of 5 places in 245 ms of which 1 ms to minimize.
[2023-03-20 01:47:02] [INFO ] Deduced a trap composed of 7 places in 255 ms of which 1 ms to minimize.
[2023-03-20 01:47:02] [INFO ] Deduced a trap composed of 5 places in 215 ms of which 1 ms to minimize.
[2023-03-20 01:47:04] [INFO ] Deduced a trap composed of 6 places in 228 ms of which 1 ms to minimize.
[2023-03-20 01:47:04] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 0 ms to minimize.
[2023-03-20 01:47:04] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 0 ms to minimize.
[2023-03-20 01:47:04] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 01:47:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 01:47:04] [INFO ] After 25061ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 28 ms.
Support contains 4 out of 1551 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1550 transition count 1300
Applied a total of 1 rules in 146 ms. Remains 1550 /1551 variables (removed 1) and now considering 1300/1301 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 1550/1551 places, 1300/1301 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 188192 steps, run timeout after 3002 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 188192 steps, saw 186400 distinct states, run finished after 3017 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1300 rows 1550 cols
[2023-03-20 01:47:08] [INFO ] Computed 551 place invariants in 48 ms
[2023-03-20 01:47:08] [INFO ] [Real]Absence check using 530 positive place invariants in 111 ms returned sat
[2023-03-20 01:47:08] [INFO ] [Real]Absence check using 530 positive and 21 generalized place invariants in 5 ms returned sat
[2023-03-20 01:47:09] [INFO ] After 1223ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:47:09] [INFO ] [Nat]Absence check using 530 positive place invariants in 106 ms returned sat
[2023-03-20 01:47:09] [INFO ] [Nat]Absence check using 530 positive and 21 generalized place invariants in 4 ms returned sat
[2023-03-20 01:47:11] [INFO ] After 1660ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:47:11] [INFO ] Deduced a trap composed of 5 places in 247 ms of which 7 ms to minimize.
[2023-03-20 01:47:12] [INFO ] Deduced a trap composed of 6 places in 281 ms of which 0 ms to minimize.
[2023-03-20 01:47:12] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 0 ms to minimize.
[2023-03-20 01:47:12] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 0 ms to minimize.
[2023-03-20 01:47:12] [INFO ] Deduced a trap composed of 6 places in 169 ms of which 14 ms to minimize.
[2023-03-20 01:47:13] [INFO ] Deduced a trap composed of 5 places in 300 ms of which 25 ms to minimize.
[2023-03-20 01:47:13] [INFO ] Deduced a trap composed of 6 places in 209 ms of which 1 ms to minimize.
[2023-03-20 01:47:13] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 1 ms to minimize.
[2023-03-20 01:47:14] [INFO ] Deduced a trap composed of 6 places in 157 ms of which 1 ms to minimize.
[2023-03-20 01:47:14] [INFO ] Deduced a trap composed of 5 places in 145 ms of which 0 ms to minimize.
[2023-03-20 01:47:15] [INFO ] Deduced a trap composed of 9 places in 247 ms of which 1 ms to minimize.
[2023-03-20 01:47:15] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 0 ms to minimize.
[2023-03-20 01:47:15] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 1 ms to minimize.
[2023-03-20 01:47:15] [INFO ] Deduced a trap composed of 5 places in 144 ms of which 5 ms to minimize.
[2023-03-20 01:47:16] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 0 ms to minimize.
[2023-03-20 01:47:16] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 13 ms to minimize.
[2023-03-20 01:47:16] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 4965 ms
[2023-03-20 01:47:16] [INFO ] After 6734ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 109 ms.
[2023-03-20 01:47:16] [INFO ] After 7261ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 35 ms.
Support contains 4 out of 1550 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1550/1550 places, 1300/1300 transitions.
Applied a total of 0 rules in 67 ms. Remains 1550 /1550 variables (removed 0) and now considering 1300/1300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 1550/1550 places, 1300/1300 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1550/1550 places, 1300/1300 transitions.
Applied a total of 0 rules in 47 ms. Remains 1550 /1550 variables (removed 0) and now considering 1300/1300 (removed 0) transitions.
[2023-03-20 01:47:16] [INFO ] Invariant cache hit.
[2023-03-20 01:47:18] [INFO ] Implicit Places using invariants in 1914 ms returned []
[2023-03-20 01:47:18] [INFO ] Invariant cache hit.
[2023-03-20 01:47:22] [INFO ] Implicit Places using invariants and state equation in 4135 ms returned []
Implicit Place search using SMT with State Equation took 6071 ms to find 0 implicit places.
[2023-03-20 01:47:22] [INFO ] Redundant transitions in 69 ms returned []
[2023-03-20 01:47:22] [INFO ] Invariant cache hit.
[2023-03-20 01:47:24] [INFO ] Dead Transitions using invariants and state equation in 1361 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7570 ms. Remains : 1550/1550 places, 1300/1300 transitions.
Applied a total of 0 rules in 57 ms. Remains 1550 /1550 variables (removed 0) and now considering 1300/1300 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-20 01:47:24] [INFO ] Invariant cache hit.
[2023-03-20 01:47:24] [INFO ] [Real]Absence check using 530 positive place invariants in 81 ms returned sat
[2023-03-20 01:47:24] [INFO ] [Real]Absence check using 530 positive and 21 generalized place invariants in 52 ms returned sat
[2023-03-20 01:47:25] [INFO ] After 1319ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:47:26] [INFO ] [Nat]Absence check using 530 positive place invariants in 109 ms returned sat
[2023-03-20 01:47:26] [INFO ] [Nat]Absence check using 530 positive and 21 generalized place invariants in 11 ms returned sat
[2023-03-20 01:47:27] [INFO ] After 1581ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:47:28] [INFO ] Deduced a trap composed of 4 places in 264 ms of which 1 ms to minimize.
[2023-03-20 01:47:28] [INFO ] Deduced a trap composed of 5 places in 250 ms of which 14 ms to minimize.
[2023-03-20 01:47:29] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 1 ms to minimize.
[2023-03-20 01:47:29] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 0 ms to minimize.
[2023-03-20 01:47:29] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2023-03-20 01:47:29] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 1 ms to minimize.
[2023-03-20 01:47:30] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 1 ms to minimize.
[2023-03-20 01:47:30] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 0 ms to minimize.
[2023-03-20 01:47:30] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 0 ms to minimize.
[2023-03-20 01:47:30] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
[2023-03-20 01:47:31] [INFO ] Deduced a trap composed of 6 places in 258 ms of which 0 ms to minimize.
[2023-03-20 01:47:31] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 13 ms to minimize.
[2023-03-20 01:47:31] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 0 ms to minimize.
[2023-03-20 01:47:31] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 1 ms to minimize.
[2023-03-20 01:47:31] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 1 ms to minimize.
[2023-03-20 01:47:33] [INFO ] Deduced a trap composed of 5 places in 414 ms of which 27 ms to minimize.
[2023-03-20 01:47:34] [INFO ] Deduced a trap composed of 4 places in 163 ms of which 0 ms to minimize.
[2023-03-20 01:47:34] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 0 ms to minimize.
[2023-03-20 01:47:34] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 0 ms to minimize.
[2023-03-20 01:47:34] [INFO ] Deduced a trap composed of 6 places in 171 ms of which 0 ms to minimize.
[2023-03-20 01:47:35] [INFO ] Deduced a trap composed of 6 places in 275 ms of which 1 ms to minimize.
[2023-03-20 01:47:35] [INFO ] Deduced a trap composed of 4 places in 474 ms of which 0 ms to minimize.
[2023-03-20 01:47:36] [INFO ] Deduced a trap composed of 4 places in 375 ms of which 1 ms to minimize.
[2023-03-20 01:47:36] [INFO ] Deduced a trap composed of 5 places in 264 ms of which 1 ms to minimize.
[2023-03-20 01:47:36] [INFO ] Deduced a trap composed of 6 places in 308 ms of which 1 ms to minimize.
[2023-03-20 01:47:37] [INFO ] Deduced a trap composed of 6 places in 226 ms of which 1 ms to minimize.
[2023-03-20 01:47:37] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 0 ms to minimize.
[2023-03-20 01:47:37] [INFO ] Deduced a trap composed of 4 places in 228 ms of which 0 ms to minimize.
[2023-03-20 01:47:37] [INFO ] Deduced a trap composed of 4 places in 210 ms of which 0 ms to minimize.
[2023-03-20 01:47:38] [INFO ] Deduced a trap composed of 6 places in 218 ms of which 1 ms to minimize.
[2023-03-20 01:47:38] [INFO ] Deduced a trap composed of 6 places in 236 ms of which 0 ms to minimize.
[2023-03-20 01:47:38] [INFO ] Deduced a trap composed of 8 places in 131 ms of which 0 ms to minimize.
[2023-03-20 01:47:39] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 0 ms to minimize.
[2023-03-20 01:47:39] [INFO ] Deduced a trap composed of 6 places in 169 ms of which 1 ms to minimize.
[2023-03-20 01:47:39] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 0 ms to minimize.
[2023-03-20 01:47:39] [INFO ] Deduced a trap composed of 6 places in 193 ms of which 0 ms to minimize.
[2023-03-20 01:47:39] [INFO ] Deduced a trap composed of 5 places in 149 ms of which 0 ms to minimize.
[2023-03-20 01:47:40] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 0 ms to minimize.
[2023-03-20 01:47:40] [INFO ] Deduced a trap composed of 6 places in 186 ms of which 1 ms to minimize.
[2023-03-20 01:47:40] [INFO ] Deduced a trap composed of 6 places in 183 ms of which 1 ms to minimize.
[2023-03-20 01:47:41] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 0 ms to minimize.
[2023-03-20 01:47:41] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 0 ms to minimize.
[2023-03-20 01:47:41] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 1 ms to minimize.
[2023-03-20 01:47:41] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 0 ms to minimize.
[2023-03-20 01:47:41] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 0 ms to minimize.
[2023-03-20 01:47:42] [INFO ] Deduced a trap composed of 10 places in 335 ms of which 1 ms to minimize.
[2023-03-20 01:47:43] [INFO ] Deduced a trap composed of 6 places in 185 ms of which 0 ms to minimize.
[2023-03-20 01:47:43] [INFO ] Deduced a trap composed of 6 places in 244 ms of which 0 ms to minimize.
[2023-03-20 01:47:43] [INFO ] Deduced a trap composed of 4 places in 261 ms of which 1 ms to minimize.
[2023-03-20 01:47:44] [INFO ] Deduced a trap composed of 4 places in 214 ms of which 0 ms to minimize.
[2023-03-20 01:47:45] [INFO ] Deduced a trap composed of 17 places in 202 ms of which 1 ms to minimize.
[2023-03-20 01:47:45] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 1 ms to minimize.
[2023-03-20 01:47:46] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 0 ms to minimize.
[2023-03-20 01:47:46] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 0 ms to minimize.
[2023-03-20 01:47:46] [INFO ] Deduced a trap composed of 6 places in 167 ms of which 1 ms to minimize.
[2023-03-20 01:47:46] [INFO ] Deduced a trap composed of 5 places in 203 ms of which 1 ms to minimize.
[2023-03-20 01:47:47] [INFO ] Deduced a trap composed of 5 places in 208 ms of which 0 ms to minimize.
[2023-03-20 01:47:47] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 0 ms to minimize.
[2023-03-20 01:47:47] [INFO ] Trap strengthening (SAT) tested/added 59/58 trap constraints in 19494 ms
[2023-03-20 01:47:47] [INFO ] After 21170ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 308 ms.
[2023-03-20 01:47:47] [INFO ] After 21938ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((!p0&&G(F(!p1)))) U (p2&&X(F(p3)))))'
Support contains 7 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 50 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2023-03-20 01:47:48] [INFO ] Computed 551 place invariants in 10 ms
[2023-03-20 01:47:49] [INFO ] Implicit Places using invariants in 1378 ms returned []
[2023-03-20 01:47:49] [INFO ] Invariant cache hit.
[2023-03-20 01:47:52] [INFO ] Implicit Places using invariants and state equation in 2947 ms returned []
Implicit Place search using SMT with State Equation took 4361 ms to find 0 implicit places.
[2023-03-20 01:47:52] [INFO ] Invariant cache hit.
[2023-03-20 01:47:53] [INFO ] Dead Transitions using invariants and state equation in 1054 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5475 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Stuttering acceptance computed with spot in 650 ms :[(OR (NOT p2) (NOT p3)), p1, p1, p0, (NOT p3)]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 1}, { cond=(NOT p2), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 3}, { cond=p2, acceptance={0} source=0 dest: 4}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s921 1), p1:(AND (EQ s1213 1) (EQ s1234 1)), p0:(AND (EQ s917 1) (EQ s928 1)), p3:(AND (EQ s1213 1) (EQ s1234 1) (EQ s562 1) (EQ s583 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 201 reset in 1146 ms.
Product exploration explored 100000 steps with 204 reset in 1224 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), (X (NOT p3)), (X (NOT (AND (NOT p2) p0))), (X (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 1485 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 5 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 347 ms :[(OR (NOT p2) (NOT p3)), p1, p1, p0, (NOT p3)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 01:47:59] [INFO ] Invariant cache hit.
[2023-03-20 01:47:59] [INFO ] [Real]Absence check using 551 positive place invariants in 99 ms returned sat
[2023-03-20 01:48:00] [INFO ] After 1320ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:48:01] [INFO ] [Nat]Absence check using 551 positive place invariants in 159 ms returned sat
[2023-03-20 01:48:03] [INFO ] After 2192ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:48:03] [INFO ] After 2471ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 129 ms.
[2023-03-20 01:48:03] [INFO ] After 3386ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 80 ms.
Support contains 4 out of 1553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1551 transition count 1301
Partial Free-agglomeration rule applied 447 times.
Drop transitions removed 447 transitions
Iterating global reduction 0 with 447 rules applied. Total rules applied 451 place count 1551 transition count 1301
Applied a total of 451 rules in 160 ms. Remains 1551 /1553 variables (removed 2) and now considering 1301/1303 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 1551/1553 places, 1301/1303 transitions.
Finished random walk after 1637 steps, including 0 resets, run visited all 1 properties in 20 ms. (steps per millisecond=81 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), (X (NOT p3)), (X (NOT (AND (NOT p2) p0))), (X (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F p3), (F p2), (F (AND (NOT p2) p0)), (F (AND (NOT p2) p1))]
Knowledge based reduction with 14 factoid took 1335 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 5 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 395 ms :[(OR (NOT p2) (NOT p3)), p1, p1, p0, (NOT p3)]
Stuttering acceptance computed with spot in 381 ms :[(OR (NOT p2) (NOT p3)), p1, p1, p0, (NOT p3)]
[2023-03-20 01:48:06] [INFO ] Invariant cache hit.
[2023-03-20 01:48:08] [INFO ] [Real]Absence check using 551 positive place invariants in 564 ms returned sat
[2023-03-20 01:48:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 01:48:15] [INFO ] [Real]Absence check using state equation in 6870 ms returned sat
[2023-03-20 01:48:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 01:48:17] [INFO ] [Nat]Absence check using 551 positive place invariants in 340 ms returned sat
[2023-03-20 01:48:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 01:48:21] [INFO ] [Nat]Absence check using state equation in 4082 ms returned sat
[2023-03-20 01:48:21] [INFO ] Computed and/alt/rep : 1302/3603/1302 causal constraints (skipped 0 transitions) in 152 ms.
[2023-03-20 01:48:31] [INFO ] Deduced a trap composed of 3 places in 1219 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 01:48:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p2)
Could not prove EG (NOT p2)
[2023-03-20 01:48:31] [INFO ] Invariant cache hit.
[2023-03-20 01:48:33] [INFO ] [Real]Absence check using 551 positive place invariants in 153 ms returned unsat
Proved EG (NOT p3)
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), (X (NOT p3)), (X (NOT (AND (NOT p2) p0))), (X (NOT p2)), (X (NOT (AND (NOT p2) p1))), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F p3), (F p2), (F (AND (NOT p2) p0)), (F (AND (NOT p2) p1)), (G (NOT p3))]
Property proved to be false thanks to negative knowledge :(G (NOT p3))
Knowledge based reduction with 14 factoid took 628 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-050A-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-050A-LTLFireability-01 finished in 45485 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) U G((!p1&&X(!p2)))))'
Support contains 6 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 42 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
[2023-03-20 01:48:33] [INFO ] Invariant cache hit.
[2023-03-20 01:48:35] [INFO ] Implicit Places using invariants in 1449 ms returned []
[2023-03-20 01:48:35] [INFO ] Invariant cache hit.
[2023-03-20 01:48:38] [INFO ] Implicit Places using invariants and state equation in 2794 ms returned []
Implicit Place search using SMT with State Equation took 4257 ms to find 0 implicit places.
[2023-03-20 01:48:38] [INFO ] Invariant cache hit.
[2023-03-20 01:48:39] [INFO ] Dead Transitions using invariants and state equation in 1235 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5538 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Stuttering acceptance computed with spot in 343 ms :[(OR p1 p2), (NOT p0), (AND (NOT p0) (NOT p1) p2), p2]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={0} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 0}, { cond=(AND p1 p2), acceptance={0} source=3 dest: 0}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s191 1) (EQ s210 1)), p0:(AND (EQ s297 1) (EQ s306 1)), p2:(AND (EQ s790 1) (EQ s832 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 40174 reset in 2920 ms.
Product exploration explored 100000 steps with 40001 reset in 3000 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 1091 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(OR p1 p2), (NOT p0), (AND (NOT p0) (NOT p1) p2), p2]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 379 ms. (steps per millisecond=26 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-20 01:48:47] [INFO ] Invariant cache hit.
[2023-03-20 01:48:48] [INFO ] [Real]Absence check using 551 positive place invariants in 158 ms returned sat
[2023-03-20 01:48:48] [INFO ] After 515ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 01:48:48] [INFO ] [Nat]Absence check using 551 positive place invariants in 175 ms returned sat
[2023-03-20 01:48:49] [INFO ] After 1132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 01:48:50] [INFO ] After 1736ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 271 ms.
[2023-03-20 01:48:50] [INFO ] After 2771ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 247 ms.
Support contains 6 out of 1553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1551 transition count 1301
Partial Free-agglomeration rule applied 442 times.
Drop transitions removed 442 transitions
Iterating global reduction 0 with 442 rules applied. Total rules applied 446 place count 1551 transition count 1301
Applied a total of 446 rules in 171 ms. Remains 1551 /1553 variables (removed 2) and now considering 1301/1303 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 1551/1553 places, 1301/1303 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 113171 steps, run timeout after 3009 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 113171 steps, saw 108635 distinct states, run finished after 3009 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1301 rows 1551 cols
[2023-03-20 01:48:54] [INFO ] Computed 551 place invariants in 13 ms
[2023-03-20 01:48:55] [INFO ] [Real]Absence check using 518 positive place invariants in 139 ms returned sat
[2023-03-20 01:48:55] [INFO ] [Real]Absence check using 518 positive and 33 generalized place invariants in 30 ms returned sat
[2023-03-20 01:48:55] [INFO ] After 591ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 01:48:55] [INFO ] [Nat]Absence check using 518 positive place invariants in 138 ms returned sat
[2023-03-20 01:48:55] [INFO ] [Nat]Absence check using 518 positive and 33 generalized place invariants in 10 ms returned sat
[2023-03-20 01:49:08] [INFO ] After 12408ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:49:16] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 1 ms to minimize.
[2023-03-20 01:49:16] [INFO ] Deduced a trap composed of 11 places in 323 ms of which 0 ms to minimize.
[2023-03-20 01:49:17] [INFO ] Deduced a trap composed of 11 places in 285 ms of which 0 ms to minimize.
[2023-03-20 01:49:17] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 1 ms to minimize.
[2023-03-20 01:49:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1608 ms
[2023-03-20 01:49:17] [INFO ] After 21952ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2535 ms.
[2023-03-20 01:49:20] [INFO ] After 25040ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 1551 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 84 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 60 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2023-03-20 01:49:20] [INFO ] Invariant cache hit.
[2023-03-20 01:49:22] [INFO ] Implicit Places using invariants in 1965 ms returned []
[2023-03-20 01:49:22] [INFO ] Invariant cache hit.
[2023-03-20 01:49:25] [INFO ] Implicit Places using invariants and state equation in 3604 ms returned []
Implicit Place search using SMT with State Equation took 5586 ms to find 0 implicit places.
[2023-03-20 01:49:26] [INFO ] Redundant transitions in 127 ms returned []
[2023-03-20 01:49:26] [INFO ] Invariant cache hit.
[2023-03-20 01:49:27] [INFO ] Dead Transitions using invariants and state equation in 1063 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6871 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 42 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-20 01:49:27] [INFO ] Invariant cache hit.
[2023-03-20 01:49:27] [INFO ] [Real]Absence check using 518 positive place invariants in 171 ms returned sat
[2023-03-20 01:49:27] [INFO ] [Real]Absence check using 518 positive and 33 generalized place invariants in 16 ms returned sat
[2023-03-20 01:49:27] [INFO ] After 642ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 01:49:28] [INFO ] [Nat]Absence check using 518 positive place invariants in 109 ms returned sat
[2023-03-20 01:49:28] [INFO ] [Nat]Absence check using 518 positive and 33 generalized place invariants in 17 ms returned sat
[2023-03-20 01:49:35] [INFO ] After 7426ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 01:49:39] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 1 ms to minimize.
[2023-03-20 01:49:39] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 1 ms to minimize.
[2023-03-20 01:49:39] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2023-03-20 01:49:44] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 1 ms to minimize.
[2023-03-20 01:49:44] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 1 ms to minimize.
[2023-03-20 01:49:44] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 0 ms to minimize.
[2023-03-20 01:49:44] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 0 ms to minimize.
[2023-03-20 01:49:45] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 10 ms to minimize.
[2023-03-20 01:49:45] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 6465 ms
[2023-03-20 01:49:46] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 1 ms to minimize.
[2023-03-20 01:49:46] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 1 ms to minimize.
[2023-03-20 01:49:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 599 ms
[2023-03-20 01:49:46] [INFO ] After 18314ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 10100 ms.
[2023-03-20 01:49:56] [INFO ] After 28926ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) p2)), (F p0), (F (AND (NOT p1) p2)), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 17 factoid took 1534 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 289 ms :[(OR p1 p2), (NOT p0), (AND (NOT p0) (NOT p1) p2), p2]
Stuttering acceptance computed with spot in 352 ms :[(OR p1 p2), (NOT p0), (AND (NOT p0) (NOT p1) p2), p2]
Support contains 6 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 101 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2023-03-20 01:49:59] [INFO ] Computed 551 place invariants in 21 ms
[2023-03-20 01:50:00] [INFO ] Implicit Places using invariants in 1209 ms returned []
[2023-03-20 01:50:00] [INFO ] Invariant cache hit.
[2023-03-20 01:50:03] [INFO ] Implicit Places using invariants and state equation in 2688 ms returned []
Implicit Place search using SMT with State Equation took 3919 ms to find 0 implicit places.
[2023-03-20 01:50:03] [INFO ] Invariant cache hit.
[2023-03-20 01:50:04] [INFO ] Dead Transitions using invariants and state equation in 1010 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5031 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 944 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[(OR p1 p2), (NOT p0), (AND (NOT p0) (NOT p1) p2), p2]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-20 01:50:05] [INFO ] Invariant cache hit.
[2023-03-20 01:50:06] [INFO ] [Real]Absence check using 551 positive place invariants in 109 ms returned sat
[2023-03-20 01:50:06] [INFO ] After 421ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 01:50:06] [INFO ] [Nat]Absence check using 551 positive place invariants in 97 ms returned sat
[2023-03-20 01:50:07] [INFO ] After 1209ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 01:50:08] [INFO ] After 1778ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 304 ms.
[2023-03-20 01:50:08] [INFO ] After 2549ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 316 ms.
Support contains 6 out of 1553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1551 transition count 1301
Partial Free-agglomeration rule applied 442 times.
Drop transitions removed 442 transitions
Iterating global reduction 0 with 442 rules applied. Total rules applied 446 place count 1551 transition count 1301
Applied a total of 446 rules in 137 ms. Remains 1551 /1553 variables (removed 2) and now considering 1301/1303 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 1551/1553 places, 1301/1303 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 116874 steps, run timeout after 3012 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 116874 steps, saw 112275 distinct states, run finished after 3014 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1301 rows 1551 cols
[2023-03-20 01:50:12] [INFO ] Computed 551 place invariants in 8 ms
[2023-03-20 01:50:13] [INFO ] [Real]Absence check using 518 positive place invariants in 229 ms returned sat
[2023-03-20 01:50:13] [INFO ] [Real]Absence check using 518 positive and 33 generalized place invariants in 16 ms returned sat
[2023-03-20 01:50:13] [INFO ] After 792ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 01:50:13] [INFO ] [Nat]Absence check using 518 positive place invariants in 140 ms returned sat
[2023-03-20 01:50:13] [INFO ] [Nat]Absence check using 518 positive and 33 generalized place invariants in 99 ms returned sat
[2023-03-20 01:50:26] [INFO ] After 12305ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:50:29] [INFO ] Deduced a trap composed of 11 places in 293 ms of which 1 ms to minimize.
[2023-03-20 01:50:29] [INFO ] Deduced a trap composed of 11 places in 173 ms of which 0 ms to minimize.
[2023-03-20 01:50:29] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 0 ms to minimize.
[2023-03-20 01:50:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 883 ms
[2023-03-20 01:50:29] [INFO ] After 15649ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 451 ms.
[2023-03-20 01:50:30] [INFO ] After 16788ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 485 ms.
Support contains 6 out of 1551 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 40 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 74 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2023-03-20 01:50:30] [INFO ] Invariant cache hit.
[2023-03-20 01:50:31] [INFO ] Implicit Places using invariants in 1185 ms returned []
[2023-03-20 01:50:31] [INFO ] Invariant cache hit.
[2023-03-20 01:50:35] [INFO ] Implicit Places using invariants and state equation in 3602 ms returned []
Implicit Place search using SMT with State Equation took 4791 ms to find 0 implicit places.
[2023-03-20 01:50:35] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-20 01:50:35] [INFO ] Invariant cache hit.
[2023-03-20 01:50:36] [INFO ] Dead Transitions using invariants and state equation in 971 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5876 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 41 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-20 01:50:36] [INFO ] Invariant cache hit.
[2023-03-20 01:50:37] [INFO ] [Real]Absence check using 518 positive place invariants in 218 ms returned sat
[2023-03-20 01:50:37] [INFO ] [Real]Absence check using 518 positive and 33 generalized place invariants in 13 ms returned sat
[2023-03-20 01:50:37] [INFO ] After 632ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 01:50:37] [INFO ] [Nat]Absence check using 518 positive place invariants in 115 ms returned sat
[2023-03-20 01:50:37] [INFO ] [Nat]Absence check using 518 positive and 33 generalized place invariants in 6 ms returned sat
[2023-03-20 01:50:44] [INFO ] After 7096ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 01:50:48] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 1 ms to minimize.
[2023-03-20 01:50:48] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 1 ms to minimize.
[2023-03-20 01:50:48] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 0 ms to minimize.
[2023-03-20 01:50:53] [INFO ] Deduced a trap composed of 17 places in 162 ms of which 2 ms to minimize.
[2023-03-20 01:50:53] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 1 ms to minimize.
[2023-03-20 01:50:53] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 0 ms to minimize.
[2023-03-20 01:50:53] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 0 ms to minimize.
[2023-03-20 01:50:54] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 0 ms to minimize.
[2023-03-20 01:50:54] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 6414 ms
[2023-03-20 01:50:55] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 0 ms to minimize.
[2023-03-20 01:50:55] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 0 ms to minimize.
[2023-03-20 01:50:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 538 ms
[2023-03-20 01:50:55] [INFO ] After 17702ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 10124 ms.
[2023-03-20 01:51:05] [INFO ] After 28484ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) p2)), (F p0), (F (AND (NOT p1) p2)), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 17 factoid took 1136 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[(OR p1 p2), (NOT p0), (AND (NOT p0) (NOT p1) p2), p2]
Stuttering acceptance computed with spot in 214 ms :[(OR p1 p2), (NOT p0), (AND (NOT p0) (NOT p1) p2), p2]
Stuttering acceptance computed with spot in 347 ms :[(OR p1 p2), (NOT p0), (AND (NOT p0) (NOT p1) p2), p2]
Product exploration explored 100000 steps with 39966 reset in 2956 ms.
Product exploration explored 100000 steps with 39933 reset in 3005 ms.
Applying partial POR strategy [false, true, true, false]
Stuttering acceptance computed with spot in 155 ms :[(OR p1 p2), (NOT p0), (AND (NOT p0) (NOT p1) p2), p2]
Support contains 6 out of 1553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 2 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1553 transition count 1303
Deduced a syphon composed of 2 places in 3 ms
Applied a total of 2 rules in 295 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
[2023-03-20 01:51:14] [INFO ] Redundant transitions in 22 ms returned []
// Phase 1: matrix 1303 rows 1553 cols
[2023-03-20 01:51:14] [INFO ] Computed 551 place invariants in 3 ms
[2023-03-20 01:51:15] [INFO ] Dead Transitions using invariants and state equation in 1310 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1553/1553 places, 1303/1303 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1653 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Support contains 6 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 38 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2023-03-20 01:51:15] [INFO ] Computed 551 place invariants in 11 ms
[2023-03-20 01:51:16] [INFO ] Implicit Places using invariants in 1113 ms returned []
[2023-03-20 01:51:16] [INFO ] Invariant cache hit.
[2023-03-20 01:51:19] [INFO ] Implicit Places using invariants and state equation in 2748 ms returned []
Implicit Place search using SMT with State Equation took 3879 ms to find 0 implicit places.
[2023-03-20 01:51:19] [INFO ] Invariant cache hit.
[2023-03-20 01:51:21] [INFO ] Dead Transitions using invariants and state equation in 1339 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5285 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Treatment of property ShieldPPPs-PT-050A-LTLFireability-02 finished in 167478 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||((p1 U X(p0))&&F(p2))))'
Support contains 6 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 43 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
[2023-03-20 01:51:21] [INFO ] Invariant cache hit.
[2023-03-20 01:51:22] [INFO ] Implicit Places using invariants in 1046 ms returned []
[2023-03-20 01:51:22] [INFO ] Invariant cache hit.
[2023-03-20 01:51:25] [INFO ] Implicit Places using invariants and state equation in 2854 ms returned []
Implicit Place search using SMT with State Equation took 3925 ms to find 0 implicit places.
[2023-03-20 01:51:25] [INFO ] Invariant cache hit.
[2023-03-20 01:51:26] [INFO ] Dead Transitions using invariants and state equation in 984 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4966 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Stuttering acceptance computed with spot in 265 ms :[(NOT p0), (NOT p0), (NOT p2), (NOT p0), (AND (NOT p2) (NOT p0)), true]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s1065 1) (EQ s1077 1)), p0:(AND (EQ s411 1) (EQ s431 1)), p2:(AND (EQ s977 1) (EQ s992 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2660 steps with 2 reset in 49 ms.
FORMULA ShieldPPPs-PT-050A-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050A-LTLFireability-04 finished in 5350 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(p1)||p0)))'
Support contains 7 out of 1553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1551 transition count 1301
Applied a total of 4 rules in 150 ms. Remains 1551 /1553 variables (removed 2) and now considering 1301/1303 (removed 2) transitions.
// Phase 1: matrix 1301 rows 1551 cols
[2023-03-20 01:51:26] [INFO ] Computed 551 place invariants in 3 ms
[2023-03-20 01:51:27] [INFO ] Implicit Places using invariants in 1180 ms returned []
[2023-03-20 01:51:27] [INFO ] Invariant cache hit.
[2023-03-20 01:51:30] [INFO ] Implicit Places using invariants and state equation in 3001 ms returned []
Implicit Place search using SMT with State Equation took 4222 ms to find 0 implicit places.
[2023-03-20 01:51:31] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-20 01:51:31] [INFO ] Invariant cache hit.
[2023-03-20 01:51:32] [INFO ] Dead Transitions using invariants and state equation in 1411 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1551/1553 places, 1301/1303 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5840 ms. Remains : 1551/1553 places, 1301/1303 transitions.
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (OR (EQ s818 0) (EQ s820 0)) (OR (EQ s253 0) (EQ s272 0))), p0:(OR (AND (EQ s1492 1) (EQ s1513 1)) (AND (EQ s818 1) (EQ s820 1) (EQ s611 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 4009 reset in 1080 ms.
Product exploration explored 100000 steps with 4064 reset in 1252 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 300 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 2545 steps, including 0 resets, run visited all 2 properties in 47 ms. (steps per millisecond=54 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 238 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p1))]
Support contains 7 out of 1551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 64 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2023-03-20 01:51:35] [INFO ] Invariant cache hit.
[2023-03-20 01:51:36] [INFO ] Implicit Places using invariants in 1184 ms returned []
[2023-03-20 01:51:36] [INFO ] Invariant cache hit.
[2023-03-20 01:51:39] [INFO ] Implicit Places using invariants and state equation in 2990 ms returned []
Implicit Place search using SMT with State Equation took 4202 ms to find 0 implicit places.
[2023-03-20 01:51:40] [INFO ] Redundant transitions in 39 ms returned []
[2023-03-20 01:51:40] [INFO ] Invariant cache hit.
[2023-03-20 01:51:40] [INFO ] Dead Transitions using invariants and state equation in 932 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5297 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 230 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 2569 steps, including 0 resets, run visited all 2 properties in 39 ms. (steps per millisecond=65 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 420 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4024 reset in 1104 ms.
Product exploration explored 100000 steps with 3973 reset in 1312 ms.
Support contains 7 out of 1551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 54 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2023-03-20 01:51:44] [INFO ] Invariant cache hit.
[2023-03-20 01:51:45] [INFO ] Implicit Places using invariants in 929 ms returned []
[2023-03-20 01:51:45] [INFO ] Invariant cache hit.
[2023-03-20 01:51:47] [INFO ] Implicit Places using invariants and state equation in 2022 ms returned []
Implicit Place search using SMT with State Equation took 2965 ms to find 0 implicit places.
[2023-03-20 01:51:47] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-20 01:51:47] [INFO ] Invariant cache hit.
[2023-03-20 01:51:49] [INFO ] Dead Transitions using invariants and state equation in 1514 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4573 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Treatment of property ShieldPPPs-PT-050A-LTLFireability-05 finished in 22565 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(p1)&&F(p2))))'
Support contains 7 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 46 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2023-03-20 01:51:49] [INFO ] Computed 551 place invariants in 3 ms
[2023-03-20 01:51:50] [INFO ] Implicit Places using invariants in 951 ms returned []
[2023-03-20 01:51:50] [INFO ] Invariant cache hit.
[2023-03-20 01:51:52] [INFO ] Implicit Places using invariants and state equation in 2588 ms returned []
Implicit Place search using SMT with State Equation took 3566 ms to find 0 implicit places.
[2023-03-20 01:51:52] [INFO ] Invariant cache hit.
[2023-03-20 01:51:53] [INFO ] Dead Transitions using invariants and state equation in 1088 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4702 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s1375 0) (EQ s1385 0) (EQ s12 0) (EQ s14 0)), p2:(AND (EQ s879 1) (EQ s889 1)), p1:(AND (EQ s1375 1) (EQ s1385 1) (EQ s424 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-050A-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050A-LTLFireability-07 finished in 5047 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G((F(p1)&&F(p2)))))'
Support contains 5 out of 1553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1551 transition count 1301
Applied a total of 4 rules in 101 ms. Remains 1551 /1553 variables (removed 2) and now considering 1301/1303 (removed 2) transitions.
// Phase 1: matrix 1301 rows 1551 cols
[2023-03-20 01:51:54] [INFO ] Computed 551 place invariants in 3 ms
[2023-03-20 01:51:55] [INFO ] Implicit Places using invariants in 1261 ms returned []
[2023-03-20 01:51:55] [INFO ] Invariant cache hit.
[2023-03-20 01:51:58] [INFO ] Implicit Places using invariants and state equation in 2842 ms returned []
Implicit Place search using SMT with State Equation took 4104 ms to find 0 implicit places.
[2023-03-20 01:51:58] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-20 01:51:58] [INFO ] Invariant cache hit.
[2023-03-20 01:51:59] [INFO ] Dead Transitions using invariants and state equation in 1424 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1551/1553 places, 1301/1303 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5657 ms. Remains : 1551/1553 places, 1301/1303 transitions.
Stuttering acceptance computed with spot in 286 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s1039 1) (EQ s1054 1)), p1:(EQ s1147 0), p2:(OR (EQ s538 0) (EQ s550 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 97 reset in 1010 ms.
Product exploration explored 100000 steps with 103 reset in 1198 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X p1), (X (NOT p0)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 567 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Finished random walk after 2112 steps, including 0 resets, run visited all 2 properties in 56 ms. (steps per millisecond=37 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X p1), (X (NOT p0)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2))]
Knowledge based reduction with 12 factoid took 700 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 133 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Support contains 3 out of 1551 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 53 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2023-03-20 01:52:04] [INFO ] Invariant cache hit.
[2023-03-20 01:52:05] [INFO ] Implicit Places using invariants in 1190 ms returned []
[2023-03-20 01:52:05] [INFO ] Invariant cache hit.
[2023-03-20 01:52:08] [INFO ] Implicit Places using invariants and state equation in 2991 ms returned []
Implicit Place search using SMT with State Equation took 4212 ms to find 0 implicit places.
[2023-03-20 01:52:08] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-20 01:52:08] [INFO ] Invariant cache hit.
[2023-03-20 01:52:09] [INFO ] Dead Transitions using invariants and state equation in 1157 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5487 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p2), (X p2), (X p1), (X (X p2)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 315 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 165 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Finished random walk after 2139 steps, including 0 resets, run visited all 2 properties in 30 ms. (steps per millisecond=71 )
Knowledge obtained : [(AND p1 p2), (X p2), (X p1), (X (X p2)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2))]
Knowledge based reduction with 5 factoid took 352 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 133 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 100 reset in 982 ms.
Product exploration explored 100000 steps with 101 reset in 1215 ms.
Support contains 3 out of 1551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 55 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2023-03-20 01:52:13] [INFO ] Invariant cache hit.
[2023-03-20 01:52:14] [INFO ] Implicit Places using invariants in 1308 ms returned []
[2023-03-20 01:52:14] [INFO ] Invariant cache hit.
[2023-03-20 01:52:17] [INFO ] Implicit Places using invariants and state equation in 2973 ms returned []
Implicit Place search using SMT with State Equation took 4303 ms to find 0 implicit places.
[2023-03-20 01:52:17] [INFO ] Redundant transitions in 45 ms returned []
[2023-03-20 01:52:17] [INFO ] Invariant cache hit.
[2023-03-20 01:52:19] [INFO ] Dead Transitions using invariants and state equation in 1385 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5802 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Treatment of property ShieldPPPs-PT-050A-LTLFireability-08 finished in 24953 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 U p1))))'
Support contains 3 out of 1553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1551 transition count 1301
Applied a total of 4 rules in 97 ms. Remains 1551 /1553 variables (removed 2) and now considering 1301/1303 (removed 2) transitions.
[2023-03-20 01:52:19] [INFO ] Invariant cache hit.
[2023-03-20 01:52:20] [INFO ] Implicit Places using invariants in 987 ms returned []
[2023-03-20 01:52:20] [INFO ] Invariant cache hit.
[2023-03-20 01:52:22] [INFO ] Implicit Places using invariants and state equation in 2538 ms returned []
Implicit Place search using SMT with State Equation took 3550 ms to find 0 implicit places.
[2023-03-20 01:52:22] [INFO ] Redundant transitions in 46 ms returned []
[2023-03-20 01:52:22] [INFO ] Invariant cache hit.
[2023-03-20 01:52:23] [INFO ] Dead Transitions using invariants and state equation in 1000 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1551/1553 places, 1301/1303 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4705 ms. Remains : 1551/1553 places, 1301/1303 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s337 1), p0:(AND (EQ s1307 1) (EQ s1326 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3230 steps with 0 reset in 61 ms.
FORMULA ShieldPPPs-PT-050A-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050A-LTLFireability-09 finished in 4885 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(p1)&&p0) U X(G(p2))))'
Support contains 4 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 35 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2023-03-20 01:52:24] [INFO ] Computed 551 place invariants in 4 ms
[2023-03-20 01:52:25] [INFO ] Implicit Places using invariants in 1138 ms returned []
[2023-03-20 01:52:25] [INFO ] Invariant cache hit.
[2023-03-20 01:52:27] [INFO ] Implicit Places using invariants and state equation in 2186 ms returned []
Implicit Place search using SMT with State Equation took 3360 ms to find 0 implicit places.
[2023-03-20 01:52:27] [INFO ] Invariant cache hit.
[2023-03-20 01:52:28] [INFO ] Dead Transitions using invariants and state equation in 1157 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4574 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}, { cond=(AND p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p2:(AND (EQ s229 1) (EQ s231 1)), p0:(AND (EQ s229 1) (EQ s231 1)), p1:(AND (EQ s1069 1) (EQ s1111 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-050A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050A-LTLFireability-10 finished in 4750 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||F(p1))))||G(p2)))'
Support contains 5 out of 1553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1551 transition count 1301
Applied a total of 4 rules in 81 ms. Remains 1551 /1553 variables (removed 2) and now considering 1301/1303 (removed 2) transitions.
// Phase 1: matrix 1301 rows 1551 cols
[2023-03-20 01:52:28] [INFO ] Computed 551 place invariants in 6 ms
[2023-03-20 01:52:29] [INFO ] Implicit Places using invariants in 997 ms returned []
[2023-03-20 01:52:29] [INFO ] Invariant cache hit.
[2023-03-20 01:52:32] [INFO ] Implicit Places using invariants and state equation in 2880 ms returned []
Implicit Place search using SMT with State Equation took 3878 ms to find 0 implicit places.
[2023-03-20 01:52:32] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-20 01:52:32] [INFO ] Invariant cache hit.
[2023-03-20 01:52:33] [INFO ] Dead Transitions using invariants and state equation in 963 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1551/1553 places, 1301/1303 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4951 ms. Remains : 1551/1553 places, 1301/1303 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s1245 1) (EQ s1264 1)), p0:(EQ s1386 1), p1:(AND (EQ s128 1) (EQ s149 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 36 reset in 1007 ms.
Product exploration explored 100000 steps with 36 reset in 1307 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (X (NOT p2))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 658 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 310 steps, including 0 resets, run visited all 2 properties in 14 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (X (NOT p2))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 10 factoid took 597 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-20 01:52:38] [INFO ] Invariant cache hit.
[2023-03-20 01:52:40] [INFO ] [Real]Absence check using 551 positive place invariants in 572 ms returned sat
[2023-03-20 01:52:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 01:52:46] [INFO ] [Real]Absence check using state equation in 6825 ms returned sat
[2023-03-20 01:52:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 01:52:48] [INFO ] [Nat]Absence check using 551 positive place invariants in 354 ms returned sat
[2023-03-20 01:52:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 01:52:53] [INFO ] [Nat]Absence check using state equation in 4738 ms returned sat
[2023-03-20 01:52:53] [INFO ] Computed and/alt/rep : 1300/3607/1300 causal constraints (skipped 0 transitions) in 93 ms.
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.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 01:53:02] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p0) (NOT p1))
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 1551 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 45 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2023-03-20 01:53:02] [INFO ] Invariant cache hit.
[2023-03-20 01:53:03] [INFO ] Implicit Places using invariants in 1119 ms returned []
[2023-03-20 01:53:03] [INFO ] Invariant cache hit.
[2023-03-20 01:53:05] [INFO ] Implicit Places using invariants and state equation in 2425 ms returned []
Implicit Place search using SMT with State Equation took 3558 ms to find 0 implicit places.
[2023-03-20 01:53:05] [INFO ] Redundant transitions in 48 ms returned []
[2023-03-20 01:53:05] [INFO ] Invariant cache hit.
[2023-03-20 01:53:06] [INFO ] Dead Transitions using invariants and state equation in 966 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4649 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 324 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 343 steps, including 0 resets, run visited all 2 properties in 15 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 445 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-20 01:53:08] [INFO ] Invariant cache hit.
[2023-03-20 01:53:10] [INFO ] [Real]Absence check using 551 positive place invariants in 487 ms returned sat
[2023-03-20 01:53:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 01:53:17] [INFO ] [Real]Absence check using state equation in 7663 ms returned sat
[2023-03-20 01:53:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 01:53:20] [INFO ] [Nat]Absence check using 551 positive place invariants in 507 ms returned sat
[2023-03-20 01:53:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 01:53:26] [INFO ] [Nat]Absence check using state equation in 6135 ms returned sat
[2023-03-20 01:53:26] [INFO ] Computed and/alt/rep : 1300/3607/1300 causal constraints (skipped 0 transitions) in 171 ms.
[2023-03-20 01:53:34] [INFO ] Deduced a trap composed of 3 places in 1178 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 01:53:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p0) (NOT p1))
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 35 reset in 988 ms.
Product exploration explored 100000 steps with 35 reset in 1295 ms.
Support contains 3 out of 1551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 45 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2023-03-20 01:53:36] [INFO ] Invariant cache hit.
[2023-03-20 01:53:37] [INFO ] Implicit Places using invariants in 1202 ms returned []
[2023-03-20 01:53:37] [INFO ] Invariant cache hit.
[2023-03-20 01:53:40] [INFO ] Implicit Places using invariants and state equation in 2792 ms returned []
Implicit Place search using SMT with State Equation took 3996 ms to find 0 implicit places.
[2023-03-20 01:53:40] [INFO ] Redundant transitions in 54 ms returned []
[2023-03-20 01:53:40] [INFO ] Invariant cache hit.
[2023-03-20 01:53:41] [INFO ] Dead Transitions using invariants and state equation in 1262 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5382 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Treatment of property ShieldPPPs-PT-050A-LTLFireability-11 finished in 73093 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(X((p1||F(G(!p2)))))))'
Support contains 5 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 46 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2023-03-20 01:53:42] [INFO ] Computed 551 place invariants in 7 ms
[2023-03-20 01:53:43] [INFO ] Implicit Places using invariants in 1686 ms returned []
[2023-03-20 01:53:43] [INFO ] Invariant cache hit.
[2023-03-20 01:53:45] [INFO ] Implicit Places using invariants and state equation in 2113 ms returned []
Implicit Place search using SMT with State Equation took 3815 ms to find 0 implicit places.
[2023-03-20 01:53:45] [INFO ] Invariant cache hit.
[2023-03-20 01:53:46] [INFO ] Dead Transitions using invariants and state equation in 899 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4761 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Stuttering acceptance computed with spot in 466 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), p2, (AND (NOT p1) p2), (AND p2 (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}, { cond=p2, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(NEQ s1302 1), p1:(AND (EQ s1339 1) (EQ s1355 1)), p2:(AND (EQ s454 1) (EQ s475 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 29 reset in 1063 ms.
Product exploration explored 100000 steps with 29 reset in 1260 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 377 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 278 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), p2, (AND (NOT p1) p2), (AND p2 (NOT p0))]
Finished random walk after 2202 steps, including 0 resets, run visited all 6 properties in 59 ms. (steps per millisecond=37 )
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND p0 (NOT p1) p2)), (F (NOT p0)), (F p2), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 590 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), p2, (AND (NOT p1) p2), (AND p2 (NOT p0))]
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), p2, (AND (NOT p1) p2), (AND p2 (NOT p0))]
Support contains 5 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 40 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
[2023-03-20 01:53:51] [INFO ] Invariant cache hit.
[2023-03-20 01:53:52] [INFO ] Implicit Places using invariants in 958 ms returned []
[2023-03-20 01:53:52] [INFO ] Invariant cache hit.
[2023-03-20 01:53:54] [INFO ] Implicit Places using invariants and state equation in 2326 ms returned []
Implicit Place search using SMT with State Equation took 3326 ms to find 0 implicit places.
[2023-03-20 01:53:54] [INFO ] Invariant cache hit.
[2023-03-20 01:53:55] [INFO ] Dead Transitions using invariants and state equation in 1111 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4478 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 293 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 380 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), p2, (AND (NOT p1) p2), (AND p2 (NOT p0))]
Finished random walk after 2137 steps, including 0 resets, run visited all 6 properties in 73 ms. (steps per millisecond=29 )
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND p0 (NOT p1) p2)), (F (NOT p0)), (F p2), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 670 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 269 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), p2, (AND (NOT p1) p2), (AND p2 (NOT p0))]
Stuttering acceptance computed with spot in 260 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), p2, (AND (NOT p1) p2), (AND p2 (NOT p0))]
Stuttering acceptance computed with spot in 294 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), p2, (AND (NOT p1) p2), (AND p2 (NOT p0))]
Product exploration explored 100000 steps with 29 reset in 1000 ms.
Product exploration explored 100000 steps with 29 reset in 1269 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 363 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), p2, (AND (NOT p1) p2), (AND p2 (NOT p0))]
Support contains 5 out of 1553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 3 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1553 transition count 1303
Deduced a syphon composed of 2 places in 4 ms
Applied a total of 2 rules in 134 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
[2023-03-20 01:54:00] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 1303 rows 1553 cols
[2023-03-20 01:54:01] [INFO ] Computed 551 place invariants in 4 ms
[2023-03-20 01:54:02] [INFO ] Dead Transitions using invariants and state equation in 1075 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1553/1553 places, 1303/1303 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1257 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Support contains 5 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 36 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2023-03-20 01:54:02] [INFO ] Computed 551 place invariants in 2 ms
[2023-03-20 01:54:03] [INFO ] Implicit Places using invariants in 1014 ms returned []
[2023-03-20 01:54:03] [INFO ] Invariant cache hit.
[2023-03-20 01:54:05] [INFO ] Implicit Places using invariants and state equation in 2409 ms returned []
Implicit Place search using SMT with State Equation took 3441 ms to find 0 implicit places.
[2023-03-20 01:54:05] [INFO ] Invariant cache hit.
[2023-03-20 01:54:06] [INFO ] Dead Transitions using invariants and state equation in 856 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4343 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Treatment of property ShieldPPPs-PT-050A-LTLFireability-12 finished in 24536 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(X(p1))))))'
Support contains 3 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 44 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
[2023-03-20 01:54:06] [INFO ] Invariant cache hit.
[2023-03-20 01:54:07] [INFO ] Implicit Places using invariants in 1210 ms returned []
[2023-03-20 01:54:07] [INFO ] Invariant cache hit.
[2023-03-20 01:54:10] [INFO ] Implicit Places using invariants and state equation in 2951 ms returned []
Implicit Place search using SMT with State Equation took 4187 ms to find 0 implicit places.
[2023-03-20 01:54:10] [INFO ] Invariant cache hit.
[2023-03-20 01:54:11] [INFO ] Dead Transitions using invariants and state equation in 1142 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5376 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s465 1), p1:(OR (EQ s449 0) (EQ s491 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 19991 reset in 1815 ms.
Product exploration explored 100000 steps with 19962 reset in 1960 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 296 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Finished random walk after 2102 steps, including 0 resets, run visited all 2 properties in 83 ms. (steps per millisecond=25 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 181 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Support contains 3 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 74 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
[2023-03-20 01:54:17] [INFO ] Invariant cache hit.
[2023-03-20 01:54:18] [INFO ] Implicit Places using invariants in 1069 ms returned []
[2023-03-20 01:54:18] [INFO ] Invariant cache hit.
[2023-03-20 01:54:20] [INFO ] Implicit Places using invariants and state equation in 2309 ms returned []
Implicit Place search using SMT with State Equation took 3420 ms to find 0 implicit places.
[2023-03-20 01:54:20] [INFO ] Invariant cache hit.
[2023-03-20 01:54:21] [INFO ] Dead Transitions using invariants and state equation in 935 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4444 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 181 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 272 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Finished random walk after 2510 steps, including 0 resets, run visited all 2 properties in 75 ms. (steps per millisecond=33 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 246 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 20033 reset in 1842 ms.
Product exploration explored 100000 steps with 20035 reset in 1941 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Support contains 3 out of 1553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 3 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1553 transition count 1303
Deduced a syphon composed of 2 places in 3 ms
Applied a total of 2 rules in 99 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
[2023-03-20 01:54:27] [INFO ] Redundant transitions in 18 ms returned []
// Phase 1: matrix 1303 rows 1553 cols
[2023-03-20 01:54:27] [INFO ] Computed 551 place invariants in 2 ms
[2023-03-20 01:54:28] [INFO ] Dead Transitions using invariants and state equation in 1307 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1553/1553 places, 1303/1303 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1455 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Support contains 3 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Applied a total of 0 rules in 35 ms. Remains 1553 /1553 variables (removed 0) and now considering 1303/1303 (removed 0) transitions.
// Phase 1: matrix 1303 rows 1553 cols
[2023-03-20 01:54:28] [INFO ] Computed 551 place invariants in 3 ms
[2023-03-20 01:54:29] [INFO ] Implicit Places using invariants in 940 ms returned []
[2023-03-20 01:54:29] [INFO ] Invariant cache hit.
[2023-03-20 01:54:31] [INFO ] Implicit Places using invariants and state equation in 2225 ms returned []
Implicit Place search using SMT with State Equation took 3198 ms to find 0 implicit places.
[2023-03-20 01:54:31] [INFO ] Invariant cache hit.
[2023-03-20 01:54:32] [INFO ] Dead Transitions using invariants and state equation in 1000 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4233 ms. Remains : 1553/1553 places, 1303/1303 transitions.
Treatment of property ShieldPPPs-PT-050A-LTLFireability-15 finished in 26207 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) U G((!p1&&X(!p2)))))'
Found a Lengthening insensitive property : ShieldPPPs-PT-050A-LTLFireability-02
Stuttering acceptance computed with spot in 216 ms :[(OR p1 p2), (NOT p0), (AND (NOT p0) (NOT p1) p2), p2]
Support contains 6 out of 1553 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1551 transition count 1301
Applied a total of 4 rules in 108 ms. Remains 1551 /1553 variables (removed 2) and now considering 1301/1303 (removed 2) transitions.
// Phase 1: matrix 1301 rows 1551 cols
[2023-03-20 01:54:33] [INFO ] Computed 551 place invariants in 3 ms
[2023-03-20 01:54:34] [INFO ] Implicit Places using invariants in 1049 ms returned []
[2023-03-20 01:54:34] [INFO ] Invariant cache hit.
[2023-03-20 01:54:36] [INFO ] Implicit Places using invariants and state equation in 2398 ms returned []
Implicit Place search using SMT with State Equation took 3455 ms to find 0 implicit places.
[2023-03-20 01:54:36] [INFO ] Invariant cache hit.
[2023-03-20 01:54:37] [INFO ] Dead Transitions using invariants and state equation in 1125 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1551/1553 places, 1301/1303 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 4690 ms. Remains : 1551/1553 places, 1301/1303 transitions.
Running random walk in product with property : ShieldPPPs-PT-050A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={0} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 0}, { cond=(AND p1 p2), acceptance={0} source=3 dest: 0}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s191 1) (EQ s210 1)), p0:(AND (EQ s297 1) (EQ s306 1)), p2:(AND (EQ s790 1) (EQ s832 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 40074 reset in 2847 ms.
Product exploration explored 100000 steps with 40068 reset in 3009 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 1223 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(OR p1 p2), (NOT p0), (AND (NOT p0) (NOT p1) p2), p2]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 264 ms. (steps per millisecond=37 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-20 01:54:45] [INFO ] Invariant cache hit.
[2023-03-20 01:54:46] [INFO ] [Real]Absence check using 551 positive place invariants in 92 ms returned sat
[2023-03-20 01:54:46] [INFO ] After 681ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 01:54:46] [INFO ] [Nat]Absence check using 551 positive place invariants in 88 ms returned sat
[2023-03-20 01:54:48] [INFO ] After 1973ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 01:54:49] [INFO ] After 2761ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 314 ms.
[2023-03-20 01:54:49] [INFO ] After 3729ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 231 ms.
Support contains 6 out of 1551 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Partial Free-agglomeration rule applied 442 times.
Drop transitions removed 442 transitions
Iterating global reduction 0 with 442 rules applied. Total rules applied 442 place count 1551 transition count 1301
Applied a total of 442 rules in 91 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Finished random walk after 3210 steps, including 0 resets, run visited all 2 properties in 97 ms. (steps per millisecond=33 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) p2)), (F p0), (F (AND p1 p2)), (F (AND (NOT p1) p2)), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) p1 p2))]
Knowledge based reduction with 17 factoid took 997 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(OR p1 p2), (NOT p0), (AND (NOT p0) (NOT p1) p2), p2]
Stuttering acceptance computed with spot in 331 ms :[(OR p1 p2), (NOT p0), (AND (NOT p0) (NOT p1) p2), p2]
Support contains 6 out of 1551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 72 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2023-03-20 01:54:51] [INFO ] Invariant cache hit.
[2023-03-20 01:54:53] [INFO ] Implicit Places using invariants in 1431 ms returned []
[2023-03-20 01:54:53] [INFO ] Invariant cache hit.
[2023-03-20 01:54:55] [INFO ] Implicit Places using invariants and state equation in 2297 ms returned []
Implicit Place search using SMT with State Equation took 3753 ms to find 0 implicit places.
[2023-03-20 01:54:55] [INFO ] Invariant cache hit.
[2023-03-20 01:54:56] [INFO ] Dead Transitions using invariants and state equation in 1065 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4907 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 960 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(OR p1 p2), (NOT p0), (AND (NOT p0) (NOT p1) p2), p2]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 246 ms. (steps per millisecond=40 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-20 01:54:58] [INFO ] Invariant cache hit.
[2023-03-20 01:54:58] [INFO ] [Real]Absence check using 551 positive place invariants in 86 ms returned sat
[2023-03-20 01:54:58] [INFO ] After 411ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 01:54:59] [INFO ] [Nat]Absence check using 551 positive place invariants in 87 ms returned sat
[2023-03-20 01:55:01] [INFO ] After 1978ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 01:55:01] [INFO ] After 2755ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 225 ms.
[2023-03-20 01:55:02] [INFO ] After 3494ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 286 ms.
Support contains 6 out of 1551 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Partial Free-agglomeration rule applied 442 times.
Drop transitions removed 442 transitions
Iterating global reduction 0 with 442 rules applied. Total rules applied 442 place count 1551 transition count 1301
Applied a total of 442 rules in 133 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Finished random walk after 6501 steps, including 1 resets, run visited all 2 properties in 297 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) p2)), (F p0), (F (AND p1 p2)), (F (AND (NOT p1) p2)), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) p1 p2))]
Knowledge based reduction with 17 factoid took 1140 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(OR p1 p2), (NOT p0), (AND (NOT p0) (NOT p1) p2), p2]
Stuttering acceptance computed with spot in 145 ms :[(OR p1 p2), (NOT p0), (AND (NOT p0) (NOT p1) p2), p2]
Stuttering acceptance computed with spot in 207 ms :[(OR p1 p2), (NOT p0), (AND (NOT p0) (NOT p1) p2), p2]
Product exploration explored 100000 steps with 40023 reset in 2813 ms.
Product exploration explored 100000 steps with 39883 reset in 2938 ms.
Applying partial POR strategy [false, true, true, false]
Stuttering acceptance computed with spot in 255 ms :[(OR p1 p2), (NOT p0), (AND (NOT p0) (NOT p1) p2), p2]
Support contains 6 out of 1551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 83 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2023-03-20 01:55:10] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-20 01:55:10] [INFO ] Invariant cache hit.
[2023-03-20 01:55:12] [INFO ] Dead Transitions using invariants and state equation in 1140 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1296 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Support contains 6 out of 1551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 33 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2023-03-20 01:55:12] [INFO ] Invariant cache hit.
[2023-03-20 01:55:12] [INFO ] Implicit Places using invariants in 871 ms returned []
[2023-03-20 01:55:12] [INFO ] Invariant cache hit.
[2023-03-20 01:55:15] [INFO ] Implicit Places using invariants and state equation in 2237 ms returned []
Implicit Place search using SMT with State Equation took 3134 ms to find 0 implicit places.
[2023-03-20 01:55:15] [INFO ] Invariant cache hit.
[2023-03-20 01:55:16] [INFO ] Dead Transitions using invariants and state equation in 855 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4045 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Treatment of property ShieldPPPs-PT-050A-LTLFireability-02 finished in 43456 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(p1)||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(p0)||G((F(p1)&&F(p2)))))'
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||F(p1))))||G(p2)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(X((p1||F(G(!p2)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(X(p1))))))'
[2023-03-20 01:55:16] [INFO ] Flatten gal took : 137 ms
[2023-03-20 01:55:16] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-20 01:55:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1553 places, 1303 transitions and 5006 arcs took 40 ms.
Total runtime 534718 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldPPPs-PT-050A
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/382
LTLFireability

FORMULA ShieldPPPs-PT-050A-LTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-050A-LTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679277468272

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/382/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/382/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/382/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 ShieldPPPs-PT-050A-LTLFireability-02
lola: time limit : 599 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for ShieldPPPs-PT-050A-LTLFireability-02
lola: result : false
lola: markings : 10357
lola: fired transitions : 10357
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 ShieldPPPs-PT-050A-LTLFireability-05
lola: time limit : 719 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-050A-LTLFireability-02: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-050A-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/719 6/32 ShieldPPPs-PT-050A-LTLFireability-05 298953 m, 59790 m/sec, 434406 t fired, .

Time elapsed: 6 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-050A-LTLFireability-02: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-050A-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/719 13/32 ShieldPPPs-PT-050A-LTLFireability-05 656366 m, 71482 m/sec, 933553 t fired, .

Time elapsed: 11 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-050A-LTLFireability-02: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-050A-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/719 19/32 ShieldPPPs-PT-050A-LTLFireability-05 999932 m, 68713 m/sec, 1424853 t fired, .

Time elapsed: 16 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-050A-LTLFireability-02: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-050A-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/719 26/32 ShieldPPPs-PT-050A-LTLFireability-05 1343572 m, 68728 m/sec, 1939399 t fired, .

Time elapsed: 21 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 6
lola: CANCELED task # 4 (type EXCL) for ShieldPPPs-PT-050A-LTLFireability-05 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-050A-LTLFireability-02: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-050A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-050A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 26 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: LAUNCH task # 16 (type EXCL) for 15 ShieldPPPs-PT-050A-LTLFireability-15
lola: time limit : 893 sec
lola: memory limit: 32 pages
lola: FINISHED task # 16 (type EXCL) for ShieldPPPs-PT-050A-LTLFireability-15
lola: result : false
lola: markings : 55981
lola: fired transitions : 55981
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 13 (type EXCL) for 12 ShieldPPPs-PT-050A-LTLFireability-12
lola: time limit : 1191 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-050A-LTLFireability-02: LTL false LTL model checker
ShieldPPPs-PT-050A-LTLFireability-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-050A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-050A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 5/1191 4/32 ShieldPPPs-PT-050A-LTLFireability-12 161443 m, 32288 m/sec, 813892 t fired, .

Time elapsed: 31 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-050A-LTLFireability-02: LTL false LTL model checker
ShieldPPPs-PT-050A-LTLFireability-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-050A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-050A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 10/1191 7/32 ShieldPPPs-PT-050A-LTLFireability-12 305877 m, 28886 m/sec, 1701434 t fired, .

Time elapsed: 36 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-050A-LTLFireability-02: LTL false LTL model checker
ShieldPPPs-PT-050A-LTLFireability-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-050A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-050A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 15/1191 9/32 ShieldPPPs-PT-050A-LTLFireability-12 440981 m, 27020 m/sec, 2581978 t fired, .

Time elapsed: 41 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-050A-LTLFireability-02: LTL false LTL model checker
ShieldPPPs-PT-050A-LTLFireability-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-050A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-050A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 20/1191 12/32 ShieldPPPs-PT-050A-LTLFireability-12 575713 m, 26946 m/sec, 3458013 t fired, .

Time elapsed: 46 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-050A-LTLFireability-02: LTL false LTL model checker
ShieldPPPs-PT-050A-LTLFireability-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-050A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-050A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 25/1191 15/32 ShieldPPPs-PT-050A-LTLFireability-12 725040 m, 29865 m/sec, 4342518 t fired, .

Time elapsed: 51 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-050A-LTLFireability-02: LTL false LTL model checker
ShieldPPPs-PT-050A-LTLFireability-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-050A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-050A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 30/1191 18/32 ShieldPPPs-PT-050A-LTLFireability-12 854433 m, 25878 m/sec, 5227637 t fired, .

Time elapsed: 56 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-050A-LTLFireability-02: LTL false LTL model checker
ShieldPPPs-PT-050A-LTLFireability-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-050A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-050A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 35/1191 21/32 ShieldPPPs-PT-050A-LTLFireability-12 983314 m, 25776 m/sec, 6111827 t fired, .

Time elapsed: 61 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-050A-LTLFireability-02: LTL false LTL model checker
ShieldPPPs-PT-050A-LTLFireability-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-050A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-050A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 40/1191 23/32 ShieldPPPs-PT-050A-LTLFireability-12 1115550 m, 26447 m/sec, 7001540 t fired, .

Time elapsed: 66 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-050A-LTLFireability-02: LTL false LTL model checker
ShieldPPPs-PT-050A-LTLFireability-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-050A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-050A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 45/1191 26/32 ShieldPPPs-PT-050A-LTLFireability-12 1268139 m, 30517 m/sec, 7886776 t fired, .

Time elapsed: 71 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-050A-LTLFireability-02: LTL false LTL model checker
ShieldPPPs-PT-050A-LTLFireability-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-050A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-050A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 50/1191 29/32 ShieldPPPs-PT-050A-LTLFireability-12 1404332 m, 27238 m/sec, 8774670 t fired, .

Time elapsed: 76 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-050A-LTLFireability-02: LTL false LTL model checker
ShieldPPPs-PT-050A-LTLFireability-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-050A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-050A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 55/1191 32/32 ShieldPPPs-PT-050A-LTLFireability-12 1534613 m, 26056 m/sec, 9663126 t fired, .

Time elapsed: 81 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: CANCELED task # 13 (type EXCL) for ShieldPPPs-PT-050A-LTLFireability-12 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-050A-LTLFireability-02: LTL false LTL model checker
ShieldPPPs-PT-050A-LTLFireability-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-050A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-050A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 86 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: LAUNCH task # 10 (type EXCL) for 9 ShieldPPPs-PT-050A-LTLFireability-11
lola: time limit : 1757 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-050A-LTLFireability-02: LTL false LTL model checker
ShieldPPPs-PT-050A-LTLFireability-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-050A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-050A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 5/1757 4/32 ShieldPPPs-PT-050A-LTLFireability-11 238189 m, 47637 m/sec, 819571 t fired, .

Time elapsed: 91 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-050A-LTLFireability-02: LTL false LTL model checker
ShieldPPPs-PT-050A-LTLFireability-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-050A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-050A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 10/1757 8/32 ShieldPPPs-PT-050A-LTLFireability-11 495538 m, 51469 m/sec, 1690881 t fired, .

Time elapsed: 96 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-050A-LTLFireability-02: LTL false LTL model checker
ShieldPPPs-PT-050A-LTLFireability-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-050A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-050A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 15/1757 12/32 ShieldPPPs-PT-050A-LTLFireability-11 754616 m, 51815 m/sec, 2563603 t fired, .

Time elapsed: 101 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-050A-LTLFireability-02: LTL false LTL model checker
ShieldPPPs-PT-050A-LTLFireability-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-050A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-050A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 20/1757 16/32 ShieldPPPs-PT-050A-LTLFireability-11 998327 m, 48742 m/sec, 3424501 t fired, .

Time elapsed: 106 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-050A-LTLFireability-02: LTL false LTL model checker
ShieldPPPs-PT-050A-LTLFireability-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-050A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-050A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 25/1757 20/32 ShieldPPPs-PT-050A-LTLFireability-11 1249165 m, 50167 m/sec, 4290386 t fired, .

Time elapsed: 111 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-050A-LTLFireability-02: LTL false LTL model checker
ShieldPPPs-PT-050A-LTLFireability-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-050A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-050A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 30/1757 24/32 ShieldPPPs-PT-050A-LTLFireability-11 1503112 m, 50789 m/sec, 5163873 t fired, .

Time elapsed: 116 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-050A-LTLFireability-02: LTL false LTL model checker
ShieldPPPs-PT-050A-LTLFireability-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-050A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-050A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 35/1757 28/32 ShieldPPPs-PT-050A-LTLFireability-11 1785760 m, 56529 m/sec, 6019921 t fired, .

Time elapsed: 121 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: CANCELED task # 10 (type EXCL) for ShieldPPPs-PT-050A-LTLFireability-11 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-050A-LTLFireability-02: LTL false LTL model checker
ShieldPPPs-PT-050A-LTLFireability-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-050A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-050A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-050A-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 126 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: LAUNCH task # 7 (type EXCL) for 6 ShieldPPPs-PT-050A-LTLFireability-08
lola: time limit : 3474 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-050A-LTLFireability-02: LTL false LTL model checker
ShieldPPPs-PT-050A-LTLFireability-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-050A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-050A-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-050A-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/3474 7/32 ShieldPPPs-PT-050A-LTLFireability-08 366848 m, 73369 m/sec, 606164 t fired, .

Time elapsed: 131 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-050A-LTLFireability-02: LTL false LTL model checker
ShieldPPPs-PT-050A-LTLFireability-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-050A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-050A-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-050A-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 10/3474 15/32 ShieldPPPs-PT-050A-LTLFireability-08 743543 m, 75339 m/sec, 1220182 t fired, .

Time elapsed: 136 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-050A-LTLFireability-02: LTL false LTL model checker
ShieldPPPs-PT-050A-LTLFireability-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-050A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-050A-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-050A-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 15/3474 22/32 ShieldPPPs-PT-050A-LTLFireability-08 1121601 m, 75611 m/sec, 1829427 t fired, .

Time elapsed: 141 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-050A-LTLFireability-02: LTL false LTL model checker
ShieldPPPs-PT-050A-LTLFireability-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-050A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-050A-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-050A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-050A-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 20/3474 29/32 ShieldPPPs-PT-050A-LTLFireability-08 1493162 m, 74312 m/sec, 2435116 t fired, .

Time elapsed: 146 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: CANCELED task # 7 (type EXCL) for ShieldPPPs-PT-050A-LTLFireability-08 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-050A-LTLFireability-02: LTL false LTL model checker
ShieldPPPs-PT-050A-LTLFireability-15: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-050A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-050A-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-050A-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-050A-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 151 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: Portfolio finished: no open tasks 6

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-050A-LTLFireability-02: LTL false LTL model checker
ShieldPPPs-PT-050A-LTLFireability-05: LTL unknown AGGR
ShieldPPPs-PT-050A-LTLFireability-08: LTL unknown AGGR
ShieldPPPs-PT-050A-LTLFireability-11: LTL unknown AGGR
ShieldPPPs-PT-050A-LTLFireability-12: LTL unknown AGGR
ShieldPPPs-PT-050A-LTLFireability-15: LTL false LTL model checker


Time elapsed: 151 secs. Pages in use: 32

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="ShieldPPPs-PT-050A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is ShieldPPPs-PT-050A, 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 r391-oct2-167903715400500"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-050A.tgz
mv ShieldPPPs-PT-050A execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;