Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r423-tajo-167905976300156.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is ShieldRVs-PT-050B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r423-tajo-167905976300156
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.9K Feb 26 18:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 26 18:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 18:23 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.5K Feb 25 17:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 18:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 26 18:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 18:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 18:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:03 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 625K 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 ShieldRVs-PT-050B-LTLFireability-00
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-01
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-02
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-03
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-04
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-05
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-06
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-07
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-08
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-09
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-10
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-11
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-12
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-13
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-14
FORMULA_NAME ShieldRVs-PT-050B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679243159057

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=ShieldRVs-PT-050B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 16:26:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 16:26:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 16:26:00] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2023-03-19 16:26:00] [INFO ] Transformed 2003 places.
[2023-03-19 16:26:00] [INFO ] Transformed 2253 transitions.
[2023-03-19 16:26:00] [INFO ] Found NUPN structural information;
[2023-03-19 16:26:00] [INFO ] Parsed PT model containing 2003 places and 2253 transitions and 7200 arcs in 215 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldRVs-PT-050B-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050B-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050B-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050B-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 2003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2003/2003 places, 2253/2253 transitions.
Discarding 339 places :
Symmetric choice reduction at 0 with 339 rule applications. Total rules 339 place count 1664 transition count 1914
Iterating global reduction 0 with 339 rules applied. Total rules applied 678 place count 1664 transition count 1914
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 679 place count 1663 transition count 1913
Iterating global reduction 0 with 1 rules applied. Total rules applied 680 place count 1663 transition count 1913
Applied a total of 680 rules in 383 ms. Remains 1663 /2003 variables (removed 340) and now considering 1913/2253 (removed 340) transitions.
// Phase 1: matrix 1913 rows 1663 cols
[2023-03-19 16:26:01] [INFO ] Computed 201 place invariants in 48 ms
[2023-03-19 16:26:01] [INFO ] Implicit Places using invariants in 643 ms returned []
[2023-03-19 16:26:01] [INFO ] Invariant cache hit.
[2023-03-19 16:26:03] [INFO ] Implicit Places using invariants and state equation in 1652 ms returned []
Implicit Place search using SMT with State Equation took 2322 ms to find 0 implicit places.
[2023-03-19 16:26:03] [INFO ] Invariant cache hit.
[2023-03-19 16:26:04] [INFO ] Dead Transitions using invariants and state equation in 943 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1663/2003 places, 1913/2253 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3650 ms. Remains : 1663/2003 places, 1913/2253 transitions.
Support contains 46 out of 1663 places after structural reductions.
[2023-03-19 16:26:04] [INFO ] Flatten gal took : 149 ms
[2023-03-19 16:26:04] [INFO ] Flatten gal took : 90 ms
[2023-03-19 16:26:05] [INFO ] Input system was already deterministic with 1913 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 497 ms. (steps per millisecond=20 ) properties (out of 28) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-19 16:26:05] [INFO ] Invariant cache hit.
[2023-03-19 16:26:06] [INFO ] [Real]Absence check using 201 positive place invariants in 62 ms returned sat
[2023-03-19 16:26:06] [INFO ] After 512ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-19 16:26:06] [INFO ] [Nat]Absence check using 201 positive place invariants in 61 ms returned sat
[2023-03-19 16:26:09] [INFO ] After 1955ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-19 16:26:09] [INFO ] Deduced a trap composed of 22 places in 431 ms of which 8 ms to minimize.
[2023-03-19 16:26:10] [INFO ] Deduced a trap composed of 15 places in 445 ms of which 2 ms to minimize.
[2023-03-19 16:26:10] [INFO ] Deduced a trap composed of 29 places in 429 ms of which 1 ms to minimize.
[2023-03-19 16:26:11] [INFO ] Deduced a trap composed of 37 places in 371 ms of which 1 ms to minimize.
[2023-03-19 16:26:11] [INFO ] Deduced a trap composed of 29 places in 410 ms of which 14 ms to minimize.
[2023-03-19 16:26:11] [INFO ] Deduced a trap composed of 43 places in 241 ms of which 0 ms to minimize.
[2023-03-19 16:26:12] [INFO ] Deduced a trap composed of 45 places in 256 ms of which 2 ms to minimize.
[2023-03-19 16:26:12] [INFO ] Deduced a trap composed of 37 places in 216 ms of which 1 ms to minimize.
[2023-03-19 16:26:12] [INFO ] Deduced a trap composed of 52 places in 180 ms of which 0 ms to minimize.
[2023-03-19 16:26:13] [INFO ] Deduced a trap composed of 51 places in 177 ms of which 0 ms to minimize.
[2023-03-19 16:26:13] [INFO ] Deduced a trap composed of 47 places in 198 ms of which 1 ms to minimize.
[2023-03-19 16:26:13] [INFO ] Deduced a trap composed of 54 places in 227 ms of which 2 ms to minimize.
[2023-03-19 16:26:13] [INFO ] Deduced a trap composed of 55 places in 190 ms of which 1 ms to minimize.
[2023-03-19 16:26:14] [INFO ] Deduced a trap composed of 61 places in 228 ms of which 0 ms to minimize.
[2023-03-19 16:26:14] [INFO ] Deduced a trap composed of 57 places in 207 ms of which 2 ms to minimize.
[2023-03-19 16:26:14] [INFO ] Deduced a trap composed of 56 places in 204 ms of which 1 ms to minimize.
[2023-03-19 16:26:14] [INFO ] Deduced a trap composed of 74 places in 218 ms of which 1 ms to minimize.
[2023-03-19 16:26:15] [INFO ] Deduced a trap composed of 70 places in 219 ms of which 1 ms to minimize.
[2023-03-19 16:26:15] [INFO ] Deduced a trap composed of 69 places in 218 ms of which 1 ms to minimize.
[2023-03-19 16:26:15] [INFO ] Deduced a trap composed of 72 places in 227 ms of which 1 ms to minimize.
[2023-03-19 16:26:16] [INFO ] Deduced a trap composed of 62 places in 235 ms of which 0 ms to minimize.
[2023-03-19 16:26:16] [INFO ] Deduced a trap composed of 59 places in 190 ms of which 1 ms to minimize.
[2023-03-19 16:26:16] [INFO ] Deduced a trap composed of 63 places in 213 ms of which 0 ms to minimize.
[2023-03-19 16:26:16] [INFO ] Deduced a trap composed of 59 places in 210 ms of which 0 ms to minimize.
[2023-03-19 16:26:17] [INFO ] Deduced a trap composed of 60 places in 224 ms of which 0 ms to minimize.
[2023-03-19 16:26:17] [INFO ] Deduced a trap composed of 57 places in 248 ms of which 0 ms to minimize.
[2023-03-19 16:26:17] [INFO ] Deduced a trap composed of 54 places in 205 ms of which 1 ms to minimize.
[2023-03-19 16:26:17] [INFO ] Deduced a trap composed of 59 places in 186 ms of which 1 ms to minimize.
[2023-03-19 16:26:18] [INFO ] Deduced a trap composed of 57 places in 206 ms of which 1 ms to minimize.
[2023-03-19 16:26:18] [INFO ] Deduced a trap composed of 55 places in 195 ms of which 0 ms to minimize.
[2023-03-19 16:26:18] [INFO ] Deduced a trap composed of 73 places in 212 ms of which 1 ms to minimize.
[2023-03-19 16:26:19] [INFO ] Deduced a trap composed of 59 places in 200 ms of which 1 ms to minimize.
[2023-03-19 16:26:19] [INFO ] Deduced a trap composed of 64 places in 192 ms of which 1 ms to minimize.
[2023-03-19 16:26:19] [INFO ] Deduced a trap composed of 83 places in 184 ms of which 1 ms to minimize.
[2023-03-19 16:26:19] [INFO ] Deduced a trap composed of 89 places in 192 ms of which 1 ms to minimize.
[2023-03-19 16:26:20] [INFO ] Deduced a trap composed of 80 places in 167 ms of which 0 ms to minimize.
[2023-03-19 16:26:20] [INFO ] Deduced a trap composed of 68 places in 166 ms of which 1 ms to minimize.
[2023-03-19 16:26:20] [INFO ] Deduced a trap composed of 65 places in 180 ms of which 0 ms to minimize.
[2023-03-19 16:26:20] [INFO ] Deduced a trap composed of 74 places in 155 ms of which 0 ms to minimize.
[2023-03-19 16:26:20] [INFO ] Deduced a trap composed of 72 places in 164 ms of which 1 ms to minimize.
[2023-03-19 16:26:21] [INFO ] Deduced a trap composed of 75 places in 162 ms of which 1 ms to minimize.
[2023-03-19 16:26:21] [INFO ] Deduced a trap composed of 78 places in 168 ms of which 0 ms to minimize.
[2023-03-19 16:26:21] [INFO ] Deduced a trap composed of 67 places in 151 ms of which 1 ms to minimize.
[2023-03-19 16:26:21] [INFO ] Deduced a trap composed of 71 places in 144 ms of which 1 ms to minimize.
[2023-03-19 16:26:21] [INFO ] Trap strengthening (SAT) tested/added 45/44 trap constraints in 12708 ms
[2023-03-19 16:26:22] [INFO ] Deduced a trap composed of 49 places in 129 ms of which 1 ms to minimize.
[2023-03-19 16:26:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 270 ms
[2023-03-19 16:26:22] [INFO ] Deduced a trap composed of 62 places in 168 ms of which 1 ms to minimize.
[2023-03-19 16:26:22] [INFO ] Deduced a trap composed of 66 places in 129 ms of which 0 ms to minimize.
[2023-03-19 16:26:22] [INFO ] Deduced a trap composed of 65 places in 169 ms of which 0 ms to minimize.
[2023-03-19 16:26:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 724 ms
[2023-03-19 16:26:23] [INFO ] Deduced a trap composed of 67 places in 173 ms of which 0 ms to minimize.
[2023-03-19 16:26:23] [INFO ] Deduced a trap composed of 75 places in 173 ms of which 0 ms to minimize.
[2023-03-19 16:26:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 570 ms
[2023-03-19 16:26:23] [INFO ] Deduced a trap composed of 37 places in 197 ms of which 2 ms to minimize.
[2023-03-19 16:26:24] [INFO ] Deduced a trap composed of 32 places in 184 ms of which 0 ms to minimize.
[2023-03-19 16:26:24] [INFO ] Deduced a trap composed of 39 places in 210 ms of which 0 ms to minimize.
[2023-03-19 16:26:24] [INFO ] Deduced a trap composed of 45 places in 196 ms of which 1 ms to minimize.
[2023-03-19 16:26:24] [INFO ] Deduced a trap composed of 42 places in 207 ms of which 1 ms to minimize.
[2023-03-19 16:26:25] [INFO ] Deduced a trap composed of 32 places in 181 ms of which 4 ms to minimize.
[2023-03-19 16:26:25] [INFO ] Deduced a trap composed of 22 places in 184 ms of which 1 ms to minimize.
[2023-03-19 16:26:25] [INFO ] Deduced a trap composed of 30 places in 182 ms of which 0 ms to minimize.
[2023-03-19 16:26:25] [INFO ] Deduced a trap composed of 30 places in 192 ms of which 0 ms to minimize.
[2023-03-19 16:26:26] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2376 ms
[2023-03-19 16:26:26] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 0 ms to minimize.
[2023-03-19 16:26:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 313 ms
[2023-03-19 16:26:26] [INFO ] Deduced a trap composed of 18 places in 185 ms of which 1 ms to minimize.
[2023-03-19 16:26:27] [INFO ] Deduced a trap composed of 16 places in 170 ms of which 1 ms to minimize.
[2023-03-19 16:26:27] [INFO ] Deduced a trap composed of 22 places in 160 ms of which 0 ms to minimize.
[2023-03-19 16:26:27] [INFO ] Deduced a trap composed of 26 places in 166 ms of which 1 ms to minimize.
[2023-03-19 16:26:27] [INFO ] Deduced a trap composed of 22 places in 179 ms of which 1 ms to minimize.
[2023-03-19 16:26:27] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 1 ms to minimize.
[2023-03-19 16:26:28] [INFO ] Deduced a trap composed of 35 places in 151 ms of which 1 ms to minimize.
[2023-03-19 16:26:28] [INFO ] Deduced a trap composed of 46 places in 162 ms of which 1 ms to minimize.
[2023-03-19 16:26:28] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 1 ms to minimize.
[2023-03-19 16:26:28] [INFO ] Deduced a trap composed of 34 places in 141 ms of which 0 ms to minimize.
[2023-03-19 16:26:29] [INFO ] Deduced a trap composed of 30 places in 164 ms of which 0 ms to minimize.
[2023-03-19 16:26:29] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2572 ms
[2023-03-19 16:26:29] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 1 ms to minimize.
[2023-03-19 16:26:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 271 ms
[2023-03-19 16:26:29] [INFO ] Deduced a trap composed of 24 places in 222 ms of which 1 ms to minimize.
[2023-03-19 16:26:30] [INFO ] Deduced a trap composed of 51 places in 191 ms of which 0 ms to minimize.
[2023-03-19 16:26:30] [INFO ] Deduced a trap composed of 58 places in 189 ms of which 1 ms to minimize.
[2023-03-19 16:26:30] [INFO ] Deduced a trap composed of 58 places in 185 ms of which 0 ms to minimize.
[2023-03-19 16:26:30] [INFO ] Deduced a trap composed of 59 places in 205 ms of which 1 ms to minimize.
[2023-03-19 16:26:31] [INFO ] Deduced a trap composed of 55 places in 189 ms of which 0 ms to minimize.
[2023-03-19 16:26:31] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1689 ms
[2023-03-19 16:26:31] [INFO ] Deduced a trap composed of 33 places in 181 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 16:26:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 16:26:31] [INFO ] After 25061ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Parikh walk visited 0 properties in 805 ms.
Support contains 21 out of 1663 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1663/1663 places, 1913/1913 transitions.
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 1663 transition count 1714
Reduce places removed 199 places and 0 transitions.
Iterating post reduction 1 with 199 rules applied. Total rules applied 398 place count 1464 transition count 1714
Performed 249 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 249 Pre rules applied. Total rules applied 398 place count 1464 transition count 1465
Deduced a syphon composed of 249 places in 3 ms
Reduce places removed 249 places and 0 transitions.
Iterating global reduction 2 with 498 rules applied. Total rules applied 896 place count 1215 transition count 1465
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 902 place count 1209 transition count 1459
Iterating global reduction 2 with 6 rules applied. Total rules applied 908 place count 1209 transition count 1459
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 908 place count 1209 transition count 1458
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 910 place count 1208 transition count 1458
Performed 493 Post agglomeration using F-continuation condition.Transition count delta: 493
Deduced a syphon composed of 493 places in 1 ms
Reduce places removed 493 places and 0 transitions.
Iterating global reduction 2 with 986 rules applied. Total rules applied 1896 place count 715 transition count 965
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 2 with 99 rules applied. Total rules applied 1995 place count 715 transition count 965
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1996 place count 714 transition count 964
Applied a total of 1996 rules in 444 ms. Remains 714 /1663 variables (removed 949) and now considering 964/1913 (removed 949) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 445 ms. Remains : 714/1663 places, 964/1913 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 10) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :1
Finished Best-First random walk after 9890 steps, including 2 resets, run visited all 1 properties in 27 ms. (steps per millisecond=366 )
FORMULA ShieldRVs-PT-050B-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 404 stabilizing places and 404 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(((X(p0) U p1)&&X(p0)))&&X(p2))))'
Support contains 5 out of 1663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1663/1663 places, 1913/1913 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1654 transition count 1904
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1654 transition count 1904
Applied a total of 18 rules in 113 ms. Remains 1654 /1663 variables (removed 9) and now considering 1904/1913 (removed 9) transitions.
// Phase 1: matrix 1904 rows 1654 cols
[2023-03-19 16:26:33] [INFO ] Computed 201 place invariants in 15 ms
[2023-03-19 16:26:33] [INFO ] Implicit Places using invariants in 490 ms returned []
[2023-03-19 16:26:33] [INFO ] Invariant cache hit.
[2023-03-19 16:26:35] [INFO ] Implicit Places using invariants and state equation in 1515 ms returned []
Implicit Place search using SMT with State Equation took 2008 ms to find 0 implicit places.
[2023-03-19 16:26:35] [INFO ] Invariant cache hit.
[2023-03-19 16:26:36] [INFO ] Dead Transitions using invariants and state equation in 968 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1654/1663 places, 1904/1913 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3091 ms. Remains : 1654/1663 places, 1904/1913 transitions.
Stuttering acceptance computed with spot in 287 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}, { cond=true, acceptance={} source=0 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={0} source=4 dest: 2}, { cond=(NOT p1), acceptance={0} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s1602 1), p2:(AND (EQ s840 1) (EQ s849 1) (EQ s870 1) (EQ s1602 0)), p0:(EQ s903 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2145 steps with 0 reset in 29 ms.
FORMULA ShieldRVs-PT-050B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050B-LTLFireability-00 finished in 3471 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 1663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1663/1663 places, 1913/1913 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 1662 transition count 1711
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1461 transition count 1711
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 402 place count 1461 transition count 1461
Deduced a syphon composed of 250 places in 3 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 902 place count 1211 transition count 1461
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 913 place count 1200 transition count 1450
Iterating global reduction 2 with 11 rules applied. Total rules applied 924 place count 1200 transition count 1450
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 924 place count 1200 transition count 1448
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 928 place count 1198 transition count 1448
Performed 494 Post agglomeration using F-continuation condition.Transition count delta: 494
Deduced a syphon composed of 494 places in 1 ms
Reduce places removed 494 places and 0 transitions.
Iterating global reduction 2 with 988 rules applied. Total rules applied 1916 place count 704 transition count 954
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1918 place count 702 transition count 952
Applied a total of 1918 rules in 280 ms. Remains 702 /1663 variables (removed 961) and now considering 952/1913 (removed 961) transitions.
// Phase 1: matrix 952 rows 702 cols
[2023-03-19 16:26:37] [INFO ] Computed 201 place invariants in 4 ms
[2023-03-19 16:26:37] [INFO ] Implicit Places using invariants in 308 ms returned []
[2023-03-19 16:26:37] [INFO ] Invariant cache hit.
[2023-03-19 16:26:37] [INFO ] Implicit Places using invariants and state equation in 609 ms returned []
Implicit Place search using SMT with State Equation took 919 ms to find 0 implicit places.
[2023-03-19 16:26:38] [INFO ] Redundant transitions in 177 ms returned [951]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 951 rows 702 cols
[2023-03-19 16:26:38] [INFO ] Computed 201 place invariants in 3 ms
[2023-03-19 16:26:38] [INFO ] Dead Transitions using invariants and state equation in 432 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 702/1663 places, 951/1913 transitions.
Applied a total of 0 rules in 22 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1838 ms. Remains : 702/1663 places, 951/1913 transitions.
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s370 1), p1:(OR (EQ s325 0) (EQ s341 0) (EQ s352 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 150 reset in 527 ms.
Product exploration explored 100000 steps with 150 reset in 622 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 290 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 16:26:40] [INFO ] Invariant cache hit.
[2023-03-19 16:26:40] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 16:26:40] [INFO ] [Nat]Absence check using 201 positive place invariants in 26 ms returned sat
[2023-03-19 16:26:40] [INFO ] After 275ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 16:26:40] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 0 ms to minimize.
[2023-03-19 16:26:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-03-19 16:26:40] [INFO ] After 384ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-19 16:26:40] [INFO ] After 537ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 951/951 transitions.
Partial Free-agglomeration rule applied 101 times.
Drop transitions removed 101 transitions
Iterating global reduction 0 with 101 rules applied. Total rules applied 101 place count 702 transition count 951
Applied a total of 101 rules in 42 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 702/702 places, 951/951 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 210446 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :{}
Probabilistic random walk after 210446 steps, saw 93869 distinct states, run finished after 3002 ms. (steps per millisecond=70 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 951 rows 702 cols
[2023-03-19 16:26:44] [INFO ] Computed 201 place invariants in 6 ms
[2023-03-19 16:26:44] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 16:26:44] [INFO ] [Nat]Absence check using 201 positive place invariants in 30 ms returned sat
[2023-03-19 16:26:44] [INFO ] After 328ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 16:26:44] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 0 ms to minimize.
[2023-03-19 16:26:44] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2023-03-19 16:26:44] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2023-03-19 16:26:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 240 ms
[2023-03-19 16:26:44] [INFO ] After 587ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-19 16:26:44] [INFO ] After 738ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 30 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 702/702 places, 951/951 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 35 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
[2023-03-19 16:26:45] [INFO ] Invariant cache hit.
[2023-03-19 16:26:45] [INFO ] Implicit Places using invariants in 346 ms returned []
[2023-03-19 16:26:45] [INFO ] Invariant cache hit.
[2023-03-19 16:26:46] [INFO ] Implicit Places using invariants and state equation in 682 ms returned []
Implicit Place search using SMT with State Equation took 1034 ms to find 0 implicit places.
[2023-03-19 16:26:46] [INFO ] Redundant transitions in 53 ms returned []
[2023-03-19 16:26:46] [INFO ] Invariant cache hit.
[2023-03-19 16:26:46] [INFO ] Dead Transitions using invariants and state equation in 438 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1570 ms. Remains : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 27 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-19 16:26:46] [INFO ] Invariant cache hit.
[2023-03-19 16:26:46] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 16:26:46] [INFO ] [Nat]Absence check using 201 positive place invariants in 22 ms returned sat
[2023-03-19 16:26:46] [INFO ] After 211ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 16:26:47] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2023-03-19 16:26:47] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2023-03-19 16:26:47] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 0 ms to minimize.
[2023-03-19 16:26:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 252 ms
[2023-03-19 16:26:47] [INFO ] After 492ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-19 16:26:47] [INFO ] After 639ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 505 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p1))]
Support contains 4 out of 702 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 28 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
// Phase 1: matrix 951 rows 702 cols
[2023-03-19 16:26:47] [INFO ] Computed 201 place invariants in 12 ms
[2023-03-19 16:26:48] [INFO ] Implicit Places using invariants in 340 ms returned []
[2023-03-19 16:26:48] [INFO ] Invariant cache hit.
[2023-03-19 16:26:48] [INFO ] Implicit Places using invariants and state equation in 697 ms returned []
Implicit Place search using SMT with State Equation took 1038 ms to find 0 implicit places.
[2023-03-19 16:26:49] [INFO ] Redundant transitions in 142 ms returned []
[2023-03-19 16:26:49] [INFO ] Invariant cache hit.
[2023-03-19 16:26:49] [INFO ] Dead Transitions using invariants and state equation in 344 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1559 ms. Remains : 702/702 places, 951/951 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 242 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 16:26:49] [INFO ] Invariant cache hit.
[2023-03-19 16:26:49] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 16:26:50] [INFO ] [Nat]Absence check using 201 positive place invariants in 25 ms returned sat
[2023-03-19 16:26:50] [INFO ] After 303ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 16:26:50] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2023-03-19 16:26:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-03-19 16:26:50] [INFO ] After 421ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-19 16:26:50] [INFO ] After 567ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 951/951 transitions.
Partial Free-agglomeration rule applied 101 times.
Drop transitions removed 101 transitions
Iterating global reduction 0 with 101 rules applied. Total rules applied 101 place count 702 transition count 951
Applied a total of 101 rules in 85 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 702/702 places, 951/951 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 206578 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 206578 steps, saw 93156 distinct states, run finished after 3002 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 951 rows 702 cols
[2023-03-19 16:26:53] [INFO ] Computed 201 place invariants in 10 ms
[2023-03-19 16:26:53] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 16:26:53] [INFO ] [Nat]Absence check using 201 positive place invariants in 30 ms returned sat
[2023-03-19 16:26:54] [INFO ] After 335ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 16:26:54] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 0 ms to minimize.
[2023-03-19 16:26:54] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 0 ms to minimize.
[2023-03-19 16:26:54] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 0 ms to minimize.
[2023-03-19 16:26:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 298 ms
[2023-03-19 16:26:54] [INFO ] After 656ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-19 16:26:54] [INFO ] After 820ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 27 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 702/702 places, 951/951 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 26 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
[2023-03-19 16:26:54] [INFO ] Invariant cache hit.
[2023-03-19 16:26:55] [INFO ] Implicit Places using invariants in 375 ms returned []
[2023-03-19 16:26:55] [INFO ] Invariant cache hit.
[2023-03-19 16:26:55] [INFO ] Implicit Places using invariants and state equation in 726 ms returned []
Implicit Place search using SMT with State Equation took 1127 ms to find 0 implicit places.
[2023-03-19 16:26:55] [INFO ] Redundant transitions in 69 ms returned []
[2023-03-19 16:26:55] [INFO ] Invariant cache hit.
[2023-03-19 16:26:56] [INFO ] Dead Transitions using invariants and state equation in 361 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1589 ms. Remains : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 18 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-19 16:26:56] [INFO ] Invariant cache hit.
[2023-03-19 16:26:56] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 16:26:56] [INFO ] [Nat]Absence check using 201 positive place invariants in 29 ms returned sat
[2023-03-19 16:26:56] [INFO ] After 247ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 16:26:56] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2023-03-19 16:26:56] [INFO ] Deduced a trap composed of 11 places in 17 ms of which 0 ms to minimize.
[2023-03-19 16:26:56] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2023-03-19 16:26:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 177 ms
[2023-03-19 16:26:56] [INFO ] After 443ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-19 16:26:56] [INFO ] After 582ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 354 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 150 reset in 624 ms.
Product exploration explored 100000 steps with 151 reset in 746 ms.
Support contains 4 out of 702 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 702/702 places, 951/951 transitions.
Applied a total of 0 rules in 23 ms. Remains 702 /702 variables (removed 0) and now considering 951/951 (removed 0) transitions.
// Phase 1: matrix 951 rows 702 cols
[2023-03-19 16:26:58] [INFO ] Computed 201 place invariants in 6 ms
[2023-03-19 16:26:59] [INFO ] Implicit Places using invariants in 317 ms returned []
[2023-03-19 16:26:59] [INFO ] Invariant cache hit.
[2023-03-19 16:26:59] [INFO ] Implicit Places using invariants and state equation in 644 ms returned []
Implicit Place search using SMT with State Equation took 962 ms to find 0 implicit places.
[2023-03-19 16:26:59] [INFO ] Redundant transitions in 142 ms returned []
[2023-03-19 16:26:59] [INFO ] Invariant cache hit.
[2023-03-19 16:27:00] [INFO ] Dead Transitions using invariants and state equation in 356 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1489 ms. Remains : 702/702 places, 951/951 transitions.
Treatment of property ShieldRVs-PT-050B-LTLFireability-01 finished in 23640 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((G(p0)||X((p1||X(p2))))))'
Support contains 5 out of 1663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1663/1663 places, 1913/1913 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1653 transition count 1903
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1653 transition count 1903
Applied a total of 20 rules in 93 ms. Remains 1653 /1663 variables (removed 10) and now considering 1903/1913 (removed 10) transitions.
// Phase 1: matrix 1903 rows 1653 cols
[2023-03-19 16:27:00] [INFO ] Computed 201 place invariants in 8 ms
[2023-03-19 16:27:00] [INFO ] Implicit Places using invariants in 397 ms returned []
[2023-03-19 16:27:00] [INFO ] Invariant cache hit.
[2023-03-19 16:27:02] [INFO ] Implicit Places using invariants and state equation in 1389 ms returned []
Implicit Place search using SMT with State Equation took 1788 ms to find 0 implicit places.
[2023-03-19 16:27:02] [INFO ] Invariant cache hit.
[2023-03-19 16:27:03] [INFO ] Dead Transitions using invariants and state equation in 721 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1653/1663 places, 1903/1913 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2604 ms. Remains : 1653/1663 places, 1903/1913 transitions.
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), true, (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s1005 0), p1:(EQ s199 0), p2:(OR (EQ s1152 0) (EQ s1155 0) (EQ s1163 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, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33363 reset in 838 ms.
Product exploration explored 100000 steps with 33235 reset in 821 ms.
Computed a total of 399 stabilizing places and 399 stable transitions
Computed a total of 399 stabilizing places and 399 stable transitions
Detected a total of 399/1653 stabilizing places and 399/1903 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 431 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), true, (AND (NOT p0) (NOT p2)), (NOT p0)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 16:27:05] [INFO ] Invariant cache hit.
[2023-03-19 16:27:05] [INFO ] After 201ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 16:27:06] [INFO ] [Nat]Absence check using 201 positive place invariants in 74 ms returned sat
[2023-03-19 16:27:07] [INFO ] After 837ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 16:27:07] [INFO ] Deduced a trap composed of 25 places in 464 ms of which 1 ms to minimize.
[2023-03-19 16:27:08] [INFO ] Deduced a trap composed of 29 places in 439 ms of which 1 ms to minimize.
[2023-03-19 16:27:08] [INFO ] Deduced a trap composed of 25 places in 425 ms of which 1 ms to minimize.
[2023-03-19 16:27:09] [INFO ] Deduced a trap composed of 35 places in 433 ms of which 1 ms to minimize.
[2023-03-19 16:27:09] [INFO ] Deduced a trap composed of 23 places in 393 ms of which 1 ms to minimize.
[2023-03-19 16:27:09] [INFO ] Deduced a trap composed of 27 places in 321 ms of which 0 ms to minimize.
[2023-03-19 16:27:10] [INFO ] Deduced a trap composed of 31 places in 332 ms of which 1 ms to minimize.
[2023-03-19 16:27:10] [INFO ] Deduced a trap composed of 54 places in 341 ms of which 1 ms to minimize.
[2023-03-19 16:27:11] [INFO ] Deduced a trap composed of 39 places in 325 ms of which 1 ms to minimize.
[2023-03-19 16:27:11] [INFO ] Deduced a trap composed of 30 places in 272 ms of which 1 ms to minimize.
[2023-03-19 16:27:11] [INFO ] Deduced a trap composed of 28 places in 265 ms of which 1 ms to minimize.
[2023-03-19 16:27:12] [INFO ] Deduced a trap composed of 22 places in 368 ms of which 0 ms to minimize.
[2023-03-19 16:27:12] [INFO ] Deduced a trap composed of 27 places in 279 ms of which 1 ms to minimize.
[2023-03-19 16:27:12] [INFO ] Deduced a trap composed of 32 places in 348 ms of which 0 ms to minimize.
[2023-03-19 16:27:13] [INFO ] Deduced a trap composed of 29 places in 417 ms of which 1 ms to minimize.
[2023-03-19 16:27:13] [INFO ] Deduced a trap composed of 33 places in 332 ms of which 0 ms to minimize.
[2023-03-19 16:27:13] [INFO ] Deduced a trap composed of 37 places in 304 ms of which 1 ms to minimize.
[2023-03-19 16:27:14] [INFO ] Deduced a trap composed of 26 places in 316 ms of which 1 ms to minimize.
[2023-03-19 16:27:14] [INFO ] Deduced a trap composed of 24 places in 383 ms of which 1 ms to minimize.
[2023-03-19 16:27:15] [INFO ] Deduced a trap composed of 29 places in 375 ms of which 1 ms to minimize.
[2023-03-19 16:27:15] [INFO ] Deduced a trap composed of 26 places in 384 ms of which 1 ms to minimize.
[2023-03-19 16:27:16] [INFO ] Deduced a trap composed of 31 places in 387 ms of which 1 ms to minimize.
[2023-03-19 16:27:16] [INFO ] Deduced a trap composed of 43 places in 341 ms of which 1 ms to minimize.
[2023-03-19 16:27:16] [INFO ] Deduced a trap composed of 55 places in 365 ms of which 1 ms to minimize.
[2023-03-19 16:27:17] [INFO ] Deduced a trap composed of 35 places in 365 ms of which 1 ms to minimize.
[2023-03-19 16:27:17] [INFO ] Deduced a trap composed of 34 places in 324 ms of which 1 ms to minimize.
[2023-03-19 16:27:18] [INFO ] Deduced a trap composed of 42 places in 355 ms of which 1 ms to minimize.
[2023-03-19 16:27:18] [INFO ] Deduced a trap composed of 57 places in 280 ms of which 1 ms to minimize.
[2023-03-19 16:27:18] [INFO ] Deduced a trap composed of 56 places in 329 ms of which 1 ms to minimize.
[2023-03-19 16:27:19] [INFO ] Deduced a trap composed of 50 places in 249 ms of which 1 ms to minimize.
[2023-03-19 16:27:19] [INFO ] Deduced a trap composed of 44 places in 241 ms of which 1 ms to minimize.
[2023-03-19 16:27:19] [INFO ] Deduced a trap composed of 48 places in 222 ms of which 0 ms to minimize.
[2023-03-19 16:27:20] [INFO ] Deduced a trap composed of 53 places in 252 ms of which 1 ms to minimize.
[2023-03-19 16:27:20] [INFO ] Deduced a trap composed of 46 places in 218 ms of which 1 ms to minimize.
[2023-03-19 16:27:20] [INFO ] Deduced a trap composed of 49 places in 256 ms of which 0 ms to minimize.
[2023-03-19 16:27:20] [INFO ] Deduced a trap composed of 42 places in 273 ms of which 1 ms to minimize.
[2023-03-19 16:27:21] [INFO ] Deduced a trap composed of 63 places in 282 ms of which 1 ms to minimize.
[2023-03-19 16:27:21] [INFO ] Deduced a trap composed of 53 places in 216 ms of which 0 ms to minimize.
[2023-03-19 16:27:21] [INFO ] Deduced a trap composed of 47 places in 232 ms of which 1 ms to minimize.
[2023-03-19 16:27:22] [INFO ] Deduced a trap composed of 54 places in 278 ms of which 1 ms to minimize.
[2023-03-19 16:27:22] [INFO ] Deduced a trap composed of 43 places in 270 ms of which 1 ms to minimize.
[2023-03-19 16:27:22] [INFO ] Deduced a trap composed of 63 places in 279 ms of which 1 ms to minimize.
[2023-03-19 16:27:23] [INFO ] Deduced a trap composed of 57 places in 296 ms of which 1 ms to minimize.
[2023-03-19 16:27:23] [INFO ] Deduced a trap composed of 45 places in 284 ms of which 0 ms to minimize.
[2023-03-19 16:27:23] [INFO ] Deduced a trap composed of 62 places in 254 ms of which 1 ms to minimize.
[2023-03-19 16:27:24] [INFO ] Deduced a trap composed of 74 places in 274 ms of which 1 ms to minimize.
[2023-03-19 16:27:24] [INFO ] Deduced a trap composed of 62 places in 306 ms of which 0 ms to minimize.
[2023-03-19 16:27:24] [INFO ] Deduced a trap composed of 47 places in 315 ms of which 1 ms to minimize.
[2023-03-19 16:27:25] [INFO ] Deduced a trap composed of 49 places in 307 ms of which 0 ms to minimize.
[2023-03-19 16:27:25] [INFO ] Deduced a trap composed of 46 places in 327 ms of which 1 ms to minimize.
[2023-03-19 16:27:25] [INFO ] Deduced a trap composed of 47 places in 293 ms of which 1 ms to minimize.
[2023-03-19 16:27:26] [INFO ] Deduced a trap composed of 50 places in 260 ms of which 0 ms to minimize.
[2023-03-19 16:27:26] [INFO ] Deduced a trap composed of 51 places in 281 ms of which 1 ms to minimize.
[2023-03-19 16:27:26] [INFO ] Deduced a trap composed of 56 places in 298 ms of which 0 ms to minimize.
[2023-03-19 16:27:27] [INFO ] Deduced a trap composed of 46 places in 300 ms of which 1 ms to minimize.
[2023-03-19 16:27:27] [INFO ] Deduced a trap composed of 61 places in 317 ms of which 1 ms to minimize.
[2023-03-19 16:27:28] [INFO ] Deduced a trap composed of 64 places in 314 ms of which 0 ms to minimize.
[2023-03-19 16:27:28] [INFO ] Deduced a trap composed of 63 places in 278 ms of which 1 ms to minimize.
[2023-03-19 16:27:28] [INFO ] Deduced a trap composed of 65 places in 303 ms of which 1 ms to minimize.
[2023-03-19 16:27:29] [INFO ] Deduced a trap composed of 73 places in 289 ms of which 1 ms to minimize.
[2023-03-19 16:27:29] [INFO ] Deduced a trap composed of 68 places in 303 ms of which 1 ms to minimize.
[2023-03-19 16:27:29] [INFO ] Deduced a trap composed of 70 places in 277 ms of which 0 ms to minimize.
[2023-03-19 16:27:30] [INFO ] Deduced a trap composed of 47 places in 301 ms of which 1 ms to minimize.
[2023-03-19 16:27:30] [INFO ] Deduced a trap composed of 52 places in 254 ms of which 1 ms to minimize.
[2023-03-19 16:27:30] [INFO ] Deduced a trap composed of 53 places in 272 ms of which 1 ms to minimize.
[2023-03-19 16:27:31] [INFO ] Deduced a trap composed of 39 places in 300 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 16:27:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 16:27:31] [INFO ] After 25280ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 162 ms.
Support contains 5 out of 1653 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1653/1653 places, 1903/1903 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 198 place count 1653 transition count 1705
Reduce places removed 198 places and 0 transitions.
Iterating post reduction 1 with 198 rules applied. Total rules applied 396 place count 1455 transition count 1705
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 396 place count 1455 transition count 1454
Deduced a syphon composed of 251 places in 3 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 898 place count 1204 transition count 1454
Performed 497 Post agglomeration using F-continuation condition.Transition count delta: 497
Deduced a syphon composed of 497 places in 2 ms
Reduce places removed 497 places and 0 transitions.
Iterating global reduction 2 with 994 rules applied. Total rules applied 1892 place count 707 transition count 957
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 102 times.
Drop transitions removed 102 transitions
Iterating global reduction 2 with 102 rules applied. Total rules applied 1994 place count 707 transition count 957
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1995 place count 706 transition count 956
Applied a total of 1995 rules in 285 ms. Remains 706 /1653 variables (removed 947) and now considering 956/1903 (removed 947) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 285 ms. Remains : 706/1653 places, 956/1903 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 956 rows 706 cols
[2023-03-19 16:27:31] [INFO ] Computed 201 place invariants in 6 ms
[2023-03-19 16:27:31] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 16:27:32] [INFO ] [Nat]Absence check using 201 positive place invariants in 46 ms returned sat
[2023-03-19 16:27:32] [INFO ] After 340ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 16:27:32] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 0 ms to minimize.
[2023-03-19 16:27:32] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2023-03-19 16:27:32] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 0 ms to minimize.
[2023-03-19 16:27:32] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2023-03-19 16:27:32] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 0 ms to minimize.
[2023-03-19 16:27:32] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 0 ms to minimize.
[2023-03-19 16:27:33] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2023-03-19 16:27:33] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 639 ms
[2023-03-19 16:27:33] [INFO ] After 998ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-19 16:27:33] [INFO ] After 1174ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 706 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 706/706 places, 956/956 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 706 transition count 954
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 704 transition count 954
Applied a total of 4 rules in 24 ms. Remains 704 /706 variables (removed 2) and now considering 954/956 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 704/706 places, 954/956 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 471615 steps, run timeout after 3009 ms. (steps per millisecond=156 ) properties seen :{}
Probabilistic random walk after 471615 steps, saw 462947 distinct states, run finished after 3009 ms. (steps per millisecond=156 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 954 rows 704 cols
[2023-03-19 16:27:36] [INFO ] Computed 201 place invariants in 7 ms
[2023-03-19 16:27:36] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 16:27:36] [INFO ] [Nat]Absence check using 201 positive place invariants in 54 ms returned sat
[2023-03-19 16:27:36] [INFO ] After 309ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 16:27:36] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 0 ms to minimize.
[2023-03-19 16:27:37] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 0 ms to minimize.
[2023-03-19 16:27:37] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2023-03-19 16:27:37] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 1 ms to minimize.
[2023-03-19 16:27:37] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2023-03-19 16:27:37] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 492 ms
[2023-03-19 16:27:37] [INFO ] After 820ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-19 16:27:37] [INFO ] After 999ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 704/704 places, 954/954 transitions.
Applied a total of 0 rules in 28 ms. Remains 704 /704 variables (removed 0) and now considering 954/954 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 704/704 places, 954/954 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 704/704 places, 954/954 transitions.
Applied a total of 0 rules in 34 ms. Remains 704 /704 variables (removed 0) and now considering 954/954 (removed 0) transitions.
[2023-03-19 16:27:37] [INFO ] Invariant cache hit.
[2023-03-19 16:27:37] [INFO ] Implicit Places using invariants in 387 ms returned []
[2023-03-19 16:27:37] [INFO ] Invariant cache hit.
[2023-03-19 16:27:38] [INFO ] Implicit Places using invariants and state equation in 695 ms returned []
Implicit Place search using SMT with State Equation took 1084 ms to find 0 implicit places.
[2023-03-19 16:27:38] [INFO ] Redundant transitions in 56 ms returned []
[2023-03-19 16:27:38] [INFO ] Invariant cache hit.
[2023-03-19 16:27:38] [INFO ] Dead Transitions using invariants and state equation in 345 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1525 ms. Remains : 704/704 places, 954/954 transitions.
Applied a total of 0 rules in 22 ms. Remains 704 /704 variables (removed 0) and now considering 954/954 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-19 16:27:38] [INFO ] Invariant cache hit.
[2023-03-19 16:27:39] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 16:27:39] [INFO ] [Nat]Absence check using 201 positive place invariants in 28 ms returned sat
[2023-03-19 16:27:39] [INFO ] After 288ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 16:27:39] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 0 ms to minimize.
[2023-03-19 16:27:39] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2023-03-19 16:27:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 147 ms
[2023-03-19 16:27:39] [INFO ] After 452ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-19 16:27:39] [INFO ] After 600ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p2)), (F (AND (NOT p1) p0)), (F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 8 factoid took 363 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), true, (AND (NOT p0) (NOT p2)), (NOT p0)]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), true, (AND (NOT p0) (NOT p2)), (NOT p0)]
Support contains 5 out of 1653 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1653/1653 places, 1903/1903 transitions.
Applied a total of 0 rules in 50 ms. Remains 1653 /1653 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
// Phase 1: matrix 1903 rows 1653 cols
[2023-03-19 16:27:40] [INFO ] Computed 201 place invariants in 6 ms
[2023-03-19 16:27:40] [INFO ] Implicit Places using invariants in 425 ms returned []
[2023-03-19 16:27:40] [INFO ] Invariant cache hit.
[2023-03-19 16:27:42] [INFO ] Implicit Places using invariants and state equation in 1583 ms returned []
Implicit Place search using SMT with State Equation took 2011 ms to find 0 implicit places.
[2023-03-19 16:27:42] [INFO ] Invariant cache hit.
[2023-03-19 16:27:43] [INFO ] Dead Transitions using invariants and state equation in 875 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2942 ms. Remains : 1653/1653 places, 1903/1903 transitions.
Computed a total of 399 stabilizing places and 399 stable transitions
Computed a total of 399 stabilizing places and 399 stable transitions
Detected a total of 399/1653 stabilizing places and 399/1903 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 251 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), true, (AND (NOT p0) (NOT p2)), (NOT p0)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-19 16:27:43] [INFO ] Invariant cache hit.
[2023-03-19 16:27:44] [INFO ] After 231ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 16:27:44] [INFO ] [Nat]Absence check using 201 positive place invariants in 56 ms returned sat
[2023-03-19 16:27:45] [INFO ] After 1145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 16:27:46] [INFO ] Deduced a trap composed of 37 places in 396 ms of which 1 ms to minimize.
[2023-03-19 16:27:46] [INFO ] Deduced a trap composed of 29 places in 421 ms of which 1 ms to minimize.
[2023-03-19 16:27:47] [INFO ] Deduced a trap composed of 23 places in 398 ms of which 1 ms to minimize.
[2023-03-19 16:27:47] [INFO ] Deduced a trap composed of 35 places in 378 ms of which 1 ms to minimize.
[2023-03-19 16:27:47] [INFO ] Deduced a trap composed of 38 places in 387 ms of which 1 ms to minimize.
[2023-03-19 16:27:48] [INFO ] Deduced a trap composed of 40 places in 317 ms of which 1 ms to minimize.
[2023-03-19 16:27:48] [INFO ] Deduced a trap composed of 31 places in 362 ms of which 1 ms to minimize.
[2023-03-19 16:27:49] [INFO ] Deduced a trap composed of 19 places in 383 ms of which 1 ms to minimize.
[2023-03-19 16:27:49] [INFO ] Deduced a trap composed of 48 places in 314 ms of which 1 ms to minimize.
[2023-03-19 16:27:49] [INFO ] Deduced a trap composed of 31 places in 360 ms of which 1 ms to minimize.
[2023-03-19 16:27:50] [INFO ] Deduced a trap composed of 19 places in 353 ms of which 1 ms to minimize.
[2023-03-19 16:27:50] [INFO ] Deduced a trap composed of 29 places in 346 ms of which 0 ms to minimize.
[2023-03-19 16:27:51] [INFO ] Deduced a trap composed of 27 places in 355 ms of which 1 ms to minimize.
[2023-03-19 16:27:51] [INFO ] Deduced a trap composed of 40 places in 458 ms of which 3 ms to minimize.
[2023-03-19 16:27:52] [INFO ] Deduced a trap composed of 18 places in 419 ms of which 1 ms to minimize.
[2023-03-19 16:27:52] [INFO ] Deduced a trap composed of 48 places in 414 ms of which 1 ms to minimize.
[2023-03-19 16:27:53] [INFO ] Deduced a trap composed of 22 places in 410 ms of which 1 ms to minimize.
[2023-03-19 16:27:53] [INFO ] Deduced a trap composed of 30 places in 386 ms of which 1 ms to minimize.
[2023-03-19 16:27:54] [INFO ] Deduced a trap composed of 57 places in 390 ms of which 1 ms to minimize.
[2023-03-19 16:27:54] [INFO ] Deduced a trap composed of 54 places in 448 ms of which 1 ms to minimize.
[2023-03-19 16:27:55] [INFO ] Deduced a trap composed of 50 places in 401 ms of which 1 ms to minimize.
[2023-03-19 16:27:55] [INFO ] Deduced a trap composed of 67 places in 346 ms of which 1 ms to minimize.
[2023-03-19 16:27:55] [INFO ] Deduced a trap composed of 49 places in 356 ms of which 1 ms to minimize.
[2023-03-19 16:27:56] [INFO ] Deduced a trap composed of 45 places in 352 ms of which 1 ms to minimize.
[2023-03-19 16:27:56] [INFO ] Deduced a trap composed of 52 places in 365 ms of which 1 ms to minimize.
[2023-03-19 16:27:57] [INFO ] Deduced a trap composed of 52 places in 388 ms of which 1 ms to minimize.
[2023-03-19 16:27:57] [INFO ] Deduced a trap composed of 58 places in 382 ms of which 1 ms to minimize.
[2023-03-19 16:27:58] [INFO ] Deduced a trap composed of 63 places in 354 ms of which 0 ms to minimize.
[2023-03-19 16:27:58] [INFO ] Deduced a trap composed of 50 places in 359 ms of which 1 ms to minimize.
[2023-03-19 16:27:58] [INFO ] Deduced a trap composed of 51 places in 377 ms of which 1 ms to minimize.
[2023-03-19 16:27:59] [INFO ] Deduced a trap composed of 41 places in 398 ms of which 0 ms to minimize.
[2023-03-19 16:27:59] [INFO ] Deduced a trap composed of 64 places in 356 ms of which 1 ms to minimize.
[2023-03-19 16:28:00] [INFO ] Deduced a trap composed of 68 places in 289 ms of which 0 ms to minimize.
[2023-03-19 16:28:00] [INFO ] Deduced a trap composed of 57 places in 279 ms of which 1 ms to minimize.
[2023-03-19 16:28:00] [INFO ] Deduced a trap composed of 56 places in 342 ms of which 1 ms to minimize.
[2023-03-19 16:28:01] [INFO ] Deduced a trap composed of 60 places in 312 ms of which 1 ms to minimize.
[2023-03-19 16:28:01] [INFO ] Deduced a trap composed of 56 places in 383 ms of which 1 ms to minimize.
[2023-03-19 16:28:02] [INFO ] Deduced a trap composed of 59 places in 319 ms of which 1 ms to minimize.
[2023-03-19 16:28:02] [INFO ] Deduced a trap composed of 81 places in 282 ms of which 1 ms to minimize.
[2023-03-19 16:28:02] [INFO ] Deduced a trap composed of 42 places in 271 ms of which 1 ms to minimize.
[2023-03-19 16:28:02] [INFO ] Deduced a trap composed of 52 places in 240 ms of which 0 ms to minimize.
[2023-03-19 16:28:03] [INFO ] Deduced a trap composed of 50 places in 232 ms of which 1 ms to minimize.
[2023-03-19 16:28:03] [INFO ] Deduced a trap composed of 48 places in 226 ms of which 1 ms to minimize.
[2023-03-19 16:28:03] [INFO ] Deduced a trap composed of 39 places in 300 ms of which 1 ms to minimize.
[2023-03-19 16:28:04] [INFO ] Deduced a trap composed of 57 places in 367 ms of which 1 ms to minimize.
[2023-03-19 16:28:04] [INFO ] Deduced a trap composed of 49 places in 287 ms of which 4 ms to minimize.
[2023-03-19 16:28:04] [INFO ] Deduced a trap composed of 60 places in 301 ms of which 0 ms to minimize.
[2023-03-19 16:28:05] [INFO ] Deduced a trap composed of 52 places in 302 ms of which 1 ms to minimize.
[2023-03-19 16:28:05] [INFO ] Deduced a trap composed of 59 places in 259 ms of which 1 ms to minimize.
[2023-03-19 16:28:05] [INFO ] Deduced a trap composed of 64 places in 245 ms of which 2 ms to minimize.
[2023-03-19 16:28:06] [INFO ] Deduced a trap composed of 57 places in 278 ms of which 1 ms to minimize.
[2023-03-19 16:28:06] [INFO ] Deduced a trap composed of 54 places in 306 ms of which 0 ms to minimize.
[2023-03-19 16:28:06] [INFO ] Deduced a trap composed of 58 places in 246 ms of which 1 ms to minimize.
[2023-03-19 16:28:07] [INFO ] Deduced a trap composed of 66 places in 283 ms of which 0 ms to minimize.
[2023-03-19 16:28:07] [INFO ] Deduced a trap composed of 67 places in 225 ms of which 1 ms to minimize.
[2023-03-19 16:28:07] [INFO ] Deduced a trap composed of 67 places in 254 ms of which 1 ms to minimize.
[2023-03-19 16:28:08] [INFO ] Deduced a trap composed of 66 places in 248 ms of which 1 ms to minimize.
[2023-03-19 16:28:08] [INFO ] Deduced a trap composed of 78 places in 269 ms of which 1 ms to minimize.
[2023-03-19 16:28:08] [INFO ] Deduced a trap composed of 78 places in 235 ms of which 1 ms to minimize.
[2023-03-19 16:28:09] [INFO ] Deduced a trap composed of 53 places in 235 ms of which 1 ms to minimize.
[2023-03-19 16:28:09] [INFO ] Deduced a trap composed of 19 places in 713 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 16:28:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 16:28:09] [INFO ] After 25723ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 299 ms.
Support contains 5 out of 1653 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1653/1653 places, 1903/1903 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 198 place count 1653 transition count 1705
Reduce places removed 198 places and 0 transitions.
Iterating post reduction 1 with 198 rules applied. Total rules applied 396 place count 1455 transition count 1705
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 396 place count 1455 transition count 1454
Deduced a syphon composed of 251 places in 2 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 898 place count 1204 transition count 1454
Performed 497 Post agglomeration using F-continuation condition.Transition count delta: 497
Deduced a syphon composed of 497 places in 1 ms
Reduce places removed 497 places and 0 transitions.
Iterating global reduction 2 with 994 rules applied. Total rules applied 1892 place count 707 transition count 957
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 102 times.
Drop transitions removed 102 transitions
Iterating global reduction 2 with 102 rules applied. Total rules applied 1994 place count 707 transition count 957
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1995 place count 706 transition count 956
Applied a total of 1995 rules in 180 ms. Remains 706 /1653 variables (removed 947) and now considering 956/1903 (removed 947) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 706/1653 places, 956/1903 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 956 rows 706 cols
[2023-03-19 16:28:10] [INFO ] Computed 201 place invariants in 3 ms
[2023-03-19 16:28:10] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 16:28:10] [INFO ] [Nat]Absence check using 201 positive place invariants in 22 ms returned sat
[2023-03-19 16:28:11] [INFO ] After 234ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 16:28:11] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 0 ms to minimize.
[2023-03-19 16:28:11] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2023-03-19 16:28:11] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 0 ms to minimize.
[2023-03-19 16:28:11] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 0 ms to minimize.
[2023-03-19 16:28:11] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 0 ms to minimize.
[2023-03-19 16:28:11] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2023-03-19 16:28:11] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2023-03-19 16:28:11] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 587 ms
[2023-03-19 16:28:11] [INFO ] After 840ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-19 16:28:11] [INFO ] After 987ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 706 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 706/706 places, 956/956 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 706 transition count 954
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 704 transition count 954
Applied a total of 4 rules in 27 ms. Remains 704 /706 variables (removed 2) and now considering 954/956 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 704/706 places, 954/956 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 344352 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :{}
Probabilistic random walk after 344352 steps, saw 338068 distinct states, run finished after 3001 ms. (steps per millisecond=114 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 954 rows 704 cols
[2023-03-19 16:28:14] [INFO ] Computed 201 place invariants in 10 ms
[2023-03-19 16:28:14] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 16:28:15] [INFO ] [Nat]Absence check using 201 positive place invariants in 31 ms returned sat
[2023-03-19 16:28:15] [INFO ] After 328ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 16:28:15] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 0 ms to minimize.
[2023-03-19 16:28:15] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 0 ms to minimize.
[2023-03-19 16:28:15] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2023-03-19 16:28:15] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
[2023-03-19 16:28:15] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 3 ms to minimize.
[2023-03-19 16:28:15] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 423 ms
[2023-03-19 16:28:15] [INFO ] After 774ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-19 16:28:15] [INFO ] After 934ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 704/704 places, 954/954 transitions.
Applied a total of 0 rules in 27 ms. Remains 704 /704 variables (removed 0) and now considering 954/954 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 704/704 places, 954/954 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 704/704 places, 954/954 transitions.
Applied a total of 0 rules in 65 ms. Remains 704 /704 variables (removed 0) and now considering 954/954 (removed 0) transitions.
[2023-03-19 16:28:15] [INFO ] Invariant cache hit.
[2023-03-19 16:28:16] [INFO ] Implicit Places using invariants in 389 ms returned []
[2023-03-19 16:28:16] [INFO ] Invariant cache hit.
[2023-03-19 16:28:16] [INFO ] Implicit Places using invariants and state equation in 656 ms returned []
Implicit Place search using SMT with State Equation took 1047 ms to find 0 implicit places.
[2023-03-19 16:28:17] [INFO ] Redundant transitions in 56 ms returned []
[2023-03-19 16:28:17] [INFO ] Invariant cache hit.
[2023-03-19 16:28:17] [INFO ] Dead Transitions using invariants and state equation in 322 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1496 ms. Remains : 704/704 places, 954/954 transitions.
Applied a total of 0 rules in 18 ms. Remains 704 /704 variables (removed 0) and now considering 954/954 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-19 16:28:17] [INFO ] Invariant cache hit.
[2023-03-19 16:28:17] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 16:28:17] [INFO ] [Nat]Absence check using 201 positive place invariants in 31 ms returned sat
[2023-03-19 16:28:17] [INFO ] After 276ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 16:28:17] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2023-03-19 16:28:17] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2023-03-19 16:28:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 133 ms
[2023-03-19 16:28:18] [INFO ] After 428ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-19 16:28:18] [INFO ] After 610ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p2)), (F (AND (NOT p1) p0)), (F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 8 factoid took 543 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), true, (AND (NOT p0) (NOT p2)), (NOT p0)]
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), true, (AND (NOT p0) (NOT p2)), (NOT p0)]
Stuttering acceptance computed with spot in 266 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), true, (AND (NOT p0) (NOT p2)), (NOT p0)]
Product exploration explored 100000 steps with 33355 reset in 1068 ms.
Product exploration explored 100000 steps with 33373 reset in 1220 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), true, (AND (NOT p0) (NOT p2)), (NOT p0)]
Support contains 5 out of 1653 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1653/1653 places, 1903/1903 transitions.
Performed 197 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 197 rules applied. Total rules applied 197 place count 1653 transition count 1903
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 104 Pre rules applied. Total rules applied 197 place count 1653 transition count 1953
Deduced a syphon composed of 301 places in 3 ms
Iterating global reduction 1 with 104 rules applied. Total rules applied 301 place count 1653 transition count 1953
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 302 place count 1652 transition count 1952
Deduced a syphon composed of 300 places in 4 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 303 place count 1652 transition count 1952
Performed 645 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 945 places in 3 ms
Iterating global reduction 1 with 645 rules applied. Total rules applied 948 place count 1652 transition count 1952
Renaming transitions due to excessive name length > 1024 char.
Discarding 344 places :
Symmetric choice reduction at 1 with 344 rule applications. Total rules 1292 place count 1308 transition count 1608
Deduced a syphon composed of 601 places in 2 ms
Iterating global reduction 1 with 344 rules applied. Total rules applied 1636 place count 1308 transition count 1608
Deduced a syphon composed of 601 places in 1 ms
Applied a total of 1636 rules in 717 ms. Remains 1308 /1653 variables (removed 345) and now considering 1608/1903 (removed 295) transitions.
[2023-03-19 16:28:23] [INFO ] Redundant transitions in 374 ms returned [1607]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1607 rows 1308 cols
[2023-03-19 16:28:23] [INFO ] Computed 201 place invariants in 25 ms
[2023-03-19 16:28:23] [INFO ] Dead Transitions using invariants and state equation in 732 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1308/1653 places, 1607/1903 transitions.
Deduced a syphon composed of 601 places in 2 ms
Applied a total of 0 rules in 34 ms. Remains 1308 /1308 variables (removed 0) and now considering 1607/1607 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1879 ms. Remains : 1308/1653 places, 1607/1903 transitions.
Support contains 5 out of 1653 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1653/1653 places, 1903/1903 transitions.
Applied a total of 0 rules in 35 ms. Remains 1653 /1653 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
// Phase 1: matrix 1903 rows 1653 cols
[2023-03-19 16:28:24] [INFO ] Computed 201 place invariants in 9 ms
[2023-03-19 16:28:24] [INFO ] Implicit Places using invariants in 402 ms returned []
[2023-03-19 16:28:24] [INFO ] Invariant cache hit.
[2023-03-19 16:28:25] [INFO ] Implicit Places using invariants and state equation in 1393 ms returned []
Implicit Place search using SMT with State Equation took 1797 ms to find 0 implicit places.
[2023-03-19 16:28:25] [INFO ] Invariant cache hit.
[2023-03-19 16:28:26] [INFO ] Dead Transitions using invariants and state equation in 799 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2632 ms. Remains : 1653/1653 places, 1903/1903 transitions.
Treatment of property ShieldRVs-PT-050B-LTLFireability-02 finished in 86296 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p1)||p0)))'
Support contains 4 out of 1663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1663/1663 places, 1913/1913 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1653 transition count 1903
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1653 transition count 1903
Applied a total of 20 rules in 81 ms. Remains 1653 /1663 variables (removed 10) and now considering 1903/1913 (removed 10) transitions.
// Phase 1: matrix 1903 rows 1653 cols
[2023-03-19 16:28:26] [INFO ] Computed 201 place invariants in 13 ms
[2023-03-19 16:28:27] [INFO ] Implicit Places using invariants in 402 ms returned []
[2023-03-19 16:28:27] [INFO ] Invariant cache hit.
[2023-03-19 16:28:28] [INFO ] Implicit Places using invariants and state equation in 1211 ms returned []
Implicit Place search using SMT with State Equation took 1615 ms to find 0 implicit places.
[2023-03-19 16:28:28] [INFO ] Invariant cache hit.
[2023-03-19 16:28:29] [INFO ] Dead Transitions using invariants and state equation in 729 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1653/1663 places, 1903/1913 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2428 ms. Remains : 1653/1663 places, 1903/1913 transitions.
Stuttering acceptance computed with spot in 59 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s479 0) (EQ s482 0) (EQ s489 0)), p1:(EQ s1317 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 3668 steps with 1 reset in 21 ms.
FORMULA ShieldRVs-PT-050B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050B-LTLFireability-04 finished in 2534 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 1663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1663/1663 places, 1913/1913 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1653 transition count 1903
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1653 transition count 1903
Applied a total of 20 rules in 94 ms. Remains 1653 /1663 variables (removed 10) and now considering 1903/1913 (removed 10) transitions.
// Phase 1: matrix 1903 rows 1653 cols
[2023-03-19 16:28:29] [INFO ] Computed 201 place invariants in 12 ms
[2023-03-19 16:28:29] [INFO ] Implicit Places using invariants in 397 ms returned []
[2023-03-19 16:28:29] [INFO ] Invariant cache hit.
[2023-03-19 16:28:30] [INFO ] Implicit Places using invariants and state equation in 1252 ms returned []
Implicit Place search using SMT with State Equation took 1651 ms to find 0 implicit places.
[2023-03-19 16:28:30] [INFO ] Invariant cache hit.
[2023-03-19 16:28:31] [INFO ] Dead Transitions using invariants and state equation in 775 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1653/1663 places, 1903/1913 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2521 ms. Remains : 1653/1663 places, 1903/1913 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s98 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 16231 steps with 7 reset in 111 ms.
FORMULA ShieldRVs-PT-050B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050B-LTLFireability-05 finished in 2722 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 1663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1663/1663 places, 1913/1913 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 1662 transition count 1711
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1461 transition count 1711
Performed 248 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 248 Pre rules applied. Total rules applied 402 place count 1461 transition count 1463
Deduced a syphon composed of 248 places in 5 ms
Reduce places removed 248 places and 0 transitions.
Iterating global reduction 2 with 496 rules applied. Total rules applied 898 place count 1213 transition count 1463
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 909 place count 1202 transition count 1452
Iterating global reduction 2 with 11 rules applied. Total rules applied 920 place count 1202 transition count 1452
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 920 place count 1202 transition count 1450
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 924 place count 1200 transition count 1450
Performed 495 Post agglomeration using F-continuation condition.Transition count delta: 495
Deduced a syphon composed of 495 places in 1 ms
Reduce places removed 495 places and 0 transitions.
Iterating global reduction 2 with 990 rules applied. Total rules applied 1914 place count 705 transition count 955
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1916 place count 703 transition count 953
Applied a total of 1916 rules in 247 ms. Remains 703 /1663 variables (removed 960) and now considering 953/1913 (removed 960) transitions.
// Phase 1: matrix 953 rows 703 cols
[2023-03-19 16:28:32] [INFO ] Computed 201 place invariants in 3 ms
[2023-03-19 16:28:32] [INFO ] Implicit Places using invariants in 321 ms returned []
[2023-03-19 16:28:32] [INFO ] Invariant cache hit.
[2023-03-19 16:28:33] [INFO ] Implicit Places using invariants and state equation in 577 ms returned []
Implicit Place search using SMT with State Equation took 900 ms to find 0 implicit places.
[2023-03-19 16:28:33] [INFO ] Redundant transitions in 114 ms returned [952]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 952 rows 703 cols
[2023-03-19 16:28:33] [INFO ] Computed 201 place invariants in 1 ms
[2023-03-19 16:28:33] [INFO ] Dead Transitions using invariants and state equation in 373 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 703/1663 places, 952/1913 transitions.
Applied a total of 0 rules in 16 ms. Remains 703 /703 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1656 ms. Remains : 703/1663 places, 952/1913 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s36 1) (EQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 164 reset in 417 ms.
Product exploration explored 100000 steps with 163 reset in 492 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Finished random walk after 559 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=139 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2023-03-19 16:28:34] [INFO ] Invariant cache hit.
[2023-03-19 16:28:35] [INFO ] [Real]Absence check using 201 positive place invariants in 54 ms returned sat
[2023-03-19 16:28:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 16:28:36] [INFO ] [Real]Absence check using state equation in 727 ms returned sat
[2023-03-19 16:28:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 16:28:36] [INFO ] [Nat]Absence check using 201 positive place invariants in 71 ms returned sat
[2023-03-19 16:28:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 16:28:37] [INFO ] [Nat]Absence check using state equation in 929 ms returned sat
[2023-03-19 16:28:37] [INFO ] Computed and/alt/rep : 853/3685/853 causal constraints (skipped 97 transitions) in 72 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-19 16:28:51] [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 p0)
Could not prove EG (NOT p0)
Support contains 2 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 952/952 transitions.
Applied a total of 0 rules in 28 ms. Remains 703 /703 variables (removed 0) and now considering 952/952 (removed 0) transitions.
[2023-03-19 16:28:51] [INFO ] Invariant cache hit.
[2023-03-19 16:28:51] [INFO ] Implicit Places using invariants in 328 ms returned []
[2023-03-19 16:28:51] [INFO ] Invariant cache hit.
[2023-03-19 16:28:52] [INFO ] Implicit Places using invariants and state equation in 681 ms returned []
Implicit Place search using SMT with State Equation took 1011 ms to find 0 implicit places.
[2023-03-19 16:28:52] [INFO ] Redundant transitions in 134 ms returned []
[2023-03-19 16:28:52] [INFO ] Invariant cache hit.
[2023-03-19 16:28:52] [INFO ] Dead Transitions using invariants and state equation in 348 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1526 ms. Remains : 703/703 places, 952/952 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 61 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 19 ms :[(NOT p0)]
Finished random walk after 585 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=146 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 19 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
[2023-03-19 16:28:52] [INFO ] Invariant cache hit.
[2023-03-19 16:28:53] [INFO ] [Real]Absence check using 201 positive place invariants in 48 ms returned sat
[2023-03-19 16:28:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 16:28:54] [INFO ] [Real]Absence check using state equation in 724 ms returned sat
[2023-03-19 16:28:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 16:28:54] [INFO ] [Nat]Absence check using 201 positive place invariants in 74 ms returned sat
[2023-03-19 16:28:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 16:28:55] [INFO ] [Nat]Absence check using state equation in 978 ms returned sat
[2023-03-19 16:28:55] [INFO ] Computed and/alt/rep : 853/3685/853 causal constraints (skipped 97 transitions) in 73 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: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-19 16:29:09] [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 p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 164 reset in 622 ms.
Product exploration explored 100000 steps with 163 reset in 767 ms.
Support contains 2 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 952/952 transitions.
Applied a total of 0 rules in 20 ms. Remains 703 /703 variables (removed 0) and now considering 952/952 (removed 0) transitions.
[2023-03-19 16:29:10] [INFO ] Invariant cache hit.
[2023-03-19 16:29:10] [INFO ] Implicit Places using invariants in 320 ms returned []
[2023-03-19 16:29:10] [INFO ] Invariant cache hit.
[2023-03-19 16:29:11] [INFO ] Implicit Places using invariants and state equation in 653 ms returned []
Implicit Place search using SMT with State Equation took 974 ms to find 0 implicit places.
[2023-03-19 16:29:11] [INFO ] Redundant transitions in 139 ms returned []
[2023-03-19 16:29:11] [INFO ] Invariant cache hit.
[2023-03-19 16:29:11] [INFO ] Dead Transitions using invariants and state equation in 314 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1456 ms. Remains : 703/703 places, 952/952 transitions.
Treatment of property ShieldRVs-PT-050B-LTLFireability-07 finished in 40043 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(F(p1))||G(p2)))))'
Support contains 3 out of 1663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1663/1663 places, 1913/1913 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 1662 transition count 1711
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1461 transition count 1711
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 402 place count 1461 transition count 1461
Deduced a syphon composed of 250 places in 2 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 902 place count 1211 transition count 1461
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 911 place count 1202 transition count 1452
Iterating global reduction 2 with 9 rules applied. Total rules applied 920 place count 1202 transition count 1452
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 920 place count 1202 transition count 1451
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 922 place count 1201 transition count 1451
Performed 496 Post agglomeration using F-continuation condition.Transition count delta: 496
Deduced a syphon composed of 496 places in 2 ms
Reduce places removed 496 places and 0 transitions.
Iterating global reduction 2 with 992 rules applied. Total rules applied 1914 place count 705 transition count 955
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1916 place count 703 transition count 953
Applied a total of 1916 rules in 181 ms. Remains 703 /1663 variables (removed 960) and now considering 953/1913 (removed 960) transitions.
// Phase 1: matrix 953 rows 703 cols
[2023-03-19 16:29:12] [INFO ] Computed 201 place invariants in 5 ms
[2023-03-19 16:29:12] [INFO ] Implicit Places using invariants in 296 ms returned []
[2023-03-19 16:29:12] [INFO ] Invariant cache hit.
[2023-03-19 16:29:13] [INFO ] Implicit Places using invariants and state equation in 662 ms returned []
Implicit Place search using SMT with State Equation took 959 ms to find 0 implicit places.
[2023-03-19 16:29:13] [INFO ] Redundant transitions in 150 ms returned [952]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 952 rows 703 cols
[2023-03-19 16:29:13] [INFO ] Computed 201 place invariants in 1 ms
[2023-03-19 16:29:13] [INFO ] Dead Transitions using invariants and state equation in 366 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 703/1663 places, 952/1913 transitions.
Applied a total of 0 rules in 15 ms. Remains 703 /703 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1677 ms. Remains : 703/1663 places, 952/1913 transitions.
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s71 1), p2:(EQ s5 0), p0:(EQ s205 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 150 reset in 424 ms.
Product exploration explored 100000 steps with 149 reset in 708 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 223 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 15 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 16:29:15] [INFO ] Invariant cache hit.
[2023-03-19 16:29:15] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 16:29:15] [INFO ] [Nat]Absence check using 201 positive place invariants in 31 ms returned sat
[2023-03-19 16:29:15] [INFO ] After 302ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 16:29:15] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 0 ms to minimize.
[2023-03-19 16:29:16] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2023-03-19 16:29:16] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 0 ms to minimize.
[2023-03-19 16:29:16] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2023-03-19 16:29:16] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 0 ms to minimize.
[2023-03-19 16:29:16] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2023-03-19 16:29:16] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2023-03-19 16:29:16] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2023-03-19 16:29:16] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 0 ms to minimize.
[2023-03-19 16:29:16] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 776 ms
[2023-03-19 16:29:16] [INFO ] After 1114ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-19 16:29:16] [INFO ] After 1288ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 21 ms.
Support contains 3 out of 703 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 703/703 places, 952/952 transitions.
Partial Free-agglomeration rule applied 101 times.
Drop transitions removed 101 transitions
Iterating global reduction 0 with 101 rules applied. Total rules applied 101 place count 703 transition count 952
Applied a total of 101 rules in 42 ms. Remains 703 /703 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 703/703 places, 952/952 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4379 steps, run visited all 1 properties in 41 ms. (steps per millisecond=106 )
Probabilistic random walk after 4379 steps, saw 4228 distinct states, run finished after 41 ms. (steps per millisecond=106 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) p2))]
Knowledge based reduction with 5 factoid took 253 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 3 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 952/952 transitions.
Applied a total of 0 rules in 24 ms. Remains 703 /703 variables (removed 0) and now considering 952/952 (removed 0) transitions.
[2023-03-19 16:29:17] [INFO ] Invariant cache hit.
[2023-03-19 16:29:17] [INFO ] Implicit Places using invariants in 304 ms returned []
[2023-03-19 16:29:17] [INFO ] Invariant cache hit.
[2023-03-19 16:29:18] [INFO ] Implicit Places using invariants and state equation in 743 ms returned []
Implicit Place search using SMT with State Equation took 1049 ms to find 0 implicit places.
[2023-03-19 16:29:18] [INFO ] Redundant transitions in 150 ms returned []
[2023-03-19 16:29:18] [INFO ] Invariant cache hit.
[2023-03-19 16:29:18] [INFO ] Dead Transitions using invariants and state equation in 378 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1611 ms. Remains : 703/703 places, 952/952 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 122 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 16:29:19] [INFO ] Invariant cache hit.
[2023-03-19 16:29:19] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 16:29:19] [INFO ] [Nat]Absence check using 201 positive place invariants in 32 ms returned sat
[2023-03-19 16:29:19] [INFO ] After 235ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 16:29:19] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2023-03-19 16:29:19] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 0 ms to minimize.
[2023-03-19 16:29:19] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 0 ms to minimize.
[2023-03-19 16:29:19] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 0 ms to minimize.
[2023-03-19 16:29:20] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2023-03-19 16:29:20] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2023-03-19 16:29:20] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2023-03-19 16:29:20] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2023-03-19 16:29:20] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 0 ms to minimize.
[2023-03-19 16:29:20] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 785 ms
[2023-03-19 16:29:20] [INFO ] After 1045ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-19 16:29:20] [INFO ] After 1213ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 703 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 703/703 places, 952/952 transitions.
Partial Free-agglomeration rule applied 101 times.
Drop transitions removed 101 transitions
Iterating global reduction 0 with 101 rules applied. Total rules applied 101 place count 703 transition count 952
Applied a total of 101 rules in 42 ms. Remains 703 /703 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 703/703 places, 952/952 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4379 steps, run visited all 1 properties in 42 ms. (steps per millisecond=104 )
Probabilistic random walk after 4379 steps, saw 4228 distinct states, run finished after 42 ms. (steps per millisecond=104 ) properties seen :1
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) p2))]
Knowledge based reduction with 5 factoid took 240 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 149 reset in 557 ms.
Product exploration explored 100000 steps with 150 reset in 588 ms.
Support contains 3 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 952/952 transitions.
Applied a total of 0 rules in 15 ms. Remains 703 /703 variables (removed 0) and now considering 952/952 (removed 0) transitions.
[2023-03-19 16:29:22] [INFO ] Invariant cache hit.
[2023-03-19 16:29:22] [INFO ] Implicit Places using invariants in 308 ms returned []
[2023-03-19 16:29:22] [INFO ] Invariant cache hit.
[2023-03-19 16:29:23] [INFO ] Implicit Places using invariants and state equation in 644 ms returned []
Implicit Place search using SMT with State Equation took 953 ms to find 0 implicit places.
[2023-03-19 16:29:23] [INFO ] Redundant transitions in 137 ms returned []
[2023-03-19 16:29:23] [INFO ] Invariant cache hit.
[2023-03-19 16:29:23] [INFO ] Dead Transitions using invariants and state equation in 309 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1421 ms. Remains : 703/703 places, 952/952 transitions.
Treatment of property ShieldRVs-PT-050B-LTLFireability-10 finished in 11820 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&(p1 U G(p2)))))'
Support contains 6 out of 1663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1663/1663 places, 1913/1913 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1653 transition count 1903
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1653 transition count 1903
Applied a total of 20 rules in 142 ms. Remains 1653 /1663 variables (removed 10) and now considering 1903/1913 (removed 10) transitions.
// Phase 1: matrix 1903 rows 1653 cols
[2023-03-19 16:29:23] [INFO ] Computed 201 place invariants in 12 ms
[2023-03-19 16:29:24] [INFO ] Implicit Places using invariants in 508 ms returned []
[2023-03-19 16:29:24] [INFO ] Invariant cache hit.
[2023-03-19 16:29:25] [INFO ] Implicit Places using invariants and state equation in 1335 ms returned []
Implicit Place search using SMT with State Equation took 1857 ms to find 0 implicit places.
[2023-03-19 16:29:25] [INFO ] Invariant cache hit.
[2023-03-19 16:29:26] [INFO ] Dead Transitions using invariants and state equation in 784 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1653/1663 places, 1903/1913 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2784 ms. Remains : 1653/1663 places, 1903/1913 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(OR p2 p1), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p2 p1), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(AND (NOT (AND (EQ s1311 1) (EQ s1315 1) (EQ s1322 1))) (EQ s423 1)), p1:(AND (EQ s1311 1) (EQ s1315 1) (EQ s1322 1)), p0:(OR (EQ s1336 1) (EQ s1048 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-050B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050B-LTLFireability-11 finished in 2956 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((G(p2)&&p1))))'
Support contains 5 out of 1663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1663/1663 places, 1913/1913 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 1662 transition count 1712
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 1462 transition count 1712
Performed 249 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 249 Pre rules applied. Total rules applied 400 place count 1462 transition count 1463
Deduced a syphon composed of 249 places in 2 ms
Reduce places removed 249 places and 0 transitions.
Iterating global reduction 2 with 498 rules applied. Total rules applied 898 place count 1213 transition count 1463
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 908 place count 1203 transition count 1453
Iterating global reduction 2 with 10 rules applied. Total rules applied 918 place count 1203 transition count 1453
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 918 place count 1203 transition count 1451
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 922 place count 1201 transition count 1451
Performed 494 Post agglomeration using F-continuation condition.Transition count delta: 494
Deduced a syphon composed of 494 places in 1 ms
Reduce places removed 494 places and 0 transitions.
Iterating global reduction 2 with 988 rules applied. Total rules applied 1910 place count 707 transition count 957
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1912 place count 705 transition count 955
Applied a total of 1912 rules in 304 ms. Remains 705 /1663 variables (removed 958) and now considering 955/1913 (removed 958) transitions.
// Phase 1: matrix 955 rows 705 cols
[2023-03-19 16:29:27] [INFO ] Computed 201 place invariants in 3 ms
[2023-03-19 16:29:27] [INFO ] Implicit Places using invariants in 232 ms returned []
[2023-03-19 16:29:27] [INFO ] Invariant cache hit.
[2023-03-19 16:29:27] [INFO ] Implicit Places using invariants and state equation in 545 ms returned []
Implicit Place search using SMT with State Equation took 778 ms to find 0 implicit places.
[2023-03-19 16:29:27] [INFO ] Redundant transitions in 128 ms returned [954]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 954 rows 705 cols
[2023-03-19 16:29:28] [INFO ] Computed 201 place invariants in 1 ms
[2023-03-19 16:29:28] [INFO ] Dead Transitions using invariants and state equation in 322 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 705/1663 places, 954/1913 transitions.
Applied a total of 0 rules in 19 ms. Remains 705 /705 variables (removed 0) and now considering 954/954 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1558 ms. Remains : 705/1663 places, 954/1913 transitions.
Stuttering acceptance computed with spot in 89 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p1 p2), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s671 1) (EQ s675 1) (EQ s684 1) (NEQ s403 1)), p2:(EQ s606 1), p0:(EQ s403 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 665 steps with 0 reset in 4 ms.
FORMULA ShieldRVs-PT-050B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050B-LTLFireability-12 finished in 1666 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' '!(((p0 U X(p0))||G((p1 U p2))||X(X(p3))))'
Support contains 5 out of 1663 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1663/1663 places, 1913/1913 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1653 transition count 1903
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1653 transition count 1903
Applied a total of 20 rules in 90 ms. Remains 1653 /1663 variables (removed 10) and now considering 1903/1913 (removed 10) transitions.
// Phase 1: matrix 1903 rows 1653 cols
[2023-03-19 16:29:28] [INFO ] Computed 201 place invariants in 7 ms
[2023-03-19 16:29:28] [INFO ] Implicit Places using invariants in 368 ms returned []
[2023-03-19 16:29:28] [INFO ] Invariant cache hit.
[2023-03-19 16:29:30] [INFO ] Implicit Places using invariants and state equation in 1367 ms returned []
Implicit Place search using SMT with State Equation took 1736 ms to find 0 implicit places.
[2023-03-19 16:29:30] [INFO ] Invariant cache hit.
[2023-03-19 16:29:31] [INFO ] Dead Transitions using invariants and state equation in 788 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1653/1663 places, 1903/1913 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2620 ms. Remains : 1653/1663 places, 1903/1913 transitions.
Stuttering acceptance computed with spot in 283 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p3), true, (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=2 dest: 7}], [{ cond=(NOT p0), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 8}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=4 dest: 9}], [{ cond=(NOT p3), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=7 dest: 10}, { cond=(OR (AND p2 (NOT p3)) (AND p1 (NOT p3))), acceptance={} source=7 dest: 11}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=8 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p0) (NOT p2) p1 (NOT p3)), acceptance={} source=9 dest: 10}, { cond=(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) p1 (NOT p3))), acceptance={} source=9 dest: 11}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=10 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={0} source=10 dest: 10}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=11 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={} source=11 dest: 10}, { cond=(OR p2 p1), acceptance={} source=11 dest: 11}]], initial=0, aps=[p0:(EQ s1323 1), p2:(AND (EQ s379 1) (EQ s413 1) (EQ s435 1)), p1:(EQ s1360 1), p3:(AND (EQ s1323 1) (EQ s379 1) (EQ s413 1) (EQ s435 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, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-050B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050B-LTLFireability-13 finished in 2929 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1663 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1663/1663 places, 1913/1913 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 1662 transition count 1711
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1461 transition count 1711
Performed 249 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 249 Pre rules applied. Total rules applied 402 place count 1461 transition count 1462
Deduced a syphon composed of 249 places in 2 ms
Reduce places removed 249 places and 0 transitions.
Iterating global reduction 2 with 498 rules applied. Total rules applied 900 place count 1212 transition count 1462
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 910 place count 1202 transition count 1452
Iterating global reduction 2 with 10 rules applied. Total rules applied 920 place count 1202 transition count 1452
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 920 place count 1202 transition count 1450
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 924 place count 1200 transition count 1450
Performed 495 Post agglomeration using F-continuation condition.Transition count delta: 495
Deduced a syphon composed of 495 places in 2 ms
Reduce places removed 495 places and 0 transitions.
Iterating global reduction 2 with 990 rules applied. Total rules applied 1914 place count 705 transition count 955
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1916 place count 703 transition count 953
Applied a total of 1916 rules in 222 ms. Remains 703 /1663 variables (removed 960) and now considering 953/1913 (removed 960) transitions.
// Phase 1: matrix 953 rows 703 cols
[2023-03-19 16:29:31] [INFO ] Computed 201 place invariants in 2 ms
[2023-03-19 16:29:31] [INFO ] Implicit Places using invariants in 213 ms returned []
[2023-03-19 16:29:31] [INFO ] Invariant cache hit.
[2023-03-19 16:29:32] [INFO ] Implicit Places using invariants and state equation in 524 ms returned []
Implicit Place search using SMT with State Equation took 738 ms to find 0 implicit places.
[2023-03-19 16:29:32] [INFO ] Redundant transitions in 121 ms returned [952]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 952 rows 703 cols
[2023-03-19 16:29:32] [INFO ] Computed 201 place invariants in 1 ms
[2023-03-19 16:29:32] [INFO ] Dead Transitions using invariants and state equation in 314 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 703/1663 places, 952/1913 transitions.
Applied a total of 0 rules in 15 ms. Remains 703 /703 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1415 ms. Remains : 703/1663 places, 952/1913 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s581 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 149 reset in 576 ms.
Product exploration explored 100000 steps with 150 reset in 601 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/703 stabilizing places and 2/952 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 125 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 124 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 20 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Support contains 1 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 952/952 transitions.
Applied a total of 0 rules in 23 ms. Remains 703 /703 variables (removed 0) and now considering 952/952 (removed 0) transitions.
[2023-03-19 16:29:34] [INFO ] Invariant cache hit.
[2023-03-19 16:29:34] [INFO ] Implicit Places using invariants in 253 ms returned []
[2023-03-19 16:29:34] [INFO ] Invariant cache hit.
[2023-03-19 16:29:35] [INFO ] Implicit Places using invariants and state equation in 677 ms returned []
Implicit Place search using SMT with State Equation took 932 ms to find 0 implicit places.
[2023-03-19 16:29:35] [INFO ] Redundant transitions in 140 ms returned []
[2023-03-19 16:29:35] [INFO ] Invariant cache hit.
[2023-03-19 16:29:35] [INFO ] Dead Transitions using invariants and state equation in 312 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1413 ms. Remains : 703/703 places, 952/952 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/703 stabilizing places and 2/952 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 116 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Product exploration explored 100000 steps with 149 reset in 515 ms.
Product exploration explored 100000 steps with 150 reset in 652 ms.
Support contains 1 out of 703 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 703/703 places, 952/952 transitions.
Applied a total of 0 rules in 15 ms. Remains 703 /703 variables (removed 0) and now considering 952/952 (removed 0) transitions.
[2023-03-19 16:29:37] [INFO ] Invariant cache hit.
[2023-03-19 16:29:37] [INFO ] Implicit Places using invariants in 308 ms returned []
[2023-03-19 16:29:37] [INFO ] Invariant cache hit.
[2023-03-19 16:29:38] [INFO ] Implicit Places using invariants and state equation in 553 ms returned []
Implicit Place search using SMT with State Equation took 874 ms to find 0 implicit places.
[2023-03-19 16:29:38] [INFO ] Redundant transitions in 164 ms returned []
[2023-03-19 16:29:38] [INFO ] Invariant cache hit.
[2023-03-19 16:29:38] [INFO ] Dead Transitions using invariants and state equation in 363 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1428 ms. Remains : 703/703 places, 952/952 transitions.
Treatment of property ShieldRVs-PT-050B-LTLFireability-14 finished in 7373 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
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((G(p0)||X((p1||X(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(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(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' '!(F(G(p0)))'
[2023-03-19 16:29:39] [INFO ] Flatten gal took : 101 ms
[2023-03-19 16:29:39] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-19 16:29:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1663 places, 1913 transitions and 6520 arcs took 16 ms.
Total runtime 218936 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldRVs-PT-050B
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability

BK_STOP 1679243570566

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
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: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 15 (type EXCL) for 6 ShieldRVs-PT-050B-LTLFireability-07
lola: time limit : 719 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050B-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-07: F 0 0 1 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
15 EG EXCL 5/719 7/32 ShieldRVs-PT-050B-LTLFireability-07 518021 m, 103604 m/sec, 1120268 t fired, .

Time elapsed: 6 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050B-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-07: F 0 0 1 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
15 EG EXCL 10/719 15/32 ShieldRVs-PT-050B-LTLFireability-07 1153548 m, 127105 m/sec, 2282647 t fired, .

Time elapsed: 11 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050B-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-07: F 0 0 1 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
15 EG EXCL 15/719 24/32 ShieldRVs-PT-050B-LTLFireability-07 1825531 m, 134396 m/sec, 3577816 t fired, .

Time elapsed: 16 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050B-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-07: F 0 0 1 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
15 EG EXCL 20/719 32/32 ShieldRVs-PT-050B-LTLFireability-07 2471493 m, 129192 m/sec, 4908342 t fired, .

Time elapsed: 21 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: CANCELED task # 15 (type EXCL) for ShieldRVs-PT-050B-LTLFireability-07 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050B-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-02: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-07: F 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-14: 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: 5
lola: LAUNCH task # 4 (type EXCL) for 3 ShieldRVs-PT-050B-LTLFireability-02
lola: time limit : 893 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050B-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-07: F 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/893 3/32 ShieldRVs-PT-050B-LTLFireability-02 112833 m, 22566 m/sec, 621842 t fired, .

Time elapsed: 31 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050B-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-07: F 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/893 5/32 ShieldRVs-PT-050B-LTLFireability-02 224469 m, 22327 m/sec, 1309155 t fired, .

Time elapsed: 36 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050B-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-07: F 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/893 7/32 ShieldRVs-PT-050B-LTLFireability-02 337199 m, 22546 m/sec, 1991623 t fired, .

Time elapsed: 41 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050B-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-07: F 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/893 8/32 ShieldRVs-PT-050B-LTLFireability-02 432055 m, 18971 m/sec, 2624581 t fired, .

Time elapsed: 46 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050B-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-07: F 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/893 10/32 ShieldRVs-PT-050B-LTLFireability-02 530249 m, 19638 m/sec, 3276105 t fired, .

Time elapsed: 51 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050B-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-07: F 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/893 12/32 ShieldRVs-PT-050B-LTLFireability-02 629377 m, 19825 m/sec, 3969920 t fired, .

Time elapsed: 56 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050B-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-07: F 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 35/893 14/32 ShieldRVs-PT-050B-LTLFireability-02 725561 m, 19236 m/sec, 4675384 t fired, .

Time elapsed: 61 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050B-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-07: F 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 40/893 16/32 ShieldRVs-PT-050B-LTLFireability-02 829513 m, 20790 m/sec, 5401078 t fired, .

Time elapsed: 66 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050B-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-07: F 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 45/893 17/32 ShieldRVs-PT-050B-LTLFireability-02 924551 m, 19007 m/sec, 6128356 t fired, .

Time elapsed: 71 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050B-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-07: F 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 50/893 19/32 ShieldRVs-PT-050B-LTLFireability-02 1027927 m, 20675 m/sec, 6853753 t fired, .

Time elapsed: 76 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050B-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-07: F 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 55/893 21/32 ShieldRVs-PT-050B-LTLFireability-02 1129963 m, 20407 m/sec, 7572768 t fired, .

Time elapsed: 81 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050B-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-07: F 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 60/893 23/32 ShieldRVs-PT-050B-LTLFireability-02 1229015 m, 19810 m/sec, 8294643 t fired, .

Time elapsed: 86 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050B-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-07: F 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 65/893 25/32 ShieldRVs-PT-050B-LTLFireability-02 1329673 m, 20131 m/sec, 9019199 t fired, .

Time elapsed: 91 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050B-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-07: F 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 70/893 26/32 ShieldRVs-PT-050B-LTLFireability-02 1424495 m, 18964 m/sec, 9744542 t fired, .

Time elapsed: 96 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050B-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-07: F 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 75/893 28/32 ShieldRVs-PT-050B-LTLFireability-02 1518757 m, 18852 m/sec, 10465387 t fired, .

Time elapsed: 101 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050B-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-07: F 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 80/893 30/32 ShieldRVs-PT-050B-LTLFireability-02 1608169 m, 17882 m/sec, 11181433 t fired, .

Time elapsed: 106 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050B-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-07: F 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 85/893 31/32 ShieldRVs-PT-050B-LTLFireability-02 1694327 m, 17231 m/sec, 11900525 t fired, .

Time elapsed: 111 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: CANCELED task # 4 (type EXCL) for ShieldRVs-PT-050B-LTLFireability-02 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050B-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-07: F 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-14: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 116 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: LAUNCH task # 13 (type EXCL) for 12 ShieldRVs-PT-050B-LTLFireability-14
lola: time limit : 1161 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050B-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-07: F 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 5/1161 5/32 ShieldRVs-PT-050B-LTLFireability-14 646530 m, 129306 m/sec, 878947 t fired, .

Time elapsed: 121 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050B-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-07: F 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 10/1161 10/32 ShieldRVs-PT-050B-LTLFireability-14 1347805 m, 140255 m/sec, 1826335 t fired, .

Time elapsed: 126 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050B-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-07: F 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 15/1161 15/32 ShieldRVs-PT-050B-LTLFireability-14 2061772 m, 142793 m/sec, 2787893 t fired, .

Time elapsed: 131 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050B-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-07: F 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 20/1161 20/32 ShieldRVs-PT-050B-LTLFireability-14 2763446 m, 140334 m/sec, 3742972 t fired, .

Time elapsed: 136 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050B-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-07: F 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 25/1161 25/32 ShieldRVs-PT-050B-LTLFireability-14 3447709 m, 136852 m/sec, 4656562 t fired, .

Time elapsed: 141 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050B-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-07: F 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 30/1161 31/32 ShieldRVs-PT-050B-LTLFireability-14 4179075 m, 146273 m/sec, 5627258 t fired, .

Time elapsed: 146 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: CANCELED task # 13 (type EXCL) for ShieldRVs-PT-050B-LTLFireability-14 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050B-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-07: F 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-14: 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: 5
lola: LAUNCH task # 10 (type EXCL) for 9 ShieldRVs-PT-050B-LTLFireability-10
lola: time limit : 1724 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050B-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-07: F 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 5/1724 9/32 ShieldRVs-PT-050B-LTLFireability-10 627634 m, 125526 m/sec, 1296703 t fired, .

Time elapsed: 156 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050B-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-07: F 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 10/1724 18/32 ShieldRVs-PT-050B-LTLFireability-10 1276543 m, 129781 m/sec, 2669579 t fired, .

Time elapsed: 161 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050B-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-07: F 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 15/1724 26/32 ShieldRVs-PT-050B-LTLFireability-10 1842506 m, 113192 m/sec, 3902113 t fired, .

Time elapsed: 166 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: CANCELED task # 10 (type EXCL) for ShieldRVs-PT-050B-LTLFireability-10 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050B-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-07: F 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 171 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: LAUNCH task # 1 (type EXCL) for 0 ShieldRVs-PT-050B-LTLFireability-01
lola: time limit : 3429 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050B-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-07: F 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3429 11/32 ShieldRVs-PT-050B-LTLFireability-01 645495 m, 129099 m/sec, 1297175 t fired, .

Time elapsed: 176 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050B-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-07: F 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3429 21/32 ShieldRVs-PT-050B-LTLFireability-01 1286570 m, 128215 m/sec, 2636842 t fired, .

Time elapsed: 181 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050B-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-07: F 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3429 32/32 ShieldRVs-PT-050B-LTLFireability-01 1946984 m, 132082 m/sec, 4136572 t fired, .

Time elapsed: 186 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: CANCELED task # 1 (type EXCL) for ShieldRVs-PT-050B-LTLFireability-01 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-050B-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-07: F 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-050B-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-050B-LTLFireability-01: LTL unknown AGGR
ShieldRVs-PT-050B-LTLFireability-02: LTL unknown AGGR
ShieldRVs-PT-050B-LTLFireability-07: F unknown AGGR
ShieldRVs-PT-050B-LTLFireability-10: LTL unknown AGGR
ShieldRVs-PT-050B-LTLFireability-14: LTL unknown AGGR


Time elapsed: 191 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="ShieldRVs-PT-050B"
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 ShieldRVs-PT-050B, 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 r423-tajo-167905976300156"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-050B.tgz
mv ShieldRVs-PT-050B 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 ;