Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 6.2K Feb 26 01:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 01:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 01:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 01:50 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.6K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 26 01:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 01:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 01:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 888K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679277171368

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-050B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 01:52:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 01:52:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 01:52:54] [INFO ] Load time of PNML (sax parser for PT used): 168 ms
[2023-03-20 01:52:54] [INFO ] Transformed 3403 places.
[2023-03-20 01:52:54] [INFO ] Transformed 3153 transitions.
[2023-03-20 01:52:54] [INFO ] Found NUPN structural information;
[2023-03-20 01:52:54] [INFO ] Parsed PT model containing 3403 places and 3153 transitions and 8706 arcs in 496 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Support contains 60 out of 3403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3403/3403 places, 3153/3153 transitions.
Discarding 342 places :
Symmetric choice reduction at 0 with 342 rule applications. Total rules 342 place count 3061 transition count 2811
Iterating global reduction 0 with 342 rules applied. Total rules applied 684 place count 3061 transition count 2811
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 685 place count 3060 transition count 2810
Iterating global reduction 0 with 1 rules applied. Total rules applied 686 place count 3060 transition count 2810
Applied a total of 686 rules in 1081 ms. Remains 3060 /3403 variables (removed 343) and now considering 2810/3153 (removed 343) transitions.
// Phase 1: matrix 2810 rows 3060 cols
[2023-03-20 01:52:55] [INFO ] Computed 551 place invariants in 48 ms
[2023-03-20 01:52:57] [INFO ] Implicit Places using invariants in 1647 ms returned []
[2023-03-20 01:52:57] [INFO ] Invariant cache hit.
[2023-03-20 01:53:01] [INFO ] Implicit Places using invariants and state equation in 4374 ms returned []
Implicit Place search using SMT with State Equation took 6122 ms to find 0 implicit places.
[2023-03-20 01:53:01] [INFO ] Invariant cache hit.
[2023-03-20 01:53:03] [INFO ] Dead Transitions using invariants and state equation in 2073 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3060/3403 places, 2810/3153 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9279 ms. Remains : 3060/3403 places, 2810/3153 transitions.
Support contains 60 out of 3060 places after structural reductions.
[2023-03-20 01:53:04] [INFO ] Flatten gal took : 202 ms
[2023-03-20 01:53:04] [INFO ] Flatten gal took : 142 ms
[2023-03-20 01:53:04] [INFO ] Input system was already deterministic with 2810 transitions.
Support contains 57 out of 3060 places (down from 60) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 570 ms. (steps per millisecond=17 ) properties (out of 37) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2023-03-20 01:53:05] [INFO ] Invariant cache hit.
[2023-03-20 01:53:07] [INFO ] [Real]Absence check using 551 positive place invariants in 262 ms returned sat
[2023-03-20 01:53:07] [INFO ] After 1592ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-20 01:53:09] [INFO ] [Nat]Absence check using 551 positive place invariants in 276 ms returned sat
[2023-03-20 01:53:13] [INFO ] After 3742ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-20 01:53:15] [INFO ] Deduced a trap composed of 18 places in 1224 ms of which 6 ms to minimize.
[2023-03-20 01:53:16] [INFO ] Deduced a trap composed of 26 places in 1074 ms of which 2 ms to minimize.
[2023-03-20 01:53:17] [INFO ] Deduced a trap composed of 25 places in 977 ms of which 3 ms to minimize.
[2023-03-20 01:53:18] [INFO ] Deduced a trap composed of 23 places in 951 ms of which 3 ms to minimize.
[2023-03-20 01:53:19] [INFO ] Deduced a trap composed of 22 places in 943 ms of which 2 ms to minimize.
[2023-03-20 01:53:20] [INFO ] Deduced a trap composed of 35 places in 892 ms of which 2 ms to minimize.
[2023-03-20 01:53:21] [INFO ] Deduced a trap composed of 20 places in 964 ms of which 4 ms to minimize.
[2023-03-20 01:53:22] [INFO ] Deduced a trap composed of 31 places in 905 ms of which 2 ms to minimize.
[2023-03-20 01:53:23] [INFO ] Deduced a trap composed of 36 places in 1073 ms of which 2 ms to minimize.
[2023-03-20 01:53:25] [INFO ] Deduced a trap composed of 20 places in 965 ms of which 2 ms to minimize.
[2023-03-20 01:53:26] [INFO ] Deduced a trap composed of 28 places in 954 ms of which 2 ms to minimize.
[2023-03-20 01:53:27] [INFO ] Deduced a trap composed of 24 places in 969 ms of which 2 ms to minimize.
[2023-03-20 01:53:28] [INFO ] Deduced a trap composed of 16 places in 947 ms of which 3 ms to minimize.
[2023-03-20 01:53:29] [INFO ] Deduced a trap composed of 25 places in 971 ms of which 2 ms to minimize.
[2023-03-20 01:53:30] [INFO ] Deduced a trap composed of 26 places in 1069 ms of which 2 ms to minimize.
[2023-03-20 01:53:31] [INFO ] Deduced a trap composed of 16 places in 961 ms of which 2 ms to minimize.
[2023-03-20 01:53:32] [INFO ] Deduced a trap composed of 19 places in 942 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 01:53:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 01:53:32] [INFO ] After 25524ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:14
Fused 14 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 1883 ms.
Support contains 24 out of 3060 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Drop transitions removed 345 transitions
Trivial Post-agglo rules discarded 345 transitions
Performed 345 trivial Post agglomeration. Transition count delta: 345
Iterating post reduction 0 with 345 rules applied. Total rules applied 345 place count 3060 transition count 2465
Reduce places removed 345 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 346 rules applied. Total rules applied 691 place count 2715 transition count 2464
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 692 place count 2714 transition count 2464
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 252 Pre rules applied. Total rules applied 692 place count 2714 transition count 2212
Deduced a syphon composed of 252 places in 6 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 3 with 504 rules applied. Total rules applied 1196 place count 2462 transition count 2212
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 1201 place count 2457 transition count 2207
Iterating global reduction 3 with 5 rules applied. Total rules applied 1206 place count 2457 transition count 2207
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 1206 place count 2457 transition count 2204
Deduced a syphon composed of 3 places in 7 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1212 place count 2454 transition count 2204
Performed 886 Post agglomeration using F-continuation condition.Transition count delta: 886
Deduced a syphon composed of 886 places in 3 ms
Reduce places removed 886 places and 0 transitions.
Iterating global reduction 3 with 1772 rules applied. Total rules applied 2984 place count 1568 transition count 1318
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 436 times.
Drop transitions removed 436 transitions
Iterating global reduction 3 with 436 rules applied. Total rules applied 3420 place count 1568 transition count 1318
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3421 place count 1567 transition count 1317
Applied a total of 3421 rules in 863 ms. Remains 1567 /3060 variables (removed 1493) and now considering 1317/2810 (removed 1493) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 863 ms. Remains : 1567/3060 places, 1317/2810 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 471 ms. (steps per millisecond=21 ) properties (out of 14) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1317 rows 1567 cols
[2023-03-20 01:53:36] [INFO ] Computed 551 place invariants in 56 ms
[2023-03-20 01:53:37] [INFO ] [Real]Absence check using 522 positive place invariants in 119 ms returned sat
[2023-03-20 01:53:37] [INFO ] [Real]Absence check using 522 positive and 29 generalized place invariants in 6 ms returned sat
[2023-03-20 01:53:37] [INFO ] After 509ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 01:53:37] [INFO ] [Nat]Absence check using 522 positive place invariants in 147 ms returned sat
[2023-03-20 01:53:37] [INFO ] [Nat]Absence check using 522 positive and 29 generalized place invariants in 8 ms returned sat
[2023-03-20 01:53:38] [INFO ] After 1098ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-20 01:53:39] [INFO ] Deduced a trap composed of 5 places in 233 ms of which 1 ms to minimize.
[2023-03-20 01:53:39] [INFO ] Deduced a trap composed of 9 places in 234 ms of which 1 ms to minimize.
[2023-03-20 01:53:39] [INFO ] Deduced a trap composed of 7 places in 233 ms of which 0 ms to minimize.
[2023-03-20 01:53:40] [INFO ] Deduced a trap composed of 5 places in 228 ms of which 1 ms to minimize.
[2023-03-20 01:53:40] [INFO ] Deduced a trap composed of 6 places in 186 ms of which 1 ms to minimize.
[2023-03-20 01:53:40] [INFO ] Deduced a trap composed of 9 places in 210 ms of which 0 ms to minimize.
[2023-03-20 01:53:40] [INFO ] Deduced a trap composed of 5 places in 206 ms of which 0 ms to minimize.
[2023-03-20 01:53:41] [INFO ] Deduced a trap composed of 10 places in 189 ms of which 0 ms to minimize.
[2023-03-20 01:53:41] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 0 ms to minimize.
[2023-03-20 01:53:41] [INFO ] Deduced a trap composed of 7 places in 372 ms of which 1 ms to minimize.
[2023-03-20 01:53:42] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 13 ms to minimize.
[2023-03-20 01:53:42] [INFO ] Deduced a trap composed of 6 places in 161 ms of which 0 ms to minimize.
[2023-03-20 01:53:42] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 1 ms to minimize.
[2023-03-20 01:53:42] [INFO ] Deduced a trap composed of 6 places in 169 ms of which 0 ms to minimize.
[2023-03-20 01:53:43] [INFO ] Deduced a trap composed of 6 places in 173 ms of which 0 ms to minimize.
[2023-03-20 01:53:43] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 1 ms to minimize.
[2023-03-20 01:53:43] [INFO ] Deduced a trap composed of 6 places in 175 ms of which 1 ms to minimize.
[2023-03-20 01:53:43] [INFO ] Deduced a trap composed of 6 places in 277 ms of which 1 ms to minimize.
[2023-03-20 01:53:44] [INFO ] Deduced a trap composed of 6 places in 156 ms of which 0 ms to minimize.
[2023-03-20 01:53:44] [INFO ] Deduced a trap composed of 7 places in 233 ms of which 1 ms to minimize.
[2023-03-20 01:53:44] [INFO ] Deduced a trap composed of 11 places in 210 ms of which 1 ms to minimize.
[2023-03-20 01:53:44] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 1 ms to minimize.
[2023-03-20 01:53:45] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 15 ms to minimize.
[2023-03-20 01:53:45] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 0 ms to minimize.
[2023-03-20 01:53:45] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 0 ms to minimize.
[2023-03-20 01:53:45] [INFO ] Deduced a trap composed of 7 places in 255 ms of which 2 ms to minimize.
[2023-03-20 01:53:46] [INFO ] Deduced a trap composed of 6 places in 278 ms of which 0 ms to minimize.
[2023-03-20 01:53:46] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 0 ms to minimize.
[2023-03-20 01:53:46] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 0 ms to minimize.
[2023-03-20 01:53:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 29 trap constraints in 7490 ms
[2023-03-20 01:53:46] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 0 ms to minimize.
[2023-03-20 01:53:46] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 1 ms to minimize.
[2023-03-20 01:53:47] [INFO ] Deduced a trap composed of 6 places in 213 ms of which 1 ms to minimize.
[2023-03-20 01:53:47] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 1 ms to minimize.
[2023-03-20 01:53:47] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 14 ms to minimize.
[2023-03-20 01:53:47] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 1 ms to minimize.
[2023-03-20 01:53:48] [INFO ] Deduced a trap composed of 7 places in 248 ms of which 0 ms to minimize.
[2023-03-20 01:53:48] [INFO ] Deduced a trap composed of 8 places in 167 ms of which 0 ms to minimize.
[2023-03-20 01:53:48] [INFO ] Deduced a trap composed of 9 places in 170 ms of which 0 ms to minimize.
[2023-03-20 01:53:48] [INFO ] Deduced a trap composed of 8 places in 268 ms of which 1 ms to minimize.
[2023-03-20 01:53:49] [INFO ] Deduced a trap composed of 10 places in 198 ms of which 1 ms to minimize.
[2023-03-20 01:53:49] [INFO ] Deduced a trap composed of 6 places in 175 ms of which 14 ms to minimize.
[2023-03-20 01:53:49] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
[2023-03-20 01:53:49] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3029 ms
[2023-03-20 01:53:50] [INFO ] After 12219ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 508 ms.
[2023-03-20 01:53:50] [INFO ] After 13503ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 395 ms.
Support contains 7 out of 1567 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1567/1567 places, 1317/1317 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1567 transition count 1316
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1566 transition count 1316
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 1566 transition count 1315
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1565 transition count 1315
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 20 place count 1557 transition count 1307
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 25 place count 1557 transition count 1307
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 1555 transition count 1305
Applied a total of 27 rules in 243 ms. Remains 1555 /1567 variables (removed 12) and now considering 1305/1317 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 243 ms. Remains : 1555/1567 places, 1305/1317 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 339 ms. (steps per millisecond=29 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1305 rows 1555 cols
[2023-03-20 01:53:51] [INFO ] Computed 551 place invariants in 33 ms
[2023-03-20 01:53:52] [INFO ] After 228ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 01:53:52] [INFO ] [Nat]Absence check using 526 positive place invariants in 125 ms returned sat
[2023-03-20 01:53:52] [INFO ] [Nat]Absence check using 526 positive and 25 generalized place invariants in 11 ms returned sat
[2023-03-20 01:53:53] [INFO ] After 1064ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 01:53:54] [INFO ] Deduced a trap composed of 8 places in 358 ms of which 0 ms to minimize.
[2023-03-20 01:53:54] [INFO ] Deduced a trap composed of 6 places in 241 ms of which 1 ms to minimize.
[2023-03-20 01:53:54] [INFO ] Deduced a trap composed of 6 places in 180 ms of which 1 ms to minimize.
[2023-03-20 01:53:55] [INFO ] Deduced a trap composed of 6 places in 182 ms of which 1 ms to minimize.
[2023-03-20 01:53:55] [INFO ] Deduced a trap composed of 8 places in 168 ms of which 1 ms to minimize.
[2023-03-20 01:53:55] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 0 ms to minimize.
[2023-03-20 01:53:55] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 1 ms to minimize.
[2023-03-20 01:53:56] [INFO ] Deduced a trap composed of 6 places in 207 ms of which 14 ms to minimize.
[2023-03-20 01:53:56] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 13 ms to minimize.
[2023-03-20 01:53:56] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2620 ms
[2023-03-20 01:53:56] [INFO ] After 4178ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 415 ms.
[2023-03-20 01:53:57] [INFO ] After 5198ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 175 ms.
Support contains 5 out of 1555 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1555/1555 places, 1305/1305 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1554 transition count 1304
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 1554 transition count 1304
Applied a total of 3 rules in 194 ms. Remains 1554 /1555 variables (removed 1) and now considering 1304/1305 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 194 ms. Remains : 1554/1555 places, 1304/1305 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1304 rows 1554 cols
[2023-03-20 01:53:58] [INFO ] Computed 551 place invariants in 8 ms
[2023-03-20 01:53:58] [INFO ] After 286ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 01:53:58] [INFO ] [Nat]Absence check using 524 positive place invariants in 153 ms returned sat
[2023-03-20 01:53:58] [INFO ] [Nat]Absence check using 524 positive and 27 generalized place invariants in 43 ms returned sat
[2023-03-20 01:53:59] [INFO ] After 922ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 01:54:00] [INFO ] Deduced a trap composed of 6 places in 232 ms of which 0 ms to minimize.
[2023-03-20 01:54:00] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 0 ms to minimize.
[2023-03-20 01:54:00] [INFO ] Deduced a trap composed of 6 places in 149 ms of which 0 ms to minimize.
[2023-03-20 01:54:00] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 0 ms to minimize.
[2023-03-20 01:54:01] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 0 ms to minimize.
[2023-03-20 01:54:01] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 0 ms to minimize.
[2023-03-20 01:54:01] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 1 ms to minimize.
[2023-03-20 01:54:01] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 0 ms to minimize.
[2023-03-20 01:54:02] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 0 ms to minimize.
[2023-03-20 01:54:02] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 1 ms to minimize.
[2023-03-20 01:54:02] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 0 ms to minimize.
[2023-03-20 01:54:02] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 0 ms to minimize.
[2023-03-20 01:54:02] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2023-03-20 01:54:03] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 0 ms to minimize.
[2023-03-20 01:54:03] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3113 ms
[2023-03-20 01:54:03] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 1 ms to minimize.
[2023-03-20 01:54:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 327 ms
[2023-03-20 01:54:03] [INFO ] After 4665ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 227 ms.
[2023-03-20 01:54:03] [INFO ] After 5464ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 163 ms.
Support contains 4 out of 1554 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1554/1554 places, 1304/1304 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1554 transition count 1303
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1553 transition count 1303
Applied a total of 2 rules in 63 ms. Remains 1553 /1554 variables (removed 1) and now considering 1303/1304 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 1553/1554 places, 1303/1304 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1303 rows 1553 cols
[2023-03-20 01:54:04] [INFO ] Computed 551 place invariants in 8 ms
[2023-03-20 01:54:04] [INFO ] After 269ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:54:04] [INFO ] [Nat]Absence check using 521 positive place invariants in 98 ms returned sat
[2023-03-20 01:54:04] [INFO ] [Nat]Absence check using 521 positive and 30 generalized place invariants in 12 ms returned sat
[2023-03-20 01:54:05] [INFO ] After 781ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:54:06] [INFO ] Deduced a trap composed of 5 places in 258 ms of which 1 ms to minimize.
[2023-03-20 01:54:06] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 1 ms to minimize.
[2023-03-20 01:54:06] [INFO ] Deduced a trap composed of 5 places in 228 ms of which 2 ms to minimize.
[2023-03-20 01:54:07] [INFO ] Deduced a trap composed of 6 places in 251 ms of which 1 ms to minimize.
[2023-03-20 01:54:07] [INFO ] Deduced a trap composed of 5 places in 145 ms of which 1 ms to minimize.
[2023-03-20 01:54:07] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 1 ms to minimize.
[2023-03-20 01:54:07] [INFO ] Deduced a trap composed of 8 places in 156 ms of which 0 ms to minimize.
[2023-03-20 01:54:07] [INFO ] Deduced a trap composed of 6 places in 214 ms of which 0 ms to minimize.
[2023-03-20 01:54:08] [INFO ] Deduced a trap composed of 8 places in 249 ms of which 1 ms to minimize.
[2023-03-20 01:54:08] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 0 ms to minimize.
[2023-03-20 01:54:08] [INFO ] Deduced a trap composed of 11 places in 257 ms of which 0 ms to minimize.
[2023-03-20 01:54:09] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 1 ms to minimize.
[2023-03-20 01:54:09] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 1 ms to minimize.
[2023-03-20 01:54:09] [INFO ] Deduced a trap composed of 12 places in 193 ms of which 0 ms to minimize.
[2023-03-20 01:54:09] [INFO ] Deduced a trap composed of 6 places in 260 ms of which 0 ms to minimize.
[2023-03-20 01:54:10] [INFO ] Deduced a trap composed of 6 places in 196 ms of which 1 ms to minimize.
[2023-03-20 01:54:10] [INFO ] Deduced a trap composed of 6 places in 156 ms of which 0 ms to minimize.
[2023-03-20 01:54:10] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 0 ms to minimize.
[2023-03-20 01:54:10] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 1 ms to minimize.
[2023-03-20 01:54:11] [INFO ] Deduced a trap composed of 6 places in 176 ms of which 1 ms to minimize.
[2023-03-20 01:54:11] [INFO ] Deduced a trap composed of 6 places in 174 ms of which 0 ms to minimize.
[2023-03-20 01:54:11] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 1 ms to minimize.
[2023-03-20 01:54:11] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 1 ms to minimize.
[2023-03-20 01:54:11] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 0 ms to minimize.
[2023-03-20 01:54:12] [INFO ] Deduced a trap composed of 9 places in 169 ms of which 1 ms to minimize.
[2023-03-20 01:54:12] [INFO ] Deduced a trap composed of 6 places in 215 ms of which 0 ms to minimize.
[2023-03-20 01:54:12] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 1 ms to minimize.
[2023-03-20 01:54:12] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 1 ms to minimize.
[2023-03-20 01:54:13] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 0 ms to minimize.
[2023-03-20 01:54:13] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 1 ms to minimize.
[2023-03-20 01:54:13] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 1 ms to minimize.
[2023-03-20 01:54:13] [INFO ] Deduced a trap composed of 16 places in 159 ms of which 1 ms to minimize.
[2023-03-20 01:54:14] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 1 ms to minimize.
[2023-03-20 01:54:14] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 1 ms to minimize.
[2023-03-20 01:54:14] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 0 ms to minimize.
[2023-03-20 01:54:14] [INFO ] Deduced a trap composed of 6 places in 229 ms of which 0 ms to minimize.
[2023-03-20 01:54:14] [INFO ] Deduced a trap composed of 6 places in 171 ms of which 13 ms to minimize.
[2023-03-20 01:54:15] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 0 ms to minimize.
[2023-03-20 01:54:15] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 0 ms to minimize.
[2023-03-20 01:54:15] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 0 ms to minimize.
[2023-03-20 01:54:15] [INFO ] Deduced a trap composed of 8 places in 131 ms of which 0 ms to minimize.
[2023-03-20 01:54:16] [INFO ] Deduced a trap composed of 5 places in 255 ms of which 0 ms to minimize.
[2023-03-20 01:54:16] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 0 ms to minimize.
[2023-03-20 01:54:16] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 1 ms to minimize.
[2023-03-20 01:54:16] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 1 ms to minimize.
[2023-03-20 01:54:17] [INFO ] Deduced a trap composed of 6 places in 204 ms of which 1 ms to minimize.
[2023-03-20 01:54:17] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 1 ms to minimize.
[2023-03-20 01:54:17] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 0 ms to minimize.
[2023-03-20 01:54:17] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 0 ms to minimize.
[2023-03-20 01:54:17] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 0 ms to minimize.
[2023-03-20 01:54:17] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 0 ms to minimize.
[2023-03-20 01:54:18] [INFO ] Deduced a trap composed of 6 places in 150 ms of which 0 ms to minimize.
[2023-03-20 01:54:18] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 1 ms to minimize.
[2023-03-20 01:54:18] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 0 ms to minimize.
[2023-03-20 01:54:18] [INFO ] Trap strengthening (SAT) tested/added 55/54 trap constraints in 12890 ms
[2023-03-20 01:54:18] [INFO ] After 13734ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 89 ms.
[2023-03-20 01:54:18] [INFO ] After 14141ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 35 ms.
Support contains 2 out of 1553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1553/1553 places, 1303/1303 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1553 transition count 1302
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1552 transition count 1302
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1551 transition count 1301
Applied a total of 4 rules in 148 ms. Remains 1551 /1553 variables (removed 2) and now considering 1301/1303 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 1551/1553 places, 1301/1303 transitions.
Finished random walk after 2578 steps, including 0 resets, run visited all 1 properties in 43 ms. (steps per millisecond=59 )
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
FORMULA ShieldPPPs-PT-050B-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 604 stabilizing places and 604 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' '!(X(F((p0||(p1 U G(p2))))))'
Support contains 3 out of 3060 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3053 transition count 2803
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3053 transition count 2803
Applied a total of 14 rules in 454 ms. Remains 3053 /3060 variables (removed 7) and now considering 2803/2810 (removed 7) transitions.
// Phase 1: matrix 2803 rows 3053 cols
[2023-03-20 01:54:20] [INFO ] Computed 551 place invariants in 25 ms
[2023-03-20 01:54:21] [INFO ] Implicit Places using invariants in 1190 ms returned []
[2023-03-20 01:54:21] [INFO ] Invariant cache hit.
[2023-03-20 01:54:22] [INFO ] Implicit Places using invariants and state equation in 1306 ms returned []
Implicit Place search using SMT with State Equation took 2500 ms to find 0 implicit places.
[2023-03-20 01:54:22] [INFO ] Invariant cache hit.
[2023-03-20 01:54:24] [INFO ] Dead Transitions using invariants and state equation in 1575 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3053/3060 places, 2803/2810 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4531 ms. Remains : 3053/3060 places, 2803/2810 transitions.
Stuttering acceptance computed with spot in 330 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s2081 1), p2:(AND (EQ s1941 1) (EQ s1971 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 7837 steps with 0 reset in 147 ms.
FORMULA ShieldPPPs-PT-050B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-LTLFireability-00 finished in 5111 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(p0)||(p1&&X(p1))))&&X(G(p2))))'
Support contains 4 out of 3060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3054 transition count 2804
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3054 transition count 2804
Applied a total of 12 rules in 514 ms. Remains 3054 /3060 variables (removed 6) and now considering 2804/2810 (removed 6) transitions.
// Phase 1: matrix 2804 rows 3054 cols
[2023-03-20 01:54:25] [INFO ] Computed 551 place invariants in 14 ms
[2023-03-20 01:54:27] [INFO ] Implicit Places using invariants in 1582 ms returned []
[2023-03-20 01:54:27] [INFO ] Invariant cache hit.
[2023-03-20 01:54:31] [INFO ] Implicit Places using invariants and state equation in 3977 ms returned []
Implicit Place search using SMT with State Equation took 5562 ms to find 0 implicit places.
[2023-03-20 01:54:31] [INFO ] Invariant cache hit.
[2023-03-20 01:54:33] [INFO ] Dead Transitions using invariants and state equation in 2021 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3054/3060 places, 2804/2810 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8101 ms. Remains : 3054/3060 places, 2804/2810 transitions.
Stuttering acceptance computed with spot in 361 ms :[(NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), true, (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=1 dest: 2}, { cond=(NOT p2), acceptance={0} source=1 dest: 3}], [{ cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 2}]], initial=4, aps=[p2:(OR (EQ s364 0) (EQ s394 0)), p0:(EQ s813 1), p1:(EQ s1058 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6245 steps with 0 reset in 110 ms.
FORMULA ShieldPPPs-PT-050B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-LTLFireability-01 finished in 8619 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)))'
Support contains 2 out of 3060 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 351 transitions
Trivial Post-agglo rules discarded 351 transitions
Performed 351 trivial Post agglomeration. Transition count delta: 351
Iterating post reduction 0 with 351 rules applied. Total rules applied 351 place count 3059 transition count 2458
Reduce places removed 351 places and 0 transitions.
Iterating post reduction 1 with 351 rules applied. Total rules applied 702 place count 2708 transition count 2458
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 702 place count 2708 transition count 2208
Deduced a syphon composed of 250 places in 7 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 1202 place count 2458 transition count 2208
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 1210 place count 2450 transition count 2200
Iterating global reduction 2 with 8 rules applied. Total rules applied 1218 place count 2450 transition count 2200
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1218 place count 2450 transition count 2196
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1226 place count 2446 transition count 2196
Performed 892 Post agglomeration using F-continuation condition.Transition count delta: 892
Deduced a syphon composed of 892 places in 1 ms
Reduce places removed 892 places and 0 transitions.
Iterating global reduction 2 with 1784 rules applied. Total rules applied 3010 place count 1554 transition count 1304
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 3012 place count 1552 transition count 1302
Applied a total of 3012 rules in 687 ms. Remains 1552 /3060 variables (removed 1508) and now considering 1302/2810 (removed 1508) transitions.
// Phase 1: matrix 1302 rows 1552 cols
[2023-03-20 01:54:34] [INFO ] Computed 551 place invariants in 6 ms
[2023-03-20 01:54:34] [INFO ] Implicit Places using invariants in 766 ms returned []
[2023-03-20 01:54:34] [INFO ] Invariant cache hit.
[2023-03-20 01:54:36] [INFO ] Implicit Places using invariants and state equation in 1954 ms returned []
Implicit Place search using SMT with State Equation took 2721 ms to find 0 implicit places.
[2023-03-20 01:54:37] [INFO ] Redundant transitions in 75 ms returned []
[2023-03-20 01:54:37] [INFO ] Invariant cache hit.
[2023-03-20 01:54:37] [INFO ] Dead Transitions using invariants and state equation in 836 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1552/3060 places, 1302/2810 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4330 ms. Remains : 1552/3060 places, 1302/2810 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s1344 0) (EQ s1357 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 179 reset in 1029 ms.
Product exploration explored 100000 steps with 164 reset in 1332 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 174 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Finished random walk after 634 steps, including 0 resets, run visited all 1 properties in 19 ms. (steps per millisecond=33 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 195 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1552/1552 places, 1302/1302 transitions.
Applied a total of 0 rules in 99 ms. Remains 1552 /1552 variables (removed 0) and now considering 1302/1302 (removed 0) transitions.
[2023-03-20 01:54:41] [INFO ] Invariant cache hit.
[2023-03-20 01:54:41] [INFO ] Implicit Places using invariants in 814 ms returned []
[2023-03-20 01:54:41] [INFO ] Invariant cache hit.
[2023-03-20 01:54:43] [INFO ] Implicit Places using invariants and state equation in 1832 ms returned []
Implicit Place search using SMT with State Equation took 2651 ms to find 0 implicit places.
[2023-03-20 01:54:43] [INFO ] Redundant transitions in 71 ms returned []
[2023-03-20 01:54:43] [INFO ] Invariant cache hit.
[2023-03-20 01:54:44] [INFO ] Dead Transitions using invariants and state equation in 817 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3659 ms. Remains : 1552/1552 places, 1302/1302 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Finished random walk after 455 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=75 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 151 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 197 reset in 916 ms.
Product exploration explored 100000 steps with 153 reset in 1066 ms.
Support contains 2 out of 1552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1552/1552 places, 1302/1302 transitions.
Applied a total of 0 rules in 52 ms. Remains 1552 /1552 variables (removed 0) and now considering 1302/1302 (removed 0) transitions.
[2023-03-20 01:54:47] [INFO ] Invariant cache hit.
[2023-03-20 01:54:48] [INFO ] Implicit Places using invariants in 893 ms returned []
[2023-03-20 01:54:48] [INFO ] Invariant cache hit.
[2023-03-20 01:54:50] [INFO ] Implicit Places using invariants and state equation in 1961 ms returned []
Implicit Place search using SMT with State Equation took 2856 ms to find 0 implicit places.
[2023-03-20 01:54:50] [INFO ] Redundant transitions in 43 ms returned []
[2023-03-20 01:54:50] [INFO ] Invariant cache hit.
[2023-03-20 01:54:51] [INFO ] Dead Transitions using invariants and state equation in 767 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3724 ms. Remains : 1552/1552 places, 1302/1302 transitions.
Treatment of property ShieldPPPs-PT-050B-LTLFireability-02 finished in 17969 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0 U ((p1 U p2)||G(p3)))))))'
Support contains 5 out of 3060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3052 transition count 2802
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3052 transition count 2802
Applied a total of 16 rules in 504 ms. Remains 3052 /3060 variables (removed 8) and now considering 2802/2810 (removed 8) transitions.
// Phase 1: matrix 2802 rows 3052 cols
[2023-03-20 01:54:52] [INFO ] Computed 551 place invariants in 17 ms
[2023-03-20 01:54:53] [INFO ] Implicit Places using invariants in 1262 ms returned []
[2023-03-20 01:54:53] [INFO ] Invariant cache hit.
[2023-03-20 01:54:57] [INFO ] Implicit Places using invariants and state equation in 3899 ms returned []
Implicit Place search using SMT with State Equation took 5168 ms to find 0 implicit places.
[2023-03-20 01:54:57] [INFO ] Invariant cache hit.
[2023-03-20 01:54:59] [INFO ] Dead Transitions using invariants and state equation in 2274 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3052/3060 places, 2802/2810 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7960 ms. Remains : 3052/3060 places, 2802/2810 transitions.
Stuttering acceptance computed with spot in 329 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (NOT p2), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR p2 p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p3) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p3 (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) p1 p3 (NOT p0)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={} source=2 dest: 7}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 3}, { cond=p3, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p2) p1 p3), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p3) (NOT p0)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p3 (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p2) p1 p3 (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) p3 p0), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p2:(NEQ s350 1), p1:(EQ s2750 1), p0:(AND (EQ s2948 1) (EQ s2950 1)), p3:(NEQ s1303 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 37520 steps with 4 reset in 446 ms.
FORMULA ShieldPPPs-PT-050B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-LTLFireability-03 finished in 8777 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p0)||(p0 U p1)))))'
Support contains 3 out of 3060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 3054 transition count 2804
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 3054 transition count 2804
Applied a total of 12 rules in 517 ms. Remains 3054 /3060 variables (removed 6) and now considering 2804/2810 (removed 6) transitions.
// Phase 1: matrix 2804 rows 3054 cols
[2023-03-20 01:55:00] [INFO ] Computed 551 place invariants in 20 ms
[2023-03-20 01:55:02] [INFO ] Implicit Places using invariants in 1401 ms returned []
[2023-03-20 01:55:02] [INFO ] Invariant cache hit.
[2023-03-20 01:55:05] [INFO ] Implicit Places using invariants and state equation in 3774 ms returned []
Implicit Place search using SMT with State Equation took 5194 ms to find 0 implicit places.
[2023-03-20 01:55:06] [INFO ] Invariant cache hit.
[2023-03-20 01:55:08] [INFO ] Dead Transitions using invariants and state equation in 2679 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3054/3060 places, 2804/2810 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8391 ms. Remains : 3054/3060 places, 2804/2810 transitions.
Stuttering acceptance computed with spot in 238 ms :[true, (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=3, aps=[p0:(EQ s2514 1), p1:(OR (EQ s2012 1) (EQ s2324 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-050B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-LTLFireability-04 finished in 8686 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)))'
Support contains 2 out of 3060 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 352 transitions
Trivial Post-agglo rules discarded 352 transitions
Performed 352 trivial Post agglomeration. Transition count delta: 352
Iterating post reduction 0 with 352 rules applied. Total rules applied 352 place count 3059 transition count 2457
Reduce places removed 352 places and 0 transitions.
Iterating post reduction 1 with 352 rules applied. Total rules applied 704 place count 2707 transition count 2457
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 704 place count 2707 transition count 2207
Deduced a syphon composed of 250 places in 9 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 1204 place count 2457 transition count 2207
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 1212 place count 2449 transition count 2199
Iterating global reduction 2 with 8 rules applied. Total rules applied 1220 place count 2449 transition count 2199
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1220 place count 2449 transition count 2195
Deduced a syphon composed of 4 places in 6 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1228 place count 2445 transition count 2195
Performed 892 Post agglomeration using F-continuation condition.Transition count delta: 892
Deduced a syphon composed of 892 places in 2 ms
Reduce places removed 892 places and 0 transitions.
Iterating global reduction 2 with 1784 rules applied. Total rules applied 3012 place count 1553 transition count 1303
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 3014 place count 1551 transition count 1301
Applied a total of 3014 rules in 704 ms. Remains 1551 /3060 variables (removed 1509) and now considering 1301/2810 (removed 1509) transitions.
// Phase 1: matrix 1301 rows 1551 cols
[2023-03-20 01:55:09] [INFO ] Computed 551 place invariants in 6 ms
[2023-03-20 01:55:10] [INFO ] Implicit Places using invariants in 717 ms returned []
[2023-03-20 01:55:10] [INFO ] Invariant cache hit.
[2023-03-20 01:55:12] [INFO ] Implicit Places using invariants and state equation in 2032 ms returned []
Implicit Place search using SMT with State Equation took 2751 ms to find 0 implicit places.
[2023-03-20 01:55:12] [INFO ] Redundant transitions in 46 ms returned []
[2023-03-20 01:55:12] [INFO ] Invariant cache hit.
[2023-03-20 01:55:13] [INFO ] Dead Transitions using invariants and state equation in 768 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1551/3060 places, 1301/2810 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4277 ms. Remains : 1551/3060 places, 1301/2810 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s192 0) (EQ s209 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 31 reset in 1113 ms.
Product exploration explored 100000 steps with 32 reset in 1348 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 179 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2887 steps, including 0 resets, run visited all 1 properties in 63 ms. (steps per millisecond=45 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 243 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 94 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2023-03-20 01:55:16] [INFO ] Invariant cache hit.
[2023-03-20 01:55:17] [INFO ] Implicit Places using invariants in 1025 ms returned []
[2023-03-20 01:55:17] [INFO ] Invariant cache hit.
[2023-03-20 01:55:19] [INFO ] Implicit Places using invariants and state equation in 2048 ms returned []
Implicit Place search using SMT with State Equation took 3088 ms to find 0 implicit places.
[2023-03-20 01:55:19] [INFO ] Redundant transitions in 42 ms returned []
[2023-03-20 01:55:19] [INFO ] Invariant cache hit.
[2023-03-20 01:55:20] [INFO ] Dead Transitions using invariants and state equation in 882 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4113 ms. Remains : 1551/1551 places, 1301/1301 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 161 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2667 steps, including 0 resets, run visited all 1 properties in 73 ms. (steps per millisecond=36 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 215 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 32 reset in 1170 ms.
Product exploration explored 100000 steps with 31 reset in 1369 ms.
Support contains 2 out of 1551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1551/1551 places, 1301/1301 transitions.
Applied a total of 0 rules in 55 ms. Remains 1551 /1551 variables (removed 0) and now considering 1301/1301 (removed 0) transitions.
[2023-03-20 01:55:24] [INFO ] Invariant cache hit.
[2023-03-20 01:55:25] [INFO ] Implicit Places using invariants in 773 ms returned []
[2023-03-20 01:55:25] [INFO ] Invariant cache hit.
[2023-03-20 01:55:27] [INFO ] Implicit Places using invariants and state equation in 2168 ms returned []
Implicit Place search using SMT with State Equation took 2946 ms to find 0 implicit places.
[2023-03-20 01:55:27] [INFO ] Redundant transitions in 42 ms returned []
[2023-03-20 01:55:27] [INFO ] Invariant cache hit.
[2023-03-20 01:55:28] [INFO ] Dead Transitions using invariants and state equation in 873 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3924 ms. Remains : 1551/1551 places, 1301/1301 transitions.
Treatment of property ShieldPPPs-PT-050B-LTLFireability-05 finished in 19507 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 4 out of 3060 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 3059 transition count 2459
Reduce places removed 350 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 351 rules applied. Total rules applied 701 place count 2709 transition count 2458
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 702 place count 2708 transition count 2458
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 250 Pre rules applied. Total rules applied 702 place count 2708 transition count 2208
Deduced a syphon composed of 250 places in 6 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 3 with 500 rules applied. Total rules applied 1202 place count 2458 transition count 2208
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1210 place count 2450 transition count 2200
Iterating global reduction 3 with 8 rules applied. Total rules applied 1218 place count 2450 transition count 2200
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 1218 place count 2450 transition count 2196
Deduced a syphon composed of 4 places in 7 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 1226 place count 2446 transition count 2196
Performed 892 Post agglomeration using F-continuation condition.Transition count delta: 892
Deduced a syphon composed of 892 places in 2 ms
Reduce places removed 892 places and 0 transitions.
Iterating global reduction 3 with 1784 rules applied. Total rules applied 3010 place count 1554 transition count 1304
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3012 place count 1552 transition count 1302
Applied a total of 3012 rules in 626 ms. Remains 1552 /3060 variables (removed 1508) and now considering 1302/2810 (removed 1508) transitions.
// Phase 1: matrix 1302 rows 1552 cols
[2023-03-20 01:55:29] [INFO ] Computed 551 place invariants in 5 ms
[2023-03-20 01:55:29] [INFO ] Implicit Places using invariants in 725 ms returned []
[2023-03-20 01:55:29] [INFO ] Invariant cache hit.
[2023-03-20 01:55:31] [INFO ] Implicit Places using invariants and state equation in 1952 ms returned []
Implicit Place search using SMT with State Equation took 2678 ms to find 0 implicit places.
[2023-03-20 01:55:31] [INFO ] Redundant transitions in 44 ms returned []
[2023-03-20 01:55:31] [INFO ] Invariant cache hit.
[2023-03-20 01:55:32] [INFO ] Dead Transitions using invariants and state equation in 746 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1552/3060 places, 1302/2810 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4101 ms. Remains : 1552/3060 places, 1302/2810 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (EQ s538 1) (EQ s551 1)) (AND (EQ s659 1) (EQ s661 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 3360 steps with 0 reset in 46 ms.
FORMULA ShieldPPPs-PT-050B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-LTLFireability-06 finished in 4195 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 3060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3052 transition count 2802
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3052 transition count 2802
Applied a total of 16 rules in 403 ms. Remains 3052 /3060 variables (removed 8) and now considering 2802/2810 (removed 8) transitions.
// Phase 1: matrix 2802 rows 3052 cols
[2023-03-20 01:55:33] [INFO ] Computed 551 place invariants in 17 ms
[2023-03-20 01:55:34] [INFO ] Implicit Places using invariants in 1574 ms returned []
[2023-03-20 01:55:34] [INFO ] Invariant cache hit.
[2023-03-20 01:55:38] [INFO ] Implicit Places using invariants and state equation in 3989 ms returned []
Implicit Place search using SMT with State Equation took 5565 ms to find 0 implicit places.
[2023-03-20 01:55:38] [INFO ] Invariant cache hit.
[2023-03-20 01:55:41] [INFO ] Dead Transitions using invariants and state equation in 2845 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3052/3060 places, 2802/2810 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8831 ms. Remains : 3052/3060 places, 2802/2810 transitions.
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s1018 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 721 steps with 0 reset in 5 ms.
FORMULA ShieldPPPs-PT-050B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-LTLFireability-07 finished in 9042 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(p1)))'
Support contains 5 out of 3060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3052 transition count 2802
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3052 transition count 2802
Applied a total of 16 rules in 477 ms. Remains 3052 /3060 variables (removed 8) and now considering 2802/2810 (removed 8) transitions.
[2023-03-20 01:55:42] [INFO ] Invariant cache hit.
[2023-03-20 01:55:43] [INFO ] Implicit Places using invariants in 1486 ms returned []
[2023-03-20 01:55:43] [INFO ] Invariant cache hit.
[2023-03-20 01:55:47] [INFO ] Implicit Places using invariants and state equation in 3838 ms returned []
Implicit Place search using SMT with State Equation took 5335 ms to find 0 implicit places.
[2023-03-20 01:55:47] [INFO ] Invariant cache hit.
[2023-03-20 01:55:49] [INFO ] Dead Transitions using invariants and state equation in 2413 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3052/3060 places, 2802/2810 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8248 ms. Remains : 3052/3060 places, 2802/2810 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (OR (EQ s2594 0) (EQ s2609 0)) (EQ s1770 0)), p0:(OR (EQ s189 0) (EQ s221 0))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1726 ms.
Product exploration explored 100000 steps with 50000 reset in 1666 ms.
Computed a total of 599 stabilizing places and 599 stable transitions
Computed a total of 599 stabilizing places and 599 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), true, (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 188 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-050B-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-050B-LTLFireability-09 finished in 12089 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||((p1 U (p2||G(p3)))&&X(X(F(p2))))))'
Support contains 7 out of 3060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3052 transition count 2802
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3052 transition count 2802
Applied a total of 16 rules in 495 ms. Remains 3052 /3060 variables (removed 8) and now considering 2802/2810 (removed 8) transitions.
[2023-03-20 01:55:54] [INFO ] Invariant cache hit.
[2023-03-20 01:55:55] [INFO ] Implicit Places using invariants in 1224 ms returned []
[2023-03-20 01:55:55] [INFO ] Invariant cache hit.
[2023-03-20 01:55:59] [INFO ] Implicit Places using invariants and state equation in 3531 ms returned []
Implicit Place search using SMT with State Equation took 4757 ms to find 0 implicit places.
[2023-03-20 01:55:59] [INFO ] Invariant cache hit.
[2023-03-20 01:56:01] [INFO ] Dead Transitions using invariants and state equation in 2525 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3052/3060 places, 2802/2810 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7781 ms. Remains : 3052/3060 places, 2802/2810 transitions.
Stuttering acceptance computed with spot in 556 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p0)), true, (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(OR p2 p3 p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p3 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) p3 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 7}], [{ cond=(NOT p0), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND p3 (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p3), acceptance={} source=6 dest: 5}, { cond=p3, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p2) p3 (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) p3 p1), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p2) (NOT p3) p1), acceptance={0} source=7 dest: 7}], [{ cond=(NOT p2), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p2:(AND (EQ s1218 1) (EQ s1298 1)), p3:(NEQ s199 1), p1:(AND (EQ s2884 1) (EQ s2914 1)), p0:(AND (EQ s2227 1) (EQ s2251 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11019 steps with 1 reset in 140 ms.
FORMULA ShieldPPPs-PT-050B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-LTLFireability-10 finished in 8547 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 3060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3052 transition count 2802
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3052 transition count 2802
Applied a total of 16 rules in 515 ms. Remains 3052 /3060 variables (removed 8) and now considering 2802/2810 (removed 8) transitions.
[2023-03-20 01:56:02] [INFO ] Invariant cache hit.
[2023-03-20 01:56:04] [INFO ] Implicit Places using invariants in 1164 ms returned []
[2023-03-20 01:56:04] [INFO ] Invariant cache hit.
[2023-03-20 01:56:07] [INFO ] Implicit Places using invariants and state equation in 3452 ms returned []
Implicit Place search using SMT with State Equation took 4618 ms to find 0 implicit places.
[2023-03-20 01:56:07] [INFO ] Invariant cache hit.
[2023-03-20 01:56:09] [INFO ] Dead Transitions using invariants and state equation in 2449 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3052/3060 places, 2802/2810 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7583 ms. Remains : 3052/3060 places, 2802/2810 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s1149 1) (EQ s1181 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 13114 steps with 1 reset in 209 ms.
FORMULA ShieldPPPs-PT-050B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-LTLFireability-11 finished in 8008 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p1)&&F(p2)&&p0)))'
Support contains 3 out of 3060 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 3059 transition count 2459
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 2709 transition count 2459
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 700 place count 2709 transition count 2209
Deduced a syphon composed of 250 places in 11 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 1200 place count 2459 transition count 2209
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 1208 place count 2451 transition count 2201
Iterating global reduction 2 with 8 rules applied. Total rules applied 1216 place count 2451 transition count 2201
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1216 place count 2451 transition count 2197
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1224 place count 2447 transition count 2197
Performed 891 Post agglomeration using F-continuation condition.Transition count delta: 891
Deduced a syphon composed of 891 places in 1 ms
Reduce places removed 891 places and 0 transitions.
Iterating global reduction 2 with 1782 rules applied. Total rules applied 3006 place count 1556 transition count 1306
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 3008 place count 1554 transition count 1304
Applied a total of 3008 rules in 683 ms. Remains 1554 /3060 variables (removed 1506) and now considering 1304/2810 (removed 1506) transitions.
// Phase 1: matrix 1304 rows 1554 cols
[2023-03-20 01:56:11] [INFO ] Computed 551 place invariants in 5 ms
[2023-03-20 01:56:11] [INFO ] Implicit Places using invariants in 863 ms returned []
[2023-03-20 01:56:11] [INFO ] Invariant cache hit.
[2023-03-20 01:56:13] [INFO ] Implicit Places using invariants and state equation in 2072 ms returned []
Implicit Place search using SMT with State Equation took 2938 ms to find 0 implicit places.
[2023-03-20 01:56:14] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-20 01:56:14] [INFO ] Invariant cache hit.
[2023-03-20 01:56:15] [INFO ] Dead Transitions using invariants and state equation in 1058 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1554/3060 places, 1304/2810 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4750 ms. Remains : 1554/3060 places, 1304/2810 transitions.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s47 1) (EQ s65 1)), p1:(EQ s1214 1), p2:(AND (EQ s47 1) (EQ s65 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 3239 steps with 0 reset in 67 ms.
FORMULA ShieldPPPs-PT-050B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-050B-LTLFireability-12 finished in 5004 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((!p0&&X(F(p1)))||(p2&&X((p2 U (!p0||G(p2)))))||G(F(p1))))))'
Support contains 4 out of 3060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3053 transition count 2803
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3053 transition count 2803
Applied a total of 14 rules in 538 ms. Remains 3053 /3060 variables (removed 7) and now considering 2803/2810 (removed 7) transitions.
// Phase 1: matrix 2803 rows 3053 cols
[2023-03-20 01:56:15] [INFO ] Computed 551 place invariants in 16 ms
[2023-03-20 01:56:17] [INFO ] Implicit Places using invariants in 1792 ms returned []
[2023-03-20 01:56:17] [INFO ] Invariant cache hit.
[2023-03-20 01:56:21] [INFO ] Implicit Places using invariants and state equation in 4223 ms returned []
Implicit Place search using SMT with State Equation took 6032 ms to find 0 implicit places.
[2023-03-20 01:56:21] [INFO ] Invariant cache hit.
[2023-03-20 01:56:24] [INFO ] Dead Transitions using invariants and state equation in 2606 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3053/3060 places, 2803/2810 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9177 ms. Remains : 3053/3060 places, 2803/2810 transitions.
Stuttering acceptance computed with spot in 317 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) p0), (AND p0 (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s2116 1) (EQ s2150 1)), p2:(NEQ s2734 1), p1:(NEQ s2781 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1150 ms.
Product exploration explored 100000 steps with 33333 reset in 1165 ms.
Computed a total of 600 stabilizing places and 600 stable transitions
Computed a total of 600 stabilizing places and 600 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (NOT (AND p0 (NOT p2)))), (X (OR (AND (NOT p0) p2) (AND (NOT p1) p2))), (X (NOT (AND p0 p2))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) p2 p1)
Knowledge based reduction with 13 factoid took 638 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-050B-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-050B-LTLFireability-13 finished in 12527 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((G(p1)||G(p2)||p0))))'
Support contains 4 out of 3060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3052 transition count 2802
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3052 transition count 2802
Applied a total of 16 rules in 531 ms. Remains 3052 /3060 variables (removed 8) and now considering 2802/2810 (removed 8) transitions.
// Phase 1: matrix 2802 rows 3052 cols
[2023-03-20 01:56:28] [INFO ] Computed 551 place invariants in 16 ms
[2023-03-20 01:56:29] [INFO ] Implicit Places using invariants in 1385 ms returned []
[2023-03-20 01:56:29] [INFO ] Invariant cache hit.
[2023-03-20 01:56:33] [INFO ] Implicit Places using invariants and state equation in 4135 ms returned []
Implicit Place search using SMT with State Equation took 5537 ms to find 0 implicit places.
[2023-03-20 01:56:33] [INFO ] Invariant cache hit.
[2023-03-20 01:56:35] [INFO ] Dead Transitions using invariants and state equation in 1733 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3052/3060 places, 2802/2810 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7817 ms. Remains : 3052/3060 places, 2802/2810 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(EQ s704 1), p0:(OR (NEQ s1576 1) (NEQ s1610 1)), p2:(EQ s1618 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1712 ms.
Product exploration explored 100000 steps with 50000 reset in 1673 ms.
Computed a total of 599 stabilizing places and 599 stable transitions
Computed a total of 599 stabilizing places and 599 stable transitions
Detected a total of 599/3052 stabilizing places and 599/2802 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) p0 (NOT p2))
Knowledge based reduction with 11 factoid took 633 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-050B-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-050B-LTLFireability-14 finished in 11974 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||G(!p1)) U X((p2||F(p3)))))'
Support contains 5 out of 3060 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3060/3060 places, 2810/2810 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 3053 transition count 2803
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 3053 transition count 2803
Applied a total of 14 rules in 525 ms. Remains 3053 /3060 variables (removed 7) and now considering 2803/2810 (removed 7) transitions.
// Phase 1: matrix 2803 rows 3053 cols
[2023-03-20 01:56:40] [INFO ] Computed 551 place invariants in 10 ms
[2023-03-20 01:56:41] [INFO ] Implicit Places using invariants in 1417 ms returned []
[2023-03-20 01:56:41] [INFO ] Invariant cache hit.
[2023-03-20 01:56:46] [INFO ] Implicit Places using invariants and state equation in 4239 ms returned []
Implicit Place search using SMT with State Equation took 5664 ms to find 0 implicit places.
[2023-03-20 01:56:46] [INFO ] Invariant cache hit.
[2023-03-20 01:56:48] [INFO ] Dead Transitions using invariants and state equation in 2437 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3053/3060 places, 2803/2810 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8627 ms. Remains : 3053/3060 places, 2803/2810 transitions.
Stuttering acceptance computed with spot in 375 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) p1 (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p3) p1)]
Running random walk in product with property : ShieldPPPs-PT-050B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(OR p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=1 dest: 4}], [{ cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND p0 (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s2008 1), p1:(OR (EQ s2159 1) (AND (EQ s2830 1) (EQ s2862 1))), p2:(NEQ s2756 1), p3:(EQ s2159 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1696 ms.
Product exploration explored 100000 steps with 50000 reset in 1612 ms.
Computed a total of 599 stabilizing places and 599 stable transitions
Computed a total of 599 stabilizing places and 599 stable transitions
Detected a total of 599/3053 stabilizing places and 599/2803 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2 (NOT p3)), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (OR (AND p0 (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT p3))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND p0 (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3)))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) (NOT p3))))
Knowledge based reduction with 18 factoid took 390 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-050B-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-050B-LTLFireability-15 finished in 12785 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-20 01:56:53] [INFO ] Flatten gal took : 119 ms
[2023-03-20 01:56:53] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-20 01:56:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3060 places, 2810 transitions and 8020 arcs took 16 ms.
Total runtime 239327 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldPPPs-PT-050B
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/381
LTLFireability

