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.r393-oct2-167903717300668.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 ltsminxred
Input is ShieldPPPt-PT-040B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903717300668
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.1K Feb 25 20:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 20:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 20:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 20:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 20:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 25 20:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 20:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 25 20:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 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 762K 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 ShieldPPPt-PT-040B-LTLFireability-00
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-01
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-02
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-03
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-04
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-05
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-06
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-07
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-08
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-09
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-10
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-11
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-12
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-13
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-14
FORMULA_NAME ShieldPPPt-PT-040B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679467731290

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-040B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 06:48:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 06:48:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 06:48:54] [INFO ] Load time of PNML (sax parser for PT used): 156 ms
[2023-03-22 06:48:54] [INFO ] Transformed 3123 places.
[2023-03-22 06:48:54] [INFO ] Transformed 2843 transitions.
[2023-03-22 06:48:54] [INFO ] Found NUPN structural information;
[2023-03-22 06:48:54] [INFO ] Parsed PT model containing 3123 places and 2843 transitions and 7126 arcs in 438 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldPPPt-PT-040B-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040B-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 3123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3123/3123 places, 2843/2843 transitions.
Discarding 434 places :
Symmetric choice reduction at 0 with 434 rule applications. Total rules 434 place count 2689 transition count 2409
Iterating global reduction 0 with 434 rules applied. Total rules applied 868 place count 2689 transition count 2409
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 869 place count 2688 transition count 2408
Iterating global reduction 0 with 1 rules applied. Total rules applied 870 place count 2688 transition count 2408
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 871 place count 2687 transition count 2407
Iterating global reduction 0 with 1 rules applied. Total rules applied 872 place count 2687 transition count 2407
Applied a total of 872 rules in 1483 ms. Remains 2687 /3123 variables (removed 436) and now considering 2407/2843 (removed 436) transitions.
// Phase 1: matrix 2407 rows 2687 cols
[2023-03-22 06:48:56] [INFO ] Computed 441 place invariants in 59 ms
[2023-03-22 06:49:00] [INFO ] Implicit Places using invariants in 3798 ms returned []
[2023-03-22 06:49:00] [INFO ] Invariant cache hit.
[2023-03-22 06:49:08] [INFO ] Implicit Places using invariants and state equation in 8621 ms returned []
Implicit Place search using SMT with State Equation took 12476 ms to find 0 implicit places.
[2023-03-22 06:49:08] [INFO ] Invariant cache hit.
[2023-03-22 06:49:17] [INFO ] Dead Transitions using invariants and state equation in 8292 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2687/3123 places, 2407/2843 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22278 ms. Remains : 2687/3123 places, 2407/2843 transitions.
Support contains 40 out of 2687 places after structural reductions.
[2023-03-22 06:49:17] [INFO ] Flatten gal took : 171 ms
[2023-03-22 06:49:17] [INFO ] Flatten gal took : 93 ms
[2023-03-22 06:49:17] [INFO ] Input system was already deterministic with 2407 transitions.
Support contains 39 out of 2687 places (down from 40) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 611 ms. (steps per millisecond=16 ) properties (out of 31) seen :12
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2023-03-22 06:49:18] [INFO ] Invariant cache hit.
[2023-03-22 06:49:20] [INFO ] [Real]Absence check using 441 positive place invariants in 499 ms returned sat
[2023-03-22 06:49:21] [INFO ] After 2904ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-03-22 06:49:23] [INFO ] [Nat]Absence check using 441 positive place invariants in 496 ms returned sat
[2023-03-22 06:49:28] [INFO ] After 4000ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-03-22 06:49:29] [INFO ] Deduced a trap composed of 17 places in 624 ms of which 8 ms to minimize.
[2023-03-22 06:49:30] [INFO ] Deduced a trap composed of 20 places in 872 ms of which 12 ms to minimize.
[2023-03-22 06:49:31] [INFO ] Deduced a trap composed of 18 places in 1279 ms of which 21 ms to minimize.
[2023-03-22 06:49:32] [INFO ] Deduced a trap composed of 19 places in 616 ms of which 2 ms to minimize.
[2023-03-22 06:49:33] [INFO ] Deduced a trap composed of 30 places in 583 ms of which 34 ms to minimize.
[2023-03-22 06:49:33] [INFO ] Deduced a trap composed of 17 places in 539 ms of which 1 ms to minimize.
[2023-03-22 06:49:34] [INFO ] Deduced a trap composed of 30 places in 583 ms of which 2 ms to minimize.
[2023-03-22 06:49:35] [INFO ] Deduced a trap composed of 26 places in 1068 ms of which 1 ms to minimize.
[2023-03-22 06:49:36] [INFO ] Deduced a trap composed of 25 places in 664 ms of which 2 ms to minimize.
[2023-03-22 06:49:37] [INFO ] Deduced a trap composed of 30 places in 679 ms of which 1 ms to minimize.
[2023-03-22 06:49:37] [INFO ] Deduced a trap composed of 21 places in 401 ms of which 1 ms to minimize.
[2023-03-22 06:49:38] [INFO ] Deduced a trap composed of 17 places in 624 ms of which 1 ms to minimize.
[2023-03-22 06:49:39] [INFO ] Deduced a trap composed of 27 places in 536 ms of which 1 ms to minimize.
[2023-03-22 06:49:39] [INFO ] Deduced a trap composed of 16 places in 537 ms of which 1 ms to minimize.
[2023-03-22 06:49:40] [INFO ] Deduced a trap composed of 31 places in 535 ms of which 3 ms to minimize.
[2023-03-22 06:49:41] [INFO ] Deduced a trap composed of 35 places in 448 ms of which 2 ms to minimize.
[2023-03-22 06:49:41] [INFO ] Deduced a trap composed of 28 places in 405 ms of which 1 ms to minimize.
[2023-03-22 06:49:42] [INFO ] Deduced a trap composed of 24 places in 582 ms of which 1 ms to minimize.
[2023-03-22 06:49:44] [INFO ] Deduced a trap composed of 25 places in 1789 ms of which 29 ms to minimize.
[2023-03-22 06:49:44] [INFO ] Deduced a trap composed of 22 places in 425 ms of which 1 ms to minimize.
[2023-03-22 06:49:45] [INFO ] Deduced a trap composed of 38 places in 525 ms of which 3 ms to minimize.
[2023-03-22 06:49:46] [INFO ] Deduced a trap composed of 30 places in 943 ms of which 2 ms to minimize.
[2023-03-22 06:49:47] [INFO ] Deduced a trap composed of 36 places in 601 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 06:49:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 06:49:47] [INFO ] After 25517ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:19
Fused 19 Parikh solutions to 17 different solutions.
Parikh walk visited 0 properties in 2641 ms.
Support contains 25 out of 2687 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2687/2687 places, 2407/2407 transitions.
Drop transitions removed 547 transitions
Trivial Post-agglo rules discarded 547 transitions
Performed 547 trivial Post agglomeration. Transition count delta: 547
Iterating post reduction 0 with 547 rules applied. Total rules applied 547 place count 2687 transition count 1860
Reduce places removed 547 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 550 rules applied. Total rules applied 1097 place count 2140 transition count 1857
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1100 place count 2137 transition count 1857
Performed 307 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 307 Pre rules applied. Total rules applied 1100 place count 2137 transition count 1550
Deduced a syphon composed of 307 places in 2 ms
Reduce places removed 307 places and 0 transitions.
Iterating global reduction 3 with 614 rules applied. Total rules applied 1714 place count 1830 transition count 1550
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1715 place count 1829 transition count 1549
Iterating global reduction 3 with 1 rules applied. Total rules applied 1716 place count 1829 transition count 1549
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1716 place count 1829 transition count 1548
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1718 place count 1828 transition count 1548
Performed 680 Post agglomeration using F-continuation condition.Transition count delta: 680
Deduced a syphon composed of 680 places in 3 ms
Reduce places removed 680 places and 0 transitions.
Iterating global reduction 3 with 1360 rules applied. Total rules applied 3078 place count 1148 transition count 868
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3079 place count 1148 transition count 867
Renaming transitions due to excessive name length > 1024 char.
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 4 with 2 rules applied. Total rules applied 3081 place count 1147 transition count 866
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3283 place count 1046 transition count 866
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 13 places in 3 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 3309 place count 1033 transition count 866
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3310 place count 1033 transition count 865
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3311 place count 1032 transition count 865
Partial Free-agglomeration rule applied 116 times.
Drop transitions removed 116 transitions
Iterating global reduction 5 with 116 rules applied. Total rules applied 3427 place count 1032 transition count 865
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3428 place count 1031 transition count 864
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3429 place count 1030 transition count 864
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 3429 place count 1030 transition count 862
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 3433 place count 1028 transition count 862
Applied a total of 3433 rules in 863 ms. Remains 1028 /2687 variables (removed 1659) and now considering 862/2407 (removed 1545) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 864 ms. Remains : 1028/2687 places, 862/2407 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 439 ms. (steps per millisecond=22 ) properties (out of 19) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 862 rows 1028 cols
[2023-03-22 06:49:51] [INFO ] Computed 440 place invariants in 3 ms
[2023-03-22 06:49:51] [INFO ] [Real]Absence check using 440 positive place invariants in 103 ms returned sat
[2023-03-22 06:49:51] [INFO ] After 567ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-22 06:49:52] [INFO ] [Nat]Absence check using 440 positive place invariants in 119 ms returned sat
[2023-03-22 06:49:54] [INFO ] After 1565ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-22 06:49:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 06:49:55] [INFO ] After 998ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2023-03-22 06:49:58] [INFO ] Deduced a trap composed of 5 places in 3085 ms of which 1 ms to minimize.
[2023-03-22 06:49:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 3203 ms
[2023-03-22 06:50:00] [INFO ] After 5857ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 1028 ms.
[2023-03-22 06:50:01] [INFO ] After 9618ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 106 ms.
Support contains 21 out of 1028 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1028/1028 places, 862/862 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 1028 transition count 861
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 1027 transition count 861
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1026 transition count 860
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 6 place count 1025 transition count 860
Applied a total of 6 rules in 118 ms. Remains 1025 /1028 variables (removed 3) and now considering 860/862 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 1025/1028 places, 860/862 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 326 ms. (steps per millisecond=30 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 78493 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 78493 steps, saw 59078 distinct states, run finished after 3003 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 860 rows 1025 cols
[2023-03-22 06:50:05] [INFO ] Computed 440 place invariants in 3 ms
[2023-03-22 06:50:05] [INFO ] [Real]Absence check using 440 positive place invariants in 113 ms returned sat
[2023-03-22 06:50:05] [INFO ] After 689ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-22 06:50:06] [INFO ] [Nat]Absence check using 440 positive place invariants in 112 ms returned sat
[2023-03-22 06:50:08] [INFO ] After 1278ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-22 06:50:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 06:50:09] [INFO ] After 637ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2023-03-22 06:50:10] [INFO ] After 2138ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 862 ms.
[2023-03-22 06:50:11] [INFO ] After 5419ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 268 ms.
Support contains 21 out of 1025 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1025/1025 places, 860/860 transitions.
Applied a total of 0 rules in 73 ms. Remains 1025 /1025 variables (removed 0) and now considering 860/860 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 1025/1025 places, 860/860 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1025/1025 places, 860/860 transitions.
Applied a total of 0 rules in 102 ms. Remains 1025 /1025 variables (removed 0) and now considering 860/860 (removed 0) transitions.
[2023-03-22 06:50:11] [INFO ] Invariant cache hit.
[2023-03-22 06:50:13] [INFO ] Implicit Places using invariants in 2092 ms returned [1008, 1012]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2100 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1023/1025 places, 860/860 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1021 transition count 858
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1021 transition count 858
Applied a total of 4 rules in 68 ms. Remains 1021 /1023 variables (removed 2) and now considering 858/860 (removed 2) transitions.
// Phase 1: matrix 858 rows 1021 cols
[2023-03-22 06:50:14] [INFO ] Computed 438 place invariants in 2 ms
[2023-03-22 06:50:14] [INFO ] Implicit Places using invariants in 668 ms returned []
[2023-03-22 06:50:14] [INFO ] Invariant cache hit.
[2023-03-22 06:50:16] [INFO ] Implicit Places using invariants and state equation in 1385 ms returned []
Implicit Place search using SMT with State Equation took 2056 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1021/1025 places, 858/860 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4331 ms. Remains : 1021/1025 places, 858/860 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 524 ms. (steps per millisecond=19 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 138115 steps, run timeout after 6001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 138115 steps, saw 102095 distinct states, run finished after 6001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 14 properties.
[2023-03-22 06:50:24] [INFO ] Invariant cache hit.
[2023-03-22 06:50:25] [INFO ] [Real]Absence check using 438 positive place invariants in 366 ms returned sat
[2023-03-22 06:50:25] [INFO ] After 759ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-22 06:50:26] [INFO ] [Nat]Absence check using 438 positive place invariants in 388 ms returned sat
[2023-03-22 06:50:28] [INFO ] After 1113ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-22 06:50:28] [INFO ] Deduced a trap composed of 6 places in 171 ms of which 1 ms to minimize.
[2023-03-22 06:50:29] [INFO ] Deduced a trap composed of 5 places in 613 ms of which 1 ms to minimize.
[2023-03-22 06:50:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 895 ms
[2023-03-22 06:50:29] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 1 ms to minimize.
[2023-03-22 06:50:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
[2023-03-22 06:50:30] [INFO ] After 3675ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 945 ms.
[2023-03-22 06:50:31] [INFO ] After 6426ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 14 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 298 ms.
Support contains 19 out of 1021 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1021/1021 places, 858/858 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 1021 transition count 857
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 1020 transition count 857
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1019 transition count 856
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 6 place count 1018 transition count 856
Applied a total of 6 rules in 118 ms. Remains 1018 /1021 variables (removed 3) and now considering 856/858 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 1018/1021 places, 856/858 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 305 ms. (steps per millisecond=32 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 82770 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{3=1}
Probabilistic random walk after 82770 steps, saw 67677 distinct states, run finished after 3002 ms. (steps per millisecond=27 ) properties seen :1
Running SMT prover for 13 properties.
// Phase 1: matrix 856 rows 1018 cols
[2023-03-22 06:50:36] [INFO ] Computed 438 place invariants in 2 ms
[2023-03-22 06:50:39] [INFO ] [Real]Absence check using 438 positive place invariants in 2193 ms returned sat
[2023-03-22 06:50:39] [INFO ] After 2702ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-22 06:50:40] [INFO ] [Nat]Absence check using 438 positive place invariants in 111 ms returned sat
[2023-03-22 06:50:48] [INFO ] After 6943ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-22 06:50:49] [INFO ] Deduced a trap composed of 5 places in 1143 ms of which 25 ms to minimize.
[2023-03-22 06:50:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1249 ms
[2023-03-22 06:50:50] [INFO ] After 9188ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 795 ms.
[2023-03-22 06:50:51] [INFO ] After 11531ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Fused 13 Parikh solutions to 9 different solutions.
Parikh walk visited 3 properties in 333 ms.
Support contains 14 out of 1018 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1018/1018 places, 856/856 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 1018 transition count 855
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 1017 transition count 855
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 12 place count 1012 transition count 850
Applied a total of 12 rules in 110 ms. Remains 1012 /1018 variables (removed 6) and now considering 850/856 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 1012/1018 places, 850/856 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 297 ms. (steps per millisecond=33 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 70792 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{5=1}
Probabilistic random walk after 70792 steps, saw 57137 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :1
Running SMT prover for 9 properties.
// Phase 1: matrix 850 rows 1012 cols
[2023-03-22 06:50:56] [INFO ] Computed 438 place invariants in 2 ms
[2023-03-22 06:50:56] [INFO ] [Real]Absence check using 438 positive place invariants in 63 ms returned sat
[2023-03-22 06:50:57] [INFO ] After 1148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-22 06:50:57] [INFO ] [Nat]Absence check using 438 positive place invariants in 89 ms returned sat
[2023-03-22 06:50:58] [INFO ] After 833ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-22 06:50:58] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 1 ms to minimize.
[2023-03-22 06:50:59] [INFO ] Deduced a trap composed of 6 places in 565 ms of which 17 ms to minimize.
[2023-03-22 06:50:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 809 ms
[2023-03-22 06:51:00] [INFO ] After 2353ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 522 ms.
[2023-03-22 06:51:00] [INFO ] After 3494ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 210 ms.
Support contains 13 out of 1012 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1012/1012 places, 850/850 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 1012 transition count 849
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1011 transition count 849
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 4 place count 1010 transition count 849
Applied a total of 4 rules in 46 ms. Remains 1010 /1012 variables (removed 2) and now considering 849/850 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 1010/1012 places, 849/850 transitions.
Computed a total of 638 stabilizing places and 638 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((((p1 U (p2||G(p1))) U ((!p3&&(p1 U (p2||G(p1))))||G((p1 U (p2||G(p1))))))&&p0)))'
Support contains 4 out of 2687 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2687/2687 places, 2407/2407 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 558 transitions
Trivial Post-agglo rules discarded 558 transitions
Performed 558 trivial Post agglomeration. Transition count delta: 558
Iterating post reduction 0 with 558 rules applied. Total rules applied 558 place count 2686 transition count 1848
Reduce places removed 558 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 559 rules applied. Total rules applied 1117 place count 2128 transition count 1847
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1118 place count 2127 transition count 1847
Performed 317 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 317 Pre rules applied. Total rules applied 1118 place count 2127 transition count 1530
Deduced a syphon composed of 317 places in 3 ms
Reduce places removed 317 places and 0 transitions.
Iterating global reduction 3 with 634 rules applied. Total rules applied 1752 place count 1810 transition count 1530
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1755 place count 1807 transition count 1527
Iterating global reduction 3 with 3 rules applied. Total rules applied 1758 place count 1807 transition count 1527
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 1758 place count 1807 transition count 1524
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1764 place count 1804 transition count 1524
Performed 680 Post agglomeration using F-continuation condition.Transition count delta: 680
Deduced a syphon composed of 680 places in 1 ms
Reduce places removed 680 places and 0 transitions.
Iterating global reduction 3 with 1360 rules applied. Total rules applied 3124 place count 1124 transition count 844
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3125 place count 1124 transition count 843
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3127 place count 1123 transition count 842
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3329 place count 1022 transition count 842
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 3363 place count 1005 transition count 842
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3365 place count 1003 transition count 840
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3366 place count 1002 transition count 840
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 3366 place count 1002 transition count 838
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3370 place count 1000 transition count 838
Applied a total of 3370 rules in 592 ms. Remains 1000 /2687 variables (removed 1687) and now considering 838/2407 (removed 1569) transitions.
// Phase 1: matrix 838 rows 1000 cols
[2023-03-22 06:51:02] [INFO ] Computed 440 place invariants in 1 ms
[2023-03-22 06:51:02] [INFO ] Implicit Places using invariants in 766 ms returned [983, 987]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 794 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 998/2687 places, 838/2407 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 996 transition count 836
Applied a total of 4 rules in 99 ms. Remains 996 /998 variables (removed 2) and now considering 836/838 (removed 2) transitions.
// Phase 1: matrix 836 rows 996 cols
[2023-03-22 06:51:02] [INFO ] Computed 438 place invariants in 1 ms
[2023-03-22 06:51:05] [INFO ] Implicit Places using invariants in 2706 ms returned []
[2023-03-22 06:51:05] [INFO ] Invariant cache hit.
[2023-03-22 06:51:09] [INFO ] Implicit Places using invariants and state equation in 4066 ms returned []
Implicit Place search using SMT with State Equation took 6799 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 996/2687 places, 836/2407 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8286 ms. Remains : 996/2687 places, 836/2407 transitions.
Stuttering acceptance computed with spot in 536 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p3) p0), acceptance={} source=0 dest: 1}, { cond=(OR (AND p2 p3 p0) (AND p1 p3 p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(OR (AND p2 p3) (AND p1 p3)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (NEQ s585 1) (NEQ s877 1)), p1:(NEQ s585 1), p0:(AND (EQ s732 1) (EQ s734 1)), p3:(AND (EQ s732 1) (EQ s734 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 12 reset in 824 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 1 ms.
FORMULA ShieldPPPt-PT-040B-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040B-LTLFireability-00 finished in 9788 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 1 out of 2687 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2687/2687 places, 2407/2407 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 559 transitions
Trivial Post-agglo rules discarded 559 transitions
Performed 559 trivial Post agglomeration. Transition count delta: 559
Iterating post reduction 0 with 559 rules applied. Total rules applied 559 place count 2686 transition count 1847
Reduce places removed 559 places and 0 transitions.
Iterating post reduction 1 with 559 rules applied. Total rules applied 1118 place count 2127 transition count 1847
Performed 316 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 316 Pre rules applied. Total rules applied 1118 place count 2127 transition count 1531
Deduced a syphon composed of 316 places in 2 ms
Reduce places removed 316 places and 0 transitions.
Iterating global reduction 2 with 632 rules applied. Total rules applied 1750 place count 1811 transition count 1531
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1753 place count 1808 transition count 1528
Iterating global reduction 2 with 3 rules applied. Total rules applied 1756 place count 1808 transition count 1528
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 1756 place count 1808 transition count 1525
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 1762 place count 1805 transition count 1525
Performed 682 Post agglomeration using F-continuation condition.Transition count delta: 682
Deduced a syphon composed of 682 places in 2 ms
Reduce places removed 682 places and 0 transitions.
Iterating global reduction 2 with 1364 rules applied. Total rules applied 3126 place count 1123 transition count 843
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3127 place count 1123 transition count 842
Renaming transitions due to excessive name length > 1024 char.
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 3 with 2 rules applied. Total rules applied 3129 place count 1122 transition count 841
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3331 place count 1021 transition count 841
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 3365 place count 1004 transition count 841
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3367 place count 1002 transition count 839
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3368 place count 1001 transition count 839
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3368 place count 1001 transition count 837
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3372 place count 999 transition count 837
Applied a total of 3372 rules in 539 ms. Remains 999 /2687 variables (removed 1688) and now considering 837/2407 (removed 1570) transitions.
// Phase 1: matrix 837 rows 999 cols
[2023-03-22 06:51:11] [INFO ] Computed 440 place invariants in 6 ms
[2023-03-22 06:51:12] [INFO ] Implicit Places using invariants in 1065 ms returned [982, 986]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1066 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 997/2687 places, 837/2407 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 995 transition count 835
Applied a total of 4 rules in 39 ms. Remains 995 /997 variables (removed 2) and now considering 835/837 (removed 2) transitions.
// Phase 1: matrix 835 rows 995 cols
[2023-03-22 06:51:12] [INFO ] Computed 438 place invariants in 2 ms
[2023-03-22 06:51:13] [INFO ] Implicit Places using invariants in 583 ms returned []
[2023-03-22 06:51:13] [INFO ] Invariant cache hit.
[2023-03-22 06:51:15] [INFO ] Implicit Places using invariants and state equation in 1723 ms returned []
Implicit Place search using SMT with State Equation took 2319 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 995/2687 places, 835/2407 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3963 ms. Remains : 995/2687 places, 835/2407 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-01 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:(EQ s147 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 746 ms.
Stack based approach found an accepted trace after 28 steps with 0 reset with depth 29 and stack size 28 in 0 ms.
FORMULA ShieldPPPt-PT-040B-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040B-LTLFireability-01 finished in 4912 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&(X(X(p1)) U (p1 U p0))))'
Support contains 3 out of 2687 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2687/2687 places, 2407/2407 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2681 transition count 2401
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2681 transition count 2401
Applied a total of 12 rules in 321 ms. Remains 2681 /2687 variables (removed 6) and now considering 2401/2407 (removed 6) transitions.
// Phase 1: matrix 2401 rows 2681 cols
[2023-03-22 06:51:16] [INFO ] Computed 441 place invariants in 6 ms
[2023-03-22 06:51:18] [INFO ] Implicit Places using invariants in 1984 ms returned []
[2023-03-22 06:51:18] [INFO ] Invariant cache hit.
[2023-03-22 06:51:25] [INFO ] Implicit Places using invariants and state equation in 7348 ms returned []
Implicit Place search using SMT with State Equation took 9370 ms to find 0 implicit places.
[2023-03-22 06:51:25] [INFO ] Invariant cache hit.
[2023-03-22 06:51:27] [INFO ] Dead Transitions using invariants and state equation in 2130 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2681/2687 places, 2401/2407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11844 ms. Remains : 2681/2687 places, 2401/2407 transitions.
Stuttering acceptance computed with spot in 247 ms :[true, (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(OR p0 p1), acceptance={} source=1 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 2}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (EQ s865 1) (EQ s891 1)), p1:(EQ s2061 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-040B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-040B-LTLFireability-04 finished in 12124 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 2 out of 2687 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2687/2687 places, 2407/2407 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2681 transition count 2401
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2681 transition count 2401
Applied a total of 12 rules in 404 ms. Remains 2681 /2687 variables (removed 6) and now considering 2401/2407 (removed 6) transitions.
[2023-03-22 06:51:28] [INFO ] Invariant cache hit.
[2023-03-22 06:51:29] [INFO ] Implicit Places using invariants in 1179 ms returned []
[2023-03-22 06:51:29] [INFO ] Invariant cache hit.
[2023-03-22 06:51:33] [INFO ] Implicit Places using invariants and state equation in 3619 ms returned []
Implicit Place search using SMT with State Equation took 4839 ms to find 0 implicit places.
[2023-03-22 06:51:33] [INFO ] Invariant cache hit.
[2023-03-22 06:51:36] [INFO ] Dead Transitions using invariants and state equation in 2769 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2681/2687 places, 2401/2407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8019 ms. Remains : 2681/2687 places, 2401/2407 transitions.
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(EQ s1631 1), p0:(EQ s1104 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]]
Product exploration explored 100000 steps with 302 reset in 468 ms.
Product exploration explored 100000 steps with 308 reset in 435 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Detected a total of 638/2681 stabilizing places and 638/2401 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 327 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), (NOT p1)]
Finished random walk after 322 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=80 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 5 factoid took 401 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p1)]
[2023-03-22 06:51:38] [INFO ] Invariant cache hit.
[2023-03-22 06:51:42] [INFO ] [Real]Absence check using 441 positive place invariants in 855 ms returned sat
[2023-03-22 06:51:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 06:51:53] [INFO ] [Real]Absence check using state equation in 10826 ms returned unknown
Could not prove EG (NOT p1)
Support contains 1 out of 2681 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 2681/2681 places, 2401/2401 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 2680 transition count 1840
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 2120 transition count 1840
Performed 320 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 320 Pre rules applied. Total rules applied 1120 place count 2120 transition count 1520
Deduced a syphon composed of 320 places in 3 ms
Reduce places removed 320 places and 0 transitions.
Iterating global reduction 2 with 640 rules applied. Total rules applied 1760 place count 1800 transition count 1520
Performed 674 Post agglomeration using F-continuation condition.Transition count delta: 674
Deduced a syphon composed of 674 places in 1 ms
Reduce places removed 674 places and 0 transitions.
Iterating global reduction 2 with 1348 rules applied. Total rules applied 3108 place count 1126 transition count 846
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3109 place count 1126 transition count 845
Renaming transitions due to excessive name length > 1024 char.
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 3 with 2 rules applied. Total rules applied 3111 place count 1125 transition count 844
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3313 place count 1024 transition count 844
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3349 place count 1006 transition count 844
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3351 place count 1004 transition count 842
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3352 place count 1003 transition count 842
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3352 place count 1003 transition count 840
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3356 place count 1001 transition count 840
Applied a total of 3356 rules in 515 ms. Remains 1001 /2681 variables (removed 1680) and now considering 840/2401 (removed 1561) transitions.
// Phase 1: matrix 840 rows 1001 cols
[2023-03-22 06:51:53] [INFO ] Computed 440 place invariants in 2 ms
[2023-03-22 06:51:56] [INFO ] Implicit Places using invariants in 3005 ms returned [984, 988]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 3024 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 999/2681 places, 840/2401 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 997 transition count 838
Applied a total of 4 rules in 42 ms. Remains 997 /999 variables (removed 2) and now considering 838/840 (removed 2) transitions.
// Phase 1: matrix 838 rows 997 cols
[2023-03-22 06:51:57] [INFO ] Computed 438 place invariants in 4 ms
[2023-03-22 06:51:57] [INFO ] Implicit Places using invariants in 903 ms returned []
[2023-03-22 06:51:57] [INFO ] Invariant cache hit.
[2023-03-22 06:51:59] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-22 06:52:01] [INFO ] Implicit Places using invariants and state equation in 3285 ms returned []
Implicit Place search using SMT with State Equation took 4205 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 997/2681 places, 838/2401 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7786 ms. Remains : 997/2681 places, 838/2401 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/997 stabilizing places and 4/838 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 259 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p1)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 285 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p1)]
[2023-03-22 06:52:02] [INFO ] Invariant cache hit.
[2023-03-22 06:52:03] [INFO ] [Real]Absence check using 438 positive place invariants in 437 ms returned sat
[2023-03-22 06:52:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 06:52:05] [INFO ] [Real]Absence check using state equation in 1766 ms returned sat
[2023-03-22 06:52:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 06:52:06] [INFO ] [Nat]Absence check using 438 positive place invariants in 256 ms returned sat
[2023-03-22 06:52:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 06:52:08] [INFO ] [Nat]Absence check using state equation in 2076 ms returned sat
[2023-03-22 06:52:08] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-22 06:52:08] [INFO ] [Nat]Added 5 Read/Feed constraints in 25 ms returned sat
[2023-03-22 06:52:09] [INFO ] Deduced a trap composed of 8 places in 428 ms of which 1 ms to minimize.
[2023-03-22 06:52:09] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2023-03-22 06:52:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 665 ms
[2023-03-22 06:52:09] [INFO ] Computed and/alt/rep : 832/1343/832 causal constraints (skipped 0 transitions) in 81 ms.
[2023-03-22 06:52:22] [INFO ] Deduced a trap composed of 2 places in 1859 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 06:52:22] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
Product exploration explored 100000 steps with 16742 reset in 936 ms.
Stack based approach found an accepted trace after 9 steps with 2 reset with depth 3 and stack size 3 in 0 ms.
FORMULA ShieldPPPt-PT-040B-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040B-LTLFireability-05 finished in 55509 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(p1)&&p0))))'
Support contains 3 out of 2687 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2687/2687 places, 2407/2407 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 2682 transition count 2402
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 2682 transition count 2402
Applied a total of 10 rules in 347 ms. Remains 2682 /2687 variables (removed 5) and now considering 2402/2407 (removed 5) transitions.
// Phase 1: matrix 2402 rows 2682 cols
[2023-03-22 06:52:24] [INFO ] Computed 441 place invariants in 15 ms
[2023-03-22 06:52:27] [INFO ] Implicit Places using invariants in 3011 ms returned []
[2023-03-22 06:52:27] [INFO ] Invariant cache hit.
[2023-03-22 06:52:35] [INFO ] Implicit Places using invariants and state equation in 8772 ms returned []
Implicit Place search using SMT with State Equation took 11814 ms to find 0 implicit places.
[2023-03-22 06:52:35] [INFO ] Invariant cache hit.
[2023-03-22 06:52:41] [INFO ] Dead Transitions using invariants and state equation in 5598 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2682/2687 places, 2402/2407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17763 ms. Remains : 2682/2687 places, 2402/2407 transitions.
Stuttering acceptance computed with spot in 218 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(NEQ s1032 1), p0:(AND (NEQ s155 1) (EQ s1193 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-040B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-040B-LTLFireability-06 finished in 18032 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))||F(p1)))'
Support contains 4 out of 2687 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2687/2687 places, 2407/2407 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 2682 transition count 2402
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 2682 transition count 2402
Applied a total of 10 rules in 322 ms. Remains 2682 /2687 variables (removed 5) and now considering 2402/2407 (removed 5) transitions.
// Phase 1: matrix 2402 rows 2682 cols
[2023-03-22 06:52:42] [INFO ] Computed 441 place invariants in 7 ms
[2023-03-22 06:52:43] [INFO ] Implicit Places using invariants in 1471 ms returned []
[2023-03-22 06:52:43] [INFO ] Invariant cache hit.
[2023-03-22 06:52:46] [INFO ] Implicit Places using invariants and state equation in 3408 ms returned []
Implicit Place search using SMT with State Equation took 4886 ms to find 0 implicit places.
[2023-03-22 06:52:46] [INFO ] Invariant cache hit.
[2023-03-22 06:52:50] [INFO ] Dead Transitions using invariants and state equation in 3331 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2682/2687 places, 2402/2407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8543 ms. Remains : 2682/2687 places, 2402/2407 transitions.
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s1568 1), p0:(OR (AND (EQ s2304 1) (EQ s2344 1)) (EQ s1331 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 243 reset in 470 ms.
Product exploration explored 100000 steps with 245 reset in 534 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Detected a total of 638/2682 stabilizing places and 638/2402 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 218 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 288 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=96 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 4 factoid took 251 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p1))]
[2023-03-22 06:52:52] [INFO ] Invariant cache hit.
[2023-03-22 06:52:55] [INFO ] [Real]Absence check using 441 positive place invariants in 763 ms returned sat
[2023-03-22 06:52:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 06:53:07] [INFO ] [Real]Absence check using state equation in 12086 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 2682 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2682/2682 places, 2402/2402 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 2681 transition count 1841
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 2121 transition count 1841
Performed 318 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 318 Pre rules applied. Total rules applied 1120 place count 2121 transition count 1523
Deduced a syphon composed of 318 places in 2 ms
Reduce places removed 318 places and 0 transitions.
Iterating global reduction 2 with 636 rules applied. Total rules applied 1756 place count 1803 transition count 1523
Performed 676 Post agglomeration using F-continuation condition.Transition count delta: 676
Deduced a syphon composed of 676 places in 1 ms
Reduce places removed 676 places and 0 transitions.
Iterating global reduction 2 with 1352 rules applied. Total rules applied 3108 place count 1127 transition count 847
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3109 place count 1127 transition count 846
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3111 place count 1126 transition count 845
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3313 place count 1025 transition count 845
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 3347 place count 1008 transition count 845
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3349 place count 1006 transition count 843
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3350 place count 1005 transition count 843
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3350 place count 1005 transition count 841
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3354 place count 1003 transition count 841
Applied a total of 3354 rules in 477 ms. Remains 1003 /2682 variables (removed 1679) and now considering 841/2402 (removed 1561) transitions.
// Phase 1: matrix 841 rows 1003 cols
[2023-03-22 06:53:07] [INFO ] Computed 440 place invariants in 3 ms
[2023-03-22 06:53:08] [INFO ] Implicit Places using invariants in 645 ms returned [986, 990]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 647 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1001/2682 places, 841/2402 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 999 transition count 839
Applied a total of 4 rules in 42 ms. Remains 999 /1001 variables (removed 2) and now considering 839/841 (removed 2) transitions.
// Phase 1: matrix 839 rows 999 cols
[2023-03-22 06:53:08] [INFO ] Computed 438 place invariants in 2 ms
[2023-03-22 06:53:09] [INFO ] Implicit Places using invariants in 656 ms returned []
[2023-03-22 06:53:09] [INFO ] Invariant cache hit.
[2023-03-22 06:53:10] [INFO ] Implicit Places using invariants and state equation in 1256 ms returned []
Implicit Place search using SMT with State Equation took 1918 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 999/2682 places, 839/2402 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3098 ms. Remains : 999/2682 places, 839/2402 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/999 stabilizing places and 2/839 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 208 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 270 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p1))]
[2023-03-22 06:53:11] [INFO ] Invariant cache hit.
[2023-03-22 06:53:12] [INFO ] [Real]Absence check using 438 positive place invariants in 517 ms returned sat
[2023-03-22 06:53:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 06:53:16] [INFO ] [Real]Absence check using state equation in 3989 ms returned sat
[2023-03-22 06:53:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 06:53:19] [INFO ] [Nat]Absence check using 438 positive place invariants in 253 ms returned sat
[2023-03-22 06:53:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 06:53:24] [INFO ] [Nat]Absence check using state equation in 4779 ms returned sat
[2023-03-22 06:53:24] [INFO ] Computed and/alt/rep : 833/1318/833 causal constraints (skipped 0 transitions) in 104 ms.
[2023-03-22 06:53:32] [INFO ] Deduced a trap composed of 2 places in 555 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 06:53:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p0) (NOT p1))
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 17498 reset in 892 ms.
Stack based approach found an accepted trace after 15 steps with 2 reset with depth 3 and stack size 3 in 0 ms.
FORMULA ShieldPPPt-PT-040B-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040B-LTLFireability-07 finished in 51502 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((G(p0) U p1)||X(F(p0)))))'
Support contains 2 out of 2687 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2687/2687 places, 2407/2407 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2681 transition count 2401
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2681 transition count 2401
Applied a total of 12 rules in 328 ms. Remains 2681 /2687 variables (removed 6) and now considering 2401/2407 (removed 6) transitions.
// Phase 1: matrix 2401 rows 2681 cols
[2023-03-22 06:53:33] [INFO ] Computed 441 place invariants in 14 ms
[2023-03-22 06:53:37] [INFO ] Implicit Places using invariants in 3807 ms returned []
[2023-03-22 06:53:37] [INFO ] Invariant cache hit.
[2023-03-22 06:53:40] [INFO ] Implicit Places using invariants and state equation in 3307 ms returned []
Implicit Place search using SMT with State Equation took 7116 ms to find 0 implicit places.
[2023-03-22 06:53:40] [INFO ] Invariant cache hit.
[2023-03-22 06:53:42] [INFO ] Dead Transitions using invariants and state equation in 2106 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2681/2687 places, 2401/2407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9574 ms. Remains : 2681/2687 places, 2401/2407 transitions.
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s1497 1), p0:(EQ s2619 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 9571 reset in 472 ms.
Product exploration explored 100000 steps with 9425 reset in 454 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Detected a total of 638/2681 stabilizing places and 638/2401 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 296 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) (NOT p0))]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 5 factoid took 422 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) (NOT p0))]
[2023-03-22 06:53:45] [INFO ] Invariant cache hit.
[2023-03-22 06:53:48] [INFO ] [Real]Absence check using 441 positive place invariants in 690 ms returned sat
[2023-03-22 06:53:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 06:54:00] [INFO ] [Real]Absence check using state equation in 12056 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 2 out of 2681 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2681/2681 places, 2401/2401 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 558 transitions
Trivial Post-agglo rules discarded 558 transitions
Performed 558 trivial Post agglomeration. Transition count delta: 558
Iterating post reduction 0 with 558 rules applied. Total rules applied 558 place count 2680 transition count 1842
Reduce places removed 558 places and 0 transitions.
Iterating post reduction 1 with 558 rules applied. Total rules applied 1116 place count 2122 transition count 1842
Performed 322 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 322 Pre rules applied. Total rules applied 1116 place count 2122 transition count 1520
Deduced a syphon composed of 322 places in 2 ms
Reduce places removed 322 places and 0 transitions.
Iterating global reduction 2 with 644 rules applied. Total rules applied 1760 place count 1800 transition count 1520
Performed 675 Post agglomeration using F-continuation condition.Transition count delta: 675
Deduced a syphon composed of 675 places in 1 ms
Reduce places removed 675 places and 0 transitions.
Iterating global reduction 2 with 1350 rules applied. Total rules applied 3110 place count 1125 transition count 845
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3111 place count 1125 transition count 844
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3113 place count 1124 transition count 843
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3315 place count 1023 transition count 843
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3351 place count 1005 transition count 843
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3352 place count 1004 transition count 842
Applied a total of 3352 rules in 475 ms. Remains 1004 /2681 variables (removed 1677) and now considering 842/2401 (removed 1559) transitions.
// Phase 1: matrix 842 rows 1004 cols
[2023-03-22 06:54:00] [INFO ] Computed 441 place invariants in 1 ms
[2023-03-22 06:54:08] [INFO ] Implicit Places using invariants in 7555 ms returned [997]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 7566 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1003/2681 places, 842/2401 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1003 transition count 840
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1001 transition count 840
Applied a total of 4 rules in 29 ms. Remains 1001 /1003 variables (removed 2) and now considering 840/842 (removed 2) transitions.
// Phase 1: matrix 840 rows 1001 cols
[2023-03-22 06:54:08] [INFO ] Computed 440 place invariants in 3 ms
[2023-03-22 06:54:10] [INFO ] Implicit Places using invariants in 1994 ms returned [984, 988]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2004 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 999/2681 places, 840/2401 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 997 transition count 838
Applied a total of 4 rules in 34 ms. Remains 997 /999 variables (removed 2) and now considering 838/840 (removed 2) transitions.
// Phase 1: matrix 838 rows 997 cols
[2023-03-22 06:54:10] [INFO ] Computed 438 place invariants in 1 ms
[2023-03-22 06:54:14] [INFO ] Implicit Places using invariants in 4056 ms returned []
[2023-03-22 06:54:14] [INFO ] Invariant cache hit.
[2023-03-22 06:54:15] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-22 06:54:18] [INFO ] Implicit Places using invariants and state equation in 3920 ms returned []
Implicit Place search using SMT with State Equation took 8006 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 997/2681 places, 838/2401 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 18122 ms. Remains : 997/2681 places, 838/2401 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/997 stabilizing places and 4/838 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 4 factoid took 242 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-040B-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-040B-LTLFireability-08 finished in 45264 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X((p1||F(G(p2)))))))'
Support contains 3 out of 2687 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2687/2687 places, 2407/2407 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2681 transition count 2401
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2681 transition count 2401
Applied a total of 12 rules in 399 ms. Remains 2681 /2687 variables (removed 6) and now considering 2401/2407 (removed 6) transitions.
// Phase 1: matrix 2401 rows 2681 cols
[2023-03-22 06:54:18] [INFO ] Computed 441 place invariants in 13 ms
[2023-03-22 06:54:20] [INFO ] Implicit Places using invariants in 1584 ms returned []
[2023-03-22 06:54:20] [INFO ] Invariant cache hit.
[2023-03-22 06:54:23] [INFO ] Implicit Places using invariants and state equation in 3055 ms returned []
Implicit Place search using SMT with State Equation took 4655 ms to find 0 implicit places.
[2023-03-22 06:54:23] [INFO ] Invariant cache hit.
[2023-03-22 06:54:29] [INFO ] Dead Transitions using invariants and state equation in 6029 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2681/2687 places, 2401/2407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11096 ms. Remains : 2681/2687 places, 2401/2407 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s2248 0), p1:(EQ s550 0), p2:(EQ s1470 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1016 ms.
Product exploration explored 100000 steps with 33333 reset in 918 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Detected a total of 638/2681 stabilizing places and 638/2401 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X p0), true, (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 5 factoid took 232 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-040B-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-040B-LTLFireability-09 finished in 13556 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 2687 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2687/2687 places, 2407/2407 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 559 transitions
Trivial Post-agglo rules discarded 559 transitions
Performed 559 trivial Post agglomeration. Transition count delta: 559
Iterating post reduction 0 with 559 rules applied. Total rules applied 559 place count 2686 transition count 1847
Reduce places removed 559 places and 0 transitions.
Iterating post reduction 1 with 559 rules applied. Total rules applied 1118 place count 2127 transition count 1847
Performed 317 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 317 Pre rules applied. Total rules applied 1118 place count 2127 transition count 1530
Deduced a syphon composed of 317 places in 3 ms
Reduce places removed 317 places and 0 transitions.
Iterating global reduction 2 with 634 rules applied. Total rules applied 1752 place count 1810 transition count 1530
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1754 place count 1808 transition count 1528
Iterating global reduction 2 with 2 rules applied. Total rules applied 1756 place count 1808 transition count 1528
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1756 place count 1808 transition count 1526
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1760 place count 1806 transition count 1526
Performed 680 Post agglomeration using F-continuation condition.Transition count delta: 680
Deduced a syphon composed of 680 places in 1 ms
Reduce places removed 680 places and 0 transitions.
Iterating global reduction 2 with 1360 rules applied. Total rules applied 3120 place count 1126 transition count 846
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3121 place count 1126 transition count 845
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3123 place count 1125 transition count 844
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3325 place count 1024 transition count 844
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3361 place count 1006 transition count 844
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3363 place count 1004 transition count 842
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3364 place count 1003 transition count 842
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3364 place count 1003 transition count 840
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3368 place count 1001 transition count 840
Applied a total of 3368 rules in 538 ms. Remains 1001 /2687 variables (removed 1686) and now considering 840/2407 (removed 1567) transitions.
// Phase 1: matrix 840 rows 1001 cols
[2023-03-22 06:54:32] [INFO ] Computed 440 place invariants in 4 ms
[2023-03-22 06:54:33] [INFO ] Implicit Places using invariants in 1202 ms returned [984, 988]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1204 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 999/2687 places, 840/2407 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 997 transition count 838
Applied a total of 4 rules in 35 ms. Remains 997 /999 variables (removed 2) and now considering 838/840 (removed 2) transitions.
// Phase 1: matrix 838 rows 997 cols
[2023-03-22 06:54:33] [INFO ] Computed 438 place invariants in 2 ms
[2023-03-22 06:54:34] [INFO ] Implicit Places using invariants in 637 ms returned []
[2023-03-22 06:54:34] [INFO ] Invariant cache hit.
[2023-03-22 06:54:37] [INFO ] Implicit Places using invariants and state equation in 2587 ms returned []
Implicit Place search using SMT with State Equation took 3240 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 997/2687 places, 838/2407 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5020 ms. Remains : 997/2687 places, 838/2407 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s551 0), p1:(AND (EQ s178 1) (EQ s203 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 748 ms.
Stack based approach found an accepted trace after 23 steps with 0 reset with depth 24 and stack size 24 in 1 ms.
FORMULA ShieldPPPt-PT-040B-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040B-LTLFireability-10 finished in 5961 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((G(p1) U p2)))))'
Support contains 3 out of 2687 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2687/2687 places, 2407/2407 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 2682 transition count 2402
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 2682 transition count 2402
Applied a total of 10 rules in 338 ms. Remains 2682 /2687 variables (removed 5) and now considering 2402/2407 (removed 5) transitions.
// Phase 1: matrix 2402 rows 2682 cols
[2023-03-22 06:54:38] [INFO ] Computed 441 place invariants in 15 ms
[2023-03-22 06:54:40] [INFO ] Implicit Places using invariants in 1661 ms returned []
[2023-03-22 06:54:40] [INFO ] Invariant cache hit.
[2023-03-22 06:54:48] [INFO ] Implicit Places using invariants and state equation in 8976 ms returned []
Implicit Place search using SMT with State Equation took 10692 ms to find 0 implicit places.
[2023-03-22 06:54:49] [INFO ] Invariant cache hit.
[2023-03-22 06:54:51] [INFO ] Dead Transitions using invariants and state equation in 2546 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2682/2687 places, 2402/2407 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13595 ms. Remains : 2682/2687 places, 2402/2407 transitions.
Stuttering acceptance computed with spot in 326 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), true, (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s2346 1), p2:(EQ s2109 1), p1:(EQ s1163 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-040B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-040B-LTLFireability-11 finished in 13959 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 2687 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2687/2687 places, 2407/2407 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 559 transitions
Trivial Post-agglo rules discarded 559 transitions
Performed 559 trivial Post agglomeration. Transition count delta: 559
Iterating post reduction 0 with 559 rules applied. Total rules applied 559 place count 2686 transition count 1847
Reduce places removed 559 places and 0 transitions.
Iterating post reduction 1 with 559 rules applied. Total rules applied 1118 place count 2127 transition count 1847
Performed 315 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 315 Pre rules applied. Total rules applied 1118 place count 2127 transition count 1532
Deduced a syphon composed of 315 places in 2 ms
Reduce places removed 315 places and 0 transitions.
Iterating global reduction 2 with 630 rules applied. Total rules applied 1748 place count 1812 transition count 1532
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1751 place count 1809 transition count 1529
Iterating global reduction 2 with 3 rules applied. Total rules applied 1754 place count 1809 transition count 1529
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 1754 place count 1809 transition count 1526
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 1760 place count 1806 transition count 1526
Performed 682 Post agglomeration using F-continuation condition.Transition count delta: 682
Deduced a syphon composed of 682 places in 1 ms
Reduce places removed 682 places and 0 transitions.
Iterating global reduction 2 with 1364 rules applied. Total rules applied 3124 place count 1124 transition count 844
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3125 place count 1124 transition count 843
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3127 place count 1123 transition count 842
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3329 place count 1022 transition count 842
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 3363 place count 1005 transition count 842
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3365 place count 1003 transition count 840
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3366 place count 1002 transition count 840
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3366 place count 1002 transition count 838
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3370 place count 1000 transition count 838
Applied a total of 3370 rules in 705 ms. Remains 1000 /2687 variables (removed 1687) and now considering 838/2407 (removed 1569) transitions.
// Phase 1: matrix 838 rows 1000 cols
[2023-03-22 06:54:52] [INFO ] Computed 440 place invariants in 1 ms
[2023-03-22 06:54:53] [INFO ] Implicit Places using invariants in 652 ms returned [983, 987]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 653 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 998/2687 places, 838/2407 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 996 transition count 836
Applied a total of 4 rules in 37 ms. Remains 996 /998 variables (removed 2) and now considering 836/838 (removed 2) transitions.
// Phase 1: matrix 836 rows 996 cols
[2023-03-22 06:54:53] [INFO ] Computed 438 place invariants in 22 ms
[2023-03-22 06:54:54] [INFO ] Implicit Places using invariants in 1168 ms returned []
[2023-03-22 06:54:54] [INFO ] Invariant cache hit.
[2023-03-22 06:54:56] [INFO ] Implicit Places using invariants and state equation in 1467 ms returned []
Implicit Place search using SMT with State Equation took 2643 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 996/2687 places, 836/2407 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4038 ms. Remains : 996/2687 places, 836/2407 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-12 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 s148 1) (EQ s404 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 685 ms.
Stack based approach found an accepted trace after 159 steps with 0 reset with depth 160 and stack size 160 in 2 ms.
FORMULA ShieldPPPt-PT-040B-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040B-LTLFireability-12 finished in 4880 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 2687 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2687/2687 places, 2407/2407 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 559 transitions
Trivial Post-agglo rules discarded 559 transitions
Performed 559 trivial Post agglomeration. Transition count delta: 559
Iterating post reduction 0 with 559 rules applied. Total rules applied 559 place count 2686 transition count 1847
Reduce places removed 559 places and 0 transitions.
Iterating post reduction 1 with 559 rules applied. Total rules applied 1118 place count 2127 transition count 1847
Performed 317 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 317 Pre rules applied. Total rules applied 1118 place count 2127 transition count 1530
Deduced a syphon composed of 317 places in 3 ms
Reduce places removed 317 places and 0 transitions.
Iterating global reduction 2 with 634 rules applied. Total rules applied 1752 place count 1810 transition count 1530
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1755 place count 1807 transition count 1527
Iterating global reduction 2 with 3 rules applied. Total rules applied 1758 place count 1807 transition count 1527
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 1758 place count 1807 transition count 1524
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 1764 place count 1804 transition count 1524
Performed 681 Post agglomeration using F-continuation condition.Transition count delta: 681
Deduced a syphon composed of 681 places in 1 ms
Reduce places removed 681 places and 0 transitions.
Iterating global reduction 2 with 1362 rules applied. Total rules applied 3126 place count 1123 transition count 843
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3127 place count 1123 transition count 842
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3129 place count 1122 transition count 841
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3331 place count 1021 transition count 841
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3367 place count 1003 transition count 841
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3369 place count 1001 transition count 839
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3370 place count 1000 transition count 839
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 3370 place count 1000 transition count 837
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 3374 place count 998 transition count 837
Applied a total of 3374 rules in 578 ms. Remains 998 /2687 variables (removed 1689) and now considering 837/2407 (removed 1570) transitions.
// Phase 1: matrix 837 rows 998 cols
[2023-03-22 06:54:57] [INFO ] Computed 440 place invariants in 3 ms
[2023-03-22 06:54:58] [INFO ] Implicit Places using invariants in 775 ms returned [981, 985]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 776 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 996/2687 places, 837/2407 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 994 transition count 835
Applied a total of 4 rules in 33 ms. Remains 994 /996 variables (removed 2) and now considering 835/837 (removed 2) transitions.
// Phase 1: matrix 835 rows 994 cols
[2023-03-22 06:54:58] [INFO ] Computed 438 place invariants in 1 ms
[2023-03-22 06:54:58] [INFO ] Implicit Places using invariants in 696 ms returned []
[2023-03-22 06:54:58] [INFO ] Invariant cache hit.
[2023-03-22 06:55:00] [INFO ] Implicit Places using invariants and state equation in 1477 ms returned []
Implicit Place search using SMT with State Equation took 2175 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 994/2687 places, 835/2407 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3562 ms. Remains : 994/2687 places, 835/2407 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s280 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 698 ms.
Stack based approach found an accepted trace after 37 steps with 0 reset with depth 38 and stack size 38 in 0 ms.
FORMULA ShieldPPPt-PT-040B-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040B-LTLFireability-13 finished in 4322 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(p1))||p0) U (G(p2) U p3)))'
Support contains 5 out of 2687 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2687/2687 places, 2407/2407 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 556 transitions
Trivial Post-agglo rules discarded 556 transitions
Performed 556 trivial Post agglomeration. Transition count delta: 556
Iterating post reduction 0 with 556 rules applied. Total rules applied 556 place count 2686 transition count 1850
Reduce places removed 556 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 557 rules applied. Total rules applied 1113 place count 2130 transition count 1849
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1114 place count 2129 transition count 1849
Performed 317 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 317 Pre rules applied. Total rules applied 1114 place count 2129 transition count 1532
Deduced a syphon composed of 317 places in 2 ms
Reduce places removed 317 places and 0 transitions.
Iterating global reduction 3 with 634 rules applied. Total rules applied 1748 place count 1812 transition count 1532
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1751 place count 1809 transition count 1529
Iterating global reduction 3 with 3 rules applied. Total rules applied 1754 place count 1809 transition count 1529
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 1754 place count 1809 transition count 1526
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1760 place count 1806 transition count 1526
Performed 676 Post agglomeration using F-continuation condition.Transition count delta: 676
Deduced a syphon composed of 676 places in 1 ms
Reduce places removed 676 places and 0 transitions.
Iterating global reduction 3 with 1352 rules applied. Total rules applied 3112 place count 1130 transition count 850
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3113 place count 1130 transition count 849
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3115 place count 1129 transition count 848
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3317 place count 1028 transition count 848
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 3353 place count 1010 transition count 848
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 3354 place count 1010 transition count 848
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3356 place count 1008 transition count 846
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3357 place count 1007 transition count 846
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 3357 place count 1007 transition count 844
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3361 place count 1005 transition count 844
Applied a total of 3361 rules in 568 ms. Remains 1005 /2687 variables (removed 1682) and now considering 844/2407 (removed 1563) transitions.
// Phase 1: matrix 844 rows 1005 cols
[2023-03-22 06:55:01] [INFO ] Computed 440 place invariants in 2 ms
[2023-03-22 06:55:03] [INFO ] Implicit Places using invariants in 1683 ms returned [988, 992]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1690 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1003/2687 places, 844/2407 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1001 transition count 842
Applied a total of 4 rules in 47 ms. Remains 1001 /1003 variables (removed 2) and now considering 842/844 (removed 2) transitions.
// Phase 1: matrix 842 rows 1001 cols
[2023-03-22 06:55:03] [INFO ] Computed 438 place invariants in 2 ms
[2023-03-22 06:55:11] [INFO ] Implicit Places using invariants in 7799 ms returned []
[2023-03-22 06:55:11] [INFO ] Invariant cache hit.
[2023-03-22 06:55:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 06:55:16] [INFO ] Implicit Places using invariants and state equation in 4926 ms returned []
Implicit Place search using SMT with State Equation took 12757 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1001/2687 places, 842/2407 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 15062 ms. Remains : 1001/2687 places, 842/2407 transitions.
Stuttering acceptance computed with spot in 226 ms :[(NOT p3), (NOT p1), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p3))]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2) p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) p2 p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p3) p2 p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(AND (EQ s317 1) (EQ s352 1)), p2:(EQ s375 1), p0:(OR (EQ s278 1) (EQ s554 1)), p1:(NEQ s554 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 26896 reset in 894 ms.
Stack based approach found an accepted trace after 18 steps with 4 reset with depth 9 and stack size 9 in 0 ms.
FORMULA ShieldPPPt-PT-040B-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040B-LTLFireability-14 finished in 16240 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 3 out of 2687 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2687/2687 places, 2407/2407 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 557 transitions
Trivial Post-agglo rules discarded 557 transitions
Performed 557 trivial Post agglomeration. Transition count delta: 557
Iterating post reduction 0 with 557 rules applied. Total rules applied 557 place count 2686 transition count 1849
Reduce places removed 557 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 558 rules applied. Total rules applied 1115 place count 2129 transition count 1848
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1116 place count 2128 transition count 1848
Performed 315 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 315 Pre rules applied. Total rules applied 1116 place count 2128 transition count 1533
Deduced a syphon composed of 315 places in 4 ms
Reduce places removed 315 places and 0 transitions.
Iterating global reduction 3 with 630 rules applied. Total rules applied 1746 place count 1813 transition count 1533
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1749 place count 1810 transition count 1530
Iterating global reduction 3 with 3 rules applied. Total rules applied 1752 place count 1810 transition count 1530
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 1752 place count 1810 transition count 1527
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1758 place count 1807 transition count 1527
Performed 682 Post agglomeration using F-continuation condition.Transition count delta: 682
Deduced a syphon composed of 682 places in 1 ms
Reduce places removed 682 places and 0 transitions.
Iterating global reduction 3 with 1364 rules applied. Total rules applied 3122 place count 1125 transition count 845
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3123 place count 1125 transition count 844
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3125 place count 1124 transition count 843
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3327 place count 1023 transition count 843
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 3359 place count 1007 transition count 843
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3361 place count 1005 transition count 841
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3362 place count 1004 transition count 841
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 3362 place count 1004 transition count 839
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3366 place count 1002 transition count 839
Applied a total of 3366 rules in 483 ms. Remains 1002 /2687 variables (removed 1685) and now considering 839/2407 (removed 1568) transitions.
// Phase 1: matrix 839 rows 1002 cols
[2023-03-22 06:55:17] [INFO ] Computed 440 place invariants in 3 ms
[2023-03-22 06:55:22] [INFO ] Implicit Places using invariants in 4104 ms returned [985, 989]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 4111 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1000/2687 places, 839/2407 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 998 transition count 837
Applied a total of 4 rules in 54 ms. Remains 998 /1000 variables (removed 2) and now considering 837/839 (removed 2) transitions.
// Phase 1: matrix 837 rows 998 cols
[2023-03-22 06:55:22] [INFO ] Computed 438 place invariants in 2 ms
[2023-03-22 06:55:22] [INFO ] Implicit Places using invariants in 638 ms returned []
[2023-03-22 06:55:22] [INFO ] Invariant cache hit.
[2023-03-22 06:55:24] [INFO ] Implicit Places using invariants and state equation in 1344 ms returned []
Implicit Place search using SMT with State Equation took 2004 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 998/2687 places, 837/2407 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6652 ms. Remains : 998/2687 places, 837/2407 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-040B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s904 1), p0:(AND (EQ s929 1) (EQ s673 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 750 ms.
Stack based approach found an accepted trace after 62 steps with 0 reset with depth 63 and stack size 63 in 1 ms.
FORMULA ShieldPPPt-PT-040B-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-040B-LTLFireability-15 finished in 7607 ms.
All properties solved by simple procedures.
Total runtime 390866 ms.
ITS solved all properties within timeout

BK_STOP 1679468125366

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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="ShieldPPPt-PT-040B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldPPPt-PT-040B, 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 r393-oct2-167903717300668"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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