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-167903717300684.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-050B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903717300684
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 8.5K Feb 25 20:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Feb 25 20:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 20:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 20:56 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.5K 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 17K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 20:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 178K Feb 25 20:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 25 20:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 20:57 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 955K 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-050B-LTLFireability-00
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-01
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-02
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-03
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-04
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-05
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-06
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-07
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-08
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-09
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-10
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-11
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-12
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-13
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-14
FORMULA_NAME ShieldPPPt-PT-050B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679470573803

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-050B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 07:36:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 07:36:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 07:36:17] [INFO ] Load time of PNML (sax parser for PT used): 226 ms
[2023-03-22 07:36:18] [INFO ] Transformed 3903 places.
[2023-03-22 07:36:18] [INFO ] Transformed 3553 transitions.
[2023-03-22 07:36:18] [INFO ] Found NUPN structural information;
[2023-03-22 07:36:18] [INFO ] Parsed PT model containing 3903 places and 3553 transitions and 8906 arcs in 665 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Support contains 46 out of 3903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3903/3903 places, 3553/3553 transitions.
Discarding 537 places :
Symmetric choice reduction at 0 with 537 rule applications. Total rules 537 place count 3366 transition count 3016
Iterating global reduction 0 with 537 rules applied. Total rules applied 1074 place count 3366 transition count 3016
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1075 place count 3365 transition count 3015
Iterating global reduction 0 with 1 rules applied. Total rules applied 1076 place count 3365 transition count 3015
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1077 place count 3364 transition count 3014
Iterating global reduction 0 with 1 rules applied. Total rules applied 1078 place count 3364 transition count 3014
Applied a total of 1078 rules in 2070 ms. Remains 3364 /3903 variables (removed 539) and now considering 3014/3553 (removed 539) transitions.
// Phase 1: matrix 3014 rows 3364 cols
[2023-03-22 07:36:20] [INFO ] Computed 551 place invariants in 55 ms
[2023-03-22 07:36:23] [INFO ] Implicit Places using invariants in 2439 ms returned []
[2023-03-22 07:36:23] [INFO ] Invariant cache hit.
[2023-03-22 07:36:27] [INFO ] Implicit Places using invariants and state equation in 4590 ms returned []
Implicit Place search using SMT with State Equation took 7094 ms to find 0 implicit places.
[2023-03-22 07:36:27] [INFO ] Invariant cache hit.
[2023-03-22 07:36:31] [INFO ] Dead Transitions using invariants and state equation in 3696 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3364/3903 places, 3014/3553 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12865 ms. Remains : 3364/3903 places, 3014/3553 transitions.
Support contains 46 out of 3364 places after structural reductions.
[2023-03-22 07:36:31] [INFO ] Flatten gal took : 233 ms
[2023-03-22 07:36:32] [INFO ] Flatten gal took : 159 ms
[2023-03-22 07:36:32] [INFO ] Input system was already deterministic with 3014 transitions.
Support contains 43 out of 3364 places (down from 46) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 556 ms. (steps per millisecond=17 ) properties (out of 41) seen :21
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) seen :0
Running SMT prover for 20 properties.
[2023-03-22 07:36:33] [INFO ] Invariant cache hit.
[2023-03-22 07:36:35] [INFO ] [Real]Absence check using 551 positive place invariants in 627 ms returned sat
[2023-03-22 07:36:36] [INFO ] After 3227ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-22 07:36:38] [INFO ] [Nat]Absence check using 551 positive place invariants in 565 ms returned sat
[2023-03-22 07:36:45] [INFO ] After 5638ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2023-03-22 07:36:46] [INFO ] Deduced a trap composed of 33 places in 1097 ms of which 14 ms to minimize.
[2023-03-22 07:36:48] [INFO ] Deduced a trap composed of 18 places in 1343 ms of which 2 ms to minimize.
[2023-03-22 07:36:49] [INFO ] Deduced a trap composed of 19 places in 1472 ms of which 4 ms to minimize.
[2023-03-22 07:36:52] [INFO ] Deduced a trap composed of 31 places in 2405 ms of which 30 ms to minimize.
[2023-03-22 07:36:55] [INFO ] Deduced a trap composed of 21 places in 3347 ms of which 13 ms to minimize.
[2023-03-22 07:36:57] [INFO ] Deduced a trap composed of 18 places in 1108 ms of which 1 ms to minimize.
[2023-03-22 07:36:58] [INFO ] Deduced a trap composed of 27 places in 1534 ms of which 1 ms to minimize.
[2023-03-22 07:37:00] [INFO ] Deduced a trap composed of 16 places in 1525 ms of which 2 ms to minimize.
[2023-03-22 07:37:01] [INFO ] Deduced a trap composed of 22 places in 983 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 07:37:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 07:37:01] [INFO ] After 25216ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:20
Fused 20 Parikh solutions to 17 different solutions.
Parikh walk visited 0 properties in 2826 ms.
Support contains 25 out of 3364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3364/3364 places, 3014/3014 transitions.
Drop transitions removed 686 transitions
Trivial Post-agglo rules discarded 686 transitions
Performed 686 trivial Post agglomeration. Transition count delta: 686
Iterating post reduction 0 with 686 rules applied. Total rules applied 686 place count 3364 transition count 2328
Reduce places removed 686 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 693 rules applied. Total rules applied 1379 place count 2678 transition count 2321
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1386 place count 2671 transition count 2321
Performed 392 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 392 Pre rules applied. Total rules applied 1386 place count 2671 transition count 1929
Deduced a syphon composed of 392 places in 4 ms
Reduce places removed 392 places and 0 transitions.
Iterating global reduction 3 with 784 rules applied. Total rules applied 2170 place count 2279 transition count 1929
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2176 place count 2273 transition count 1923
Iterating global reduction 3 with 6 rules applied. Total rules applied 2182 place count 2273 transition count 1923
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 2182 place count 2273 transition count 1920
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 2188 place count 2270 transition count 1920
Performed 843 Post agglomeration using F-continuation condition.Transition count delta: 843
Deduced a syphon composed of 843 places in 4 ms
Reduce places removed 843 places and 0 transitions.
Iterating global reduction 3 with 1686 rules applied. Total rules applied 3874 place count 1427 transition count 1077
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3875 place count 1427 transition count 1076
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 3877 place count 1426 transition count 1075
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 7 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4079 place count 1325 transition count 1075
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 44 places in 3 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 4167 place count 1281 transition count 1075
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4168 place count 1281 transition count 1074
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4169 place count 1280 transition count 1074
Partial Free-agglomeration rule applied 146 times.
Drop transitions removed 146 transitions
Iterating global reduction 5 with 146 rules applied. Total rules applied 4315 place count 1280 transition count 1074
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4316 place count 1279 transition count 1073
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 4317 place count 1278 transition count 1073
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 4317 place count 1278 transition count 1071
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 4321 place count 1276 transition count 1071
Applied a total of 4321 rules in 980 ms. Remains 1276 /3364 variables (removed 2088) and now considering 1071/3014 (removed 1943) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 980 ms. Remains : 1276/3364 places, 1071/3014 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 527 ms. (steps per millisecond=18 ) properties (out of 20) 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 16) 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 16) 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 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 16) 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 16) 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 16) 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 16) 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 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 1071 rows 1276 cols
[2023-03-22 07:37:06] [INFO ] Computed 550 place invariants in 4 ms
[2023-03-22 07:37:06] [INFO ] [Real]Absence check using 550 positive place invariants in 165 ms returned sat
[2023-03-22 07:37:07] [INFO ] After 868ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-22 07:37:07] [INFO ] [Nat]Absence check using 550 positive place invariants in 180 ms returned sat
[2023-03-22 07:37:09] [INFO ] After 1604ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2023-03-22 07:37:09] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-22 07:37:10] [INFO ] After 1266ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :16
[2023-03-22 07:37:11] [INFO ] Deduced a trap composed of 6 places in 170 ms of which 1 ms to minimize.
[2023-03-22 07:37:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 263 ms
[2023-03-22 07:37:12] [INFO ] After 2879ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 866 ms.
[2023-03-22 07:37:13] [INFO ] After 6310ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Fused 16 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 432 ms.
Support contains 22 out of 1276 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1276/1276 places, 1071/1071 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1276 transition count 1070
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1275 transition count 1070
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 2 with 4 rules applied. Total rules applied 6 place count 1273 transition count 1068
Applied a total of 6 rules in 67 ms. Remains 1273 /1276 variables (removed 3) and now considering 1068/1071 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 1273/1276 places, 1068/1071 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 479 ms. (steps per millisecond=20 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 16) 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 16) 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 16) 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 16) 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 16) 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 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 68890 steps, run timeout after 3056 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68890 steps, saw 58070 distinct states, run finished after 3060 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 1068 rows 1273 cols
[2023-03-22 07:37:17] [INFO ] Computed 550 place invariants in 3 ms
[2023-03-22 07:37:18] [INFO ] [Real]Absence check using 550 positive place invariants in 161 ms returned sat
[2023-03-22 07:37:18] [INFO ] After 876ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-22 07:37:19] [INFO ] [Nat]Absence check using 550 positive place invariants in 256 ms returned sat
[2023-03-22 07:37:21] [INFO ] After 1844ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2023-03-22 07:37:21] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-22 07:37:22] [INFO ] After 983ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :16
[2023-03-22 07:37:22] [INFO ] Deduced a trap composed of 6 places in 212 ms of which 0 ms to minimize.
[2023-03-22 07:37:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 331 ms
[2023-03-22 07:37:23] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 0 ms to minimize.
[2023-03-22 07:37:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 254 ms
[2023-03-22 07:37:24] [INFO ] Deduced a trap composed of 7 places in 218 ms of which 0 ms to minimize.
[2023-03-22 07:37:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 309 ms
[2023-03-22 07:37:24] [INFO ] After 3449ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 1047 ms.
[2023-03-22 07:37:26] [INFO ] After 7531ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Fused 16 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 551 ms.
Support contains 22 out of 1273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1273/1273 places, 1068/1068 transitions.
Applied a total of 0 rules in 33 ms. Remains 1273 /1273 variables (removed 0) and now considering 1068/1068 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 1273/1273 places, 1068/1068 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1273/1273 places, 1068/1068 transitions.
Applied a total of 0 rules in 32 ms. Remains 1273 /1273 variables (removed 0) and now considering 1068/1068 (removed 0) transitions.
[2023-03-22 07:37:26] [INFO ] Invariant cache hit.
[2023-03-22 07:37:27] [INFO ] Implicit Places using invariants in 687 ms returned [1256, 1260]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 689 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1271/1273 places, 1068/1068 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1269 transition count 1066
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1269 transition count 1066
Applied a total of 4 rules in 75 ms. Remains 1269 /1271 variables (removed 2) and now considering 1066/1068 (removed 2) transitions.
// Phase 1: matrix 1066 rows 1269 cols
[2023-03-22 07:37:27] [INFO ] Computed 548 place invariants in 4 ms
[2023-03-22 07:37:28] [INFO ] Implicit Places using invariants in 1144 ms returned []
[2023-03-22 07:37:28] [INFO ] Invariant cache hit.
[2023-03-22 07:37:29] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-22 07:37:31] [INFO ] Implicit Places using invariants and state equation in 3056 ms returned []
Implicit Place search using SMT with State Equation took 4230 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1269/1273 places, 1066/1068 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5026 ms. Remains : 1269/1273 places, 1066/1068 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 500 ms. (steps per millisecond=20 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 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 10000 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 151 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 122 ms. (steps per millisecond=81 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 136 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 112 ms. (steps per millisecond=89 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2023-03-22 07:37:33] [INFO ] Invariant cache hit.
[2023-03-22 07:37:34] [INFO ] [Real]Absence check using 548 positive place invariants in 195 ms returned sat
[2023-03-22 07:37:34] [INFO ] After 873ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-22 07:37:35] [INFO ] [Nat]Absence check using 548 positive place invariants in 77 ms returned sat
[2023-03-22 07:37:37] [INFO ] After 1660ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-22 07:37:37] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-22 07:37:38] [INFO ] After 892ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-03-22 07:37:39] [INFO ] After 2443ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 764 ms.
[2023-03-22 07:37:40] [INFO ] After 6094ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 14 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 215 ms.
Support contains 19 out of 1269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1269/1269 places, 1066/1066 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 1269 transition count 1064
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 1267 transition count 1064
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 6 place count 1266 transition count 1063
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 8 place count 1265 transition count 1063
Applied a total of 8 rules in 107 ms. Remains 1265 /1269 variables (removed 4) and now considering 1063/1066 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 1265/1269 places, 1063/1066 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 60519 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 60519 steps, saw 50565 distinct states, run finished after 3002 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 1063 rows 1265 cols
[2023-03-22 07:37:45] [INFO ] Computed 548 place invariants in 3 ms
[2023-03-22 07:37:46] [INFO ] [Real]Absence check using 548 positive place invariants in 126 ms returned sat
[2023-03-22 07:37:46] [INFO ] After 863ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-22 07:37:47] [INFO ] [Nat]Absence check using 548 positive place invariants in 105 ms returned sat
[2023-03-22 07:37:50] [INFO ] After 3134ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-22 07:37:50] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-22 07:37:51] [INFO ] After 1013ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-03-22 07:37:53] [INFO ] After 2913ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 905 ms.
[2023-03-22 07:37:54] [INFO ] After 7946ms 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 195 ms.
Support contains 19 out of 1265 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1265/1265 places, 1063/1063 transitions.
Applied a total of 0 rules in 37 ms. Remains 1265 /1265 variables (removed 0) and now considering 1063/1063 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 1265/1265 places, 1063/1063 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1265/1265 places, 1063/1063 transitions.
Applied a total of 0 rules in 34 ms. Remains 1265 /1265 variables (removed 0) and now considering 1063/1063 (removed 0) transitions.
[2023-03-22 07:37:55] [INFO ] Invariant cache hit.
[2023-03-22 07:37:56] [INFO ] Implicit Places using invariants in 1175 ms returned []
[2023-03-22 07:37:56] [INFO ] Invariant cache hit.
[2023-03-22 07:37:56] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-22 07:37:59] [INFO ] Implicit Places using invariants and state equation in 2847 ms returned []
Implicit Place search using SMT with State Equation took 4033 ms to find 0 implicit places.
[2023-03-22 07:37:59] [INFO ] Redundant transitions in 117 ms returned []
[2023-03-22 07:37:59] [INFO ] Invariant cache hit.
[2023-03-22 07:37:59] [INFO ] Dead Transitions using invariants and state equation in 781 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5003 ms. Remains : 1265/1265 places, 1063/1063 transitions.
Partial Free-agglomeration rule applied 286 times.
Drop transitions removed 286 transitions
Iterating global reduction 0 with 286 rules applied. Total rules applied 286 place count 1265 transition count 1063
Applied a total of 286 rules in 97 ms. Remains 1265 /1265 variables (removed 0) and now considering 1063/1063 (removed 0) transitions.
Running SMT prover for 14 properties.
// Phase 1: matrix 1063 rows 1265 cols
[2023-03-22 07:38:00] [INFO ] Computed 548 place invariants in 3 ms
[2023-03-22 07:38:00] [INFO ] [Real]Absence check using 548 positive place invariants in 137 ms returned sat
[2023-03-22 07:38:00] [INFO ] After 709ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-22 07:38:02] [INFO ] [Nat]Absence check using 548 positive place invariants in 918 ms returned sat
[2023-03-22 07:38:05] [INFO ] After 2248ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-22 07:38:05] [INFO ] State equation strengthened by 279 read => feed constraints.
[2023-03-22 07:38:07] [INFO ] After 1806ms SMT Verify possible using 279 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-03-22 07:38:08] [INFO ] Deduced a trap composed of 5 places in 361 ms of which 0 ms to minimize.
[2023-03-22 07:38:10] [INFO ] Deduced a trap composed of 3 places in 2721 ms of which 1 ms to minimize.
[2023-03-22 07:38:13] [INFO ] Deduced a trap composed of 7 places in 2283 ms of which 1 ms to minimize.
[2023-03-22 07:38:13] [INFO ] Deduced a trap composed of 5 places in 274 ms of which 2 ms to minimize.
[2023-03-22 07:38:13] [INFO ] Deduced a trap composed of 5 places in 247 ms of which 1 ms to minimize.
[2023-03-22 07:38:14] [INFO ] Deduced a trap composed of 5 places in 294 ms of which 1 ms to minimize.
[2023-03-22 07:38:14] [INFO ] Deduced a trap composed of 5 places in 326 ms of which 1 ms to minimize.
[2023-03-22 07:38:15] [INFO ] Deduced a trap composed of 5 places in 375 ms of which 1 ms to minimize.
[2023-03-22 07:38:15] [INFO ] Deduced a trap composed of 6 places in 328 ms of which 28 ms to minimize.
[2023-03-22 07:38:15] [INFO ] Deduced a trap composed of 5 places in 288 ms of which 1 ms to minimize.
[2023-03-22 07:38:15] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 8265 ms
[2023-03-22 07:38:16] [INFO ] Deduced a trap composed of 7 places in 235 ms of which 0 ms to minimize.
[2023-03-22 07:38:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 393 ms
[2023-03-22 07:38:17] [INFO ] Deduced a trap composed of 7 places in 354 ms of which 1 ms to minimize.
[2023-03-22 07:38:17] [INFO ] Deduced a trap composed of 7 places in 241 ms of which 1 ms to minimize.
[2023-03-22 07:38:18] [INFO ] Deduced a trap composed of 5 places in 361 ms of which 2 ms to minimize.
[2023-03-22 07:38:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1212 ms
[2023-03-22 07:38:19] [INFO ] After 13481ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 1146 ms.
[2023-03-22 07:38:20] [INFO ] After 19681ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Computed a total of 801 stabilizing places and 801 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||G(p1))))'
Support contains 1 out of 3364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3364/3364 places, 3014/3014 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3351 transition count 3001
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3351 transition count 3001
Applied a total of 26 rules in 702 ms. Remains 3351 /3364 variables (removed 13) and now considering 3001/3014 (removed 13) transitions.
// Phase 1: matrix 3001 rows 3351 cols
[2023-03-22 07:38:21] [INFO ] Computed 551 place invariants in 29 ms
[2023-03-22 07:38:23] [INFO ] Implicit Places using invariants in 1781 ms returned []
[2023-03-22 07:38:23] [INFO ] Invariant cache hit.
[2023-03-22 07:38:29] [INFO ] Implicit Places using invariants and state equation in 5701 ms returned []
Implicit Place search using SMT with State Equation took 7507 ms to find 0 implicit places.
[2023-03-22 07:38:29] [INFO ] Invariant cache hit.
[2023-03-22 07:38:32] [INFO ] Dead Transitions using invariants and state equation in 2894 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3351/3364 places, 3001/3014 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11105 ms. Remains : 3351/3364 places, 3001/3014 transitions.
Stuttering acceptance computed with spot in 500 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(EQ s2522 0), p1:(EQ s2522 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1471 ms.
Product exploration explored 100000 steps with 33333 reset in 1362 ms.
Computed a total of 798 stabilizing places and 798 stable transitions
Computed a total of 798 stabilizing places and 798 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 5 factoid took 246 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-050B-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-050B-LTLFireability-00 finished in 14829 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(p1)))'
Support contains 3 out of 3364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3364/3364 places, 3014/3014 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 3352 transition count 3002
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 3352 transition count 3002
Applied a total of 24 rules in 784 ms. Remains 3352 /3364 variables (removed 12) and now considering 3002/3014 (removed 12) transitions.
// Phase 1: matrix 3002 rows 3352 cols
[2023-03-22 07:38:36] [INFO ] Computed 551 place invariants in 38 ms
[2023-03-22 07:38:38] [INFO ] Implicit Places using invariants in 1814 ms returned []
[2023-03-22 07:38:38] [INFO ] Invariant cache hit.
[2023-03-22 07:38:43] [INFO ] Implicit Places using invariants and state equation in 4513 ms returned []
Implicit Place search using SMT with State Equation took 6348 ms to find 0 implicit places.
[2023-03-22 07:38:43] [INFO ] Invariant cache hit.
[2023-03-22 07:38:46] [INFO ] Dead Transitions using invariants and state equation in 3270 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3352/3364 places, 3002/3014 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10416 ms. Remains : 3352/3364 places, 3002/3014 transitions.
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s82 1) (EQ s84 1)), p1:(EQ s2273 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 975 ms.
Stack based approach found an accepted trace after 2561 steps with 0 reset with depth 2562 and stack size 2562 in 26 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-01 finished in 11692 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||(F(G(p1)) U (G(p2)&&F(p3))))))'
Support contains 5 out of 3364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3364/3364 places, 3014/3014 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 698 transitions
Trivial Post-agglo rules discarded 698 transitions
Performed 698 trivial Post agglomeration. Transition count delta: 698
Iterating post reduction 0 with 698 rules applied. Total rules applied 698 place count 3363 transition count 2315
Reduce places removed 698 places and 0 transitions.
Iterating post reduction 1 with 698 rules applied. Total rules applied 1396 place count 2665 transition count 2315
Performed 395 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 395 Pre rules applied. Total rules applied 1396 place count 2665 transition count 1920
Deduced a syphon composed of 395 places in 3 ms
Reduce places removed 395 places and 0 transitions.
Iterating global reduction 2 with 790 rules applied. Total rules applied 2186 place count 2270 transition count 1920
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 2195 place count 2261 transition count 1911
Iterating global reduction 2 with 9 rules applied. Total rules applied 2204 place count 2261 transition count 1911
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2204 place count 2261 transition count 1905
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 2216 place count 2255 transition count 1905
Performed 846 Post agglomeration using F-continuation condition.Transition count delta: 846
Deduced a syphon composed of 846 places in 1 ms
Reduce places removed 846 places and 0 transitions.
Iterating global reduction 2 with 1692 rules applied. Total rules applied 3908 place count 1409 transition count 1059
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3909 place count 1409 transition count 1058
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 3911 place count 1408 transition count 1057
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4113 place count 1307 transition count 1057
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 4209 place count 1259 transition count 1057
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4211 place count 1257 transition count 1055
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4212 place count 1256 transition count 1055
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 4212 place count 1256 transition count 1053
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 4216 place count 1254 transition count 1053
Applied a total of 4216 rules in 1004 ms. Remains 1254 /3364 variables (removed 2110) and now considering 1053/3014 (removed 1961) transitions.
// Phase 1: matrix 1053 rows 1254 cols
[2023-03-22 07:38:48] [INFO ] Computed 550 place invariants in 17 ms
[2023-03-22 07:38:49] [INFO ] Implicit Places using invariants in 965 ms returned [1237, 1241]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 991 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1252/3364 places, 1053/3014 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 1250 transition count 1051
Applied a total of 4 rules in 67 ms. Remains 1250 /1252 variables (removed 2) and now considering 1051/1053 (removed 2) transitions.
// Phase 1: matrix 1051 rows 1250 cols
[2023-03-22 07:38:49] [INFO ] Computed 548 place invariants in 3 ms
[2023-03-22 07:38:50] [INFO ] Implicit Places using invariants in 845 ms returned []
[2023-03-22 07:38:50] [INFO ] Invariant cache hit.
[2023-03-22 07:38:51] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-22 07:38:52] [INFO ] Implicit Places using invariants and state equation in 1960 ms returned []
Implicit Place search using SMT with State Equation took 2814 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1250/3364 places, 1051/3014 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4876 ms. Remains : 1250/3364 places, 1051/3014 transitions.
Stuttering acceptance computed with spot in 480 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (NOT p1), (OR (NOT p2) (NOT p3)), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p0) p2)]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=0 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 5}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p3)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={0} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 1}, { cond=(AND p0 p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s728 1), p2:(EQ s75 1), p3:(EQ s429 1), p1:(AND (EQ s857 1) (EQ s882 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 876 ms.
Stack based approach found an accepted trace after 452 steps with 0 reset with depth 453 and stack size 453 in 6 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-02 finished in 6324 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 3364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3364/3364 places, 3014/3014 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 699 transitions
Trivial Post-agglo rules discarded 699 transitions
Performed 699 trivial Post agglomeration. Transition count delta: 699
Iterating post reduction 0 with 699 rules applied. Total rules applied 699 place count 3363 transition count 2314
Reduce places removed 699 places and 0 transitions.
Iterating post reduction 1 with 699 rules applied. Total rules applied 1398 place count 2664 transition count 2314
Performed 395 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 395 Pre rules applied. Total rules applied 1398 place count 2664 transition count 1919
Deduced a syphon composed of 395 places in 4 ms
Reduce places removed 395 places and 0 transitions.
Iterating global reduction 2 with 790 rules applied. Total rules applied 2188 place count 2269 transition count 1919
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 2199 place count 2258 transition count 1908
Iterating global reduction 2 with 11 rules applied. Total rules applied 2210 place count 2258 transition count 1908
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 2210 place count 2258 transition count 1900
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 2226 place count 2250 transition count 1900
Performed 847 Post agglomeration using F-continuation condition.Transition count delta: 847
Deduced a syphon composed of 847 places in 2 ms
Reduce places removed 847 places and 0 transitions.
Iterating global reduction 2 with 1694 rules applied. Total rules applied 3920 place count 1403 transition count 1053
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3921 place count 1403 transition count 1052
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 3923 place count 1402 transition count 1051
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 4125 place count 1301 transition count 1051
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 47 places in 2 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 4219 place count 1254 transition count 1051
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4221 place count 1252 transition count 1049
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4222 place count 1251 transition count 1049
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 4222 place count 1251 transition count 1047
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 4226 place count 1249 transition count 1047
Applied a total of 4226 rules in 840 ms. Remains 1249 /3364 variables (removed 2115) and now considering 1047/3014 (removed 1967) transitions.
// Phase 1: matrix 1047 rows 1249 cols
[2023-03-22 07:38:54] [INFO ] Computed 550 place invariants in 2 ms
[2023-03-22 07:38:55] [INFO ] Implicit Places using invariants in 705 ms returned [1232, 1236]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 708 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1247/3364 places, 1047/3014 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 1245 transition count 1045
Applied a total of 4 rules in 63 ms. Remains 1245 /1247 variables (removed 2) and now considering 1045/1047 (removed 2) transitions.
// Phase 1: matrix 1045 rows 1245 cols
[2023-03-22 07:38:55] [INFO ] Computed 548 place invariants in 2 ms
[2023-03-22 07:38:56] [INFO ] Implicit Places using invariants in 845 ms returned []
[2023-03-22 07:38:56] [INFO ] Invariant cache hit.
[2023-03-22 07:38:58] [INFO ] Implicit Places using invariants and state equation in 1838 ms returned []
Implicit Place search using SMT with State Equation took 2687 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1245/3364 places, 1045/3014 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4298 ms. Remains : 1245/3364 places, 1045/3014 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s1195 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 416 reset in 883 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 0 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-03 finished in 5298 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0&&F(p1))||(G((p2||X(p3)))&&F(p0)))))'
Support contains 3 out of 3364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3364/3364 places, 3014/3014 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3351 transition count 3001
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3351 transition count 3001
Applied a total of 26 rules in 772 ms. Remains 3351 /3364 variables (removed 13) and now considering 3001/3014 (removed 13) transitions.
// Phase 1: matrix 3001 rows 3351 cols
[2023-03-22 07:39:00] [INFO ] Computed 551 place invariants in 10 ms
[2023-03-22 07:39:01] [INFO ] Implicit Places using invariants in 1700 ms returned []
[2023-03-22 07:39:01] [INFO ] Invariant cache hit.
[2023-03-22 07:39:06] [INFO ] Implicit Places using invariants and state equation in 4275 ms returned []
Implicit Place search using SMT with State Equation took 6002 ms to find 0 implicit places.
[2023-03-22 07:39:06] [INFO ] Invariant cache hit.
[2023-03-22 07:39:08] [INFO ] Dead Transitions using invariants and state equation in 2021 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3351/3364 places, 3001/3014 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8796 ms. Remains : 3351/3364 places, 3001/3014 transitions.
Stuttering acceptance computed with spot in 494 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p0), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(NOT p1), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s920 1), p2:(EQ s2976 1), p1:(EQ s2940 0), p3:(EQ s2940 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4 reset in 969 ms.
Stack based approach found an accepted trace after 5367 steps with 12 reset with depth 3976 and stack size 3976 in 46 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-04 finished in 10365 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(F(p1)))))'
Support contains 2 out of 3364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3364/3364 places, 3014/3014 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 3363 transition count 2313
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 2663 transition count 2313
Performed 395 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 395 Pre rules applied. Total rules applied 1400 place count 2663 transition count 1918
Deduced a syphon composed of 395 places in 3 ms
Reduce places removed 395 places and 0 transitions.
Iterating global reduction 2 with 790 rules applied. Total rules applied 2190 place count 2268 transition count 1918
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 2200 place count 2258 transition count 1908
Iterating global reduction 2 with 10 rules applied. Total rules applied 2210 place count 2258 transition count 1908
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 2210 place count 2258 transition count 1901
Deduced a syphon composed of 7 places in 4 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 2224 place count 2251 transition count 1901
Performed 846 Post agglomeration using F-continuation condition.Transition count delta: 846
Deduced a syphon composed of 846 places in 1 ms
Reduce places removed 846 places and 0 transitions.
Iterating global reduction 2 with 1692 rules applied. Total rules applied 3916 place count 1405 transition count 1055
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3917 place count 1405 transition count 1054
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 3919 place count 1404 transition count 1053
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4121 place count 1303 transition count 1053
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 4217 place count 1255 transition count 1053
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4219 place count 1253 transition count 1051
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4220 place count 1252 transition count 1051
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 4220 place count 1252 transition count 1049
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 4224 place count 1250 transition count 1049
Applied a total of 4224 rules in 896 ms. Remains 1250 /3364 variables (removed 2114) and now considering 1049/3014 (removed 1965) transitions.
// Phase 1: matrix 1049 rows 1250 cols
[2023-03-22 07:39:10] [INFO ] Computed 550 place invariants in 2 ms
[2023-03-22 07:39:11] [INFO ] Implicit Places using invariants in 1098 ms returned [1233, 1237]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1111 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1248/3364 places, 1049/3014 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 1246 transition count 1047
Applied a total of 4 rules in 102 ms. Remains 1246 /1248 variables (removed 2) and now considering 1047/1049 (removed 2) transitions.
// Phase 1: matrix 1047 rows 1246 cols
[2023-03-22 07:39:11] [INFO ] Computed 548 place invariants in 2 ms
[2023-03-22 07:39:12] [INFO ] Implicit Places using invariants in 885 ms returned []
[2023-03-22 07:39:12] [INFO ] Invariant cache hit.
[2023-03-22 07:39:14] [INFO ] Implicit Places using invariants and state equation in 2091 ms returned []
Implicit Place search using SMT with State Equation took 3000 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1246/3364 places, 1047/3014 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5109 ms. Remains : 1246/3364 places, 1047/3014 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s1021 1), p1:(EQ s53 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 110 reset in 822 ms.
Stack based approach found an accepted trace after 92 steps with 2 reset with depth 82 and stack size 82 in 1 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-05 finished in 6072 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&F(p1))))'
Support contains 3 out of 3364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3364/3364 places, 3014/3014 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 3352 transition count 3002
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 3352 transition count 3002
Applied a total of 24 rules in 688 ms. Remains 3352 /3364 variables (removed 12) and now considering 3002/3014 (removed 12) transitions.
// Phase 1: matrix 3002 rows 3352 cols
[2023-03-22 07:39:16] [INFO ] Computed 551 place invariants in 34 ms
[2023-03-22 07:39:18] [INFO ] Implicit Places using invariants in 1605 ms returned []
[2023-03-22 07:39:18] [INFO ] Invariant cache hit.
[2023-03-22 07:39:21] [INFO ] Implicit Places using invariants and state equation in 3899 ms returned []
Implicit Place search using SMT with State Equation took 5511 ms to find 0 implicit places.
[2023-03-22 07:39:21] [INFO ] Invariant cache hit.
[2023-03-22 07:39:25] [INFO ] Dead Transitions using invariants and state equation in 3639 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3352/3364 places, 3002/3014 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9838 ms. Remains : 3352/3364 places, 3002/3014 transitions.
Stuttering acceptance computed with spot in 280 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s1974 1), p0:(AND (EQ s1974 1) (EQ s2471 1) (EQ s633 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 5 reset in 912 ms.
Stack based approach found an accepted trace after 9207 steps with 0 reset with depth 9208 and stack size 9208 in 105 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-06 finished in 11194 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&&(p1 U (p2||G(p1)))) U (G((!p0&&(p1 U (p2||G(p1)))))||((p1 U (p2||G(p1)))&&p3))))))'
Support contains 5 out of 3364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3364/3364 places, 3014/3014 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3351 transition count 3001
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3351 transition count 3001
Applied a total of 26 rules in 738 ms. Remains 3351 /3364 variables (removed 13) and now considering 3001/3014 (removed 13) transitions.
// Phase 1: matrix 3001 rows 3351 cols
[2023-03-22 07:39:27] [INFO ] Computed 551 place invariants in 13 ms
[2023-03-22 07:39:29] [INFO ] Implicit Places using invariants in 1501 ms returned []
[2023-03-22 07:39:29] [INFO ] Invariant cache hit.
[2023-03-22 07:39:34] [INFO ] Implicit Places using invariants and state equation in 5330 ms returned []
Implicit Place search using SMT with State Equation took 6835 ms to find 0 implicit places.
[2023-03-22 07:39:34] [INFO ] Invariant cache hit.
[2023-03-22 07:39:37] [INFO ] Dead Transitions using invariants and state equation in 2845 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3351/3364 places, 3001/3014 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10444 ms. Remains : 3351/3364 places, 3001/3014 transitions.
Stuttering acceptance computed with spot in 249 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p3))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p3) p2 (NOT p0)) (AND (NOT p3) p1 (NOT p0))), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p3) p0) (AND (NOT p2) (NOT p1))), acceptance={0, 1} source=1 dest: 1}, { cond=(OR (AND p3 (NOT p2) p1) (AND (NOT p2) p1 (NOT p0))), acceptance={1} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p3:(AND (NOT (AND (EQ s2311 1) (EQ s2336 1))) (NOT (OR (AND (EQ s2311 1) (EQ s2336 1)) (EQ s2492 1)))), p2:(AND (NEQ s486 1) (NEQ s515 1)), p0:(OR (AND (E...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1937 ms.
Product exploration explored 100000 steps with 50000 reset in 1911 ms.
Computed a total of 798 stabilizing places and 798 stable transitions
Computed a total of 798 stabilizing places and 798 stable transitions
Knowledge obtained : [(AND p3 p2 (NOT p0) p1), (X (NOT (OR (AND (NOT p3) p0) (AND (NOT p2) (NOT p1))))), (X (NOT (OR (AND p3 (NOT p2) p1) (AND (NOT p2) p1 (NOT p0))))), (X (NOT (OR (AND (NOT p3) p2 (NOT p0)) (AND (NOT p3) p1 (NOT p0))))), (X (X (NOT (OR (AND (NOT p3) p0) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (OR (AND p3 (NOT p2) p1) (AND (NOT p2) p1 (NOT p0)))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p3) p2 (NOT p0)) (AND (NOT p3) p1 (NOT p0)))))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p3 p2 (NOT p0) p1)
Knowledge based reduction with 9 factoid took 529 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-050B-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-050B-LTLFireability-07 finished in 15182 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U p1)||X(p2)))'
Support contains 3 out of 3364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3364/3364 places, 3014/3014 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 3352 transition count 3002
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 3352 transition count 3002
Applied a total of 24 rules in 739 ms. Remains 3352 /3364 variables (removed 12) and now considering 3002/3014 (removed 12) transitions.
// Phase 1: matrix 3002 rows 3352 cols
[2023-03-22 07:39:42] [INFO ] Computed 551 place invariants in 9 ms
[2023-03-22 07:39:44] [INFO ] Implicit Places using invariants in 1460 ms returned []
[2023-03-22 07:39:44] [INFO ] Invariant cache hit.
[2023-03-22 07:39:46] [INFO ] Implicit Places using invariants and state equation in 2162 ms returned []
Implicit Place search using SMT with State Equation took 3636 ms to find 0 implicit places.
[2023-03-22 07:39:46] [INFO ] Invariant cache hit.
[2023-03-22 07:39:50] [INFO ] Dead Transitions using invariants and state equation in 3489 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3352/3364 places, 3002/3014 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7882 ms. Remains : 3352/3364 places, 3002/3014 transitions.
Stuttering acceptance computed with spot in 391 ms :[(NOT p0), true, (AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND p1 p0), acceptance={0} source=5 dest: 0}, { cond=(NOT p0), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}]], initial=2, aps=[p0:(EQ s3254 1), p1:(EQ s2932 1), p2:(AND (EQ s2664 0) (EQ s3254 0))], 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, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1851 ms.
Product exploration explored 100000 steps with 50000 reset in 1807 ms.
Computed a total of 798 stabilizing places and 798 stable transitions
Computed a total of 798 stabilizing places and 798 stable transitions
Detected a total of 798/3352 stabilizing places and 798/3002 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 10 factoid took 337 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-050B-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-050B-LTLFireability-08 finished in 12374 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((p1&&X(p1))))))'
Support contains 2 out of 3364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3364/3364 places, 3014/3014 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3351 transition count 3001
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3351 transition count 3001
Applied a total of 26 rules in 790 ms. Remains 3351 /3364 variables (removed 13) and now considering 3001/3014 (removed 13) transitions.
// Phase 1: matrix 3001 rows 3351 cols
[2023-03-22 07:39:55] [INFO ] Computed 551 place invariants in 8 ms
[2023-03-22 07:39:56] [INFO ] Implicit Places using invariants in 1640 ms returned []
[2023-03-22 07:39:56] [INFO ] Invariant cache hit.
[2023-03-22 07:39:59] [INFO ] Implicit Places using invariants and state equation in 2132 ms returned []
Implicit Place search using SMT with State Equation took 3775 ms to find 0 implicit places.
[2023-03-22 07:39:59] [INFO ] Invariant cache hit.
[2023-03-22 07:40:01] [INFO ] Dead Transitions using invariants and state equation in 2515 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3351/3364 places, 3001/3014 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7096 ms. Remains : 3351/3364 places, 3001/3014 transitions.
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-09 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=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 2}]], initial=0, aps=[p0:(EQ s2804 0), p1:(EQ s230 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33297 reset in 1305 ms.
Product exploration explored 100000 steps with 33283 reset in 1381 ms.
Computed a total of 798 stabilizing places and 798 stable transitions
Computed a total of 798 stabilizing places and 798 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 318 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 305 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 07:40:05] [INFO ] Invariant cache hit.
[2023-03-22 07:40:05] [INFO ] After 486ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 07:40:06] [INFO ] [Nat]Absence check using 551 positive place invariants in 292 ms returned sat
[2023-03-22 07:40:09] [INFO ] After 2557ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 07:40:10] [INFO ] Deduced a trap composed of 26 places in 998 ms of which 2 ms to minimize.
[2023-03-22 07:40:11] [INFO ] Deduced a trap composed of 22 places in 949 ms of which 2 ms to minimize.
[2023-03-22 07:40:12] [INFO ] Deduced a trap composed of 28 places in 1015 ms of which 4 ms to minimize.
[2023-03-22 07:40:13] [INFO ] Deduced a trap composed of 24 places in 893 ms of which 3 ms to minimize.
[2023-03-22 07:40:15] [INFO ] Deduced a trap composed of 18 places in 1259 ms of which 2 ms to minimize.
[2023-03-22 07:40:15] [INFO ] Deduced a trap composed of 18 places in 818 ms of which 2 ms to minimize.
[2023-03-22 07:40:16] [INFO ] Deduced a trap composed of 18 places in 643 ms of which 1 ms to minimize.
[2023-03-22 07:40:18] [INFO ] Deduced a trap composed of 20 places in 1151 ms of which 2 ms to minimize.
[2023-03-22 07:40:19] [INFO ] Deduced a trap composed of 26 places in 933 ms of which 2 ms to minimize.
[2023-03-22 07:40:20] [INFO ] Deduced a trap composed of 20 places in 1070 ms of which 2 ms to minimize.
[2023-03-22 07:40:21] [INFO ] Deduced a trap composed of 29 places in 1399 ms of which 12 ms to minimize.
[2023-03-22 07:40:22] [INFO ] Deduced a trap composed of 28 places in 700 ms of which 2 ms to minimize.
[2023-03-22 07:40:24] [INFO ] Deduced a trap composed of 28 places in 1398 ms of which 15 ms to minimize.
[2023-03-22 07:40:25] [INFO ] Deduced a trap composed of 24 places in 883 ms of which 2 ms to minimize.
[2023-03-22 07:40:26] [INFO ] Deduced a trap composed of 32 places in 766 ms of which 1 ms to minimize.
[2023-03-22 07:40:26] [INFO ] Deduced a trap composed of 36 places in 775 ms of which 1 ms to minimize.
[2023-03-22 07:40:27] [INFO ] Deduced a trap composed of 27 places in 729 ms of which 2 ms to minimize.
[2023-03-22 07:40:28] [INFO ] Deduced a trap composed of 27 places in 592 ms of which 2 ms to minimize.
[2023-03-22 07:40:29] [INFO ] Deduced a trap composed of 25 places in 822 ms of which 1 ms to minimize.
[2023-03-22 07:40:30] [INFO ] Deduced a trap composed of 22 places in 799 ms of which 2 ms to minimize.
[2023-03-22 07:40:31] [INFO ] Deduced a trap composed of 23 places in 990 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 07:40:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 07:40:31] [INFO ] After 25576ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 45 ms.
Support contains 1 out of 3351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3351/3351 places, 3001/3001 transitions.
Drop transitions removed 699 transitions
Trivial Post-agglo rules discarded 699 transitions
Performed 699 trivial Post agglomeration. Transition count delta: 699
Iterating post reduction 0 with 699 rules applied. Total rules applied 699 place count 3351 transition count 2302
Reduce places removed 699 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 700 rules applied. Total rules applied 1399 place count 2652 transition count 2301
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1400 place count 2651 transition count 2301
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 399 Pre rules applied. Total rules applied 1400 place count 2651 transition count 1902
Deduced a syphon composed of 399 places in 4 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 3 with 798 rules applied. Total rules applied 2198 place count 2252 transition count 1902
Performed 849 Post agglomeration using F-continuation condition.Transition count delta: 849
Deduced a syphon composed of 849 places in 1 ms
Reduce places removed 849 places and 0 transitions.
Iterating global reduction 3 with 1698 rules applied. Total rules applied 3896 place count 1403 transition count 1053
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3897 place count 1403 transition count 1052
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 3899 place count 1402 transition count 1051
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4101 place count 1301 transition count 1051
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 4197 place count 1253 transition count 1051
Partial Free-agglomeration rule applied 149 times.
Drop transitions removed 149 transitions
Iterating global reduction 4 with 149 rules applied. Total rules applied 4346 place count 1253 transition count 1051
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4347 place count 1252 transition count 1050
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4348 place count 1251 transition count 1050
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 4348 place count 1251 transition count 1048
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 4352 place count 1249 transition count 1048
Applied a total of 4352 rules in 633 ms. Remains 1249 /3351 variables (removed 2102) and now considering 1048/3001 (removed 1953) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 633 ms. Remains : 1249/3351 places, 1048/3001 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 173184 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :{}
Probabilistic random walk after 173184 steps, saw 144840 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1048 rows 1249 cols
[2023-03-22 07:40:35] [INFO ] Computed 550 place invariants in 4 ms
[2023-03-22 07:40:35] [INFO ] After 314ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 07:40:36] [INFO ] [Nat]Absence check using 550 positive place invariants in 162 ms returned sat
[2023-03-22 07:40:36] [INFO ] After 532ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 07:40:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 07:40:36] [INFO ] After 51ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 07:40:37] [INFO ] Deduced a trap composed of 6 places in 202 ms of which 1 ms to minimize.
[2023-03-22 07:40:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 336 ms
[2023-03-22 07:40:37] [INFO ] After 441ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 80 ms.
[2023-03-22 07:40:37] [INFO ] After 1443ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 20 ms.
Support contains 1 out of 1249 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1249/1249 places, 1048/1048 transitions.
Applied a total of 0 rules in 47 ms. Remains 1249 /1249 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 1249/1249 places, 1048/1048 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1249/1249 places, 1048/1048 transitions.
Applied a total of 0 rules in 30 ms. Remains 1249 /1249 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
[2023-03-22 07:40:37] [INFO ] Invariant cache hit.
[2023-03-22 07:40:38] [INFO ] Implicit Places using invariants in 945 ms returned [1232, 1236]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 946 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1247/1249 places, 1048/1048 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1245 transition count 1046
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1245 transition count 1046
Applied a total of 4 rules in 61 ms. Remains 1245 /1247 variables (removed 2) and now considering 1046/1048 (removed 2) transitions.
// Phase 1: matrix 1046 rows 1245 cols
[2023-03-22 07:40:38] [INFO ] Computed 548 place invariants in 3 ms
[2023-03-22 07:40:39] [INFO ] Implicit Places using invariants in 893 ms returned []
[2023-03-22 07:40:39] [INFO ] Invariant cache hit.
[2023-03-22 07:40:41] [INFO ] Implicit Places using invariants and state equation in 2656 ms returned []
Implicit Place search using SMT with State Equation took 3563 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1245/1249 places, 1046/1048 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4600 ms. Remains : 1245/1249 places, 1046/1048 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 170943 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 170943 steps, saw 142812 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 07:40:45] [INFO ] Invariant cache hit.
[2023-03-22 07:40:45] [INFO ] After 314ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 07:40:45] [INFO ] [Nat]Absence check using 548 positive place invariants in 146 ms returned sat
[2023-03-22 07:40:46] [INFO ] After 561ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 07:40:46] [INFO ] After 664ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-22 07:40:46] [INFO ] After 1137ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 1245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 44 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 1245/1245 places, 1046/1046 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 34 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
[2023-03-22 07:40:46] [INFO ] Invariant cache hit.
[2023-03-22 07:40:47] [INFO ] Implicit Places using invariants in 883 ms returned []
[2023-03-22 07:40:47] [INFO ] Invariant cache hit.
[2023-03-22 07:40:49] [INFO ] Implicit Places using invariants and state equation in 2178 ms returned []
Implicit Place search using SMT with State Equation took 3062 ms to find 0 implicit places.
[2023-03-22 07:40:49] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-22 07:40:49] [INFO ] Invariant cache hit.
[2023-03-22 07:40:50] [INFO ] Dead Transitions using invariants and state equation in 706 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3850 ms. Remains : 1245/1245 places, 1046/1046 transitions.
Partial Free-agglomeration rule applied 296 times.
Drop transitions removed 296 transitions
Iterating global reduction 0 with 296 rules applied. Total rules applied 296 place count 1245 transition count 1046
Applied a total of 296 rules in 74 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1046 rows 1245 cols
[2023-03-22 07:40:50] [INFO ] Computed 548 place invariants in 3 ms
[2023-03-22 07:40:50] [INFO ] After 253ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 07:40:51] [INFO ] [Nat]Absence check using 548 positive place invariants in 108 ms returned sat
[2023-03-22 07:40:51] [INFO ] After 784ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 07:40:51] [INFO ] State equation strengthened by 294 read => feed constraints.
[2023-03-22 07:40:52] [INFO ] After 161ms SMT Verify possible using 294 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 07:40:52] [INFO ] Deduced a trap composed of 5 places in 374 ms of which 1 ms to minimize.
[2023-03-22 07:40:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 500 ms
[2023-03-22 07:40:52] [INFO ] After 765ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 56 ms.
[2023-03-22 07:40:52] [INFO ] After 1998ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 454 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 324 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Support contains 2 out of 3351 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3351/3351 places, 3001/3001 transitions.
Applied a total of 0 rules in 398 ms. Remains 3351 /3351 variables (removed 0) and now considering 3001/3001 (removed 0) transitions.
// Phase 1: matrix 3001 rows 3351 cols
[2023-03-22 07:40:54] [INFO ] Computed 551 place invariants in 16 ms
[2023-03-22 07:40:56] [INFO ] Implicit Places using invariants in 2283 ms returned []
[2023-03-22 07:40:56] [INFO ] Invariant cache hit.
[2023-03-22 07:40:58] [INFO ] Implicit Places using invariants and state equation in 2066 ms returned []
Implicit Place search using SMT with State Equation took 4357 ms to find 0 implicit places.
[2023-03-22 07:40:58] [INFO ] Invariant cache hit.
[2023-03-22 07:41:02] [INFO ] Dead Transitions using invariants and state equation in 3987 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8755 ms. Remains : 3351/3351 places, 3001/3001 transitions.
Computed a total of 798 stabilizing places and 798 stable transitions
Computed a total of 798 stabilizing places and 798 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 356 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 07:41:03] [INFO ] Invariant cache hit.
[2023-03-22 07:41:03] [INFO ] After 452ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 07:41:04] [INFO ] [Nat]Absence check using 551 positive place invariants in 366 ms returned sat
[2023-03-22 07:41:07] [INFO ] After 2405ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 07:41:08] [INFO ] Deduced a trap composed of 26 places in 1056 ms of which 2 ms to minimize.
[2023-03-22 07:41:10] [INFO ] Deduced a trap composed of 22 places in 1208 ms of which 2 ms to minimize.
[2023-03-22 07:41:11] [INFO ] Deduced a trap composed of 28 places in 1012 ms of which 3 ms to minimize.
[2023-03-22 07:41:12] [INFO ] Deduced a trap composed of 24 places in 972 ms of which 3 ms to minimize.
[2023-03-22 07:41:13] [INFO ] Deduced a trap composed of 18 places in 973 ms of which 4 ms to minimize.
[2023-03-22 07:41:14] [INFO ] Deduced a trap composed of 18 places in 1001 ms of which 2 ms to minimize.
[2023-03-22 07:41:15] [INFO ] Deduced a trap composed of 18 places in 1111 ms of which 18 ms to minimize.
[2023-03-22 07:41:16] [INFO ] Deduced a trap composed of 20 places in 963 ms of which 19 ms to minimize.
[2023-03-22 07:41:17] [INFO ] Deduced a trap composed of 26 places in 923 ms of which 2 ms to minimize.
[2023-03-22 07:41:18] [INFO ] Deduced a trap composed of 20 places in 866 ms of which 27 ms to minimize.
[2023-03-22 07:41:19] [INFO ] Deduced a trap composed of 29 places in 943 ms of which 61 ms to minimize.
[2023-03-22 07:41:21] [INFO ] Deduced a trap composed of 28 places in 1176 ms of which 27 ms to minimize.
[2023-03-22 07:41:22] [INFO ] Deduced a trap composed of 28 places in 943 ms of which 2 ms to minimize.
[2023-03-22 07:41:23] [INFO ] Deduced a trap composed of 24 places in 1188 ms of which 2 ms to minimize.
[2023-03-22 07:41:25] [INFO ] Deduced a trap composed of 32 places in 1333 ms of which 2 ms to minimize.
[2023-03-22 07:41:26] [INFO ] Deduced a trap composed of 36 places in 870 ms of which 3 ms to minimize.
[2023-03-22 07:41:27] [INFO ] Deduced a trap composed of 27 places in 1466 ms of which 3 ms to minimize.
[2023-03-22 07:41:28] [INFO ] Deduced a trap composed of 27 places in 948 ms of which 3 ms to minimize.
[2023-03-22 07:41:29] [INFO ] Deduced a trap composed of 25 places in 947 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java: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 07:41:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 07:41:29] [INFO ] After 25851ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 32 ms.
Support contains 1 out of 3351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3351/3351 places, 3001/3001 transitions.
Drop transitions removed 699 transitions
Trivial Post-agglo rules discarded 699 transitions
Performed 699 trivial Post agglomeration. Transition count delta: 699
Iterating post reduction 0 with 699 rules applied. Total rules applied 699 place count 3351 transition count 2302
Reduce places removed 699 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 700 rules applied. Total rules applied 1399 place count 2652 transition count 2301
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1400 place count 2651 transition count 2301
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 399 Pre rules applied. Total rules applied 1400 place count 2651 transition count 1902
Deduced a syphon composed of 399 places in 3 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 3 with 798 rules applied. Total rules applied 2198 place count 2252 transition count 1902
Performed 849 Post agglomeration using F-continuation condition.Transition count delta: 849
Deduced a syphon composed of 849 places in 1 ms
Reduce places removed 849 places and 0 transitions.
Iterating global reduction 3 with 1698 rules applied. Total rules applied 3896 place count 1403 transition count 1053
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3897 place count 1403 transition count 1052
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 3899 place count 1402 transition count 1051
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 4101 place count 1301 transition count 1051
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 4197 place count 1253 transition count 1051
Partial Free-agglomeration rule applied 149 times.
Drop transitions removed 149 transitions
Iterating global reduction 4 with 149 rules applied. Total rules applied 4346 place count 1253 transition count 1051
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4347 place count 1252 transition count 1050
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4348 place count 1251 transition count 1050
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 4348 place count 1251 transition count 1048
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 4352 place count 1249 transition count 1048
Applied a total of 4352 rules in 657 ms. Remains 1249 /3351 variables (removed 2102) and now considering 1048/3001 (removed 1953) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 657 ms. Remains : 1249/3351 places, 1048/3001 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 176822 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 176822 steps, saw 148136 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1048 rows 1249 cols
[2023-03-22 07:41:33] [INFO ] Computed 550 place invariants in 4 ms
[2023-03-22 07:41:33] [INFO ] After 174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 07:41:34] [INFO ] [Nat]Absence check using 550 positive place invariants in 212 ms returned sat
[2023-03-22 07:41:34] [INFO ] After 666ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 07:41:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 07:41:35] [INFO ] After 71ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 07:41:35] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 1 ms to minimize.
[2023-03-22 07:41:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 233 ms
[2023-03-22 07:41:35] [INFO ] After 337ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-03-22 07:41:35] [INFO ] After 1493ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 1249 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1249/1249 places, 1048/1048 transitions.
Applied a total of 0 rules in 30 ms. Remains 1249 /1249 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 1249/1249 places, 1048/1048 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1249/1249 places, 1048/1048 transitions.
Applied a total of 0 rules in 30 ms. Remains 1249 /1249 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
[2023-03-22 07:41:35] [INFO ] Invariant cache hit.
[2023-03-22 07:41:36] [INFO ] Implicit Places using invariants in 1049 ms returned [1232, 1236]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1051 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1247/1249 places, 1048/1048 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1245 transition count 1046
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1245 transition count 1046
Applied a total of 4 rules in 92 ms. Remains 1245 /1247 variables (removed 2) and now considering 1046/1048 (removed 2) transitions.
// Phase 1: matrix 1046 rows 1245 cols
[2023-03-22 07:41:36] [INFO ] Computed 548 place invariants in 4 ms
[2023-03-22 07:41:37] [INFO ] Implicit Places using invariants in 1129 ms returned []
[2023-03-22 07:41:37] [INFO ] Invariant cache hit.
[2023-03-22 07:41:40] [INFO ] Implicit Places using invariants and state equation in 2305 ms returned []
Implicit Place search using SMT with State Equation took 3444 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1245/1249 places, 1046/1048 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4630 ms. Remains : 1245/1249 places, 1046/1048 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 171708 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :{}
Probabilistic random walk after 171708 steps, saw 143384 distinct states, run finished after 3013 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 07:41:43] [INFO ] Invariant cache hit.
[2023-03-22 07:41:43] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 07:41:43] [INFO ] [Nat]Absence check using 548 positive place invariants in 133 ms returned sat
[2023-03-22 07:41:44] [INFO ] After 657ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 07:41:44] [INFO ] After 758ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 80 ms.
[2023-03-22 07:41:44] [INFO ] After 1339ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 45 ms.
Support contains 1 out of 1245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 33 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 1245/1245 places, 1046/1046 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 34 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
[2023-03-22 07:41:44] [INFO ] Invariant cache hit.
[2023-03-22 07:41:46] [INFO ] Implicit Places using invariants in 1118 ms returned []
[2023-03-22 07:41:46] [INFO ] Invariant cache hit.
[2023-03-22 07:41:48] [INFO ] Implicit Places using invariants and state equation in 2601 ms returned []
Implicit Place search using SMT with State Equation took 3738 ms to find 0 implicit places.
[2023-03-22 07:41:48] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-22 07:41:48] [INFO ] Invariant cache hit.
[2023-03-22 07:41:49] [INFO ] Dead Transitions using invariants and state equation in 838 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4658 ms. Remains : 1245/1245 places, 1046/1046 transitions.
Partial Free-agglomeration rule applied 296 times.
Drop transitions removed 296 transitions
Iterating global reduction 0 with 296 rules applied. Total rules applied 296 place count 1245 transition count 1046
Applied a total of 296 rules in 109 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1046 rows 1245 cols
[2023-03-22 07:41:49] [INFO ] Computed 548 place invariants in 2 ms
[2023-03-22 07:41:49] [INFO ] After 219ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 07:41:50] [INFO ] [Nat]Absence check using 548 positive place invariants in 262 ms returned sat
[2023-03-22 07:41:51] [INFO ] After 791ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 07:41:51] [INFO ] State equation strengthened by 294 read => feed constraints.
[2023-03-22 07:41:51] [INFO ] After 220ms SMT Verify possible using 294 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 07:41:51] [INFO ] Deduced a trap composed of 5 places in 427 ms of which 1 ms to minimize.
[2023-03-22 07:41:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 560 ms
[2023-03-22 07:41:52] [INFO ] After 889ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 133 ms.
[2023-03-22 07:41:52] [INFO ] After 2303ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 370 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 279 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 33331 reset in 1514 ms.
Product exploration explored 100000 steps with 33525 reset in 1505 ms.
Applying partial POR strategy [false, true, false, false]
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Support contains 2 out of 3351 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3351/3351 places, 3001/3001 transitions.
Performed 700 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 3351 transition count 3001
Performed 248 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 248 Pre rules applied. Total rules applied 700 place count 3351 transition count 3199
Deduced a syphon composed of 948 places in 6 ms
Iterating global reduction 1 with 248 rules applied. Total rules applied 948 place count 3351 transition count 3199
Performed 950 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1898 places in 9 ms
Iterating global reduction 1 with 950 rules applied. Total rules applied 1898 place count 3351 transition count 3199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1899 place count 3351 transition count 3198
Renaming transitions due to excessive name length > 1024 char.
Discarding 352 places :
Symmetric choice reduction at 2 with 352 rule applications. Total rules 2251 place count 2999 transition count 2846
Deduced a syphon composed of 1546 places in 6 ms
Iterating global reduction 2 with 352 rules applied. Total rules applied 2603 place count 2999 transition count 2846
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1547 places in 6 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2604 place count 2999 transition count 2846
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2606 place count 2997 transition count 2844
Deduced a syphon composed of 1545 places in 6 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2608 place count 2997 transition count 2844
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -430
Deduced a syphon composed of 1646 places in 5 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2709 place count 2997 transition count 3274
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2810 place count 2896 transition count 3072
Deduced a syphon composed of 1545 places in 10 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2911 place count 2896 transition count 3072
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -411
Deduced a syphon composed of 1641 places in 5 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 3007 place count 2896 transition count 3483
Discarding 96 places :
Symmetric choice reduction at 2 with 96 rule applications. Total rules 3103 place count 2800 transition count 3291
Deduced a syphon composed of 1545 places in 4 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 3199 place count 2800 transition count 3291
Deduced a syphon composed of 1545 places in 4 ms
Applied a total of 3199 rules in 3069 ms. Remains 2800 /3351 variables (removed 551) and now considering 3291/3001 (removed -290) transitions.
[2023-03-22 07:41:59] [INFO ] Redundant transitions in 98 ms returned []
// Phase 1: matrix 3291 rows 2800 cols
[2023-03-22 07:42:00] [INFO ] Computed 551 place invariants in 61 ms
[2023-03-22 07:42:03] [INFO ] Dead Transitions using invariants and state equation in 3388 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2800/3351 places, 3291/3001 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6582 ms. Remains : 2800/3351 places, 3291/3001 transitions.
Support contains 2 out of 3351 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3351/3351 places, 3001/3001 transitions.
Applied a total of 0 rules in 285 ms. Remains 3351 /3351 variables (removed 0) and now considering 3001/3001 (removed 0) transitions.
// Phase 1: matrix 3001 rows 3351 cols
[2023-03-22 07:42:03] [INFO ] Computed 551 place invariants in 9 ms
[2023-03-22 07:42:05] [INFO ] Implicit Places using invariants in 1522 ms returned []
[2023-03-22 07:42:05] [INFO ] Invariant cache hit.
[2023-03-22 07:42:07] [INFO ] Implicit Places using invariants and state equation in 1959 ms returned []
Implicit Place search using SMT with State Equation took 3495 ms to find 0 implicit places.
[2023-03-22 07:42:07] [INFO ] Invariant cache hit.
[2023-03-22 07:42:09] [INFO ] Dead Transitions using invariants and state equation in 2741 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6526 ms. Remains : 3351/3351 places, 3001/3001 transitions.
Treatment of property ShieldPPPt-PT-050B-LTLFireability-09 finished in 135863 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)||F(p1)||G(p2))))'
Support contains 3 out of 3364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3364/3364 places, 3014/3014 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 3351 transition count 3001
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 3351 transition count 3001
Applied a total of 26 rules in 614 ms. Remains 3351 /3364 variables (removed 13) and now considering 3001/3014 (removed 13) transitions.
[2023-03-22 07:42:11] [INFO ] Invariant cache hit.
[2023-03-22 07:42:13] [INFO ] Implicit Places using invariants in 2391 ms returned []
[2023-03-22 07:42:13] [INFO ] Invariant cache hit.
[2023-03-22 07:42:18] [INFO ] Implicit Places using invariants and state equation in 5463 ms returned []
Implicit Place search using SMT with State Equation took 7870 ms to find 0 implicit places.
[2023-03-22 07:42:18] [INFO ] Invariant cache hit.
[2023-03-22 07:42:21] [INFO ] Dead Transitions using invariants and state equation in 2425 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3351/3364 places, 3001/3014 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10910 ms. Remains : 3351/3364 places, 3001/3014 transitions.
Stuttering acceptance computed with spot in 264 ms :[(NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(EQ s1075 1), p2:(NEQ s2734 1), p0:(EQ s1313 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, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 119 reset in 666 ms.
Product exploration explored 100000 steps with 120 reset in 673 ms.
Computed a total of 798 stabilizing places and 798 stable transitions
Computed a total of 798 stabilizing places and 798 stable transitions
Detected a total of 798/3351 stabilizing places and 798/3001 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p1) p2))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 1281 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 794 steps, including 0 resets, run visited all 3 properties in 7 ms. (steps per millisecond=113 )
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p1) p2))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) p2))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 17 factoid took 1119 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 221 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 2 out of 3351 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 3351/3351 places, 3001/3001 transitions.
Applied a total of 0 rules in 295 ms. Remains 3351 /3351 variables (removed 0) and now considering 3001/3001 (removed 0) transitions.
[2023-03-22 07:42:26] [INFO ] Invariant cache hit.
[2023-03-22 07:42:28] [INFO ] Implicit Places using invariants in 1926 ms returned []
[2023-03-22 07:42:28] [INFO ] Invariant cache hit.
[2023-03-22 07:42:32] [INFO ] Implicit Places using invariants and state equation in 4661 ms returned []
Implicit Place search using SMT with State Equation took 6614 ms to find 0 implicit places.
[2023-03-22 07:42:32] [INFO ] Invariant cache hit.
[2023-03-22 07:42:35] [INFO ] Dead Transitions using invariants and state equation in 2527 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9449 ms. Remains : 3351/3351 places, 3001/3001 transitions.
Computed a total of 798 stabilizing places and 798 stable transitions
Computed a total of 798 stabilizing places and 798 stable transitions
Detected a total of 798/3351 stabilizing places and 798/3001 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 497 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 957 steps, including 0 resets, run visited all 3 properties in 22 ms. (steps per millisecond=43 )
Knowledge obtained : [(AND (NOT p1) p2), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) p2))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 8 factoid took 490 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 120 reset in 667 ms.
Product exploration explored 100000 steps with 119 reset in 743 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 203 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 2 out of 3351 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3351/3351 places, 3001/3001 transitions.
Performed 700 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 3351 transition count 3001
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 250 Pre rules applied. Total rules applied 700 place count 3351 transition count 3201
Deduced a syphon composed of 950 places in 5 ms
Iterating global reduction 1 with 250 rules applied. Total rules applied 950 place count 3351 transition count 3201
Performed 946 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1896 places in 7 ms
Iterating global reduction 1 with 946 rules applied. Total rules applied 1896 place count 3351 transition count 3201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1897 place count 3351 transition count 3200
Renaming transitions due to excessive name length > 1024 char.
Discarding 350 places :
Symmetric choice reduction at 2 with 350 rule applications. Total rules 2247 place count 3001 transition count 2850
Deduced a syphon composed of 1546 places in 7 ms
Iterating global reduction 2 with 350 rules applied. Total rules applied 2597 place count 3001 transition count 2850
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1547 places in 5 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2598 place count 3001 transition count 2850
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2600 place count 2999 transition count 2848
Deduced a syphon composed of 1545 places in 6 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2602 place count 2999 transition count 2848
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -430
Deduced a syphon composed of 1646 places in 7 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2703 place count 2999 transition count 3278
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2804 place count 2898 transition count 3076
Deduced a syphon composed of 1545 places in 6 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2905 place count 2898 transition count 3076
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: -415
Deduced a syphon composed of 1643 places in 4 ms
Iterating global reduction 2 with 98 rules applied. Total rules applied 3003 place count 2898 transition count 3491
Discarding 98 places :
Symmetric choice reduction at 2 with 98 rule applications. Total rules 3101 place count 2800 transition count 3295
Deduced a syphon composed of 1545 places in 3 ms
Iterating global reduction 2 with 98 rules applied. Total rules applied 3199 place count 2800 transition count 3295
Deduced a syphon composed of 1545 places in 4 ms
Applied a total of 3199 rules in 1875 ms. Remains 2800 /3351 variables (removed 551) and now considering 3295/3001 (removed -294) transitions.
[2023-03-22 07:42:41] [INFO ] Redundant transitions in 66 ms returned []
// Phase 1: matrix 3295 rows 2800 cols
[2023-03-22 07:42:41] [INFO ] Computed 551 place invariants in 34 ms
[2023-03-22 07:42:44] [INFO ] Dead Transitions using invariants and state equation in 3623 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2800/3351 places, 3295/3001 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5588 ms. Remains : 2800/3351 places, 3295/3001 transitions.
Support contains 2 out of 3351 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3351/3351 places, 3001/3001 transitions.
Applied a total of 0 rules in 304 ms. Remains 3351 /3351 variables (removed 0) and now considering 3001/3001 (removed 0) transitions.
// Phase 1: matrix 3001 rows 3351 cols
[2023-03-22 07:42:45] [INFO ] Computed 551 place invariants in 20 ms
[2023-03-22 07:42:47] [INFO ] Implicit Places using invariants in 2105 ms returned []
[2023-03-22 07:42:47] [INFO ] Invariant cache hit.
[2023-03-22 07:42:52] [INFO ] Implicit Places using invariants and state equation in 5405 ms returned []
Implicit Place search using SMT with State Equation took 7516 ms to find 0 implicit places.
[2023-03-22 07:42:52] [INFO ] Invariant cache hit.
[2023-03-22 07:42:55] [INFO ] Dead Transitions using invariants and state equation in 2855 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10682 ms. Remains : 3351/3351 places, 3001/3001 transitions.
Treatment of property ShieldPPPt-PT-050B-LTLFireability-10 finished in 45202 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(p1))))'
Support contains 2 out of 3364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3364/3364 places, 3014/3014 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 3352 transition count 3002
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 3352 transition count 3002
Applied a total of 24 rules in 596 ms. Remains 3352 /3364 variables (removed 12) and now considering 3002/3014 (removed 12) transitions.
// Phase 1: matrix 3002 rows 3352 cols
[2023-03-22 07:42:56] [INFO ] Computed 551 place invariants in 19 ms
[2023-03-22 07:42:58] [INFO ] Implicit Places using invariants in 2266 ms returned []
[2023-03-22 07:42:58] [INFO ] Invariant cache hit.
[2023-03-22 07:43:03] [INFO ] Implicit Places using invariants and state equation in 5384 ms returned []
Implicit Place search using SMT with State Equation took 7652 ms to find 0 implicit places.
[2023-03-22 07:43:03] [INFO ] Invariant cache hit.
[2023-03-22 07:43:05] [INFO ] Dead Transitions using invariants and state equation in 2075 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3352/3364 places, 3002/3014 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10343 ms. Remains : 3352/3364 places, 3002/3014 transitions.
Stuttering acceptance computed with spot in 163 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s2245 1), p1:(EQ s1562 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-11 finished in 10552 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||(p1&&G(p2))))||G(p3)))'
Support contains 4 out of 3364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3364/3364 places, 3014/3014 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 699 transitions
Trivial Post-agglo rules discarded 699 transitions
Performed 699 trivial Post agglomeration. Transition count delta: 699
Iterating post reduction 0 with 699 rules applied. Total rules applied 699 place count 3363 transition count 2314
Reduce places removed 699 places and 0 transitions.
Iterating post reduction 1 with 699 rules applied. Total rules applied 1398 place count 2664 transition count 2314
Performed 394 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 394 Pre rules applied. Total rules applied 1398 place count 2664 transition count 1920
Deduced a syphon composed of 394 places in 4 ms
Reduce places removed 394 places and 0 transitions.
Iterating global reduction 2 with 788 rules applied. Total rules applied 2186 place count 2270 transition count 1920
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 2196 place count 2260 transition count 1910
Iterating global reduction 2 with 10 rules applied. Total rules applied 2206 place count 2260 transition count 1910
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 2206 place count 2260 transition count 1902
Deduced a syphon composed of 8 places in 5 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 2222 place count 2252 transition count 1902
Performed 844 Post agglomeration using F-continuation condition.Transition count delta: 844
Deduced a syphon composed of 844 places in 2 ms
Reduce places removed 844 places and 0 transitions.
Iterating global reduction 2 with 1688 rules applied. Total rules applied 3910 place count 1408 transition count 1058
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3911 place count 1408 transition count 1057
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 3913 place count 1407 transition count 1056
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4115 place count 1306 transition count 1056
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 4211 place count 1258 transition count 1056
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4213 place count 1256 transition count 1054
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4214 place count 1255 transition count 1054
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 4214 place count 1255 transition count 1052
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 4218 place count 1253 transition count 1052
Applied a total of 4218 rules in 955 ms. Remains 1253 /3364 variables (removed 2111) and now considering 1052/3014 (removed 1962) transitions.
// Phase 1: matrix 1052 rows 1253 cols
[2023-03-22 07:43:07] [INFO ] Computed 550 place invariants in 4 ms
[2023-03-22 07:43:08] [INFO ] Implicit Places using invariants in 998 ms returned [1236, 1240]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 999 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1251/3364 places, 1052/3014 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 1249 transition count 1050
Applied a total of 4 rules in 53 ms. Remains 1249 /1251 variables (removed 2) and now considering 1050/1052 (removed 2) transitions.
// Phase 1: matrix 1050 rows 1249 cols
[2023-03-22 07:43:08] [INFO ] Computed 548 place invariants in 2 ms
[2023-03-22 07:43:09] [INFO ] Implicit Places using invariants in 885 ms returned []
[2023-03-22 07:43:09] [INFO ] Invariant cache hit.
[2023-03-22 07:43:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 07:43:10] [INFO ] Implicit Places using invariants and state equation in 1883 ms returned []
Implicit Place search using SMT with State Equation took 2781 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1249/3364 places, 1050/3014 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4788 ms. Remains : 1249/3364 places, 1050/3014 transitions.
Stuttering acceptance computed with spot in 381 ms :[true, (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p3)]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), acceptance={} source=1 dest: 0}, { cond=(AND p0 p3), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1 p2 (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 p2 p3), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p3)), acceptance={} source=1 dest: 4}, { cond=(OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p2) p3)), acceptance={} source=1 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(OR (AND p0 p2) (AND p1 p2)), acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), acceptance={} source=3 dest: 0}, { cond=(OR (AND p0 p2 (NOT p3)) (AND p1 p2 (NOT p3))), acceptance={} source=3 dest: 2}, { cond=(OR (AND p0 p2 p3) (AND p1 p2 p3)), acceptance={} source=3 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p2) p3)), acceptance={} source=3 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=4 dest: 2}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 0}, { cond=p3, acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(EQ s1159 0), p1:(EQ s53 0), p3:(EQ s530 0), p2:(EQ s1226 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 213 steps with 0 reset in 4 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-12 finished in 5207 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(!p0)))'
Support contains 1 out of 3364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3364/3364 places, 3014/3014 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 698 transitions
Trivial Post-agglo rules discarded 698 transitions
Performed 698 trivial Post agglomeration. Transition count delta: 698
Iterating post reduction 0 with 698 rules applied. Total rules applied 698 place count 3363 transition count 2315
Reduce places removed 698 places and 0 transitions.
Iterating post reduction 1 with 698 rules applied. Total rules applied 1396 place count 2665 transition count 2315
Performed 395 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 395 Pre rules applied. Total rules applied 1396 place count 2665 transition count 1920
Deduced a syphon composed of 395 places in 3 ms
Reduce places removed 395 places and 0 transitions.
Iterating global reduction 2 with 790 rules applied. Total rules applied 2186 place count 2270 transition count 1920
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 2196 place count 2260 transition count 1910
Iterating global reduction 2 with 10 rules applied. Total rules applied 2206 place count 2260 transition count 1910
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 2206 place count 2260 transition count 1902
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 2222 place count 2252 transition count 1902
Performed 848 Post agglomeration using F-continuation condition.Transition count delta: 848
Deduced a syphon composed of 848 places in 2 ms
Reduce places removed 848 places and 0 transitions.
Iterating global reduction 2 with 1696 rules applied. Total rules applied 3918 place count 1404 transition count 1054
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3919 place count 1404 transition count 1053
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 3921 place count 1403 transition count 1052
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4123 place count 1302 transition count 1052
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 4219 place count 1254 transition count 1052
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4221 place count 1252 transition count 1050
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4222 place count 1251 transition count 1050
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 4222 place count 1251 transition count 1048
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 4226 place count 1249 transition count 1048
Applied a total of 4226 rules in 753 ms. Remains 1249 /3364 variables (removed 2115) and now considering 1048/3014 (removed 1966) transitions.
// Phase 1: matrix 1048 rows 1249 cols
[2023-03-22 07:43:12] [INFO ] Computed 550 place invariants in 4 ms
[2023-03-22 07:43:12] [INFO ] Implicit Places using invariants in 895 ms returned [1232, 1236]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 897 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1247/3364 places, 1048/3014 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 1245 transition count 1046
Applied a total of 4 rules in 72 ms. Remains 1245 /1247 variables (removed 2) and now considering 1046/1048 (removed 2) transitions.
// Phase 1: matrix 1046 rows 1245 cols
[2023-03-22 07:43:13] [INFO ] Computed 548 place invariants in 2 ms
[2023-03-22 07:43:14] [INFO ] Implicit Places using invariants in 1193 ms returned []
[2023-03-22 07:43:14] [INFO ] Invariant cache hit.
[2023-03-22 07:43:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 07:43:15] [INFO ] Implicit Places using invariants and state equation in 1702 ms returned []
Implicit Place search using SMT with State Equation took 2912 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1245/3364 places, 1046/3014 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4634 ms. Remains : 1245/3364 places, 1046/3014 transitions.
Stuttering acceptance computed with spot in 127 ms :[p0, true, p0]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(NEQ s24 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-13 finished in 4778 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 3364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3364/3364 places, 3014/3014 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 3363 transition count 2313
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 2663 transition count 2313
Performed 395 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 395 Pre rules applied. Total rules applied 1400 place count 2663 transition count 1918
Deduced a syphon composed of 395 places in 3 ms
Reduce places removed 395 places and 0 transitions.
Iterating global reduction 2 with 790 rules applied. Total rules applied 2190 place count 2268 transition count 1918
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 2200 place count 2258 transition count 1908
Iterating global reduction 2 with 10 rules applied. Total rules applied 2210 place count 2258 transition count 1908
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 2210 place count 2258 transition count 1901
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 2224 place count 2251 transition count 1901
Performed 848 Post agglomeration using F-continuation condition.Transition count delta: 848
Deduced a syphon composed of 848 places in 1 ms
Reduce places removed 848 places and 0 transitions.
Iterating global reduction 2 with 1696 rules applied. Total rules applied 3920 place count 1403 transition count 1053
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3921 place count 1403 transition count 1052
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 3923 place count 1402 transition count 1051
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4125 place count 1301 transition count 1051
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 4221 place count 1253 transition count 1051
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4223 place count 1251 transition count 1049
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4224 place count 1250 transition count 1049
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 4224 place count 1250 transition count 1047
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 4228 place count 1248 transition count 1047
Applied a total of 4228 rules in 776 ms. Remains 1248 /3364 variables (removed 2116) and now considering 1047/3014 (removed 1967) transitions.
// Phase 1: matrix 1047 rows 1248 cols
[2023-03-22 07:43:16] [INFO ] Computed 550 place invariants in 2 ms
[2023-03-22 07:43:17] [INFO ] Implicit Places using invariants in 984 ms returned [1231, 1235]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 997 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1246/3364 places, 1047/3014 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 1244 transition count 1045
Applied a total of 4 rules in 86 ms. Remains 1244 /1246 variables (removed 2) and now considering 1045/1047 (removed 2) transitions.
// Phase 1: matrix 1045 rows 1244 cols
[2023-03-22 07:43:17] [INFO ] Computed 548 place invariants in 1 ms
[2023-03-22 07:43:18] [INFO ] Implicit Places using invariants in 830 ms returned []
[2023-03-22 07:43:18] [INFO ] Invariant cache hit.
[2023-03-22 07:43:21] [INFO ] Implicit Places using invariants and state equation in 2223 ms returned []
Implicit Place search using SMT with State Equation took 3084 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1244/3364 places, 1045/3014 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4943 ms. Remains : 1244/3364 places, 1045/3014 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s200 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 906 ms.
Stack based approach found an accepted trace after 239 steps with 0 reset with depth 240 and stack size 240 in 3 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-14 finished in 5965 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&(F(G(p1))||G((F(p2)&&(!p1 U (p3||G(!p1)))))))))'
Support contains 5 out of 3364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3364/3364 places, 3014/3014 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 696 transitions
Trivial Post-agglo rules discarded 696 transitions
Performed 696 trivial Post agglomeration. Transition count delta: 696
Iterating post reduction 0 with 696 rules applied. Total rules applied 696 place count 3363 transition count 2317
Reduce places removed 696 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 698 rules applied. Total rules applied 1394 place count 2667 transition count 2315
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1396 place count 2665 transition count 2315
Performed 394 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 394 Pre rules applied. Total rules applied 1396 place count 2665 transition count 1921
Deduced a syphon composed of 394 places in 4 ms
Reduce places removed 394 places and 0 transitions.
Iterating global reduction 3 with 788 rules applied. Total rules applied 2184 place count 2271 transition count 1921
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 2195 place count 2260 transition count 1910
Iterating global reduction 3 with 11 rules applied. Total rules applied 2206 place count 2260 transition count 1910
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 2206 place count 2260 transition count 1902
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 2222 place count 2252 transition count 1902
Performed 846 Post agglomeration using F-continuation condition.Transition count delta: 846
Deduced a syphon composed of 846 places in 1 ms
Reduce places removed 846 places and 0 transitions.
Iterating global reduction 3 with 1692 rules applied. Total rules applied 3914 place count 1406 transition count 1056
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3915 place count 1406 transition count 1055
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 3917 place count 1405 transition count 1054
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4119 place count 1304 transition count 1054
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 4211 place count 1258 transition count 1054
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4213 place count 1256 transition count 1052
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4214 place count 1255 transition count 1052
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 4214 place count 1255 transition count 1050
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 4218 place count 1253 transition count 1050
Applied a total of 4218 rules in 796 ms. Remains 1253 /3364 variables (removed 2111) and now considering 1050/3014 (removed 1964) transitions.
// Phase 1: matrix 1050 rows 1253 cols
[2023-03-22 07:43:22] [INFO ] Computed 550 place invariants in 4 ms
[2023-03-22 07:43:23] [INFO ] Implicit Places using invariants in 827 ms returned [1236, 1240]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 829 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1251/3364 places, 1050/3014 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 1249 transition count 1048
Applied a total of 4 rules in 101 ms. Remains 1249 /1251 variables (removed 2) and now considering 1048/1050 (removed 2) transitions.
// Phase 1: matrix 1048 rows 1249 cols
[2023-03-22 07:43:23] [INFO ] Computed 548 place invariants in 2 ms
[2023-03-22 07:43:24] [INFO ] Implicit Places using invariants in 1110 ms returned []
[2023-03-22 07:43:24] [INFO ] Invariant cache hit.
[2023-03-22 07:43:27] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-22 07:43:28] [INFO ] Implicit Places using invariants and state equation in 3817 ms returned []
Implicit Place search using SMT with State Equation took 4949 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1249/3364 places, 1048/3014 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6697 ms. Remains : 1249/3364 places, 1048/3014 transitions.
Stuttering acceptance computed with spot in 354 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), false, (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p2) p3)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(OR (AND p0 (NOT p1)) (AND p0 p3)), acceptance={} source=0 dest: 3}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={1, 2} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0, 2} source=2 dest: 2}, { cond=(AND p1 (NOT p3)), acceptance={1, 2} source=2 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) p3)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0, 2} source=3 dest: 2}, { cond=(AND p1 p3), acceptance={1} source=3 dest: 3}, { cond=(NOT p1), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p1 (NOT p3)), acceptance={1, 2} source=3 dest: 4}], [{ cond=(OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p2) p3)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={0, 2} source=4 dest: 2}, { cond=(AND p0 p1 p3), acceptance={1} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=4 dest: 3}, { cond=(OR (AND (NOT p0) p1) (AND p1 (NOT p3))), acceptance={1, 2} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s1207 1), p1:(EQ s455 1), p2:(EQ s147 1), p3:(AND (NEQ s455 1) (NOT (AND (EQ s640 1) (EQ s642 1))))], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 808 ms.
Stack based approach found an accepted trace after 33 steps with 0 reset with depth 34 and stack size 34 in 0 ms.
FORMULA ShieldPPPt-PT-050B-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-050B-LTLFireability-15 finished in 7883 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((p1&&X(p1))))))'
Found a Shortening insensitive property : ShieldPPPt-PT-050B-LTLFireability-09
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Support contains 2 out of 3364 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3364/3364 places, 3014/3014 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 698 transitions
Trivial Post-agglo rules discarded 698 transitions
Performed 698 trivial Post agglomeration. Transition count delta: 698
Iterating post reduction 0 with 698 rules applied. Total rules applied 698 place count 3363 transition count 2315
Reduce places removed 698 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 700 rules applied. Total rules applied 1398 place count 2665 transition count 2313
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1400 place count 2663 transition count 2313
Performed 393 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 393 Pre rules applied. Total rules applied 1400 place count 2663 transition count 1920
Deduced a syphon composed of 393 places in 3 ms
Reduce places removed 393 places and 0 transitions.
Iterating global reduction 3 with 786 rules applied. Total rules applied 2186 place count 2270 transition count 1920
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 2197 place count 2259 transition count 1909
Iterating global reduction 3 with 11 rules applied. Total rules applied 2208 place count 2259 transition count 1909
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 2208 place count 2259 transition count 1901
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 2224 place count 2251 transition count 1901
Performed 845 Post agglomeration using F-continuation condition.Transition count delta: 845
Deduced a syphon composed of 845 places in 2 ms
Reduce places removed 845 places and 0 transitions.
Iterating global reduction 3 with 1690 rules applied. Total rules applied 3914 place count 1406 transition count 1056
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3915 place count 1406 transition count 1055
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 3917 place count 1405 transition count 1054
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4119 place count 1304 transition count 1054
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 4215 place count 1256 transition count 1054
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4217 place count 1254 transition count 1052
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4218 place count 1253 transition count 1052
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 4218 place count 1253 transition count 1050
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 4222 place count 1251 transition count 1050
Applied a total of 4222 rules in 731 ms. Remains 1251 /3364 variables (removed 2113) and now considering 1050/3014 (removed 1964) transitions.
// Phase 1: matrix 1050 rows 1251 cols
[2023-03-22 07:43:31] [INFO ] Computed 550 place invariants in 16 ms
[2023-03-22 07:43:31] [INFO ] Implicit Places using invariants in 864 ms returned [1234, 1238]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 865 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1249/3364 places, 1050/3014 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 1247 transition count 1048
Applied a total of 4 rules in 55 ms. Remains 1247 /1249 variables (removed 2) and now considering 1048/1050 (removed 2) transitions.
// Phase 1: matrix 1048 rows 1247 cols
[2023-03-22 07:43:31] [INFO ] Computed 548 place invariants in 2 ms
[2023-03-22 07:43:33] [INFO ] Implicit Places using invariants in 1304 ms returned []
[2023-03-22 07:43:33] [INFO ] Invariant cache hit.
[2023-03-22 07:43:35] [INFO ] Implicit Places using invariants and state equation in 1918 ms returned []
Implicit Place search using SMT with State Equation took 3272 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1247/3364 places, 1048/3014 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 4923 ms. Remains : 1247/3364 places, 1048/3014 transitions.
Running random walk in product with property : ShieldPPPt-PT-050B-LTLFireability-09 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=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 2}]], initial=0, aps=[p0:(EQ s1050 0), p1:(EQ s73 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33190 reset in 1241 ms.
Product exploration explored 100000 steps with 33481 reset in 1358 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 414 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 07:43:38] [INFO ] Invariant cache hit.
[2023-03-22 07:43:39] [INFO ] After 271ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 07:43:39] [INFO ] [Nat]Absence check using 548 positive place invariants in 154 ms returned sat
[2023-03-22 07:43:40] [INFO ] After 943ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 07:43:40] [INFO ] After 1023ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-22 07:43:40] [INFO ] After 1568ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 1247 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1247/1247 places, 1048/1048 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 1247 transition count 1047
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 1246 transition count 1047
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 1245 transition count 1046
Applied a total of 4 rules in 99 ms. Remains 1245 /1247 variables (removed 2) and now considering 1046/1048 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 1245/1247 places, 1046/1048 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 197744 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :{}
Probabilistic random walk after 197744 steps, saw 142595 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1046 rows 1245 cols
[2023-03-22 07:43:43] [INFO ] Computed 548 place invariants in 2 ms
[2023-03-22 07:43:44] [INFO ] After 196ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 07:43:44] [INFO ] [Nat]Absence check using 548 positive place invariants in 134 ms returned sat
[2023-03-22 07:43:45] [INFO ] After 736ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 07:43:45] [INFO ] After 827ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 105 ms.
[2023-03-22 07:43:45] [INFO ] After 1372ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 1245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 41 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 1245/1245 places, 1046/1046 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 31 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
[2023-03-22 07:43:45] [INFO ] Invariant cache hit.
[2023-03-22 07:43:46] [INFO ] Implicit Places using invariants in 1123 ms returned []
[2023-03-22 07:43:46] [INFO ] Invariant cache hit.
[2023-03-22 07:43:48] [INFO ] Implicit Places using invariants and state equation in 2169 ms returned []
Implicit Place search using SMT with State Equation took 3295 ms to find 0 implicit places.
[2023-03-22 07:43:48] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-22 07:43:48] [INFO ] Invariant cache hit.
[2023-03-22 07:43:49] [INFO ] Dead Transitions using invariants and state equation in 883 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4232 ms. Remains : 1245/1245 places, 1046/1046 transitions.
Partial Free-agglomeration rule applied 296 times.
Drop transitions removed 296 transitions
Iterating global reduction 0 with 296 rules applied. Total rules applied 296 place count 1245 transition count 1046
Applied a total of 296 rules in 62 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1046 rows 1245 cols
[2023-03-22 07:43:49] [INFO ] Computed 548 place invariants in 3 ms
[2023-03-22 07:43:49] [INFO ] After 167ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 07:43:50] [INFO ] [Nat]Absence check using 548 positive place invariants in 83 ms returned sat
[2023-03-22 07:43:50] [INFO ] After 486ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 07:43:50] [INFO ] After 580ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 67 ms.
[2023-03-22 07:43:50] [INFO ] After 922ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 522 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 266 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 303 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Support contains 2 out of 1247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1247/1247 places, 1048/1048 transitions.
Applied a total of 0 rules in 50 ms. Remains 1247 /1247 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
// Phase 1: matrix 1048 rows 1247 cols
[2023-03-22 07:43:52] [INFO ] Computed 548 place invariants in 4 ms
[2023-03-22 07:43:53] [INFO ] Implicit Places using invariants in 908 ms returned []
[2023-03-22 07:43:53] [INFO ] Invariant cache hit.
[2023-03-22 07:43:55] [INFO ] Implicit Places using invariants and state equation in 1965 ms returned []
Implicit Place search using SMT with State Equation took 2888 ms to find 0 implicit places.
[2023-03-22 07:43:55] [INFO ] Invariant cache hit.
[2023-03-22 07:43:55] [INFO ] Dead Transitions using invariants and state equation in 775 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3718 ms. Remains : 1247/1247 places, 1048/1048 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 336 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 07:43:56] [INFO ] Invariant cache hit.
[2023-03-22 07:43:56] [INFO ] After 194ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 07:43:57] [INFO ] [Nat]Absence check using 548 positive place invariants in 328 ms returned sat
[2023-03-22 07:43:58] [INFO ] After 706ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 07:43:58] [INFO ] After 782ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 66 ms.
[2023-03-22 07:43:58] [INFO ] After 1375ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 1247 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1247/1247 places, 1048/1048 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 1247 transition count 1047
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 1246 transition count 1047
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 1245 transition count 1046
Applied a total of 4 rules in 82 ms. Remains 1245 /1247 variables (removed 2) and now considering 1046/1048 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 1245/1247 places, 1046/1048 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 193585 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 193585 steps, saw 139505 distinct states, run finished after 3002 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1046 rows 1245 cols
[2023-03-22 07:44:01] [INFO ] Computed 548 place invariants in 2 ms
[2023-03-22 07:44:01] [INFO ] After 192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 07:44:02] [INFO ] [Nat]Absence check using 548 positive place invariants in 266 ms returned sat
[2023-03-22 07:44:03] [INFO ] After 1551ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 07:44:03] [INFO ] After 1616ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-22 07:44:03] [INFO ] After 2192ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 1245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 26 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 1245/1245 places, 1046/1046 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1245/1245 places, 1046/1046 transitions.
Applied a total of 0 rules in 28 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
[2023-03-22 07:44:03] [INFO ] Invariant cache hit.
[2023-03-22 07:44:04] [INFO ] Implicit Places using invariants in 763 ms returned []
[2023-03-22 07:44:04] [INFO ] Invariant cache hit.
[2023-03-22 07:44:05] [INFO ] Implicit Places using invariants and state equation in 1215 ms returned []
Implicit Place search using SMT with State Equation took 2011 ms to find 0 implicit places.
[2023-03-22 07:44:05] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-22 07:44:05] [INFO ] Invariant cache hit.
[2023-03-22 07:44:06] [INFO ] Dead Transitions using invariants and state equation in 599 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2662 ms. Remains : 1245/1245 places, 1046/1046 transitions.
Partial Free-agglomeration rule applied 296 times.
Drop transitions removed 296 transitions
Iterating global reduction 0 with 296 rules applied. Total rules applied 296 place count 1245 transition count 1046
Applied a total of 296 rules in 69 ms. Remains 1245 /1245 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1046 rows 1245 cols
[2023-03-22 07:44:06] [INFO ] Computed 548 place invariants in 2 ms
[2023-03-22 07:44:06] [INFO ] After 238ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 07:44:07] [INFO ] [Nat]Absence check using 548 positive place invariants in 182 ms returned sat
[2023-03-22 07:44:07] [INFO ] After 665ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 07:44:07] [INFO ] After 744ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-22 07:44:08] [INFO ] After 1217ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 256 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 33341 reset in 1116 ms.
Product exploration explored 100000 steps with 33217 reset in 1233 ms.
Applying partial POR strategy [false, true, false, false]
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Support contains 2 out of 1247 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1247/1247 places, 1048/1048 transitions.
Applied a total of 0 rules in 40 ms. Remains 1247 /1247 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
[2023-03-22 07:44:11] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 1048 rows 1247 cols
[2023-03-22 07:44:11] [INFO ] Computed 548 place invariants in 1 ms
[2023-03-22 07:44:12] [INFO ] Dead Transitions using invariants and state equation in 702 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 781 ms. Remains : 1247/1247 places, 1048/1048 transitions.
Support contains 2 out of 1247 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1247/1247 places, 1048/1048 transitions.
Applied a total of 0 rules in 21 ms. Remains 1247 /1247 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
[2023-03-22 07:44:12] [INFO ] Invariant cache hit.
[2023-03-22 07:44:13] [INFO ] Implicit Places using invariants in 765 ms returned []
[2023-03-22 07:44:13] [INFO ] Invariant cache hit.
[2023-03-22 07:44:15] [INFO ] Implicit Places using invariants and state equation in 2370 ms returned []
Implicit Place search using SMT with State Equation took 3157 ms to find 0 implicit places.
[2023-03-22 07:44:15] [INFO ] Invariant cache hit.
[2023-03-22 07:44:16] [INFO ] Dead Transitions using invariants and state equation in 737 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3923 ms. Remains : 1247/1247 places, 1048/1048 transitions.
Treatment of property ShieldPPPt-PT-050B-LTLFireability-09 finished in 46447 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)||F(p1)||G(p2))))'
[2023-03-22 07:44:16] [INFO ] Flatten gal took : 114 ms
[2023-03-22 07:44:16] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-22 07:44:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3364 places, 3014 transitions and 7828 arcs took 24 ms.
Total runtime 479269 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2281/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2281/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldPPPt-PT-050B-LTLFireability-09
Could not compute solution for formula : ShieldPPPt-PT-050B-LTLFireability-10

BK_STOP 1679471060564

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ sed s/.jar//
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name ShieldPPPt-PT-050B-LTLFireability-09
ltl formula formula --ltl=/tmp/2281/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 3364 places, 3014 transitions and 7828 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.530 real 0.150 user 0.270 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2281/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2281/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2281/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2281/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name ShieldPPPt-PT-050B-LTLFireability-10
ltl formula formula --ltl=/tmp/2281/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 3364 places, 3014 transitions and 7828 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.700 real 0.150 user 0.260 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2281/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2281/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2281/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2281/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:

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-050B"
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-050B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r393-oct2-167903717300684"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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