Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.2K Feb 25 17:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 17:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 17:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 17:03 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.6K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 17:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Feb 25 17:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 17:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 17:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 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 860K 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 ShieldIIPt-PT-050B-LTLFireability-00
FORMULA_NAME ShieldIIPt-PT-050B-LTLFireability-01
FORMULA_NAME ShieldIIPt-PT-050B-LTLFireability-02
FORMULA_NAME ShieldIIPt-PT-050B-LTLFireability-03
FORMULA_NAME ShieldIIPt-PT-050B-LTLFireability-04
FORMULA_NAME ShieldIIPt-PT-050B-LTLFireability-05
FORMULA_NAME ShieldIIPt-PT-050B-LTLFireability-06
FORMULA_NAME ShieldIIPt-PT-050B-LTLFireability-07
FORMULA_NAME ShieldIIPt-PT-050B-LTLFireability-08
FORMULA_NAME ShieldIIPt-PT-050B-LTLFireability-09
FORMULA_NAME ShieldIIPt-PT-050B-LTLFireability-10
FORMULA_NAME ShieldIIPt-PT-050B-LTLFireability-11
FORMULA_NAME ShieldIIPt-PT-050B-LTLFireability-12
FORMULA_NAME ShieldIIPt-PT-050B-LTLFireability-13
FORMULA_NAME ShieldIIPt-PT-050B-LTLFireability-14
FORMULA_NAME ShieldIIPt-PT-050B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679273700176

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-050B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 00:55:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 00:55:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 00:55:03] [INFO ] Load time of PNML (sax parser for PT used): 171 ms
[2023-03-20 00:55:03] [INFO ] Transformed 3503 places.
[2023-03-20 00:55:03] [INFO ] Transformed 3253 transitions.
[2023-03-20 00:55:03] [INFO ] Found NUPN structural information;
[2023-03-20 00:55:03] [INFO ] Parsed PT model containing 3503 places and 3253 transitions and 8106 arcs in 537 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ShieldIIPt-PT-050B-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050B-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050B-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050B-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050B-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 3503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3503/3503 places, 3253/3253 transitions.
Discarding 543 places :
Symmetric choice reduction at 0 with 543 rule applications. Total rules 543 place count 2960 transition count 2710
Iterating global reduction 0 with 543 rules applied. Total rules applied 1086 place count 2960 transition count 2710
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1087 place count 2959 transition count 2709
Iterating global reduction 0 with 1 rules applied. Total rules applied 1088 place count 2959 transition count 2709
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1089 place count 2958 transition count 2708
Iterating global reduction 0 with 1 rules applied. Total rules applied 1090 place count 2958 transition count 2708
Applied a total of 1090 rules in 1468 ms. Remains 2958 /3503 variables (removed 545) and now considering 2708/3253 (removed 545) transitions.
// Phase 1: matrix 2708 rows 2958 cols
[2023-03-20 00:55:05] [INFO ] Computed 451 place invariants in 59 ms
[2023-03-20 00:55:07] [INFO ] Implicit Places using invariants in 1748 ms returned []
[2023-03-20 00:55:07] [INFO ] Invariant cache hit.
[2023-03-20 00:55:11] [INFO ] Implicit Places using invariants and state equation in 4354 ms returned []
Implicit Place search using SMT with State Equation took 6173 ms to find 0 implicit places.
[2023-03-20 00:55:11] [INFO ] Invariant cache hit.
[2023-03-20 00:55:15] [INFO ] Dead Transitions using invariants and state equation in 3469 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2958/3503 places, 2708/3253 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11116 ms. Remains : 2958/3503 places, 2708/3253 transitions.
Support contains 30 out of 2958 places after structural reductions.
[2023-03-20 00:55:15] [INFO ] Flatten gal took : 220 ms
[2023-03-20 00:55:16] [INFO ] Flatten gal took : 109 ms
[2023-03-20 00:55:16] [INFO ] Input system was already deterministic with 2708 transitions.
Support contains 27 out of 2958 places (down from 30) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 519 ms. (steps per millisecond=19 ) properties (out of 21) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-20 00:55:17] [INFO ] Invariant cache hit.
[2023-03-20 00:55:18] [INFO ] [Real]Absence check using 451 positive place invariants in 258 ms returned sat
[2023-03-20 00:55:19] [INFO ] After 1949ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-20 00:55:20] [INFO ] [Nat]Absence check using 451 positive place invariants in 211 ms returned sat
[2023-03-20 00:55:24] [INFO ] After 3378ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-20 00:55:26] [INFO ] Deduced a trap composed of 21 places in 895 ms of which 14 ms to minimize.
[2023-03-20 00:55:27] [INFO ] Deduced a trap composed of 21 places in 1072 ms of which 3 ms to minimize.
[2023-03-20 00:55:28] [INFO ] Deduced a trap composed of 25 places in 900 ms of which 3 ms to minimize.
[2023-03-20 00:55:29] [INFO ] Deduced a trap composed of 19 places in 1578 ms of which 29 ms to minimize.
[2023-03-20 00:55:30] [INFO ] Deduced a trap composed of 18 places in 717 ms of which 3 ms to minimize.
[2023-03-20 00:55:31] [INFO ] Deduced a trap composed of 23 places in 728 ms of which 2 ms to minimize.
[2023-03-20 00:55:32] [INFO ] Deduced a trap composed of 31 places in 885 ms of which 1 ms to minimize.
[2023-03-20 00:55:33] [INFO ] Deduced a trap composed of 24 places in 693 ms of which 4 ms to minimize.
[2023-03-20 00:55:34] [INFO ] Deduced a trap composed of 21 places in 804 ms of which 2 ms to minimize.
[2023-03-20 00:55:35] [INFO ] Deduced a trap composed of 18 places in 718 ms of which 2 ms to minimize.
[2023-03-20 00:55:36] [INFO ] Deduced a trap composed of 17 places in 960 ms of which 2 ms to minimize.
[2023-03-20 00:55:37] [INFO ] Deduced a trap composed of 20 places in 1342 ms of which 3 ms to minimize.
[2023-03-20 00:55:38] [INFO ] Deduced a trap composed of 18 places in 740 ms of which 1 ms to minimize.
[2023-03-20 00:55:39] [INFO ] Deduced a trap composed of 23 places in 707 ms of which 10 ms to minimize.
[2023-03-20 00:55:40] [INFO ] Deduced a trap composed of 32 places in 700 ms of which 3 ms to minimize.
[2023-03-20 00:55:41] [INFO ] Deduced a trap composed of 24 places in 611 ms of which 2 ms to minimize.
[2023-03-20 00:55:41] [INFO ] Deduced a trap composed of 39 places in 597 ms of which 4 ms to minimize.
[2023-03-20 00:55:42] [INFO ] Deduced a trap composed of 55 places in 559 ms of which 1 ms to minimize.
[2023-03-20 00:55:43] [INFO ] Deduced a trap composed of 26 places in 740 ms of which 2 ms to minimize.
[2023-03-20 00:55:44] [INFO ] Deduced a trap composed of 29 places in 816 ms of which 4 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 00:55:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 00:55:44] [INFO ] After 25142ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:12
Parikh walk visited 0 properties in 2095 ms.
Support contains 16 out of 2958 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2958/2958 places, 2708/2708 transitions.
Drop transitions removed 588 transitions
Trivial Post-agglo rules discarded 588 transitions
Performed 588 trivial Post agglomeration. Transition count delta: 588
Iterating post reduction 0 with 588 rules applied. Total rules applied 588 place count 2958 transition count 2120
Reduce places removed 588 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 589 rules applied. Total rules applied 1177 place count 2370 transition count 2119
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1178 place count 2369 transition count 2119
Performed 396 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 396 Pre rules applied. Total rules applied 1178 place count 2369 transition count 1723
Deduced a syphon composed of 396 places in 3 ms
Reduce places removed 396 places and 0 transitions.
Iterating global reduction 3 with 792 rules applied. Total rules applied 1970 place count 1973 transition count 1723
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1972 place count 1971 transition count 1721
Iterating global reduction 3 with 2 rules applied. Total rules applied 1974 place count 1971 transition count 1721
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1974 place count 1971 transition count 1719
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1978 place count 1969 transition count 1719
Performed 852 Post agglomeration using F-continuation condition.Transition count delta: 852
Deduced a syphon composed of 852 places in 5 ms
Reduce places removed 852 places and 0 transitions.
Iterating global reduction 3 with 1704 rules applied. Total rules applied 3682 place count 1117 transition count 867
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3683 place count 1117 transition count 866
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 3685 place count 1116 transition count 865
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -63
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 3887 place count 1015 transition count 928
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 43 places in 5 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 3973 place count 972 transition count 954
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3974 place count 972 transition count 953
Partial Free-agglomeration rule applied 50 times.
Drop transitions removed 50 transitions
Iterating global reduction 5 with 50 rules applied. Total rules applied 4024 place count 972 transition count 953
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4025 place count 971 transition count 952
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 4027 place count 969 transition count 952
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 4027 place count 969 transition count 951
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4029 place count 968 transition count 951
Applied a total of 4029 rules in 758 ms. Remains 968 /2958 variables (removed 1990) and now considering 951/2708 (removed 1757) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 758 ms. Remains : 968/2958 places, 951/2708 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 417 ms. (steps per millisecond=23 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 84344 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 84344 steps, saw 54031 distinct states, run finished after 3002 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 951 rows 968 cols
[2023-03-20 00:55:51] [INFO ] Computed 449 place invariants in 3 ms
[2023-03-20 00:55:51] [INFO ] [Real]Absence check using 449 positive place invariants in 133 ms returned sat
[2023-03-20 00:55:52] [INFO ] After 564ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:10
[2023-03-20 00:55:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 00:55:52] [INFO ] After 42ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-20 00:55:52] [INFO ] After 1278ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-20 00:55:53] [INFO ] [Nat]Absence check using 449 positive place invariants in 225 ms returned sat
[2023-03-20 00:55:54] [INFO ] After 996ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-20 00:55:55] [INFO ] After 660ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-20 00:55:56] [INFO ] After 1931ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 691 ms.
[2023-03-20 00:55:57] [INFO ] After 4586ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 182 ms.
Support contains 16 out of 968 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 968/968 places, 951/951 transitions.
Applied a total of 0 rules in 21 ms. Remains 968 /968 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 968/968 places, 951/951 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 88619 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 88619 steps, saw 56727 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 11 properties.
[2023-03-20 00:56:01] [INFO ] Invariant cache hit.
[2023-03-20 00:56:02] [INFO ] [Real]Absence check using 449 positive place invariants in 351 ms returned sat
[2023-03-20 00:56:03] [INFO ] After 1945ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-20 00:56:04] [INFO ] [Nat]Absence check using 449 positive place invariants in 106 ms returned sat
[2023-03-20 00:56:05] [INFO ] After 1228ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-20 00:56:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 00:56:06] [INFO ] After 603ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-20 00:56:07] [INFO ] After 1589ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 714 ms.
[2023-03-20 00:56:08] [INFO ] After 4341ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 192 ms.
Support contains 16 out of 968 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 968/968 places, 951/951 transitions.
Applied a total of 0 rules in 21 ms. Remains 968 /968 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 968/968 places, 951/951 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 968/968 places, 951/951 transitions.
Applied a total of 0 rules in 37 ms. Remains 968 /968 variables (removed 0) and now considering 951/951 (removed 0) transitions.
[2023-03-20 00:56:08] [INFO ] Invariant cache hit.
[2023-03-20 00:56:10] [INFO ] Implicit Places using invariants in 1478 ms returned [957]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1481 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 967/968 places, 951/951 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 966 transition count 950
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 966 transition count 950
Applied a total of 2 rules in 33 ms. Remains 966 /967 variables (removed 1) and now considering 950/951 (removed 1) transitions.
// Phase 1: matrix 950 rows 966 cols
[2023-03-20 00:56:10] [INFO ] Computed 448 place invariants in 14 ms
[2023-03-20 00:56:10] [INFO ] Implicit Places using invariants in 845 ms returned []
[2023-03-20 00:56:10] [INFO ] Invariant cache hit.
[2023-03-20 00:56:12] [INFO ] Implicit Places using invariants and state equation in 1448 ms returned []
Implicit Place search using SMT with State Equation took 2315 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 966/968 places, 950/951 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3871 ms. Remains : 966/968 places, 950/951 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 87729 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 87729 steps, saw 55030 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 11 properties.
[2023-03-20 00:56:16] [INFO ] Invariant cache hit.
[2023-03-20 00:56:16] [INFO ] [Real]Absence check using 448 positive place invariants in 89 ms returned sat
[2023-03-20 00:56:18] [INFO ] After 2342ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-20 00:56:19] [INFO ] [Nat]Absence check using 448 positive place invariants in 107 ms returned sat
[2023-03-20 00:56:21] [INFO ] After 1139ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-20 00:56:21] [INFO ] After 2083ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 629 ms.
[2023-03-20 00:56:22] [INFO ] After 3659ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 157 ms.
Support contains 16 out of 966 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 966/966 places, 950/950 transitions.
Applied a total of 0 rules in 22 ms. Remains 966 /966 variables (removed 0) and now considering 950/950 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 966/966 places, 950/950 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 966/966 places, 950/950 transitions.
Applied a total of 0 rules in 17 ms. Remains 966 /966 variables (removed 0) and now considering 950/950 (removed 0) transitions.
[2023-03-20 00:56:22] [INFO ] Invariant cache hit.
[2023-03-20 00:56:23] [INFO ] Implicit Places using invariants in 624 ms returned []
[2023-03-20 00:56:23] [INFO ] Invariant cache hit.
[2023-03-20 00:56:25] [INFO ] Implicit Places using invariants and state equation in 2341 ms returned []
Implicit Place search using SMT with State Equation took 2975 ms to find 0 implicit places.
[2023-03-20 00:56:25] [INFO ] Redundant transitions in 75 ms returned []
[2023-03-20 00:56:25] [INFO ] Invariant cache hit.
[2023-03-20 00:56:26] [INFO ] Dead Transitions using invariants and state equation in 622 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3709 ms. Remains : 966/966 places, 950/950 transitions.
Partial Free-agglomeration rule applied 97 times.
Drop transitions removed 97 transitions
Iterating global reduction 0 with 97 rules applied. Total rules applied 97 place count 966 transition count 950
Applied a total of 97 rules in 37 ms. Remains 966 /966 variables (removed 0) and now considering 950/950 (removed 0) transitions.
Running SMT prover for 11 properties.
// Phase 1: matrix 950 rows 966 cols
[2023-03-20 00:56:26] [INFO ] Computed 448 place invariants in 2 ms
[2023-03-20 00:56:26] [INFO ] [Real]Absence check using 448 positive place invariants in 105 ms returned sat
[2023-03-20 00:56:27] [INFO ] After 1343ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-20 00:56:28] [INFO ] [Nat]Absence check using 448 positive place invariants in 98 ms returned sat
[2023-03-20 00:56:29] [INFO ] After 972ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-20 00:56:29] [INFO ] State equation strengthened by 94 read => feed constraints.
[2023-03-20 00:56:30] [INFO ] After 976ms SMT Verify possible using 94 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-20 00:56:31] [INFO ] After 2210ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 745 ms.
[2023-03-20 00:56:32] [INFO ] After 4716ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Computed a total of 799 stabilizing places and 799 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' '!(((G((p0||F(p1))) U p2) U G(p3)))'
Support contains 4 out of 2958 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2958/2958 places, 2708/2708 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 594 transitions
Trivial Post-agglo rules discarded 594 transitions
Performed 594 trivial Post agglomeration. Transition count delta: 594
Iterating post reduction 0 with 594 rules applied. Total rules applied 594 place count 2957 transition count 2113
Reduce places removed 594 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 595 rules applied. Total rules applied 1189 place count 2363 transition count 2112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1190 place count 2362 transition count 2112
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 399 Pre rules applied. Total rules applied 1190 place count 2362 transition count 1713
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 1988 place count 1963 transition count 1713
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 1993 place count 1958 transition count 1708
Iterating global reduction 3 with 5 rules applied. Total rules applied 1998 place count 1958 transition count 1708
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 1998 place count 1958 transition count 1703
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 2008 place count 1953 transition count 1703
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 3700 place count 1107 transition count 857
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3701 place count 1107 transition count 856
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 4 with 2 rules applied. Total rules applied 3703 place count 1106 transition count 855
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
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 3905 place count 1005 transition count 921
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -32
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 4001 place count 957 transition count 953
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4003 place count 955 transition count 951
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 4005 place count 953 transition count 951
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4005 place count 953 transition count 950
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4007 place count 952 transition count 950
Applied a total of 4007 rules in 664 ms. Remains 952 /2958 variables (removed 2006) and now considering 950/2708 (removed 1758) transitions.
// Phase 1: matrix 950 rows 952 cols
[2023-03-20 00:56:33] [INFO ] Computed 449 place invariants in 3 ms
[2023-03-20 00:56:34] [INFO ] Implicit Places using invariants in 673 ms returned [941]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 675 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 951/2958 places, 950/2708 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 950 transition count 949
Applied a total of 2 rules in 34 ms. Remains 950 /951 variables (removed 1) and now considering 949/950 (removed 1) transitions.
// Phase 1: matrix 949 rows 950 cols
[2023-03-20 00:56:34] [INFO ] Computed 448 place invariants in 2 ms
[2023-03-20 00:56:35] [INFO ] Implicit Places using invariants in 802 ms returned []
[2023-03-20 00:56:35] [INFO ] Invariant cache hit.
[2023-03-20 00:56:36] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-20 00:56:37] [INFO ] Implicit Places using invariants and state equation in 1875 ms returned []
Implicit Place search using SMT with State Equation took 2682 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 950/2958 places, 949/2708 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4055 ms. Remains : 950/2958 places, 949/2708 transitions.
Stuttering acceptance computed with spot in 605 ms :[(NOT p3), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p3) p0), (AND (NOT p1) (NOT p0) (NOT p3) p2)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={} source=0 dest: 0}, { cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p3 (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND p3 (NOT p2)), acceptance={} source=0 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p3) p0 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p3 p0 (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=5 dest: 2}, { cond=(AND p3 p2 (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p3 p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p3:(NEQ s818 1), p2:(EQ s842 1), p0:(EQ s381 1), p1:(EQ s181 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]]
Stuttering criterion allowed to conclude after 10 steps with 4 reset in 4 ms.
FORMULA ShieldIIPt-PT-050B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-LTLFireability-00 finished in 4824 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 2 out of 2958 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2958/2958 places, 2708/2708 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 593 transitions
Trivial Post-agglo rules discarded 593 transitions
Performed 593 trivial Post agglomeration. Transition count delta: 593
Iterating post reduction 0 with 593 rules applied. Total rules applied 593 place count 2957 transition count 2114
Reduce places removed 593 places and 0 transitions.
Iterating post reduction 1 with 593 rules applied. Total rules applied 1186 place count 2364 transition count 2114
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 400 Pre rules applied. Total rules applied 1186 place count 2364 transition count 1714
Deduced a syphon composed of 400 places in 5 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 2 with 800 rules applied. Total rules applied 1986 place count 1964 transition count 1714
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1992 place count 1958 transition count 1708
Iterating global reduction 2 with 6 rules applied. Total rules applied 1998 place count 1958 transition count 1708
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 1998 place count 1958 transition count 1702
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 2010 place count 1952 transition count 1702
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 3702 place count 1106 transition count 856
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3703 place count 1106 transition count 855
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 3705 place count 1105 transition count 854
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
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 3907 place count 1004 transition count 920
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -33
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 4003 place count 956 transition count 953
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4005 place count 954 transition count 951
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 4007 place count 952 transition count 951
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 4007 place count 952 transition count 950
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 4009 place count 951 transition count 950
Applied a total of 4009 rules in 673 ms. Remains 951 /2958 variables (removed 2007) and now considering 950/2708 (removed 1758) transitions.
// Phase 1: matrix 950 rows 951 cols
[2023-03-20 00:56:38] [INFO ] Computed 449 place invariants in 6 ms
[2023-03-20 00:56:39] [INFO ] Implicit Places using invariants in 581 ms returned [940]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 583 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 950/2958 places, 950/2708 transitions.
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 2 place count 949 transition count 949
Applied a total of 2 rules in 45 ms. Remains 949 /950 variables (removed 1) and now considering 949/950 (removed 1) transitions.
// Phase 1: matrix 949 rows 949 cols
[2023-03-20 00:56:39] [INFO ] Computed 448 place invariants in 10 ms
[2023-03-20 00:56:40] [INFO ] Implicit Places using invariants in 868 ms returned []
[2023-03-20 00:56:40] [INFO ] Invariant cache hit.
[2023-03-20 00:56:40] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-20 00:56:41] [INFO ] Implicit Places using invariants and state equation in 1419 ms returned []
Implicit Place search using SMT with State Equation took 2325 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 949/2958 places, 949/2708 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3626 ms. Remains : 949/2958 places, 949/2708 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s784 1) (EQ s96 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-050B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-LTLFireability-01 finished in 3708 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 2958 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2958/2958 places, 2708/2708 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 595 transitions
Trivial Post-agglo rules discarded 595 transitions
Performed 595 trivial Post agglomeration. Transition count delta: 595
Iterating post reduction 0 with 595 rules applied. Total rules applied 595 place count 2957 transition count 2112
Reduce places removed 595 places and 0 transitions.
Iterating post reduction 1 with 595 rules applied. Total rules applied 1190 place count 2362 transition count 2112
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 399 Pre rules applied. Total rules applied 1190 place count 2362 transition count 1713
Deduced a syphon composed of 399 places in 3 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 2 with 798 rules applied. Total rules applied 1988 place count 1963 transition count 1713
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1994 place count 1957 transition count 1707
Iterating global reduction 2 with 6 rules applied. Total rules applied 2000 place count 1957 transition count 1707
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2000 place count 1957 transition count 1701
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 2012 place count 1951 transition count 1701
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 3708 place count 1103 transition count 853
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3709 place count 1103 transition count 852
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 3711 place count 1102 transition count 851
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3913 place count 1001 transition count 917
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -32
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 4009 place count 953 transition count 949
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4011 place count 951 transition count 947
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 4013 place count 949 transition count 947
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 4013 place count 949 transition count 946
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4015 place count 948 transition count 946
Applied a total of 4015 rules in 716 ms. Remains 948 /2958 variables (removed 2010) and now considering 946/2708 (removed 1762) transitions.
// Phase 1: matrix 946 rows 948 cols
[2023-03-20 00:56:42] [INFO ] Computed 449 place invariants in 3 ms
[2023-03-20 00:56:42] [INFO ] Implicit Places using invariants in 658 ms returned [937]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 666 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 947/2958 places, 946/2708 transitions.
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 2 place count 946 transition count 945
Applied a total of 2 rules in 33 ms. Remains 946 /947 variables (removed 1) and now considering 945/946 (removed 1) transitions.
// Phase 1: matrix 945 rows 946 cols
[2023-03-20 00:56:42] [INFO ] Computed 448 place invariants in 2 ms
[2023-03-20 00:56:43] [INFO ] Implicit Places using invariants in 648 ms returned []
[2023-03-20 00:56:43] [INFO ] Invariant cache hit.
[2023-03-20 00:56:45] [INFO ] Implicit Places using invariants and state equation in 1692 ms returned []
Implicit Place search using SMT with State Equation took 2358 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 946/2958 places, 945/2708 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3788 ms. Remains : 946/2958 places, 945/2708 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s684 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 1081 ms.
Stack based approach found an accepted trace after 47703 steps with 0 reset with depth 47704 and stack size 17352 in 676 ms.
FORMULA ShieldIIPt-PT-050B-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-050B-LTLFireability-02 finished in 5639 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) U p1)&&F(p2)))&&F(p0)))'
Support contains 6 out of 2958 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2958/2958 places, 2708/2708 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2951 transition count 2701
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2951 transition count 2701
Applied a total of 14 rules in 513 ms. Remains 2951 /2958 variables (removed 7) and now considering 2701/2708 (removed 7) transitions.
// Phase 1: matrix 2701 rows 2951 cols
[2023-03-20 00:56:47] [INFO ] Computed 451 place invariants in 17 ms
[2023-03-20 00:56:48] [INFO ] Implicit Places using invariants in 1217 ms returned []
[2023-03-20 00:56:48] [INFO ] Invariant cache hit.
[2023-03-20 00:56:52] [INFO ] Implicit Places using invariants and state equation in 3422 ms returned []
Implicit Place search using SMT with State Equation took 4670 ms to find 0 implicit places.
[2023-03-20 00:56:52] [INFO ] Invariant cache hit.
[2023-03-20 00:56:54] [INFO ] Dead Transitions using invariants and state equation in 1998 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2951/2958 places, 2701/2708 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7190 ms. Remains : 2951/2958 places, 2701/2708 transitions.
Stuttering acceptance computed with spot in 320 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2)), (NOT p0), true, (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 5}, { cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s383 1), p1:(AND (EQ s1642 1) (EQ s1667 1) (EQ s1676 1)), p2:(AND (EQ s1685 1) (EQ s1730 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-050B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-LTLFireability-03 finished in 7589 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 2958 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2958/2958 places, 2708/2708 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2951 transition count 2701
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2951 transition count 2701
Applied a total of 14 rules in 427 ms. Remains 2951 /2958 variables (removed 7) and now considering 2701/2708 (removed 7) transitions.
[2023-03-20 00:56:55] [INFO ] Invariant cache hit.
[2023-03-20 00:56:56] [INFO ] Implicit Places using invariants in 1663 ms returned []
[2023-03-20 00:56:56] [INFO ] Invariant cache hit.
[2023-03-20 00:57:00] [INFO ] Implicit Places using invariants and state equation in 3523 ms returned []
Implicit Place search using SMT with State Equation took 5189 ms to find 0 implicit places.
[2023-03-20 00:57:00] [INFO ] Invariant cache hit.
[2023-03-20 00:57:01] [INFO ] Dead Transitions using invariants and state equation in 1578 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2951/2958 places, 2701/2708 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7195 ms. Remains : 2951/2958 places, 2701/2708 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s1434 1) (EQ s1610 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 190 reset in 626 ms.
Product exploration explored 100000 steps with 191 reset in 772 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 241 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0)]
Finished random walk after 545 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=109 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 228 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0)]
[2023-03-20 00:57:04] [INFO ] Invariant cache hit.
[2023-03-20 00:57:07] [INFO ] [Real]Absence check using 451 positive place invariants in 859 ms returned sat
[2023-03-20 00:57:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 00:57:19] [INFO ] [Real]Absence check using state equation in 11746 ms returned unknown
Could not prove EG (NOT p0)
Support contains 2 out of 2951 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2951/2951 places, 2701/2701 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 597 transitions
Trivial Post-agglo rules discarded 597 transitions
Performed 597 trivial Post agglomeration. Transition count delta: 597
Iterating post reduction 0 with 597 rules applied. Total rules applied 597 place count 2950 transition count 2103
Reduce places removed 597 places and 0 transitions.
Iterating post reduction 1 with 597 rules applied. Total rules applied 1194 place count 2353 transition count 2103
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 400 Pre rules applied. Total rules applied 1194 place count 2353 transition count 1703
Deduced a syphon composed of 400 places in 4 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 2 with 800 rules applied. Total rules applied 1994 place count 1953 transition count 1703
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 3690 place count 1105 transition count 855
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3691 place count 1105 transition count 854
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 3693 place count 1104 transition count 853
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
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 3895 place count 1003 transition count 920
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -31
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 3989 place count 956 transition count 951
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3991 place count 954 transition count 949
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 3993 place count 952 transition count 949
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3993 place count 952 transition count 948
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 3995 place count 951 transition count 948
Applied a total of 3995 rules in 519 ms. Remains 951 /2951 variables (removed 2000) and now considering 948/2701 (removed 1753) transitions.
// Phase 1: matrix 948 rows 951 cols
[2023-03-20 00:57:19] [INFO ] Computed 449 place invariants in 3 ms
[2023-03-20 00:57:22] [INFO ] Implicit Places using invariants in 2501 ms returned [940]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2508 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 950/2951 places, 948/2701 transitions.
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 2 place count 949 transition count 947
Applied a total of 2 rules in 35 ms. Remains 949 /950 variables (removed 1) and now considering 947/948 (removed 1) transitions.
// Phase 1: matrix 947 rows 949 cols
[2023-03-20 00:57:22] [INFO ] Computed 448 place invariants in 3 ms
[2023-03-20 00:57:23] [INFO ] Implicit Places using invariants in 589 ms returned []
[2023-03-20 00:57:23] [INFO ] Invariant cache hit.
[2023-03-20 00:57:24] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 00:57:25] [INFO ] Implicit Places using invariants and state equation in 2337 ms returned []
Implicit Place search using SMT with State Equation took 2943 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 949/2951 places, 947/2701 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6008 ms. Remains : 949/2951 places, 947/2701 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 282 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 189 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0)]
[2023-03-20 00:57:26] [INFO ] Invariant cache hit.
[2023-03-20 00:57:27] [INFO ] [Real]Absence check using 448 positive place invariants in 289 ms returned sat
[2023-03-20 00:57:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 00:57:29] [INFO ] [Real]Absence check using state equation in 1868 ms returned sat
[2023-03-20 00:57:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 00:57:30] [INFO ] [Nat]Absence check using 448 positive place invariants in 220 ms returned sat
[2023-03-20 00:57:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 00:57:33] [INFO ] [Nat]Absence check using state equation in 2468 ms returned sat
[2023-03-20 00:57:33] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 00:57:33] [INFO ] [Nat]Added 3 Read/Feed constraints in 42 ms returned sat
[2023-03-20 00:57:33] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 1 ms to minimize.
[2023-03-20 00:57:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2023-03-20 00:57:33] [INFO ] Computed and/alt/rep : 942/1446/942 causal constraints (skipped 0 transitions) in 49 ms.
[2023-03-20 00:57:44] [INFO ] Added : 475 causal constraints over 95 iterations in 10776 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-050B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-LTLFireability-05 finished in 49659 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) U G(p1))) U ((p1 U X(p1))||G(F(p2)))))'
Support contains 3 out of 2958 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2958/2958 places, 2708/2708 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 2953 transition count 2703
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 2953 transition count 2703
Applied a total of 10 rules in 387 ms. Remains 2953 /2958 variables (removed 5) and now considering 2703/2708 (removed 5) transitions.
// Phase 1: matrix 2703 rows 2953 cols
[2023-03-20 00:57:44] [INFO ] Computed 451 place invariants in 8 ms
[2023-03-20 00:57:46] [INFO ] Implicit Places using invariants in 1764 ms returned []
[2023-03-20 00:57:46] [INFO ] Invariant cache hit.
[2023-03-20 00:57:50] [INFO ] Implicit Places using invariants and state equation in 4048 ms returned []
Implicit Place search using SMT with State Equation took 5820 ms to find 0 implicit places.
[2023-03-20 00:57:50] [INFO ] Invariant cache hit.
[2023-03-20 00:57:52] [INFO ] Dead Transitions using invariants and state equation in 2183 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2953/2958 places, 2703/2708 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8392 ms. Remains : 2953/2958 places, 2703/2708 transitions.
Stuttering acceptance computed with spot in 542 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) p1)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 6}, { cond=(NOT p1), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=7 dest: 6}, { cond=true, acceptance={} source=7 dest: 7}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 8}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=8 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p2:(EQ s1429 1), p1:(EQ s1477 1), p0:(EQ s2306 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 6 reset in 916 ms.
Stack based approach found an accepted trace after 1755 steps with 0 reset with depth 1756 and stack size 1756 in 19 ms.
FORMULA ShieldIIPt-PT-050B-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-050B-LTLFireability-07 finished in 9929 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 2958 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2958/2958 places, 2708/2708 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 594 transitions
Trivial Post-agglo rules discarded 594 transitions
Performed 594 trivial Post agglomeration. Transition count delta: 594
Iterating post reduction 0 with 594 rules applied. Total rules applied 594 place count 2957 transition count 2113
Reduce places removed 594 places and 0 transitions.
Iterating post reduction 1 with 594 rules applied. Total rules applied 1188 place count 2363 transition count 2113
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 399 Pre rules applied. Total rules applied 1188 place count 2363 transition count 1714
Deduced a syphon composed of 399 places in 13 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 2 with 798 rules applied. Total rules applied 1986 place count 1964 transition count 1714
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1993 place count 1957 transition count 1707
Iterating global reduction 2 with 7 rules applied. Total rules applied 2000 place count 1957 transition count 1707
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 2000 place count 1957 transition count 1700
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 2014 place count 1950 transition count 1700
Performed 847 Post agglomeration using F-continuation condition.Transition count delta: 847
Deduced a syphon composed of 847 places in 1 ms
Reduce places removed 847 places and 0 transitions.
Iterating global reduction 2 with 1694 rules applied. Total rules applied 3708 place count 1103 transition count 853
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3709 place count 1103 transition count 852
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 3711 place count 1102 transition count 851
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
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 3913 place count 1001 transition count 917
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -31
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 4007 place count 954 transition count 948
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4009 place count 952 transition count 946
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 4011 place count 950 transition count 946
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 4011 place count 950 transition count 945
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 4013 place count 949 transition count 945
Applied a total of 4013 rules in 562 ms. Remains 949 /2958 variables (removed 2009) and now considering 945/2708 (removed 1763) transitions.
// Phase 1: matrix 945 rows 949 cols
[2023-03-20 00:57:54] [INFO ] Computed 449 place invariants in 2 ms
[2023-03-20 00:57:55] [INFO ] Implicit Places using invariants in 603 ms returned [938]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 606 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 948/2958 places, 945/2708 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 947 transition count 944
Applied a total of 2 rules in 27 ms. Remains 947 /948 variables (removed 1) and now considering 944/945 (removed 1) transitions.
// Phase 1: matrix 944 rows 947 cols
[2023-03-20 00:57:55] [INFO ] Computed 448 place invariants in 2 ms
[2023-03-20 00:57:56] [INFO ] Implicit Places using invariants in 720 ms returned []
[2023-03-20 00:57:56] [INFO ] Invariant cache hit.
[2023-03-20 00:57:58] [INFO ] Implicit Places using invariants and state equation in 2026 ms returned []
Implicit Place search using SMT with State Equation took 2772 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 947/2958 places, 944/2708 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3967 ms. Remains : 947/2958 places, 944/2708 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s364 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-050B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-LTLFireability-08 finished in 4039 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 2958 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2958/2958 places, 2708/2708 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2951 transition count 2701
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2951 transition count 2701
Applied a total of 14 rules in 425 ms. Remains 2951 /2958 variables (removed 7) and now considering 2701/2708 (removed 7) transitions.
// Phase 1: matrix 2701 rows 2951 cols
[2023-03-20 00:57:58] [INFO ] Computed 451 place invariants in 11 ms
[2023-03-20 00:58:00] [INFO ] Implicit Places using invariants in 1210 ms returned []
[2023-03-20 00:58:00] [INFO ] Invariant cache hit.
[2023-03-20 00:58:04] [INFO ] Implicit Places using invariants and state equation in 4764 ms returned []
Implicit Place search using SMT with State Equation took 5989 ms to find 0 implicit places.
[2023-03-20 00:58:04] [INFO ] Invariant cache hit.
[2023-03-20 00:58:07] [INFO ] Dead Transitions using invariants and state equation in 2437 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2951/2958 places, 2701/2708 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8863 ms. Remains : 2951/2958 places, 2701/2708 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s1742 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 190 reset in 527 ms.
Product exploration explored 100000 steps with 191 reset in 575 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/2951 stabilizing places and 798/2701 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 198 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Finished random walk after 478 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=119 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 323 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
[2023-03-20 00:58:09] [INFO ] Invariant cache hit.
[2023-03-20 00:58:12] [INFO ] [Real]Absence check using 451 positive place invariants in 908 ms returned sat
[2023-03-20 00:58:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 00:58:24] [INFO ] [Real]Absence check using state equation in 11841 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1 out of 2951 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2951/2951 places, 2701/2701 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 599 transitions
Trivial Post-agglo rules discarded 599 transitions
Performed 599 trivial Post agglomeration. Transition count delta: 599
Iterating post reduction 0 with 599 rules applied. Total rules applied 599 place count 2950 transition count 2101
Reduce places removed 599 places and 0 transitions.
Iterating post reduction 1 with 599 rules applied. Total rules applied 1198 place count 2351 transition count 2101
Performed 401 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 401 Pre rules applied. Total rules applied 1198 place count 2351 transition count 1700
Deduced a syphon composed of 401 places in 4 ms
Reduce places removed 401 places and 0 transitions.
Iterating global reduction 2 with 802 rules applied. Total rules applied 2000 place count 1950 transition count 1700
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 3692 place count 1104 transition count 854
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3693 place count 1104 transition count 853
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 3695 place count 1103 transition count 852
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
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 3897 place count 1002 transition count 918
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -33
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 3993 place count 954 transition count 951
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3995 place count 952 transition count 949
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 3997 place count 950 transition count 949
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3997 place count 950 transition count 948
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 3999 place count 949 transition count 948
Applied a total of 3999 rules in 487 ms. Remains 949 /2951 variables (removed 2002) and now considering 948/2701 (removed 1753) transitions.
// Phase 1: matrix 948 rows 949 cols
[2023-03-20 00:58:24] [INFO ] Computed 449 place invariants in 4 ms
[2023-03-20 00:58:25] [INFO ] Implicit Places using invariants in 930 ms returned [938]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 931 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 948/2951 places, 948/2701 transitions.
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 2 place count 947 transition count 947
Applied a total of 2 rules in 27 ms. Remains 947 /948 variables (removed 1) and now considering 947/948 (removed 1) transitions.
// Phase 1: matrix 947 rows 947 cols
[2023-03-20 00:58:25] [INFO ] Computed 448 place invariants in 2 ms
[2023-03-20 00:58:26] [INFO ] Implicit Places using invariants in 753 ms returned []
[2023-03-20 00:58:26] [INFO ] Invariant cache hit.
[2023-03-20 00:58:28] [INFO ] Implicit Places using invariants and state equation in 1813 ms returned []
Implicit Place search using SMT with State Equation took 2577 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 947/2951 places, 947/2701 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4023 ms. Remains : 947/2951 places, 947/2701 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/947 stabilizing places and 2/947 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 232 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 235 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
[2023-03-20 00:58:28] [INFO ] Invariant cache hit.
[2023-03-20 00:58:30] [INFO ] [Real]Absence check using 448 positive place invariants in 510 ms returned sat
[2023-03-20 00:58:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 00:58:33] [INFO ] [Real]Absence check using state equation in 2375 ms returned sat
[2023-03-20 00:58:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 00:58:35] [INFO ] [Nat]Absence check using 448 positive place invariants in 581 ms returned sat
[2023-03-20 00:58:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 00:58:37] [INFO ] [Nat]Absence check using state equation in 1698 ms returned sat
[2023-03-20 00:58:37] [INFO ] Computed and/alt/rep : 942/1446/942 causal constraints (skipped 0 transitions) in 81 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 00:58:48] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-050B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-LTLFireability-09 finished in 50183 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&(!p1 U (p2||G(!p1))))))'
Support contains 3 out of 2958 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2958/2958 places, 2708/2708 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2952 transition count 2702
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2952 transition count 2702
Applied a total of 12 rules in 344 ms. Remains 2952 /2958 variables (removed 6) and now considering 2702/2708 (removed 6) transitions.
// Phase 1: matrix 2702 rows 2952 cols
[2023-03-20 00:58:48] [INFO ] Computed 451 place invariants in 10 ms
[2023-03-20 00:58:50] [INFO ] Implicit Places using invariants in 1117 ms returned []
[2023-03-20 00:58:50] [INFO ] Invariant cache hit.
[2023-03-20 00:58:53] [INFO ] Implicit Places using invariants and state equation in 3552 ms returned []
Implicit Place search using SMT with State Equation took 4675 ms to find 0 implicit places.
[2023-03-20 00:58:53] [INFO ] Invariant cache hit.
[2023-03-20 00:58:55] [INFO ] Dead Transitions using invariants and state equation in 2261 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2952/2958 places, 2702/2708 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7288 ms. Remains : 2952/2958 places, 2702/2708 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(OR p2 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s1316 1) (NOT (AND (EQ s2772 1) (EQ s1316 1)))), p1:(AND (EQ s2772 1) (EQ s1316 1)), p0:(EQ s1436 1)], nbAcceptance=1, 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 0 reset in 1021 ms.
Product exploration explored 100000 steps with 0 reset in 1172 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/2952 stabilizing places and 798/2702 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1))), (X (OR p2 (NOT p1))), (X (OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0)))), (X (AND (NOT p2) (NOT p1))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (OR p2 (NOT p1)))), (X (X (OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 881 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 366 ms. (steps per millisecond=27 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-20 00:58:59] [INFO ] Invariant cache hit.
[2023-03-20 00:59:00] [INFO ] [Real]Absence check using 451 positive place invariants in 301 ms returned sat
[2023-03-20 00:59:04] [INFO ] After 4823ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 00:59:05] [INFO ] [Nat]Absence check using 451 positive place invariants in 196 ms returned sat
[2023-03-20 00:59:07] [INFO ] After 2158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 00:59:08] [INFO ] Deduced a trap composed of 16 places in 733 ms of which 2 ms to minimize.
[2023-03-20 00:59:09] [INFO ] Deduced a trap composed of 25 places in 822 ms of which 2 ms to minimize.
[2023-03-20 00:59:10] [INFO ] Deduced a trap composed of 18 places in 781 ms of which 14 ms to minimize.
[2023-03-20 00:59:11] [INFO ] Deduced a trap composed of 21 places in 789 ms of which 2 ms to minimize.
[2023-03-20 00:59:12] [INFO ] Deduced a trap composed of 31 places in 781 ms of which 2 ms to minimize.
[2023-03-20 00:59:13] [INFO ] Deduced a trap composed of 26 places in 777 ms of which 1 ms to minimize.
[2023-03-20 00:59:14] [INFO ] Deduced a trap composed of 24 places in 738 ms of which 1 ms to minimize.
[2023-03-20 00:59:15] [INFO ] Deduced a trap composed of 38 places in 797 ms of which 2 ms to minimize.
[2023-03-20 00:59:15] [INFO ] Deduced a trap composed of 42 places in 707 ms of which 2 ms to minimize.
[2023-03-20 00:59:16] [INFO ] Deduced a trap composed of 27 places in 767 ms of which 1 ms to minimize.
[2023-03-20 00:59:17] [INFO ] Deduced a trap composed of 21 places in 727 ms of which 2 ms to minimize.
[2023-03-20 00:59:18] [INFO ] Deduced a trap composed of 40 places in 864 ms of which 1 ms to minimize.
[2023-03-20 00:59:19] [INFO ] Deduced a trap composed of 43 places in 748 ms of which 1 ms to minimize.
[2023-03-20 00:59:20] [INFO ] Deduced a trap composed of 40 places in 774 ms of which 2 ms to minimize.
[2023-03-20 00:59:21] [INFO ] Deduced a trap composed of 36 places in 602 ms of which 1 ms to minimize.
[2023-03-20 00:59:21] [INFO ] Deduced a trap composed of 34 places in 607 ms of which 2 ms to minimize.
[2023-03-20 00:59:22] [INFO ] Deduced a trap composed of 26 places in 719 ms of which 2 ms to minimize.
[2023-03-20 00:59:23] [INFO ] Deduced a trap composed of 35 places in 622 ms of which 14 ms to minimize.
[2023-03-20 00:59:24] [INFO ] Deduced a trap composed of 32 places in 694 ms of which 3 ms to minimize.
[2023-03-20 00:59:25] [INFO ] Deduced a trap composed of 28 places in 645 ms of which 2 ms to minimize.
[2023-03-20 00:59:25] [INFO ] Deduced a trap composed of 42 places in 614 ms of which 1 ms to minimize.
[2023-03-20 00:59:26] [INFO ] Deduced a trap composed of 30 places in 721 ms of which 1 ms to minimize.
[2023-03-20 00:59:27] [INFO ] Deduced a trap composed of 37 places in 710 ms of which 4 ms to minimize.
[2023-03-20 00:59:28] [INFO ] Deduced a trap composed of 38 places in 663 ms of which 2 ms to minimize.
[2023-03-20 00:59:29] [INFO ] Deduced a trap composed of 42 places in 678 ms of which 2 ms to minimize.
[2023-03-20 00:59:29] [INFO ] Deduced a trap composed of 27 places in 585 ms of which 2 ms to minimize.
[2023-03-20 00:59:31] [INFO ] Deduced a trap composed of 13 places in 2009 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.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-20 00:59:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 00:59:31] [INFO ] After 27020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 215 ms.
Support contains 3 out of 2952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2952/2952 places, 2702/2702 transitions.
Drop transitions removed 596 transitions
Trivial Post-agglo rules discarded 596 transitions
Performed 596 trivial Post agglomeration. Transition count delta: 596
Iterating post reduction 0 with 596 rules applied. Total rules applied 596 place count 2952 transition count 2106
Reduce places removed 596 places and 0 transitions.
Iterating post reduction 1 with 596 rules applied. Total rules applied 1192 place count 2356 transition count 2106
Performed 401 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 401 Pre rules applied. Total rules applied 1192 place count 2356 transition count 1705
Deduced a syphon composed of 401 places in 4 ms
Reduce places removed 401 places and 0 transitions.
Iterating global reduction 2 with 802 rules applied. Total rules applied 1994 place count 1955 transition count 1705
Performed 850 Post agglomeration using F-continuation condition.Transition count delta: 850
Deduced a syphon composed of 850 places in 1 ms
Reduce places removed 850 places and 0 transitions.
Iterating global reduction 2 with 1700 rules applied. Total rules applied 3694 place count 1105 transition count 855
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3695 place count 1105 transition count 854
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 3697 place count 1104 transition count 853
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
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 3899 place count 1003 transition count 920
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 3993 place count 956 transition count 950
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3994 place count 956 transition count 949
Partial Free-agglomeration rule applied 50 times.
Drop transitions removed 50 transitions
Iterating global reduction 4 with 50 rules applied. Total rules applied 4044 place count 956 transition count 949
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4045 place count 955 transition count 948
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 4047 place count 953 transition count 948
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4047 place count 953 transition count 947
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4049 place count 952 transition count 947
Applied a total of 4049 rules in 548 ms. Remains 952 /2952 variables (removed 2000) and now considering 947/2702 (removed 1755) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 548 ms. Remains : 952/2952 places, 947/2702 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 92753 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 92753 steps, saw 59517 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 947 rows 952 cols
[2023-03-20 00:59:36] [INFO ] Computed 449 place invariants in 1 ms
[2023-03-20 00:59:36] [INFO ] [Real]Absence check using 449 positive place invariants in 128 ms returned sat
[2023-03-20 00:59:37] [INFO ] After 1555ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 00:59:38] [INFO ] [Nat]Absence check using 449 positive place invariants in 104 ms returned sat
[2023-03-20 00:59:38] [INFO ] After 693ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 00:59:38] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-20 00:59:39] [INFO ] After 271ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-20 00:59:39] [INFO ] After 644ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 221 ms.
[2023-03-20 00:59:39] [INFO ] After 2029ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 109 ms.
Support contains 3 out of 952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 947/947 transitions.
Applied a total of 0 rules in 15 ms. Remains 952 /952 variables (removed 0) and now considering 947/947 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 952/952 places, 947/947 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 947/947 transitions.
Applied a total of 0 rules in 18 ms. Remains 952 /952 variables (removed 0) and now considering 947/947 (removed 0) transitions.
[2023-03-20 00:59:39] [INFO ] Invariant cache hit.
[2023-03-20 00:59:40] [INFO ] Implicit Places using invariants in 827 ms returned [941]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 829 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 951/952 places, 947/947 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 950 transition count 946
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 950 transition count 946
Applied a total of 2 rules in 29 ms. Remains 950 /951 variables (removed 1) and now considering 946/947 (removed 1) transitions.
// Phase 1: matrix 946 rows 950 cols
[2023-03-20 00:59:40] [INFO ] Computed 448 place invariants in 16 ms
[2023-03-20 00:59:41] [INFO ] Implicit Places using invariants in 821 ms returned []
[2023-03-20 00:59:41] [INFO ] Invariant cache hit.
[2023-03-20 00:59:42] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 00:59:42] [INFO ] Implicit Places using invariants and state equation in 1383 ms returned []
Implicit Place search using SMT with State Equation took 2232 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 950/952 places, 946/947 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3108 ms. Remains : 950/952 places, 946/947 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 374 ms. (steps per millisecond=26 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 77053 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 77053 steps, saw 48825 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-20 00:59:46] [INFO ] Invariant cache hit.
[2023-03-20 00:59:47] [INFO ] [Real]Absence check using 448 positive place invariants in 61 ms returned sat
[2023-03-20 00:59:47] [INFO ] After 885ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 00:59:48] [INFO ] [Nat]Absence check using 448 positive place invariants in 89 ms returned sat
[2023-03-20 00:59:48] [INFO ] After 812ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 00:59:48] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 00:59:49] [INFO ] After 282ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-20 00:59:49] [INFO ] After 789ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 305 ms.
[2023-03-20 00:59:50] [INFO ] After 2266ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 147 ms.
Support contains 3 out of 950 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 950/950 places, 946/946 transitions.
Applied a total of 0 rules in 18 ms. Remains 950 /950 variables (removed 0) and now considering 946/946 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 950/950 places, 946/946 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 950/950 places, 946/946 transitions.
Applied a total of 0 rules in 18 ms. Remains 950 /950 variables (removed 0) and now considering 946/946 (removed 0) transitions.
[2023-03-20 00:59:50] [INFO ] Invariant cache hit.
[2023-03-20 00:59:50] [INFO ] Implicit Places using invariants in 580 ms returned []
[2023-03-20 00:59:50] [INFO ] Invariant cache hit.
[2023-03-20 00:59:51] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 00:59:52] [INFO ] Implicit Places using invariants and state equation in 1832 ms returned []
Implicit Place search using SMT with State Equation took 2427 ms to find 0 implicit places.
[2023-03-20 00:59:52] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-20 00:59:52] [INFO ] Invariant cache hit.
[2023-03-20 00:59:53] [INFO ] Dead Transitions using invariants and state equation in 867 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3353 ms. Remains : 950/950 places, 946/946 transitions.
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 99 place count 950 transition count 946
Applied a total of 99 rules in 30 ms. Remains 950 /950 variables (removed 0) and now considering 946/946 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 946 rows 950 cols
[2023-03-20 00:59:53] [INFO ] Computed 448 place invariants in 1 ms
[2023-03-20 00:59:53] [INFO ] [Real]Absence check using 448 positive place invariants in 97 ms returned sat
[2023-03-20 00:59:54] [INFO ] After 1172ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 00:59:55] [INFO ] [Nat]Absence check using 448 positive place invariants in 143 ms returned sat
[2023-03-20 00:59:56] [INFO ] After 1045ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 00:59:56] [INFO ] State equation strengthened by 97 read => feed constraints.
[2023-03-20 00:59:56] [INFO ] After 315ms SMT Verify possible using 97 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-20 00:59:57] [INFO ] After 688ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 299 ms.
[2023-03-20 00:59:57] [INFO ] After 2556ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1))), (X (OR p2 (NOT p1))), (X (OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0)))), (X (AND (NOT p2) (NOT p1))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (OR p2 (NOT p1)))), (X (X (OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) p2)))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2))))]
Knowledge based reduction with 14 factoid took 1184 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
// Phase 1: matrix 2702 rows 2952 cols
[2023-03-20 00:59:59] [INFO ] Computed 451 place invariants in 7 ms
[2023-03-20 01:00:02] [INFO ] [Real]Absence check using 451 positive place invariants in 1000 ms returned sat
[2023-03-20 01:00:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
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.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:517)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 01:00:14] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 3 out of 2952 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2952/2952 places, 2702/2702 transitions.
Applied a total of 0 rules in 165 ms. Remains 2952 /2952 variables (removed 0) and now considering 2702/2702 (removed 0) transitions.
[2023-03-20 01:00:14] [INFO ] Invariant cache hit.
[2023-03-20 01:00:15] [INFO ] Implicit Places using invariants in 1576 ms returned []
[2023-03-20 01:00:15] [INFO ] Invariant cache hit.
[2023-03-20 01:00:18] [INFO ] Implicit Places using invariants and state equation in 3134 ms returned []
Implicit Place search using SMT with State Equation took 4725 ms to find 0 implicit places.
[2023-03-20 01:00:18] [INFO ] Invariant cache hit.
[2023-03-20 01:00:21] [INFO ] Dead Transitions using invariants and state equation in 2098 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6988 ms. Remains : 2952/2952 places, 2702/2702 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/2952 stabilizing places and 798/2702 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (OR (NOT p1) p2)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) p2))), (X (X (OR (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 949 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-20 01:00:22] [INFO ] Invariant cache hit.
[2023-03-20 01:00:23] [INFO ] [Real]Absence check using 451 positive place invariants in 177 ms returned sat
[2023-03-20 01:00:25] [INFO ] After 2777ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 01:00:27] [INFO ] [Nat]Absence check using 451 positive place invariants in 1146 ms returned sat
[2023-03-20 01:00:30] [INFO ] After 2404ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 01:00:31] [INFO ] Deduced a trap composed of 16 places in 723 ms of which 6 ms to minimize.
[2023-03-20 01:00:31] [INFO ] Deduced a trap composed of 25 places in 653 ms of which 1 ms to minimize.
[2023-03-20 01:00:32] [INFO ] Deduced a trap composed of 18 places in 695 ms of which 2 ms to minimize.
[2023-03-20 01:00:33] [INFO ] Deduced a trap composed of 21 places in 986 ms of which 1 ms to minimize.
[2023-03-20 01:00:35] [INFO ] Deduced a trap composed of 31 places in 1406 ms of which 5 ms to minimize.
[2023-03-20 01:00:36] [INFO ] Deduced a trap composed of 26 places in 999 ms of which 2 ms to minimize.
[2023-03-20 01:00:37] [INFO ] Deduced a trap composed of 24 places in 910 ms of which 1 ms to minimize.
[2023-03-20 01:00:38] [INFO ] Deduced a trap composed of 38 places in 771 ms of which 2 ms to minimize.
[2023-03-20 01:00:39] [INFO ] Deduced a trap composed of 42 places in 763 ms of which 1 ms to minimize.
[2023-03-20 01:00:40] [INFO ] Deduced a trap composed of 27 places in 1340 ms of which 1 ms to minimize.
[2023-03-20 01:00:41] [INFO ] Deduced a trap composed of 21 places in 722 ms of which 1 ms to minimize.
[2023-03-20 01:00:42] [INFO ] Deduced a trap composed of 40 places in 848 ms of which 2 ms to minimize.
[2023-03-20 01:00:43] [INFO ] Deduced a trap composed of 43 places in 618 ms of which 39 ms to minimize.
[2023-03-20 01:00:45] [INFO ] Deduced a trap composed of 40 places in 1972 ms of which 31 ms to minimize.
[2023-03-20 01:00:46] [INFO ] Deduced a trap composed of 36 places in 695 ms of which 2 ms to minimize.
[2023-03-20 01:00:47] [INFO ] Deduced a trap composed of 34 places in 943 ms of which 1 ms to minimize.
[2023-03-20 01:00:48] [INFO ] Deduced a trap composed of 26 places in 710 ms of which 11 ms to minimize.
[2023-03-20 01:00:49] [INFO ] Deduced a trap composed of 35 places in 857 ms of which 1 ms to minimize.
[2023-03-20 01:00:49] [INFO ] Deduced a trap composed of 32 places in 519 ms of which 1 ms to minimize.
[2023-03-20 01:00:50] [INFO ] Deduced a trap composed of 28 places in 642 ms of which 1 ms to minimize.
[2023-03-20 01:00:52] [INFO ] Deduced a trap composed of 42 places in 1912 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 01:00:52] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 01:00:52] [INFO ] After 26988ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 367 ms.
Support contains 3 out of 2952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2952/2952 places, 2702/2702 transitions.
Drop transitions removed 596 transitions
Trivial Post-agglo rules discarded 596 transitions
Performed 596 trivial Post agglomeration. Transition count delta: 596
Iterating post reduction 0 with 596 rules applied. Total rules applied 596 place count 2952 transition count 2106
Reduce places removed 596 places and 0 transitions.
Iterating post reduction 1 with 596 rules applied. Total rules applied 1192 place count 2356 transition count 2106
Performed 401 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 401 Pre rules applied. Total rules applied 1192 place count 2356 transition count 1705
Deduced a syphon composed of 401 places in 3 ms
Reduce places removed 401 places and 0 transitions.
Iterating global reduction 2 with 802 rules applied. Total rules applied 1994 place count 1955 transition count 1705
Performed 850 Post agglomeration using F-continuation condition.Transition count delta: 850
Deduced a syphon composed of 850 places in 2 ms
Reduce places removed 850 places and 0 transitions.
Iterating global reduction 2 with 1700 rules applied. Total rules applied 3694 place count 1105 transition count 855
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3695 place count 1105 transition count 854
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 3697 place count 1104 transition count 853
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
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 3899 place count 1003 transition count 920
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 3993 place count 956 transition count 950
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3994 place count 956 transition count 949
Partial Free-agglomeration rule applied 50 times.
Drop transitions removed 50 transitions
Iterating global reduction 4 with 50 rules applied. Total rules applied 4044 place count 956 transition count 949
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4045 place count 955 transition count 948
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 4047 place count 953 transition count 948
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4047 place count 953 transition count 947
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4049 place count 952 transition count 947
Applied a total of 4049 rules in 456 ms. Remains 952 /2952 variables (removed 2000) and now considering 947/2702 (removed 1755) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 456 ms. Remains : 952/2952 places, 947/2702 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 274 ms. (steps per millisecond=36 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 67209 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 67209 steps, saw 42654 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 947 rows 952 cols
[2023-03-20 01:00:57] [INFO ] Computed 449 place invariants in 6 ms
[2023-03-20 01:00:57] [INFO ] [Real]Absence check using 449 positive place invariants in 111 ms returned sat
[2023-03-20 01:00:58] [INFO ] After 1209ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 01:00:58] [INFO ] [Nat]Absence check using 449 positive place invariants in 102 ms returned sat
[2023-03-20 01:00:59] [INFO ] After 552ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 01:00:59] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-20 01:00:59] [INFO ] After 182ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-20 01:00:59] [INFO ] After 438ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 122 ms.
[2023-03-20 01:00:59] [INFO ] After 1498ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 160 ms.
Support contains 3 out of 952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 947/947 transitions.
Applied a total of 0 rules in 15 ms. Remains 952 /952 variables (removed 0) and now considering 947/947 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 952/952 places, 947/947 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 947/947 transitions.
Applied a total of 0 rules in 14 ms. Remains 952 /952 variables (removed 0) and now considering 947/947 (removed 0) transitions.
[2023-03-20 01:01:00] [INFO ] Invariant cache hit.
[2023-03-20 01:01:00] [INFO ] Implicit Places using invariants in 579 ms returned [941]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 595 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 951/952 places, 947/947 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 950 transition count 946
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 950 transition count 946
Applied a total of 2 rules in 26 ms. Remains 950 /951 variables (removed 1) and now considering 946/947 (removed 1) transitions.
// Phase 1: matrix 946 rows 950 cols
[2023-03-20 01:01:00] [INFO ] Computed 448 place invariants in 4 ms
[2023-03-20 01:01:01] [INFO ] Implicit Places using invariants in 906 ms returned []
[2023-03-20 01:01:01] [INFO ] Invariant cache hit.
[2023-03-20 01:01:02] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 01:01:03] [INFO ] Implicit Places using invariants and state equation in 1583 ms returned []
Implicit Place search using SMT with State Equation took 2494 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 950/952 places, 946/947 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3129 ms. Remains : 950/952 places, 946/947 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 453 ms. (steps per millisecond=22 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 73271 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 73271 steps, saw 46451 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-20 01:01:07] [INFO ] Invariant cache hit.
[2023-03-20 01:01:07] [INFO ] [Real]Absence check using 448 positive place invariants in 65 ms returned sat
[2023-03-20 01:01:08] [INFO ] After 1029ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 01:01:08] [INFO ] [Nat]Absence check using 448 positive place invariants in 125 ms returned sat
[2023-03-20 01:01:09] [INFO ] After 513ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 01:01:09] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 01:01:09] [INFO ] After 220ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-20 01:01:09] [INFO ] After 568ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 180 ms.
[2023-03-20 01:01:09] [INFO ] After 1711ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 91 ms.
Support contains 3 out of 950 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 950/950 places, 946/946 transitions.
Applied a total of 0 rules in 17 ms. Remains 950 /950 variables (removed 0) and now considering 946/946 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 950/950 places, 946/946 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 950/950 places, 946/946 transitions.
Applied a total of 0 rules in 15 ms. Remains 950 /950 variables (removed 0) and now considering 946/946 (removed 0) transitions.
[2023-03-20 01:01:09] [INFO ] Invariant cache hit.
[2023-03-20 01:01:10] [INFO ] Implicit Places using invariants in 570 ms returned []
[2023-03-20 01:01:10] [INFO ] Invariant cache hit.
[2023-03-20 01:01:11] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 01:01:12] [INFO ] Implicit Places using invariants and state equation in 1580 ms returned []
Implicit Place search using SMT with State Equation took 2171 ms to find 0 implicit places.
[2023-03-20 01:01:12] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-20 01:01:12] [INFO ] Invariant cache hit.
[2023-03-20 01:01:12] [INFO ] Dead Transitions using invariants and state equation in 575 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2775 ms. Remains : 950/950 places, 946/946 transitions.
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 99 place count 950 transition count 946
Applied a total of 99 rules in 42 ms. Remains 950 /950 variables (removed 0) and now considering 946/946 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 946 rows 950 cols
[2023-03-20 01:01:12] [INFO ] Computed 448 place invariants in 2 ms
[2023-03-20 01:01:13] [INFO ] [Real]Absence check using 448 positive place invariants in 83 ms returned sat
[2023-03-20 01:01:13] [INFO ] After 944ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 01:01:14] [INFO ] [Nat]Absence check using 448 positive place invariants in 269 ms returned sat
[2023-03-20 01:01:15] [INFO ] After 978ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 01:01:15] [INFO ] State equation strengthened by 97 read => feed constraints.
[2023-03-20 01:01:15] [INFO ] After 329ms SMT Verify possible using 97 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-20 01:01:15] [INFO ] After 693ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 181 ms.
[2023-03-20 01:01:16] [INFO ] After 2419ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (OR (NOT p1) p2)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) p2))), (X (X (OR (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) p2)))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2))))]
Knowledge based reduction with 14 factoid took 759 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
// Phase 1: matrix 2702 rows 2952 cols
[2023-03-20 01:01:17] [INFO ] Computed 451 place invariants in 7 ms
[2023-03-20 01:01:25] [INFO ] [Real]Absence check using 451 positive place invariants in 1027 ms returned sat
[2023-03-20 01:01:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 01:01:32] [INFO ] [Real]Absence check using state equation in 7177 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 986 ms.
Product exploration explored 100000 steps with 0 reset in 1154 ms.
Support contains 3 out of 2952 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2952/2952 places, 2702/2702 transitions.
Applied a total of 0 rules in 192 ms. Remains 2952 /2952 variables (removed 0) and now considering 2702/2702 (removed 0) transitions.
[2023-03-20 01:01:35] [INFO ] Invariant cache hit.
[2023-03-20 01:01:36] [INFO ] Implicit Places using invariants in 1533 ms returned []
[2023-03-20 01:01:36] [INFO ] Invariant cache hit.
[2023-03-20 01:01:40] [INFO ] Implicit Places using invariants and state equation in 3489 ms returned []
Implicit Place search using SMT with State Equation took 5059 ms to find 0 implicit places.
[2023-03-20 01:01:40] [INFO ] Invariant cache hit.
[2023-03-20 01:01:42] [INFO ] Dead Transitions using invariants and state equation in 2215 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7476 ms. Remains : 2952/2952 places, 2702/2702 transitions.
Treatment of property ShieldIIPt-PT-050B-LTLFireability-10 finished in 174021 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&G(p1))))'
Support contains 3 out of 2958 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2958/2958 places, 2708/2708 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2951 transition count 2701
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2951 transition count 2701
Applied a total of 14 rules in 371 ms. Remains 2951 /2958 variables (removed 7) and now considering 2701/2708 (removed 7) transitions.
// Phase 1: matrix 2701 rows 2951 cols
[2023-03-20 01:01:43] [INFO ] Computed 451 place invariants in 17 ms
[2023-03-20 01:01:44] [INFO ] Implicit Places using invariants in 1053 ms returned []
[2023-03-20 01:01:44] [INFO ] Invariant cache hit.
[2023-03-20 01:01:48] [INFO ] Implicit Places using invariants and state equation in 4049 ms returned []
Implicit Place search using SMT with State Equation took 5104 ms to find 0 implicit places.
[2023-03-20 01:01:48] [INFO ] Invariant cache hit.
[2023-03-20 01:01:50] [INFO ] Dead Transitions using invariants and state equation in 2603 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2951/2958 places, 2701/2708 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8089 ms. Remains : 2951/2958 places, 2701/2708 transitions.
Stuttering acceptance computed with spot in 173 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(AND (OR (EQ s1666 1) (EQ s862 1)) (EQ s2285 0)), p0:(OR (EQ s862 1) (EQ s2285 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-050B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-LTLFireability-12 finished in 8330 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&X(G((p0||X(G(p0)))))))))'
Support contains 1 out of 2958 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2958/2958 places, 2708/2708 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2951 transition count 2701
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2951 transition count 2701
Applied a total of 14 rules in 433 ms. Remains 2951 /2958 variables (removed 7) and now considering 2701/2708 (removed 7) transitions.
[2023-03-20 01:01:51] [INFO ] Invariant cache hit.
[2023-03-20 01:01:53] [INFO ] Implicit Places using invariants in 2058 ms returned []
[2023-03-20 01:01:53] [INFO ] Invariant cache hit.
[2023-03-20 01:01:57] [INFO ] Implicit Places using invariants and state equation in 3850 ms returned []
Implicit Place search using SMT with State Equation took 5913 ms to find 0 implicit places.
[2023-03-20 01:01:57] [INFO ] Invariant cache hit.
[2023-03-20 01:01:59] [INFO ] Dead Transitions using invariants and state equation in 2294 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2951/2958 places, 2701/2708 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8642 ms. Remains : 2951/2958 places, 2701/2708 transitions.
Stuttering acceptance computed with spot in 288 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 3}]], initial=2, aps=[p0:(NEQ s2529 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 149 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-050B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-LTLFireability-15 finished in 8989 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&(!p1 U (p2||G(!p1))))))'
Found a Shortening insensitive property : ShieldIIPt-PT-050B-LTLFireability-10
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Support contains 3 out of 2958 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2958/2958 places, 2708/2708 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 593 transitions
Trivial Post-agglo rules discarded 593 transitions
Performed 593 trivial Post agglomeration. Transition count delta: 593
Iterating post reduction 0 with 593 rules applied. Total rules applied 593 place count 2957 transition count 2114
Reduce places removed 593 places and 0 transitions.
Iterating post reduction 1 with 593 rules applied. Total rules applied 1186 place count 2364 transition count 2114
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 399 Pre rules applied. Total rules applied 1186 place count 2364 transition count 1715
Deduced a syphon composed of 399 places in 3 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 2 with 798 rules applied. Total rules applied 1984 place count 1965 transition count 1715
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1990 place count 1959 transition count 1709
Iterating global reduction 2 with 6 rules applied. Total rules applied 1996 place count 1959 transition count 1709
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 1996 place count 1959 transition count 1703
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 2008 place count 1953 transition count 1703
Performed 847 Post agglomeration using F-continuation condition.Transition count delta: 847
Deduced a syphon composed of 847 places in 1 ms
Reduce places removed 847 places and 0 transitions.
Iterating global reduction 2 with 1694 rules applied. Total rules applied 3702 place count 1106 transition count 856
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3703 place count 1106 transition count 855
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 3705 place count 1105 transition count 854
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
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 3907 place count 1004 transition count 921
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 4001 place count 957 transition count 951
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4003 place count 955 transition count 949
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 4005 place count 953 transition count 949
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 4005 place count 953 transition count 948
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 4007 place count 952 transition count 948
Applied a total of 4007 rules in 481 ms. Remains 952 /2958 variables (removed 2006) and now considering 948/2708 (removed 1760) transitions.
// Phase 1: matrix 948 rows 952 cols
[2023-03-20 01:02:00] [INFO ] Computed 449 place invariants in 2 ms
[2023-03-20 01:02:01] [INFO ] Implicit Places using invariants in 977 ms returned [941]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 978 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 951/2958 places, 948/2708 transitions.
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 2 place count 950 transition count 947
Applied a total of 2 rules in 27 ms. Remains 950 /951 variables (removed 1) and now considering 947/948 (removed 1) transitions.
// Phase 1: matrix 947 rows 950 cols
[2023-03-20 01:02:01] [INFO ] Computed 448 place invariants in 4 ms
[2023-03-20 01:02:02] [INFO ] Implicit Places using invariants in 705 ms returned []
[2023-03-20 01:02:02] [INFO ] Invariant cache hit.
[2023-03-20 01:02:03] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 01:02:04] [INFO ] Implicit Places using invariants and state equation in 2461 ms returned []
Implicit Place search using SMT with State Equation took 3204 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 950/2958 places, 947/2708 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 4690 ms. Remains : 950/2958 places, 947/2708 transitions.
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(OR p2 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s419 1) (NOT (AND (EQ s897 1) (EQ s419 1)))), p1:(AND (EQ s897 1) (EQ s419 1)), p0:(EQ s459 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
Treatment of property ShieldIIPt-PT-050B-LTLFireability-10 finished in 4987 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-20 01:02:05] [INFO ] Flatten gal took : 98 ms
[2023-03-20 01:02:05] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-20 01:02:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2958 places, 2708 transitions and 7016 arcs took 41 ms.
Total runtime 421849 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldIIPt-PT-050B
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/381
LTLFireability

FORMULA ShieldIIPt-PT-050B-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679274127165

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/381/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/381/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/381/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 ShieldIIPt-PT-050B-LTLFireability-10
lola: time limit : 3598 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for ShieldIIPt-PT-050B-LTLFireability-10
lola: result : false
lola: markings : 352
lola: fired transitions : 352
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-050B-LTLFireability-10: LTL false LTL model checker


Time elapsed: 2 secs. Pages in use: 1

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is ShieldIIPt-PT-050B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r391-oct2-167903715100332"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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