BK_STOP 1679277458896

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/381/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/381/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/381/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 1 (type EXCL) for 0 ShieldPPPs-PT-050B-LTLFireability-02
lola: time limit : 1799 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
ShieldPPPs-PT-050B-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-050B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 4/1799 10/32 ShieldPPPs-PT-050B-LTLFireability-02 471522 m, 94304 m/sec, 722530 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-050B-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-050B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 9/1799 20/32 ShieldPPPs-PT-050B-LTLFireability-02 966656 m, 99026 m/sec, 1487182 t fired, .

Time elapsed: 10 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-050B-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-050B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 14/1799 30/32 ShieldPPPs-PT-050B-LTLFireability-02 1471268 m, 100922 m/sec, 2236442 t fired, .

Time elapsed: 15 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for ShieldPPPs-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
ShieldPPPs-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-050B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 20 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 4 (type EXCL) for 3 ShieldPPPs-PT-050B-LTLFireability-05
lola: time limit : 3580 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
ShieldPPPs-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-050B-LTLFireability-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/3580 7/32 ShieldPPPs-PT-050B-LTLFireability-05 556141 m, 111228 m/sec, 620522 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-050B-LTLFireability-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/3580 15/32 ShieldPPPs-PT-050B-LTLFireability-05 1125673 m, 113906 m/sec, 1264361 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-050B-LTLFireability-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/3580 22/32 ShieldPPPs-PT-050B-LTLFireability-05 1689736 m, 112812 m/sec, 1920439 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-050B-LTLFireability-05: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/3580 28/32 ShieldPPPs-PT-050B-LTLFireability-05 2253459 m, 112744 m/sec, 2557410 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-050B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-050B-LTLFireability-05: LTL 0 0 0 0 1 0 1 0

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-050B-LTLFireability-02: LTL unknown AGGR
ShieldPPPs-PT-050B-LTLFireability-05: LTL unknown AGGR


Time elapsed: 45 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPs-PT-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 ShieldPPPs-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 r391-oct2-167903715400508"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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