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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.0K Feb 25 17:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 17:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 17:06 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 4.1K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 9.6K Feb 25 17:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 17:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 17:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 25 17:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 686K 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-040B-LTLFireability-00
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-01
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-02
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-03
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-04
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-05
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-06
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-07
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-08
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-09
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-10
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-11
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-12
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-13
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-14
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679188411491

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-040B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-19 01:13:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 01:13:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 01:13:36] [INFO ] Load time of PNML (sax parser for PT used): 183 ms
[2023-03-19 01:13:37] [INFO ] Transformed 2803 places.
[2023-03-19 01:13:37] [INFO ] Transformed 2603 transitions.
[2023-03-19 01:13:37] [INFO ] Found NUPN structural information;
[2023-03-19 01:13:37] [INFO ] Parsed PT model containing 2803 places and 2603 transitions and 6486 arcs in 411 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Support contains 43 out of 2803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2803/2803 places, 2603/2603 transitions.
Discarding 429 places :
Symmetric choice reduction at 0 with 429 rule applications. Total rules 429 place count 2374 transition count 2174
Iterating global reduction 0 with 429 rules applied. Total rules applied 858 place count 2374 transition count 2174
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 859 place count 2373 transition count 2173
Iterating global reduction 0 with 1 rules applied. Total rules applied 860 place count 2373 transition count 2173
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 861 place count 2372 transition count 2172
Iterating global reduction 0 with 1 rules applied. Total rules applied 862 place count 2372 transition count 2172
Applied a total of 862 rules in 1113 ms. Remains 2372 /2803 variables (removed 431) and now considering 2172/2603 (removed 431) transitions.
// Phase 1: matrix 2172 rows 2372 cols
[2023-03-19 01:13:38] [INFO ] Computed 361 place invariants in 52 ms
[2023-03-19 01:13:39] [INFO ] Implicit Places using invariants in 1005 ms returned []
[2023-03-19 01:13:39] [INFO ] Invariant cache hit.
[2023-03-19 01:13:40] [INFO ] Implicit Places using invariants and state equation in 778 ms returned []
Implicit Place search using SMT with State Equation took 2257 ms to find 0 implicit places.
[2023-03-19 01:13:40] [INFO ] Invariant cache hit.
[2023-03-19 01:13:42] [INFO ] Dead Transitions using invariants and state equation in 1719 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2372/2803 places, 2172/2603 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5095 ms. Remains : 2372/2803 places, 2172/2603 transitions.
Support contains 43 out of 2372 places after structural reductions.
[2023-03-19 01:13:42] [INFO ] Flatten gal took : 158 ms
[2023-03-19 01:13:42] [INFO ] Flatten gal took : 107 ms
[2023-03-19 01:13:43] [INFO ] Input system was already deterministic with 2172 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 654 ms. (steps per millisecond=15 ) properties (out of 36) seen :18
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2023-03-19 01:13:43] [INFO ] Invariant cache hit.
[2023-03-19 01:13:45] [INFO ] After 1454ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-03-19 01:13:46] [INFO ] [Nat]Absence check using 361 positive place invariants in 174 ms returned sat
[2023-03-19 01:13:51] [INFO ] After 3412ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2023-03-19 01:13:52] [INFO ] Deduced a trap composed of 19 places in 622 ms of which 13 ms to minimize.
[2023-03-19 01:13:52] [INFO ] Deduced a trap composed of 19 places in 572 ms of which 2 ms to minimize.
[2023-03-19 01:13:53] [INFO ] Deduced a trap composed of 17 places in 457 ms of which 1 ms to minimize.
[2023-03-19 01:13:53] [INFO ] Deduced a trap composed of 22 places in 497 ms of which 2 ms to minimize.
[2023-03-19 01:13:54] [INFO ] Deduced a trap composed of 19 places in 541 ms of which 2 ms to minimize.
[2023-03-19 01:13:55] [INFO ] Deduced a trap composed of 30 places in 439 ms of which 1 ms to minimize.
[2023-03-19 01:13:55] [INFO ] Deduced a trap composed of 28 places in 442 ms of which 2 ms to minimize.
[2023-03-19 01:13:56] [INFO ] Deduced a trap composed of 22 places in 487 ms of which 2 ms to minimize.
[2023-03-19 01:13:56] [INFO ] Deduced a trap composed of 24 places in 511 ms of which 1 ms to minimize.
[2023-03-19 01:13:57] [INFO ] Deduced a trap composed of 33 places in 414 ms of which 1 ms to minimize.
[2023-03-19 01:13:57] [INFO ] Deduced a trap composed of 33 places in 515 ms of which 1 ms to minimize.
[2023-03-19 01:13:58] [INFO ] Deduced a trap composed of 20 places in 402 ms of which 1 ms to minimize.
[2023-03-19 01:13:58] [INFO ] Deduced a trap composed of 30 places in 441 ms of which 1 ms to minimize.
[2023-03-19 01:13:59] [INFO ] Deduced a trap composed of 17 places in 483 ms of which 1 ms to minimize.
[2023-03-19 01:14:00] [INFO ] Deduced a trap composed of 38 places in 406 ms of which 1 ms to minimize.
[2023-03-19 01:14:00] [INFO ] Deduced a trap composed of 28 places in 380 ms of which 1 ms to minimize.
[2023-03-19 01:14:00] [INFO ] Deduced a trap composed of 20 places in 408 ms of which 1 ms to minimize.
[2023-03-19 01:14:01] [INFO ] Deduced a trap composed of 27 places in 399 ms of which 1 ms to minimize.
[2023-03-19 01:14:01] [INFO ] Deduced a trap composed of 16 places in 390 ms of which 1 ms to minimize.
[2023-03-19 01:14:02] [INFO ] Deduced a trap composed of 27 places in 385 ms of which 1 ms to minimize.
[2023-03-19 01:14:02] [INFO ] Deduced a trap composed of 25 places in 344 ms of which 1 ms to minimize.
[2023-03-19 01:14:03] [INFO ] Deduced a trap composed of 27 places in 277 ms of which 1 ms to minimize.
[2023-03-19 01:14:03] [INFO ] Deduced a trap composed of 29 places in 362 ms of which 1 ms to minimize.
[2023-03-19 01:14:04] [INFO ] Deduced a trap composed of 36 places in 280 ms of which 1 ms to minimize.
[2023-03-19 01:14:04] [INFO ] Deduced a trap composed of 40 places in 297 ms of which 1 ms to minimize.
[2023-03-19 01:14:04] [INFO ] Deduced a trap composed of 37 places in 320 ms of which 0 ms to minimize.
[2023-03-19 01:14:05] [INFO ] Deduced a trap composed of 35 places in 298 ms of which 0 ms to minimize.
[2023-03-19 01:14:05] [INFO ] Deduced a trap composed of 36 places in 302 ms of which 0 ms to minimize.
[2023-03-19 01:14:05] [INFO ] Deduced a trap composed of 30 places in 264 ms of which 1 ms to minimize.
[2023-03-19 01:14:06] [INFO ] Deduced a trap composed of 34 places in 299 ms of which 1 ms to minimize.
[2023-03-19 01:14:06] [INFO ] Deduced a trap composed of 41 places in 373 ms of which 0 ms to minimize.
[2023-03-19 01:14:07] [INFO ] Deduced a trap composed of 36 places in 343 ms of which 1 ms to minimize.
[2023-03-19 01:14:07] [INFO ] Deduced a trap composed of 42 places in 276 ms of which 1 ms to minimize.
[2023-03-19 01:14:07] [INFO ] Deduced a trap composed of 37 places in 333 ms of which 1 ms to minimize.
[2023-03-19 01:14:08] [INFO ] Deduced a trap composed of 40 places in 297 ms of which 1 ms to minimize.
[2023-03-19 01:14:08] [INFO ] Deduced a trap composed of 42 places in 349 ms of which 4 ms to minimize.
[2023-03-19 01:14:09] [INFO ] Deduced a trap composed of 41 places in 298 ms of which 0 ms to minimize.
[2023-03-19 01:14:09] [INFO ] Deduced a trap composed of 46 places in 285 ms of which 1 ms to minimize.
[2023-03-19 01:14:09] [INFO ] Deduced a trap composed of 43 places in 302 ms of which 1 ms to minimize.
[2023-03-19 01:14:10] [INFO ] Deduced a trap composed of 56 places in 261 ms of which 1 ms to minimize.
[2023-03-19 01:14:10] [INFO ] Deduced a trap composed of 52 places in 271 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 01:14:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 01:14:10] [INFO ] After 25283ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:18
Fused 18 Parikh solutions to 17 different solutions.
Parikh walk visited 0 properties in 2201 ms.
Support contains 24 out of 2372 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2372/2372 places, 2172/2172 transitions.
Drop transitions removed 467 transitions
Trivial Post-agglo rules discarded 467 transitions
Performed 467 trivial Post agglomeration. Transition count delta: 467
Iterating post reduction 0 with 467 rules applied. Total rules applied 467 place count 2372 transition count 1705
Reduce places removed 467 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 470 rules applied. Total rules applied 937 place count 1905 transition count 1702
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 940 place count 1902 transition count 1702
Performed 307 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 307 Pre rules applied. Total rules applied 940 place count 1902 transition count 1395
Deduced a syphon composed of 307 places in 2 ms
Reduce places removed 307 places and 0 transitions.
Iterating global reduction 3 with 614 rules applied. Total rules applied 1554 place count 1595 transition count 1395
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1557 place count 1592 transition count 1392
Iterating global reduction 3 with 3 rules applied. Total rules applied 1560 place count 1592 transition count 1392
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 1560 place count 1592 transition count 1389
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1566 place count 1589 transition count 1389
Performed 683 Post agglomeration using F-continuation condition.Transition count delta: 683
Deduced a syphon composed of 683 places in 3 ms
Reduce places removed 683 places and 0 transitions.
Iterating global reduction 3 with 1366 rules applied. Total rules applied 2932 place count 906 transition count 706
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2933 place count 906 transition count 705
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 2935 place count 905 transition count 704
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -63
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 3137 place count 804 transition count 767
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 3159 place count 793 transition count 774
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3160 place count 793 transition count 773
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3162 place count 793 transition count 771
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 3164 place count 791 transition count 771
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 6 with 40 rules applied. Total rules applied 3204 place count 791 transition count 771
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3205 place count 790 transition count 770
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 3207 place count 788 transition count 770
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 3207 place count 788 transition count 769
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 3209 place count 787 transition count 769
Applied a total of 3209 rules in 557 ms. Remains 787 /2372 variables (removed 1585) and now considering 769/2172 (removed 1403) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 557 ms. Remains : 787/2372 places, 769/2172 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 327 ms. (steps per millisecond=30 ) properties (out of 18) seen :9
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 769 rows 787 cols
[2023-03-19 01:14:14] [INFO ] Computed 359 place invariants in 2 ms
[2023-03-19 01:14:14] [INFO ] After 163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-19 01:14:14] [INFO ] [Nat]Absence check using 359 positive place invariants in 68 ms returned sat
[2023-03-19 01:14:15] [INFO ] After 674ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-19 01:14:15] [INFO ] State equation strengthened by 82 read => feed constraints.
[2023-03-19 01:14:16] [INFO ] After 508ms SMT Verify possible using 82 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-19 01:14:16] [INFO ] After 1318ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 490 ms.
[2023-03-19 01:14:17] [INFO ] After 2927ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 270 ms.
Support contains 10 out of 787 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 787/787 places, 769/769 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 787 transition count 766
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 784 transition count 766
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 6 place count 784 transition count 761
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 16 place count 779 transition count 761
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 24 place count 775 transition count 757
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 32 place count 771 transition count 759
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 771 transition count 758
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 34 place count 770 transition count 758
Applied a total of 34 rules in 85 ms. Remains 770 /787 variables (removed 17) and now considering 758/769 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 770/787 places, 758/769 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 99812 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 99812 steps, saw 63343 distinct states, run finished after 3003 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 758 rows 770 cols
[2023-03-19 01:14:21] [INFO ] Computed 359 place invariants in 3 ms
[2023-03-19 01:14:21] [INFO ] After 170ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-19 01:14:22] [INFO ] [Nat]Absence check using 359 positive place invariants in 92 ms returned sat
[2023-03-19 01:14:23] [INFO ] After 730ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-19 01:14:23] [INFO ] State equation strengthened by 83 read => feed constraints.
[2023-03-19 01:14:23] [INFO ] After 524ms SMT Verify possible using 83 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-19 01:14:24] [INFO ] After 1391ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 529 ms.
[2023-03-19 01:14:24] [INFO ] After 3221ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 218 ms.
Support contains 10 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 758/758 transitions.
Applied a total of 0 rules in 25 ms. Remains 770 /770 variables (removed 0) and now considering 758/758 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 770/770 places, 758/758 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 758/758 transitions.
Applied a total of 0 rules in 16 ms. Remains 770 /770 variables (removed 0) and now considering 758/758 (removed 0) transitions.
[2023-03-19 01:14:25] [INFO ] Invariant cache hit.
[2023-03-19 01:14:25] [INFO ] Implicit Places using invariants in 537 ms returned [759]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 540 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 769/770 places, 758/758 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 768 transition count 757
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 768 transition count 757
Applied a total of 2 rules in 34 ms. Remains 768 /769 variables (removed 1) and now considering 757/758 (removed 1) transitions.
// Phase 1: matrix 757 rows 768 cols
[2023-03-19 01:14:25] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-19 01:14:26] [INFO ] Implicit Places using invariants in 465 ms returned []
[2023-03-19 01:14:26] [INFO ] Invariant cache hit.
[2023-03-19 01:14:26] [INFO ] State equation strengthened by 82 read => feed constraints.
[2023-03-19 01:14:27] [INFO ] Implicit Places using invariants and state equation in 1668 ms returned []
Implicit Place search using SMT with State Equation took 2137 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 768/770 places, 757/758 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2727 ms. Remains : 768/770 places, 757/758 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 272 ms. (steps per millisecond=36 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 103172 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 103172 steps, saw 65427 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 9 properties.
[2023-03-19 01:14:31] [INFO ] Invariant cache hit.
[2023-03-19 01:14:32] [INFO ] After 196ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-19 01:14:32] [INFO ] [Nat]Absence check using 358 positive place invariants in 81 ms returned sat
[2023-03-19 01:14:33] [INFO ] After 757ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-19 01:14:33] [INFO ] State equation strengthened by 82 read => feed constraints.
[2023-03-19 01:14:33] [INFO ] After 535ms SMT Verify possible using 82 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-19 01:14:34] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 1 ms to minimize.
[2023-03-19 01:14:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 230 ms
[2023-03-19 01:14:34] [INFO ] After 1562ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 481 ms.
[2023-03-19 01:14:35] [INFO ] After 3335ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 329 ms.
Support contains 10 out of 768 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 768/768 places, 757/757 transitions.
Applied a total of 0 rules in 14 ms. Remains 768 /768 variables (removed 0) and now considering 757/757 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 768/768 places, 757/757 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 768/768 places, 757/757 transitions.
Applied a total of 0 rules in 21 ms. Remains 768 /768 variables (removed 0) and now considering 757/757 (removed 0) transitions.
[2023-03-19 01:14:35] [INFO ] Invariant cache hit.
[2023-03-19 01:14:36] [INFO ] Implicit Places using invariants in 433 ms returned []
[2023-03-19 01:14:36] [INFO ] Invariant cache hit.
[2023-03-19 01:14:36] [INFO ] State equation strengthened by 82 read => feed constraints.
[2023-03-19 01:14:37] [INFO ] Implicit Places using invariants and state equation in 1618 ms returned []
Implicit Place search using SMT with State Equation took 2056 ms to find 0 implicit places.
[2023-03-19 01:14:37] [INFO ] Redundant transitions in 72 ms returned []
[2023-03-19 01:14:37] [INFO ] Invariant cache hit.
[2023-03-19 01:14:38] [INFO ] Dead Transitions using invariants and state equation in 433 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2589 ms. Remains : 768/768 places, 757/757 transitions.
Partial Free-agglomeration rule applied 103 times.
Drop transitions removed 103 transitions
Iterating global reduction 0 with 103 rules applied. Total rules applied 103 place count 768 transition count 757
Applied a total of 103 rules in 25 ms. Remains 768 /768 variables (removed 0) and now considering 757/757 (removed 0) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 757 rows 768 cols
[2023-03-19 01:14:38] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-19 01:14:38] [INFO ] After 292ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-19 01:14:38] [INFO ] [Nat]Absence check using 358 positive place invariants in 81 ms returned sat
[2023-03-19 01:14:39] [INFO ] After 781ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-19 01:14:39] [INFO ] State equation strengthened by 101 read => feed constraints.
[2023-03-19 01:14:40] [INFO ] After 543ms SMT Verify possible using 101 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-19 01:14:41] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 0 ms to minimize.
[2023-03-19 01:14:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 302 ms
[2023-03-19 01:14:41] [INFO ] After 1619ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 498 ms.
[2023-03-19 01:14:42] [INFO ] After 3432ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Computed a total of 639 stabilizing places and 639 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((G(p1)||p0)))))'
Support contains 4 out of 2372 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2372/2372 places, 2172/2172 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 2361 transition count 2161
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 2361 transition count 2161
Applied a total of 22 rules in 230 ms. Remains 2361 /2372 variables (removed 11) and now considering 2161/2172 (removed 11) transitions.
// Phase 1: matrix 2161 rows 2361 cols
[2023-03-19 01:14:43] [INFO ] Computed 361 place invariants in 20 ms
[2023-03-19 01:14:43] [INFO ] Implicit Places using invariants in 865 ms returned []
[2023-03-19 01:14:43] [INFO ] Invariant cache hit.
[2023-03-19 01:14:45] [INFO ] Implicit Places using invariants and state equation in 1286 ms returned []
Implicit Place search using SMT with State Equation took 2153 ms to find 0 implicit places.
[2023-03-19 01:14:45] [INFO ] Invariant cache hit.
[2023-03-19 01:14:46] [INFO ] Dead Transitions using invariants and state equation in 1451 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2361/2372 places, 2161/2172 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3837 ms. Remains : 2361/2372 places, 2161/2172 transitions.
Stuttering acceptance computed with spot in 431 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(EQ s321 0), p0:(OR (EQ s994 0) (EQ s1019 0) (EQ s1028 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 857 ms.
Product exploration explored 100000 steps with 0 reset in 1012 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 310 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 264 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 309 ms. (steps per millisecond=32 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 93306 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 93306 steps, saw 60665 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-19 01:14:52] [INFO ] Invariant cache hit.
[2023-03-19 01:14:53] [INFO ] After 336ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 01:14:54] [INFO ] [Nat]Absence check using 361 positive place invariants in 269 ms returned sat
[2023-03-19 01:14:55] [INFO ] After 1524ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 01:14:56] [INFO ] Deduced a trap composed of 17 places in 581 ms of which 1 ms to minimize.
[2023-03-19 01:14:57] [INFO ] Deduced a trap composed of 23 places in 502 ms of which 2 ms to minimize.
[2023-03-19 01:14:57] [INFO ] Deduced a trap composed of 30 places in 525 ms of which 1 ms to minimize.
[2023-03-19 01:14:58] [INFO ] Deduced a trap composed of 30 places in 692 ms of which 3 ms to minimize.
[2023-03-19 01:14:59] [INFO ] Deduced a trap composed of 28 places in 483 ms of which 1 ms to minimize.
[2023-03-19 01:14:59] [INFO ] Deduced a trap composed of 33 places in 488 ms of which 1 ms to minimize.
[2023-03-19 01:15:00] [INFO ] Deduced a trap composed of 34 places in 472 ms of which 2 ms to minimize.
[2023-03-19 01:15:00] [INFO ] Deduced a trap composed of 34 places in 472 ms of which 1 ms to minimize.
[2023-03-19 01:15:01] [INFO ] Deduced a trap composed of 16 places in 456 ms of which 1 ms to minimize.
[2023-03-19 01:15:02] [INFO ] Deduced a trap composed of 32 places in 747 ms of which 2 ms to minimize.
[2023-03-19 01:15:02] [INFO ] Deduced a trap composed of 19 places in 507 ms of which 1 ms to minimize.
[2023-03-19 01:15:03] [INFO ] Deduced a trap composed of 32 places in 489 ms of which 1 ms to minimize.
[2023-03-19 01:15:03] [INFO ] Deduced a trap composed of 20 places in 400 ms of which 1 ms to minimize.
[2023-03-19 01:15:04] [INFO ] Deduced a trap composed of 35 places in 406 ms of which 1 ms to minimize.
[2023-03-19 01:15:04] [INFO ] Deduced a trap composed of 26 places in 439 ms of which 1 ms to minimize.
[2023-03-19 01:15:05] [INFO ] Deduced a trap composed of 18 places in 413 ms of which 1 ms to minimize.
[2023-03-19 01:15:05] [INFO ] Deduced a trap composed of 25 places in 491 ms of which 2 ms to minimize.
[2023-03-19 01:15:06] [INFO ] Deduced a trap composed of 30 places in 395 ms of which 1 ms to minimize.
[2023-03-19 01:15:06] [INFO ] Deduced a trap composed of 22 places in 424 ms of which 2 ms to minimize.
[2023-03-19 01:15:07] [INFO ] Deduced a trap composed of 22 places in 356 ms of which 1 ms to minimize.
[2023-03-19 01:15:07] [INFO ] Deduced a trap composed of 27 places in 376 ms of which 2 ms to minimize.
[2023-03-19 01:15:08] [INFO ] Deduced a trap composed of 19 places in 375 ms of which 5 ms to minimize.
[2023-03-19 01:15:08] [INFO ] Deduced a trap composed of 35 places in 365 ms of which 2 ms to minimize.
[2023-03-19 01:15:09] [INFO ] Deduced a trap composed of 23 places in 329 ms of which 1 ms to minimize.
[2023-03-19 01:15:09] [INFO ] Deduced a trap composed of 28 places in 367 ms of which 1 ms to minimize.
[2023-03-19 01:15:09] [INFO ] Deduced a trap composed of 27 places in 349 ms of which 1 ms to minimize.
[2023-03-19 01:15:10] [INFO ] Deduced a trap composed of 29 places in 373 ms of which 1 ms to minimize.
[2023-03-19 01:15:10] [INFO ] Deduced a trap composed of 26 places in 326 ms of which 1 ms to minimize.
[2023-03-19 01:15:11] [INFO ] Deduced a trap composed of 36 places in 308 ms of which 1 ms to minimize.
[2023-03-19 01:15:11] [INFO ] Deduced a trap composed of 31 places in 349 ms of which 1 ms to minimize.
[2023-03-19 01:15:12] [INFO ] Deduced a trap composed of 27 places in 360 ms of which 1 ms to minimize.
[2023-03-19 01:15:12] [INFO ] Deduced a trap composed of 23 places in 364 ms of which 1 ms to minimize.
[2023-03-19 01:15:12] [INFO ] Deduced a trap composed of 25 places in 304 ms of which 1 ms to minimize.
[2023-03-19 01:15:13] [INFO ] Deduced a trap composed of 31 places in 303 ms of which 1 ms to minimize.
[2023-03-19 01:15:13] [INFO ] Deduced a trap composed of 32 places in 329 ms of which 1 ms to minimize.
[2023-03-19 01:15:14] [INFO ] Deduced a trap composed of 19 places in 295 ms of which 0 ms to minimize.
[2023-03-19 01:15:14] [INFO ] Deduced a trap composed of 34 places in 262 ms of which 1 ms to minimize.
[2023-03-19 01:15:14] [INFO ] Deduced a trap composed of 38 places in 279 ms of which 1 ms to minimize.
[2023-03-19 01:15:15] [INFO ] Deduced a trap composed of 29 places in 299 ms of which 1 ms to minimize.
[2023-03-19 01:15:15] [INFO ] Deduced a trap composed of 41 places in 281 ms of which 1 ms to minimize.
[2023-03-19 01:15:15] [INFO ] Deduced a trap composed of 42 places in 251 ms of which 0 ms to minimize.
[2023-03-19 01:15:16] [INFO ] Deduced a trap composed of 46 places in 275 ms of which 0 ms to minimize.
[2023-03-19 01:15:16] [INFO ] Deduced a trap composed of 44 places in 343 ms of which 1 ms to minimize.
[2023-03-19 01:15:16] [INFO ] Deduced a trap composed of 37 places in 331 ms of which 1 ms to minimize.
[2023-03-19 01:15:17] [INFO ] Deduced a trap composed of 41 places in 288 ms of which 1 ms to minimize.
[2023-03-19 01:15:17] [INFO ] Deduced a trap composed of 32 places in 276 ms of which 0 ms to minimize.
[2023-03-19 01:15:18] [INFO ] Deduced a trap composed of 46 places in 330 ms of which 2 ms to minimize.
[2023-03-19 01:15:18] [INFO ] Deduced a trap composed of 40 places in 290 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 01:15:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 01:15:18] [INFO ] After 25188ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 295 ms.
Support contains 4 out of 2361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2361/2361 places, 2161/2161 transitions.
Drop transitions removed 477 transitions
Trivial Post-agglo rules discarded 477 transitions
Performed 477 trivial Post agglomeration. Transition count delta: 477
Iterating post reduction 0 with 477 rules applied. Total rules applied 477 place count 2361 transition count 1684
Reduce places removed 477 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 478 rules applied. Total rules applied 955 place count 1884 transition count 1683
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 956 place count 1883 transition count 1683
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 319 Pre rules applied. Total rules applied 956 place count 1883 transition count 1364
Deduced a syphon composed of 319 places in 2 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 3 with 638 rules applied. Total rules applied 1594 place count 1564 transition count 1364
Performed 680 Post agglomeration using F-continuation condition.Transition count delta: 680
Deduced a syphon composed of 680 places in 1 ms
Reduce places removed 680 places and 0 transitions.
Iterating global reduction 3 with 1360 rules applied. Total rules applied 2954 place count 884 transition count 684
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2955 place count 884 transition count 683
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2957 place count 883 transition count 682
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 4 with 202 rules applied. Total rules applied 3159 place count 782 transition count 749
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 3193 place count 765 transition count 760
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3194 place count 765 transition count 759
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 5 with 40 rules applied. Total rules applied 3234 place count 765 transition count 759
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3235 place count 764 transition count 758
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 3237 place count 762 transition count 758
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 3237 place count 762 transition count 757
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 3239 place count 761 transition count 757
Applied a total of 3239 rules in 332 ms. Remains 761 /2361 variables (removed 1600) and now considering 757/2161 (removed 1404) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 332 ms. Remains : 761/2361 places, 757/2161 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 256 ms. (steps per millisecond=39 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 138074 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 138074 steps, saw 88712 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 757 rows 761 cols
[2023-03-19 01:15:22] [INFO ] Computed 359 place invariants in 1 ms
[2023-03-19 01:15:22] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 01:15:23] [INFO ] [Nat]Absence check using 359 positive place invariants in 115 ms returned sat
[2023-03-19 01:15:23] [INFO ] After 436ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 01:15:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 01:15:23] [INFO ] After 165ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-19 01:15:24] [INFO ] After 557ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 203 ms.
[2023-03-19 01:15:24] [INFO ] After 1554ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 129 ms.
Support contains 4 out of 761 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 757/757 transitions.
Applied a total of 0 rules in 17 ms. Remains 761 /761 variables (removed 0) and now considering 757/757 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 761/761 places, 757/757 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 757/757 transitions.
Applied a total of 0 rules in 14 ms. Remains 761 /761 variables (removed 0) and now considering 757/757 (removed 0) transitions.
[2023-03-19 01:15:24] [INFO ] Invariant cache hit.
[2023-03-19 01:15:24] [INFO ] Implicit Places using invariants in 416 ms returned [750]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 418 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 760/761 places, 757/757 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 759 transition count 756
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 759 transition count 756
Applied a total of 2 rules in 50 ms. Remains 759 /760 variables (removed 1) and now considering 756/757 (removed 1) transitions.
// Phase 1: matrix 756 rows 759 cols
[2023-03-19 01:15:24] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-19 01:15:25] [INFO ] Implicit Places using invariants in 450 ms returned []
[2023-03-19 01:15:25] [INFO ] Invariant cache hit.
[2023-03-19 01:15:26] [INFO ] Implicit Places using invariants and state equation in 877 ms returned []
Implicit Place search using SMT with State Equation took 1328 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 759/761 places, 756/757 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1810 ms. Remains : 759/761 places, 756/757 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 134848 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 134848 steps, saw 86573 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-19 01:15:29] [INFO ] Invariant cache hit.
[2023-03-19 01:15:29] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 01:15:30] [INFO ] [Nat]Absence check using 358 positive place invariants in 62 ms returned sat
[2023-03-19 01:15:30] [INFO ] After 381ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 01:15:30] [INFO ] After 663ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 208 ms.
[2023-03-19 01:15:31] [INFO ] After 1190ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 117 ms.
Support contains 4 out of 759 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 756/756 transitions.
Applied a total of 0 rules in 13 ms. Remains 759 /759 variables (removed 0) and now considering 756/756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 759/759 places, 756/756 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 756/756 transitions.
Applied a total of 0 rules in 12 ms. Remains 759 /759 variables (removed 0) and now considering 756/756 (removed 0) transitions.
[2023-03-19 01:15:31] [INFO ] Invariant cache hit.
[2023-03-19 01:15:31] [INFO ] Implicit Places using invariants in 407 ms returned []
[2023-03-19 01:15:31] [INFO ] Invariant cache hit.
[2023-03-19 01:15:32] [INFO ] Implicit Places using invariants and state equation in 1052 ms returned []
Implicit Place search using SMT with State Equation took 1462 ms to find 0 implicit places.
[2023-03-19 01:15:32] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-19 01:15:32] [INFO ] Invariant cache hit.
[2023-03-19 01:15:33] [INFO ] Dead Transitions using invariants and state equation in 412 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1911 ms. Remains : 759/759 places, 756/756 transitions.
Partial Free-agglomeration rule applied 78 times.
Drop transitions removed 78 transitions
Iterating global reduction 0 with 78 rules applied. Total rules applied 78 place count 759 transition count 756
Applied a total of 78 rules in 32 ms. Remains 759 /759 variables (removed 0) and now considering 756/756 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 756 rows 759 cols
[2023-03-19 01:15:33] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-19 01:15:33] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 01:15:33] [INFO ] [Nat]Absence check using 358 positive place invariants in 44 ms returned sat
[2023-03-19 01:15:33] [INFO ] After 407ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 01:15:34] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-19 01:15:34] [INFO ] After 243ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-19 01:15:34] [INFO ] After 653ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 222 ms.
[2023-03-19 01:15:34] [INFO ] After 1530ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 319 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 277 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 2361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2361/2361 places, 2161/2161 transitions.
Applied a total of 0 rules in 171 ms. Remains 2361 /2361 variables (removed 0) and now considering 2161/2161 (removed 0) transitions.
// Phase 1: matrix 2161 rows 2361 cols
[2023-03-19 01:15:35] [INFO ] Computed 361 place invariants in 17 ms
[2023-03-19 01:15:36] [INFO ] Implicit Places using invariants in 1001 ms returned []
[2023-03-19 01:15:36] [INFO ] Invariant cache hit.
[2023-03-19 01:15:38] [INFO ] Implicit Places using invariants and state equation in 1220 ms returned []
Implicit Place search using SMT with State Equation took 2225 ms to find 0 implicit places.
[2023-03-19 01:15:38] [INFO ] Invariant cache hit.
[2023-03-19 01:15:39] [INFO ] Dead Transitions using invariants and state equation in 1233 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3629 ms. Remains : 2361/2361 places, 2161/2161 transitions.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 198 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 247 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 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 105574 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 105574 steps, saw 67060 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-19 01:15:43] [INFO ] Invariant cache hit.
[2023-03-19 01:15:43] [INFO ] After 506ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 01:15:44] [INFO ] [Nat]Absence check using 361 positive place invariants in 208 ms returned sat
[2023-03-19 01:15:46] [INFO ] After 1626ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 01:15:46] [INFO ] Deduced a trap composed of 17 places in 495 ms of which 1 ms to minimize.
[2023-03-19 01:15:47] [INFO ] Deduced a trap composed of 23 places in 461 ms of which 1 ms to minimize.
[2023-03-19 01:15:48] [INFO ] Deduced a trap composed of 30 places in 458 ms of which 1 ms to minimize.
[2023-03-19 01:15:48] [INFO ] Deduced a trap composed of 30 places in 613 ms of which 1 ms to minimize.
[2023-03-19 01:15:49] [INFO ] Deduced a trap composed of 28 places in 499 ms of which 1 ms to minimize.
[2023-03-19 01:15:49] [INFO ] Deduced a trap composed of 33 places in 488 ms of which 1 ms to minimize.
[2023-03-19 01:15:50] [INFO ] Deduced a trap composed of 34 places in 461 ms of which 1 ms to minimize.
[2023-03-19 01:15:51] [INFO ] Deduced a trap composed of 34 places in 428 ms of which 2 ms to minimize.
[2023-03-19 01:15:51] [INFO ] Deduced a trap composed of 16 places in 520 ms of which 1 ms to minimize.
[2023-03-19 01:15:52] [INFO ] Deduced a trap composed of 32 places in 506 ms of which 1 ms to minimize.
[2023-03-19 01:15:52] [INFO ] Deduced a trap composed of 19 places in 407 ms of which 1 ms to minimize.
[2023-03-19 01:15:53] [INFO ] Deduced a trap composed of 32 places in 501 ms of which 2 ms to minimize.
[2023-03-19 01:15:53] [INFO ] Deduced a trap composed of 20 places in 464 ms of which 1 ms to minimize.
[2023-03-19 01:15:54] [INFO ] Deduced a trap composed of 35 places in 480 ms of which 2 ms to minimize.
[2023-03-19 01:15:54] [INFO ] Deduced a trap composed of 26 places in 423 ms of which 1 ms to minimize.
[2023-03-19 01:15:55] [INFO ] Deduced a trap composed of 18 places in 417 ms of which 1 ms to minimize.
[2023-03-19 01:15:55] [INFO ] Deduced a trap composed of 25 places in 367 ms of which 1 ms to minimize.
[2023-03-19 01:15:56] [INFO ] Deduced a trap composed of 30 places in 432 ms of which 1 ms to minimize.
[2023-03-19 01:15:56] [INFO ] Deduced a trap composed of 22 places in 383 ms of which 1 ms to minimize.
[2023-03-19 01:15:57] [INFO ] Deduced a trap composed of 22 places in 341 ms of which 1 ms to minimize.
[2023-03-19 01:15:57] [INFO ] Deduced a trap composed of 27 places in 384 ms of which 1 ms to minimize.
[2023-03-19 01:15:58] [INFO ] Deduced a trap composed of 19 places in 352 ms of which 1 ms to minimize.
[2023-03-19 01:15:58] [INFO ] Deduced a trap composed of 35 places in 394 ms of which 1 ms to minimize.
[2023-03-19 01:15:59] [INFO ] Deduced a trap composed of 23 places in 358 ms of which 1 ms to minimize.
[2023-03-19 01:15:59] [INFO ] Deduced a trap composed of 28 places in 355 ms of which 1 ms to minimize.
[2023-03-19 01:15:59] [INFO ] Deduced a trap composed of 27 places in 347 ms of which 1 ms to minimize.
[2023-03-19 01:16:00] [INFO ] Deduced a trap composed of 29 places in 351 ms of which 2 ms to minimize.
[2023-03-19 01:16:00] [INFO ] Deduced a trap composed of 26 places in 350 ms of which 1 ms to minimize.
[2023-03-19 01:16:01] [INFO ] Deduced a trap composed of 36 places in 304 ms of which 1 ms to minimize.
[2023-03-19 01:16:01] [INFO ] Deduced a trap composed of 31 places in 362 ms of which 1 ms to minimize.
[2023-03-19 01:16:02] [INFO ] Deduced a trap composed of 27 places in 340 ms of which 1 ms to minimize.
[2023-03-19 01:16:02] [INFO ] Deduced a trap composed of 23 places in 328 ms of which 0 ms to minimize.
[2023-03-19 01:16:02] [INFO ] Deduced a trap composed of 25 places in 354 ms of which 1 ms to minimize.
[2023-03-19 01:16:03] [INFO ] Deduced a trap composed of 31 places in 335 ms of which 1 ms to minimize.
[2023-03-19 01:16:03] [INFO ] Deduced a trap composed of 32 places in 350 ms of which 2 ms to minimize.
[2023-03-19 01:16:04] [INFO ] Deduced a trap composed of 19 places in 282 ms of which 3 ms to minimize.
[2023-03-19 01:16:04] [INFO ] Deduced a trap composed of 34 places in 297 ms of which 1 ms to minimize.
[2023-03-19 01:16:04] [INFO ] Deduced a trap composed of 38 places in 340 ms of which 1 ms to minimize.
[2023-03-19 01:16:05] [INFO ] Deduced a trap composed of 29 places in 319 ms of which 0 ms to minimize.
[2023-03-19 01:16:05] [INFO ] Deduced a trap composed of 41 places in 288 ms of which 2 ms to minimize.
[2023-03-19 01:16:06] [INFO ] Deduced a trap composed of 42 places in 322 ms of which 1 ms to minimize.
[2023-03-19 01:16:06] [INFO ] Deduced a trap composed of 46 places in 245 ms of which 0 ms to minimize.
[2023-03-19 01:16:06] [INFO ] Deduced a trap composed of 44 places in 278 ms of which 1 ms to minimize.
[2023-03-19 01:16:06] [INFO ] Deduced a trap composed of 37 places in 253 ms of which 2 ms to minimize.
[2023-03-19 01:16:07] [INFO ] Deduced a trap composed of 41 places in 233 ms of which 1 ms to minimize.
[2023-03-19 01:16:07] [INFO ] Deduced a trap composed of 32 places in 229 ms of which 1 ms to minimize.
[2023-03-19 01:16:07] [INFO ] Deduced a trap composed of 46 places in 273 ms of which 1 ms to minimize.
[2023-03-19 01:16:08] [INFO ] Deduced a trap composed of 40 places in 280 ms of which 1 ms to minimize.
[2023-03-19 01:16:08] [INFO ] Deduced a trap composed of 43 places in 265 ms of which 0 ms to minimize.
[2023-03-19 01:16:08] [INFO ] Deduced a trap composed of 43 places in 322 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 01:16:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 01:16:09] [INFO ] After 25251ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 287 ms.
Support contains 4 out of 2361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2361/2361 places, 2161/2161 transitions.
Drop transitions removed 477 transitions
Trivial Post-agglo rules discarded 477 transitions
Performed 477 trivial Post agglomeration. Transition count delta: 477
Iterating post reduction 0 with 477 rules applied. Total rules applied 477 place count 2361 transition count 1684
Reduce places removed 477 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 478 rules applied. Total rules applied 955 place count 1884 transition count 1683
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 956 place count 1883 transition count 1683
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 319 Pre rules applied. Total rules applied 956 place count 1883 transition count 1364
Deduced a syphon composed of 319 places in 2 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 3 with 638 rules applied. Total rules applied 1594 place count 1564 transition count 1364
Performed 680 Post agglomeration using F-continuation condition.Transition count delta: 680
Deduced a syphon composed of 680 places in 1 ms
Reduce places removed 680 places and 0 transitions.
Iterating global reduction 3 with 1360 rules applied. Total rules applied 2954 place count 884 transition count 684
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2955 place count 884 transition count 683
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 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2957 place count 883 transition count 682
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 4 with 202 rules applied. Total rules applied 3159 place count 782 transition count 749
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 3193 place count 765 transition count 760
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3194 place count 765 transition count 759
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 5 with 40 rules applied. Total rules applied 3234 place count 765 transition count 759
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3235 place count 764 transition count 758
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 3237 place count 762 transition count 758
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 3237 place count 762 transition count 757
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 3239 place count 761 transition count 757
Applied a total of 3239 rules in 231 ms. Remains 761 /2361 variables (removed 1600) and now considering 757/2161 (removed 1404) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 231 ms. Remains : 761/2361 places, 757/2161 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 124359 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 124359 steps, saw 79575 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 757 rows 761 cols
[2023-03-19 01:16:13] [INFO ] Computed 359 place invariants in 2 ms
[2023-03-19 01:16:13] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 01:16:13] [INFO ] [Nat]Absence check using 359 positive place invariants in 45 ms returned sat
[2023-03-19 01:16:13] [INFO ] After 355ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 01:16:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 01:16:13] [INFO ] After 84ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-19 01:16:13] [INFO ] After 264ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 99 ms.
[2023-03-19 01:16:14] [INFO ] After 904ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 97 ms.
Support contains 4 out of 761 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 757/757 transitions.
Applied a total of 0 rules in 14 ms. Remains 761 /761 variables (removed 0) and now considering 757/757 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 761/761 places, 757/757 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 757/757 transitions.
Applied a total of 0 rules in 12 ms. Remains 761 /761 variables (removed 0) and now considering 757/757 (removed 0) transitions.
[2023-03-19 01:16:14] [INFO ] Invariant cache hit.
[2023-03-19 01:16:14] [INFO ] Implicit Places using invariants in 400 ms returned [750]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 401 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 760/761 places, 757/757 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 759 transition count 756
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 759 transition count 756
Applied a total of 2 rules in 24 ms. Remains 759 /760 variables (removed 1) and now considering 756/757 (removed 1) transitions.
// Phase 1: matrix 756 rows 759 cols
[2023-03-19 01:16:14] [INFO ] Computed 358 place invariants in 1 ms
[2023-03-19 01:16:14] [INFO ] Implicit Places using invariants in 365 ms returned []
[2023-03-19 01:16:14] [INFO ] Invariant cache hit.
[2023-03-19 01:16:15] [INFO ] Implicit Places using invariants and state equation in 719 ms returned []
Implicit Place search using SMT with State Equation took 1088 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 759/761 places, 756/757 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1525 ms. Remains : 759/761 places, 756/757 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 139358 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 139358 steps, saw 89681 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-19 01:16:19] [INFO ] Invariant cache hit.
[2023-03-19 01:16:19] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 01:16:19] [INFO ] [Nat]Absence check using 358 positive place invariants in 79 ms returned sat
[2023-03-19 01:16:19] [INFO ] After 442ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 01:16:20] [INFO ] After 779ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 206 ms.
[2023-03-19 01:16:20] [INFO ] After 1324ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 103 ms.
Support contains 4 out of 759 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 756/756 transitions.
Applied a total of 0 rules in 10 ms. Remains 759 /759 variables (removed 0) and now considering 756/756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 759/759 places, 756/756 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 756/756 transitions.
Applied a total of 0 rules in 11 ms. Remains 759 /759 variables (removed 0) and now considering 756/756 (removed 0) transitions.
[2023-03-19 01:16:20] [INFO ] Invariant cache hit.
[2023-03-19 01:16:21] [INFO ] Implicit Places using invariants in 403 ms returned []
[2023-03-19 01:16:21] [INFO ] Invariant cache hit.
[2023-03-19 01:16:21] [INFO ] Implicit Places using invariants and state equation in 779 ms returned []
Implicit Place search using SMT with State Equation took 1184 ms to find 0 implicit places.
[2023-03-19 01:16:21] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-19 01:16:21] [INFO ] Invariant cache hit.
[2023-03-19 01:16:22] [INFO ] Dead Transitions using invariants and state equation in 486 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1719 ms. Remains : 759/759 places, 756/756 transitions.
Partial Free-agglomeration rule applied 78 times.
Drop transitions removed 78 transitions
Iterating global reduction 0 with 78 rules applied. Total rules applied 78 place count 759 transition count 756
Applied a total of 78 rules in 21 ms. Remains 759 /759 variables (removed 0) and now considering 756/756 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 756 rows 759 cols
[2023-03-19 01:16:22] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-19 01:16:22] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 01:16:22] [INFO ] [Nat]Absence check using 358 positive place invariants in 92 ms returned sat
[2023-03-19 01:16:23] [INFO ] After 467ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 01:16:23] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-19 01:16:23] [INFO ] After 288ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-19 01:16:24] [INFO ] After 664ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 228 ms.
[2023-03-19 01:16:24] [INFO ] After 1714ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 266 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 278 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 253 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 738 ms.
Product exploration explored 100000 steps with 0 reset in 952 ms.
Applying partial POR strategy [true, true, true, false, false]
Stuttering acceptance computed with spot in 267 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 2361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2361/2361 places, 2161/2161 transitions.
Performed 478 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 478 rules applied. Total rules applied 478 place count 2361 transition count 2161
Performed 161 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 161 Pre rules applied. Total rules applied 478 place count 2361 transition count 2281
Deduced a syphon composed of 639 places in 3 ms
Iterating global reduction 1 with 161 rules applied. Total rules applied 639 place count 2361 transition count 2281
Performed 798 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1437 places in 2 ms
Iterating global reduction 1 with 798 rules applied. Total rules applied 1437 place count 2361 transition count 2281
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1438 place count 2361 transition count 2280
Renaming transitions due to excessive name length > 1024 char.
Discarding 318 places :
Symmetric choice reduction at 2 with 318 rule applications. Total rules 1756 place count 2043 transition count 1962
Deduced a syphon composed of 1119 places in 2 ms
Iterating global reduction 2 with 318 rules applied. Total rules applied 2074 place count 2043 transition count 1962
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1120 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2075 place count 2043 transition count 1962
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2077 place count 2041 transition count 1960
Deduced a syphon composed of 1118 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2079 place count 2041 transition count 1960
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -521
Deduced a syphon composed of 1219 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2180 place count 2041 transition count 2481
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2281 place count 1940 transition count 2279
Deduced a syphon composed of 1118 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2382 place count 1940 transition count 2279
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: -307
Deduced a syphon composed of 1175 places in 2 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 2439 place count 1940 transition count 2586
Discarding 57 places :
Symmetric choice reduction at 2 with 57 rule applications. Total rules 2496 place count 1883 transition count 2472
Deduced a syphon composed of 1118 places in 2 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 2553 place count 1883 transition count 2472
Deduced a syphon composed of 1118 places in 2 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 2562 place count 1883 transition count 2463
Deduced a syphon composed of 1118 places in 2 ms
Applied a total of 2562 rules in 1456 ms. Remains 1883 /2361 variables (removed 478) and now considering 2463/2161 (removed -302) transitions.
[2023-03-19 01:16:29] [INFO ] Redundant transitions in 36 ms returned []
// Phase 1: matrix 2463 rows 1883 cols
[2023-03-19 01:16:29] [INFO ] Computed 361 place invariants in 18 ms
[2023-03-19 01:16:30] [INFO ] Dead Transitions using invariants and state equation in 1394 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1883/2361 places, 2463/2161 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2898 ms. Remains : 1883/2361 places, 2463/2161 transitions.
Built C files in :
/tmp/ltsmin14838268776090985366
[2023-03-19 01:16:30] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14838268776090985366
Running compilation step : cd /tmp/ltsmin14838268776090985366;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14838268776090985366;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14838268776090985366;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 4 out of 2361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2361/2361 places, 2161/2161 transitions.
Applied a total of 0 rules in 119 ms. Remains 2361 /2361 variables (removed 0) and now considering 2161/2161 (removed 0) transitions.
// Phase 1: matrix 2161 rows 2361 cols
[2023-03-19 01:16:34] [INFO ] Computed 361 place invariants in 15 ms
[2023-03-19 01:16:34] [INFO ] Implicit Places using invariants in 957 ms returned []
[2023-03-19 01:16:34] [INFO ] Invariant cache hit.
[2023-03-19 01:16:37] [INFO ] Implicit Places using invariants and state equation in 2557 ms returned []
Implicit Place search using SMT with State Equation took 3529 ms to find 0 implicit places.
[2023-03-19 01:16:37] [INFO ] Invariant cache hit.
[2023-03-19 01:16:38] [INFO ] Dead Transitions using invariants and state equation in 1394 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5044 ms. Remains : 2361/2361 places, 2161/2161 transitions.
Built C files in :
/tmp/ltsmin6273628877473947169
[2023-03-19 01:16:38] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6273628877473947169
Running compilation step : cd /tmp/ltsmin6273628877473947169;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6273628877473947169;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6273628877473947169;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-19 01:16:42] [INFO ] Flatten gal took : 67 ms
[2023-03-19 01:16:42] [INFO ] Flatten gal took : 69 ms
[2023-03-19 01:16:42] [INFO ] Time to serialize gal into /tmp/LTL9883018966131666822.gal : 34 ms
[2023-03-19 01:16:42] [INFO ] Time to serialize properties into /tmp/LTL17454769914591810167.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9883018966131666822.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10655075366535053621.hoa' '-atoms' '/tmp/LTL17454769914591810167.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17454769914591810167.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10655075366535053621.hoa
Detected timeout of ITS tools.
[2023-03-19 01:16:57] [INFO ] Flatten gal took : 56 ms
[2023-03-19 01:16:57] [INFO ] Flatten gal took : 53 ms
[2023-03-19 01:16:57] [INFO ] Time to serialize gal into /tmp/LTL9125643640192585576.gal : 8 ms
[2023-03-19 01:16:57] [INFO ] Time to serialize properties into /tmp/LTL15736845541998280906.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9125643640192585576.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15736845541998280906.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("((p1170==0)||(p1202==0))")||(("(p1214==0)")||(G("(p371==0)"))))))))
Formula 0 simplified : XXF(!"((p1170==0)||(p1202==0))" & !"(p1214==0)" & F!"(p371==0)")
Detected timeout of ITS tools.
[2023-03-19 01:17:13] [INFO ] Flatten gal took : 89 ms
[2023-03-19 01:17:13] [INFO ] Applying decomposition
[2023-03-19 01:17:13] [INFO ] Flatten gal took : 54 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1642741410570862639.txt' '-o' '/tmp/graph1642741410570862639.bin' '-w' '/tmp/graph1642741410570862639.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1642741410570862639.bin' '-l' '-1' '-v' '-w' '/tmp/graph1642741410570862639.weights' '-q' '0' '-e' '0.001'
[2023-03-19 01:17:13] [INFO ] Decomposing Gal with order
[2023-03-19 01:17:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 01:17:13] [INFO ] Removed a total of 401 redundant transitions.
[2023-03-19 01:17:13] [INFO ] Flatten gal took : 157 ms
[2023-03-19 01:17:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 14 ms.
[2023-03-19 01:17:13] [INFO ] Time to serialize gal into /tmp/LTL9133952503733897861.gal : 26 ms
[2023-03-19 01:17:13] [INFO ] Time to serialize properties into /tmp/LTL10260028180014521573.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9133952503733897861.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10260028180014521573.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("((i17.i1.u370.p1170==0)||(i17.i5.u380.p1202==0))")||(("(i17.i6.u381.p1214==0)")||(G("(i5.i5.u119.p371==0)"))))))))
Formula 0 simplified : XXF(!"((i17.i1.u370.p1170==0)||(i17.i5.u380.p1202==0))" & !"(i17.i6.u381.p1214==0)" & F!"(i5.i5.u119.p371==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5851826281752563283
[2023-03-19 01:17:29] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5851826281752563283
Running compilation step : cd /tmp/ltsmin5851826281752563283;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5851826281752563283;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5851826281752563283;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldIIPt-PT-040B-LTLFireability-00 finished in 169400 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X((p1&&G(p2))))))'
Support contains 3 out of 2372 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2372/2372 places, 2172/2172 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 2363 transition count 2163
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 2363 transition count 2163
Applied a total of 18 rules in 258 ms. Remains 2363 /2372 variables (removed 9) and now considering 2163/2172 (removed 9) transitions.
// Phase 1: matrix 2163 rows 2363 cols
[2023-03-19 01:17:32] [INFO ] Computed 361 place invariants in 15 ms
[2023-03-19 01:17:33] [INFO ] Implicit Places using invariants in 793 ms returned []
[2023-03-19 01:17:33] [INFO ] Invariant cache hit.
[2023-03-19 01:17:35] [INFO ] Implicit Places using invariants and state equation in 2144 ms returned []
Implicit Place search using SMT with State Equation took 2940 ms to find 0 implicit places.
[2023-03-19 01:17:35] [INFO ] Invariant cache hit.
[2023-03-19 01:17:36] [INFO ] Dead Transitions using invariants and state equation in 1348 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2363/2372 places, 2163/2172 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4547 ms. Remains : 2363/2372 places, 2163/2172 transitions.
Stuttering acceptance computed with spot in 252 ms :[true, (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p2), acceptance={} source=4 dest: 3}]], initial=1, aps=[p0:(EQ s503 0), p2:(EQ s216 0), p1:(EQ s1478 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-040B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLFireability-01 finished in 4830 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 2372 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2372/2372 places, 2172/2172 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 479 transitions
Trivial Post-agglo rules discarded 479 transitions
Performed 479 trivial Post agglomeration. Transition count delta: 479
Iterating post reduction 0 with 479 rules applied. Total rules applied 479 place count 2371 transition count 1692
Reduce places removed 479 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 480 rules applied. Total rules applied 959 place count 1892 transition count 1691
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 960 place count 1891 transition count 1691
Performed 313 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 313 Pre rules applied. Total rules applied 960 place count 1891 transition count 1378
Deduced a syphon composed of 313 places in 3 ms
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 3 with 626 rules applied. Total rules applied 1586 place count 1578 transition count 1378
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1592 place count 1572 transition count 1372
Iterating global reduction 3 with 6 rules applied. Total rules applied 1598 place count 1572 transition count 1372
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 1598 place count 1572 transition count 1366
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 1610 place count 1566 transition count 1366
Performed 681 Post agglomeration using F-continuation condition.Transition count delta: 681
Deduced a syphon composed of 681 places in 1 ms
Reduce places removed 681 places and 0 transitions.
Iterating global reduction 3 with 1362 rules applied. Total rules applied 2972 place count 885 transition count 685
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2973 place count 885 transition count 684
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2975 place count 884 transition count 683
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3177 place count 783 transition count 748
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 3213 place count 765 transition count 761
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3215 place count 763 transition count 759
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 3217 place count 761 transition count 759
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 3217 place count 761 transition count 758
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 3219 place count 760 transition count 758
Applied a total of 3219 rules in 394 ms. Remains 760 /2372 variables (removed 1612) and now considering 758/2172 (removed 1414) transitions.
// Phase 1: matrix 758 rows 760 cols
[2023-03-19 01:17:37] [INFO ] Computed 359 place invariants in 4 ms
[2023-03-19 01:17:37] [INFO ] Implicit Places using invariants in 422 ms returned [749]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 423 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 759/2372 places, 758/2172 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 758 transition count 757
Applied a total of 2 rules in 19 ms. Remains 758 /759 variables (removed 1) and now considering 757/758 (removed 1) transitions.
// Phase 1: matrix 757 rows 758 cols
[2023-03-19 01:17:37] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-19 01:17:38] [INFO ] Implicit Places using invariants in 359 ms returned []
[2023-03-19 01:17:38] [INFO ] Invariant cache hit.
[2023-03-19 01:17:38] [INFO ] Implicit Places using invariants and state equation in 782 ms returned []
Implicit Place search using SMT with State Equation took 1142 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 758/2372 places, 757/2172 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1978 ms. Remains : 758/2372 places, 757/2172 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s150 1) (EQ s403 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 1 ms.
FORMULA ShieldIIPt-PT-040B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLFireability-02 finished in 2042 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(p1)))))'
Support contains 2 out of 2372 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2372/2372 places, 2172/2172 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 2362 transition count 2162
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 2362 transition count 2162
Applied a total of 20 rules in 272 ms. Remains 2362 /2372 variables (removed 10) and now considering 2162/2172 (removed 10) transitions.
// Phase 1: matrix 2162 rows 2362 cols
[2023-03-19 01:17:39] [INFO ] Computed 361 place invariants in 14 ms
[2023-03-19 01:17:40] [INFO ] Implicit Places using invariants in 957 ms returned []
[2023-03-19 01:17:40] [INFO ] Invariant cache hit.
[2023-03-19 01:17:42] [INFO ] Implicit Places using invariants and state equation in 2308 ms returned []
Implicit Place search using SMT with State Equation took 3267 ms to find 0 implicit places.
[2023-03-19 01:17:42] [INFO ] Invariant cache hit.
[2023-03-19 01:17:43] [INFO ] Dead Transitions using invariants and state equation in 1311 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2362/2372 places, 2162/2172 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4853 ms. Remains : 2362/2372 places, 2162/2172 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s2233 1), p1:(NEQ s726 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-040B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLFireability-03 finished in 5028 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 1 out of 2372 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2372/2372 places, 2172/2172 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 479 transitions
Trivial Post-agglo rules discarded 479 transitions
Performed 479 trivial Post agglomeration. Transition count delta: 479
Iterating post reduction 0 with 479 rules applied. Total rules applied 479 place count 2371 transition count 1692
Reduce places removed 479 places and 0 transitions.
Iterating post reduction 1 with 479 rules applied. Total rules applied 958 place count 1892 transition count 1692
Performed 313 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 313 Pre rules applied. Total rules applied 958 place count 1892 transition count 1379
Deduced a syphon composed of 313 places in 2 ms
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 2 with 626 rules applied. Total rules applied 1584 place count 1579 transition count 1379
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1591 place count 1572 transition count 1372
Iterating global reduction 2 with 7 rules applied. Total rules applied 1598 place count 1572 transition count 1372
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 1598 place count 1572 transition count 1365
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 1612 place count 1565 transition count 1365
Performed 682 Post agglomeration using F-continuation condition.Transition count delta: 682
Deduced a syphon composed of 682 places in 1 ms
Reduce places removed 682 places and 0 transitions.
Iterating global reduction 2 with 1364 rules applied. Total rules applied 2976 place count 883 transition count 683
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2977 place count 883 transition count 682
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 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2979 place count 882 transition count 681
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 3181 place count 781 transition count 748
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 3215 place count 764 transition count 759
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3217 place count 762 transition count 757
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 3219 place count 760 transition count 757
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3219 place count 760 transition count 756
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 3221 place count 759 transition count 756
Applied a total of 3221 rules in 373 ms. Remains 759 /2372 variables (removed 1613) and now considering 756/2172 (removed 1416) transitions.
// Phase 1: matrix 756 rows 759 cols
[2023-03-19 01:17:44] [INFO ] Computed 359 place invariants in 3 ms
[2023-03-19 01:17:44] [INFO ] Implicit Places using invariants in 501 ms returned [748]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 503 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 758/2372 places, 756/2172 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 757 transition count 755
Applied a total of 2 rules in 42 ms. Remains 757 /758 variables (removed 1) and now considering 755/756 (removed 1) transitions.
// Phase 1: matrix 755 rows 757 cols
[2023-03-19 01:17:44] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-19 01:17:45] [INFO ] Implicit Places using invariants in 491 ms returned []
[2023-03-19 01:17:45] [INFO ] Invariant cache hit.
[2023-03-19 01:17:46] [INFO ] Implicit Places using invariants and state equation in 1071 ms returned []
Implicit Place search using SMT with State Equation took 1566 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 757/2372 places, 755/2172 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2485 ms. Remains : 757/2372 places, 755/2172 transitions.
Stuttering acceptance computed with spot in 38 ms :[true, (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(NEQ s92 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 728 ms.
Product exploration explored 100000 steps with 0 reset in 788 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 1537 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 261817 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :{}
Probabilistic random walk after 261817 steps, saw 164908 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 01:17:52] [INFO ] Invariant cache hit.
[2023-03-19 01:17:52] [INFO ] [Real]Absence check using 358 positive place invariants in 62 ms returned sat
[2023-03-19 01:17:53] [INFO ] After 556ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 01:17:53] [INFO ] After 652ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-19 01:17:53] [INFO ] After 920ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 757 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 755/755 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 757 transition count 754
Applied a total of 1 rules in 24 ms. Remains 757 /757 variables (removed 0) and now considering 754/755 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 757/757 places, 754/755 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 257205 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :{}
Probabilistic random walk after 257205 steps, saw 163468 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 754 rows 757 cols
[2023-03-19 01:17:56] [INFO ] Computed 358 place invariants in 4 ms
[2023-03-19 01:17:57] [INFO ] [Real]Absence check using 358 positive place invariants in 56 ms returned sat
[2023-03-19 01:17:57] [INFO ] After 523ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 01:17:57] [INFO ] [Nat]Absence check using 358 positive place invariants in 59 ms returned sat
[2023-03-19 01:17:57] [INFO ] After 306ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 01:17:57] [INFO ] After 363ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-19 01:17:58] [INFO ] After 605ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 757 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 754/754 transitions.
Applied a total of 0 rules in 36 ms. Remains 757 /757 variables (removed 0) and now considering 754/754 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 757/757 places, 754/754 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 754/754 transitions.
Applied a total of 0 rules in 15 ms. Remains 757 /757 variables (removed 0) and now considering 754/754 (removed 0) transitions.
[2023-03-19 01:17:58] [INFO ] Invariant cache hit.
[2023-03-19 01:17:58] [INFO ] Implicit Places using invariants in 415 ms returned []
[2023-03-19 01:17:58] [INFO ] Invariant cache hit.
[2023-03-19 01:17:59] [INFO ] Implicit Places using invariants and state equation in 1023 ms returned []
Implicit Place search using SMT with State Equation took 1439 ms to find 0 implicit places.
[2023-03-19 01:17:59] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-19 01:17:59] [INFO ] Invariant cache hit.
[2023-03-19 01:17:59] [INFO ] Dead Transitions using invariants and state equation in 447 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1920 ms. Remains : 757/757 places, 754/754 transitions.
Partial Free-agglomeration rule applied 79 times.
Drop transitions removed 79 transitions
Iterating global reduction 0 with 79 rules applied. Total rules applied 79 place count 757 transition count 754
Applied a total of 79 rules in 24 ms. Remains 757 /757 variables (removed 0) and now considering 754/754 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 754 rows 757 cols
[2023-03-19 01:18:00] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-19 01:18:00] [INFO ] [Real]Absence check using 358 positive place invariants in 59 ms returned sat
[2023-03-19 01:18:00] [INFO ] After 332ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 01:18:00] [INFO ] After 397ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-19 01:18:00] [INFO ] After 641ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 216 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0)]
Support contains 1 out of 757 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 757/757 places, 755/755 transitions.
Applied a total of 0 rules in 27 ms. Remains 757 /757 variables (removed 0) and now considering 755/755 (removed 0) transitions.
// Phase 1: matrix 755 rows 757 cols
[2023-03-19 01:18:01] [INFO ] Computed 358 place invariants in 3 ms
[2023-03-19 01:18:01] [INFO ] Implicit Places using invariants in 457 ms returned []
[2023-03-19 01:18:01] [INFO ] Invariant cache hit.
[2023-03-19 01:18:02] [INFO ] Implicit Places using invariants and state equation in 924 ms returned []
Implicit Place search using SMT with State Equation took 1383 ms to find 0 implicit places.
[2023-03-19 01:18:02] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-19 01:18:02] [INFO ] Invariant cache hit.
[2023-03-19 01:18:02] [INFO ] Dead Transitions using invariants and state equation in 378 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1807 ms. Remains : 757/757 places, 755/755 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 152 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 272065 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :{}
Probabilistic random walk after 272065 steps, saw 171702 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 01:18:06] [INFO ] Invariant cache hit.
[2023-03-19 01:18:06] [INFO ] [Real]Absence check using 358 positive place invariants in 84 ms returned sat
[2023-03-19 01:18:06] [INFO ] After 356ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 01:18:06] [INFO ] After 426ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-19 01:18:07] [INFO ] After 733ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 757 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 755/755 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 757 transition count 754
Applied a total of 1 rules in 25 ms. Remains 757 /757 variables (removed 0) and now considering 754/755 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 757/757 places, 754/755 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 260187 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :{}
Probabilistic random walk after 260187 steps, saw 165417 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 754 rows 757 cols
[2023-03-19 01:18:10] [INFO ] Computed 358 place invariants in 1 ms
[2023-03-19 01:18:10] [INFO ] [Real]Absence check using 358 positive place invariants in 59 ms returned sat
[2023-03-19 01:18:10] [INFO ] After 542ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 01:18:10] [INFO ] [Nat]Absence check using 358 positive place invariants in 52 ms returned sat
[2023-03-19 01:18:11] [INFO ] After 272ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 01:18:11] [INFO ] After 364ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-03-19 01:18:11] [INFO ] After 603ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 757 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 754/754 transitions.
Applied a total of 0 rules in 23 ms. Remains 757 /757 variables (removed 0) and now considering 754/754 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 757/757 places, 754/754 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 754/754 transitions.
Applied a total of 0 rules in 18 ms. Remains 757 /757 variables (removed 0) and now considering 754/754 (removed 0) transitions.
[2023-03-19 01:18:11] [INFO ] Invariant cache hit.
[2023-03-19 01:18:11] [INFO ] Implicit Places using invariants in 568 ms returned []
[2023-03-19 01:18:11] [INFO ] Invariant cache hit.
[2023-03-19 01:18:12] [INFO ] Implicit Places using invariants and state equation in 952 ms returned []
Implicit Place search using SMT with State Equation took 1523 ms to find 0 implicit places.
[2023-03-19 01:18:12] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-19 01:18:12] [INFO ] Invariant cache hit.
[2023-03-19 01:18:13] [INFO ] Dead Transitions using invariants and state equation in 404 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1961 ms. Remains : 757/757 places, 754/754 transitions.
Partial Free-agglomeration rule applied 79 times.
Drop transitions removed 79 transitions
Iterating global reduction 0 with 79 rules applied. Total rules applied 79 place count 757 transition count 754
Applied a total of 79 rules in 20 ms. Remains 757 /757 variables (removed 0) and now considering 754/754 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 754 rows 757 cols
[2023-03-19 01:18:13] [INFO ] Computed 358 place invariants in 1 ms
[2023-03-19 01:18:13] [INFO ] [Real]Absence check using 358 positive place invariants in 44 ms returned sat
[2023-03-19 01:18:13] [INFO ] After 339ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 01:18:13] [INFO ] After 438ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-19 01:18:13] [INFO ] After 626ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 221 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 723 ms.
Product exploration explored 100000 steps with 0 reset in 901 ms.
Built C files in :
/tmp/ltsmin10672287670490025336
[2023-03-19 01:18:16] [INFO ] Computing symmetric may disable matrix : 755 transitions.
[2023-03-19 01:18:16] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 01:18:16] [INFO ] Computing symmetric may enable matrix : 755 transitions.
[2023-03-19 01:18:16] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 01:18:16] [INFO ] Computing Do-Not-Accords matrix : 755 transitions.
[2023-03-19 01:18:16] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 01:18:16] [INFO ] Built C files in 166ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10672287670490025336
Running compilation step : cd /tmp/ltsmin10672287670490025336;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1985 ms.
Running link step : cd /tmp/ltsmin10672287670490025336;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 112 ms.
Running LTSmin : cd /tmp/ltsmin10672287670490025336;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4428934934947557596.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 757 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 757/757 places, 755/755 transitions.
Applied a total of 0 rules in 11 ms. Remains 757 /757 variables (removed 0) and now considering 755/755 (removed 0) transitions.
// Phase 1: matrix 755 rows 757 cols
[2023-03-19 01:18:31] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-19 01:18:31] [INFO ] Implicit Places using invariants in 445 ms returned []
[2023-03-19 01:18:31] [INFO ] Invariant cache hit.
[2023-03-19 01:18:32] [INFO ] Implicit Places using invariants and state equation in 1043 ms returned []
Implicit Place search using SMT with State Equation took 1490 ms to find 0 implicit places.
[2023-03-19 01:18:32] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-19 01:18:32] [INFO ] Invariant cache hit.
[2023-03-19 01:18:33] [INFO ] Dead Transitions using invariants and state equation in 456 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1973 ms. Remains : 757/757 places, 755/755 transitions.
Built C files in :
/tmp/ltsmin13080770749632807494
[2023-03-19 01:18:33] [INFO ] Computing symmetric may disable matrix : 755 transitions.
[2023-03-19 01:18:33] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 01:18:33] [INFO ] Computing symmetric may enable matrix : 755 transitions.
[2023-03-19 01:18:33] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 01:18:33] [INFO ] Computing Do-Not-Accords matrix : 755 transitions.
[2023-03-19 01:18:33] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 01:18:34] [INFO ] Built C files in 178ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13080770749632807494
Running compilation step : cd /tmp/ltsmin13080770749632807494;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1957 ms.
Running link step : cd /tmp/ltsmin13080770749632807494;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin13080770749632807494;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7571103826292416024.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-19 01:18:48] [INFO ] Flatten gal took : 26 ms
[2023-03-19 01:18:49] [INFO ] Flatten gal took : 25 ms
[2023-03-19 01:18:49] [INFO ] Time to serialize gal into /tmp/LTL16134809657332719355.gal : 15 ms
[2023-03-19 01:18:49] [INFO ] Time to serialize properties into /tmp/LTL4335833277838904617.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16134809657332719355.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16101405185315383212.hoa' '-atoms' '/tmp/LTL4335833277838904617.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL4335833277838904617.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16101405185315383212.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.60065e+49 deadlock states
Detected timeout of ITS tools.
[2023-03-19 01:19:04] [INFO ] Flatten gal took : 22 ms
[2023-03-19 01:19:04] [INFO ] Flatten gal took : 21 ms
[2023-03-19 01:19:04] [INFO ] Time to serialize gal into /tmp/LTL11582886879857232468.gal : 4 ms
[2023-03-19 01:19:04] [INFO ] Time to serialize properties into /tmp/LTL16879404123438337156.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11582886879857232468.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16879404123438337156.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G("(p350!=1)")))
Formula 0 simplified : F!"(p350!=1)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.60065e+49 deadlock states
Detected timeout of ITS tools.
[2023-03-19 01:19:19] [INFO ] Flatten gal took : 31 ms
[2023-03-19 01:19:19] [INFO ] Applying decomposition
[2023-03-19 01:19:19] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph17462702109105221199.txt' '-o' '/tmp/graph17462702109105221199.bin' '-w' '/tmp/graph17462702109105221199.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17462702109105221199.bin' '-l' '-1' '-v' '-w' '/tmp/graph17462702109105221199.weights' '-q' '0' '-e' '0.001'
[2023-03-19 01:19:19] [INFO ] Decomposing Gal with order
[2023-03-19 01:19:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 01:19:19] [INFO ] Removed a total of 850 redundant transitions.
[2023-03-19 01:19:19] [INFO ] Flatten gal took : 53 ms
[2023-03-19 01:19:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 356 labels/synchronizations in 13 ms.
[2023-03-19 01:19:19] [INFO ] Time to serialize gal into /tmp/LTL6545506413010729752.gal : 6 ms
[2023-03-19 01:19:19] [INFO ] Time to serialize properties into /tmp/LTL3798079421280133111.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6545506413010729752.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3798079421280133111.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G("(i2.u38.p350!=1)")))
Formula 0 simplified : F!"(i2.u38.p350!=1)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.60065e+49 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
932 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,9.39321,477972,1,0,1.06632e+06,382,2579,2.82104e+06,217,2254,416537
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-040B-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ShieldIIPt-PT-040B-LTLFireability-04 finished in 108027 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((G((X(p0) U p1))||(p0 U p2)))||F(G(p0)))))'
Support contains 4 out of 2372 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2372/2372 places, 2172/2172 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 2361 transition count 2161
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 2361 transition count 2161
Applied a total of 22 rules in 219 ms. Remains 2361 /2372 variables (removed 11) and now considering 2161/2172 (removed 11) transitions.
// Phase 1: matrix 2161 rows 2361 cols
[2023-03-19 01:19:32] [INFO ] Computed 361 place invariants in 14 ms
[2023-03-19 01:19:33] [INFO ] Implicit Places using invariants in 1017 ms returned []
[2023-03-19 01:19:33] [INFO ] Invariant cache hit.
[2023-03-19 01:19:35] [INFO ] Implicit Places using invariants and state equation in 2418 ms returned []
Implicit Place search using SMT with State Equation took 3437 ms to find 0 implicit places.
[2023-03-19 01:19:35] [INFO ] Invariant cache hit.
[2023-03-19 01:19:37] [INFO ] Dead Transitions using invariants and state equation in 1372 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2361/2372 places, 2161/2172 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5029 ms. Remains : 2361/2372 places, 2161/2172 transitions.
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={1} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s2158 1) (EQ s2207 1)), p0:(EQ s1844 1), p1:(EQ s784 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 39 reset in 669 ms.
Stack based approach found an accepted trace after 6954 steps with 2 reset with depth 1037 and stack size 1037 in 55 ms.
FORMULA ShieldIIPt-PT-040B-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-040B-LTLFireability-05 finished in 5928 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 2372 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2372/2372 places, 2172/2172 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 479 transitions
Trivial Post-agglo rules discarded 479 transitions
Performed 479 trivial Post agglomeration. Transition count delta: 479
Iterating post reduction 0 with 479 rules applied. Total rules applied 479 place count 2371 transition count 1692
Reduce places removed 479 places and 0 transitions.
Iterating post reduction 1 with 479 rules applied. Total rules applied 958 place count 1892 transition count 1692
Performed 314 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 314 Pre rules applied. Total rules applied 958 place count 1892 transition count 1378
Deduced a syphon composed of 314 places in 4 ms
Reduce places removed 314 places and 0 transitions.
Iterating global reduction 2 with 628 rules applied. Total rules applied 1586 place count 1578 transition count 1378
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1593 place count 1571 transition count 1371
Iterating global reduction 2 with 7 rules applied. Total rules applied 1600 place count 1571 transition count 1371
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 1600 place count 1571 transition count 1364
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 1614 place count 1564 transition count 1364
Performed 680 Post agglomeration using F-continuation condition.Transition count delta: 680
Deduced a syphon composed of 680 places in 0 ms
Reduce places removed 680 places and 0 transitions.
Iterating global reduction 2 with 1360 rules applied. Total rules applied 2974 place count 884 transition count 684
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2975 place count 884 transition count 683
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 2977 place count 883 transition count 682
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 3179 place count 782 transition count 748
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3215 place count 764 transition count 761
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3217 place count 762 transition count 759
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 3219 place count 760 transition count 759
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3219 place count 760 transition count 758
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 3221 place count 759 transition count 758
Applied a total of 3221 rules in 386 ms. Remains 759 /2372 variables (removed 1613) and now considering 758/2172 (removed 1414) transitions.
// Phase 1: matrix 758 rows 759 cols
[2023-03-19 01:19:38] [INFO ] Computed 359 place invariants in 3 ms
[2023-03-19 01:19:38] [INFO ] Implicit Places using invariants in 487 ms returned [748]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 488 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 758/2372 places, 758/2172 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 757 transition count 757
Applied a total of 2 rules in 19 ms. Remains 757 /758 variables (removed 1) and now considering 757/758 (removed 1) transitions.
// Phase 1: matrix 757 rows 757 cols
[2023-03-19 01:19:38] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-19 01:19:39] [INFO ] Implicit Places using invariants in 416 ms returned []
[2023-03-19 01:19:39] [INFO ] Invariant cache hit.
[2023-03-19 01:19:39] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 01:19:40] [INFO ] Implicit Places using invariants and state equation in 891 ms returned []
Implicit Place search using SMT with State Equation took 1309 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 757/2372 places, 757/2172 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2202 ms. Remains : 757/2372 places, 757/2172 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s383 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-040B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLFireability-06 finished in 2265 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(F((p0&&X(F(p1))))))))'
Support contains 1 out of 2372 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 2372/2372 places, 2172/2172 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 477 transitions
Trivial Post-agglo rules discarded 477 transitions
Performed 477 trivial Post agglomeration. Transition count delta: 477
Iterating post reduction 0 with 477 rules applied. Total rules applied 477 place count 2371 transition count 1694
Reduce places removed 477 places and 0 transitions.
Iterating post reduction 1 with 477 rules applied. Total rules applied 954 place count 1894 transition count 1694
Performed 315 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 315 Pre rules applied. Total rules applied 954 place count 1894 transition count 1379
Deduced a syphon composed of 315 places in 3 ms
Reduce places removed 315 places and 0 transitions.
Iterating global reduction 2 with 630 rules applied. Total rules applied 1584 place count 1579 transition count 1379
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1590 place count 1573 transition count 1373
Iterating global reduction 2 with 6 rules applied. Total rules applied 1596 place count 1573 transition count 1373
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 1596 place count 1573 transition count 1367
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 1608 place count 1567 transition count 1367
Performed 681 Post agglomeration using F-continuation condition.Transition count delta: 681
Deduced a syphon composed of 681 places in 1 ms
Reduce places removed 681 places and 0 transitions.
Iterating global reduction 2 with 1362 rules applied. Total rules applied 2970 place count 886 transition count 686
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2971 place count 886 transition count 685
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 2973 place count 885 transition count 684
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 3175 place count 784 transition count 750
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3211 place count 766 transition count 763
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3213 place count 764 transition count 761
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 3215 place count 762 transition count 761
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3215 place count 762 transition count 760
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 3217 place count 761 transition count 760
Applied a total of 3217 rules in 387 ms. Remains 761 /2372 variables (removed 1611) and now considering 760/2172 (removed 1412) transitions.
// Phase 1: matrix 760 rows 761 cols
[2023-03-19 01:19:40] [INFO ] Computed 359 place invariants in 2 ms
[2023-03-19 01:19:41] [INFO ] Implicit Places using invariants in 555 ms returned [750]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 556 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 760/2372 places, 760/2172 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 759 transition count 759
Applied a total of 2 rules in 22 ms. Remains 759 /760 variables (removed 1) and now considering 759/760 (removed 1) transitions.
// Phase 1: matrix 759 rows 759 cols
[2023-03-19 01:19:41] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-19 01:19:41] [INFO ] Implicit Places using invariants in 485 ms returned []
[2023-03-19 01:19:41] [INFO ] Invariant cache hit.
[2023-03-19 01:19:42] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-19 01:19:42] [INFO ] Implicit Places using invariants and state equation in 1097 ms returned []
Implicit Place search using SMT with State Equation took 1585 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 759/2372 places, 759/2172 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2552 ms. Remains : 759/2372 places, 759/2172 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s398 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-040B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLFireability-07 finished in 2647 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)&&(p1||G(p2)))))'
Support contains 5 out of 2372 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2372/2372 places, 2172/2172 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 479 transitions
Trivial Post-agglo rules discarded 479 transitions
Performed 479 trivial Post agglomeration. Transition count delta: 479
Iterating post reduction 0 with 479 rules applied. Total rules applied 479 place count 2371 transition count 1692
Reduce places removed 479 places and 0 transitions.
Iterating post reduction 1 with 479 rules applied. Total rules applied 958 place count 1892 transition count 1692
Performed 312 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 312 Pre rules applied. Total rules applied 958 place count 1892 transition count 1380
Deduced a syphon composed of 312 places in 2 ms
Reduce places removed 312 places and 0 transitions.
Iterating global reduction 2 with 624 rules applied. Total rules applied 1582 place count 1580 transition count 1380
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1589 place count 1573 transition count 1373
Iterating global reduction 2 with 7 rules applied. Total rules applied 1596 place count 1573 transition count 1373
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 1596 place count 1573 transition count 1366
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 1610 place count 1566 transition count 1366
Performed 680 Post agglomeration using F-continuation condition.Transition count delta: 680
Deduced a syphon composed of 680 places in 1 ms
Reduce places removed 680 places and 0 transitions.
Iterating global reduction 2 with 1360 rules applied. Total rules applied 2970 place count 886 transition count 686
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2971 place count 886 transition count 685
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 2973 place count 885 transition count 684
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3175 place count 784 transition count 751
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 3209 place count 767 transition count 762
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3211 place count 765 transition count 760
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 3213 place count 763 transition count 760
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3213 place count 763 transition count 759
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3215 place count 762 transition count 759
Applied a total of 3215 rules in 360 ms. Remains 762 /2372 variables (removed 1610) and now considering 759/2172 (removed 1413) transitions.
// Phase 1: matrix 759 rows 762 cols
[2023-03-19 01:19:43] [INFO ] Computed 359 place invariants in 3 ms
[2023-03-19 01:19:43] [INFO ] Implicit Places using invariants in 499 ms returned [751]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 502 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 761/2372 places, 759/2172 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 760 transition count 758
Applied a total of 2 rules in 19 ms. Remains 760 /761 variables (removed 1) and now considering 758/759 (removed 1) transitions.
// Phase 1: matrix 758 rows 760 cols
[2023-03-19 01:19:43] [INFO ] Computed 358 place invariants in 1 ms
[2023-03-19 01:19:44] [INFO ] Implicit Places using invariants in 417 ms returned []
[2023-03-19 01:19:44] [INFO ] Invariant cache hit.
[2023-03-19 01:19:45] [INFO ] Implicit Places using invariants and state equation in 981 ms returned []
Implicit Place search using SMT with State Equation took 1399 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 760/2372 places, 758/2172 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2281 ms. Remains : 760/2372 places, 758/2172 transitions.
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={1} source=0 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={1} source=1 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 2}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s240 1) (EQ s247 1) (EQ s250 1)), p1:(EQ s646 1), p2:(EQ s563 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-040B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLFireability-08 finished in 2515 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&F((X(G(p1))&&(G(p0)||G(p2)))))))'
Support contains 3 out of 2372 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2372/2372 places, 2172/2172 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 2363 transition count 2163
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 2363 transition count 2163
Applied a total of 18 rules in 201 ms. Remains 2363 /2372 variables (removed 9) and now considering 2163/2172 (removed 9) transitions.
// Phase 1: matrix 2163 rows 2363 cols
[2023-03-19 01:19:45] [INFO ] Computed 361 place invariants in 13 ms
[2023-03-19 01:19:46] [INFO ] Implicit Places using invariants in 885 ms returned []
[2023-03-19 01:19:46] [INFO ] Invariant cache hit.
[2023-03-19 01:19:48] [INFO ] Implicit Places using invariants and state equation in 2165 ms returned []
Implicit Place search using SMT with State Equation took 3065 ms to find 0 implicit places.
[2023-03-19 01:19:48] [INFO ] Invariant cache hit.
[2023-03-19 01:19:49] [INFO ] Dead Transitions using invariants and state equation in 1308 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2363/2372 places, 2163/2172 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4601 ms. Remains : 2363/2372 places, 2163/2172 transitions.
Stuttering acceptance computed with spot in 542 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND p0 p2), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0, 1, 2} source=2 dest: 2}], [{ cond=p1, acceptance={0, 1} source=3 dest: 3}, { cond=(OR (AND p0 (NOT p1)) (AND p2 (NOT p1))), acceptance={0, 1, 2} source=3 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1, 2} source=3 dest: 4}, { cond=(AND p0 p2 (NOT p1)), acceptance={2} source=3 dest: 5}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=3 dest: 6}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0, 2} source=3 dest: 7}], [{ cond=(AND (NOT p0) p2), acceptance={0, 1, 2} source=4 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={1, 2} source=4 dest: 4}, { cond=(AND p0 p2), acceptance={2} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=4 dest: 6}, { cond=(AND (NOT p0) p2), acceptance={0, 2} source=4 dest: 7}, { cond=(AND p0 p2), acceptance={1, 2} source=4 dest: 8}], [{ cond=(AND p0 (NOT p2)), acceptance={1, 2} source=5 dest: 4}, { cond=(AND p0 p2), acceptance={2} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=5 dest: 6}, { cond=(AND (NOT p0) p2), acceptance={0, 2} source=5 dest: 7}], [{ cond=(OR p0 p2), acceptance={0, 1, 2} source=6 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={1, 2} source=6 dest: 4}, { cond=(AND p0 p2), acceptance={2} source=6 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=6 dest: 6}, { cond=(AND (NOT p0) p2), acceptance={0, 2} source=6 dest: 7}], [{ cond=(AND p0 (NOT p2)), acceptance={0, 1, 2} source=7 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={1, 2} source=7 dest: 4}, { cond=(AND p0 p2), acceptance={2} source=7 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=7 dest: 6}, { cond=(AND (NOT p0) p2), acceptance={0, 2} source=7 dest: 7}, { cond=(AND p0 p2), acceptance={0, 2} source=7 dest: 9}], [{ cond=(AND (NOT p0) p1), acceptance={0, 1} source=8 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0, 1, 2} source=8 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1, 2} source=8 dest: 4}, { cond=(AND p0 p2 (NOT p1)), acceptance={2} source=8 dest: 5}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=8 dest: 6}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0, 2} source=8 dest: 7}, { cond=(AND p0 p1), acceptance={1} source=8 dest: 8}, { cond=(AND p0 p2 (NOT p1)), acceptance={1, 2} source=8 dest: 8}], [{ cond=(AND (NOT p2) p1), acceptance={0, 1} source=9 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=9 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1, 2} source=9 dest: 4}, { cond=(AND p0 p2 (NOT p1)), acceptance={2} source=9 dest: 5}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=9 dest: 6}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0, 2} source=9 dest: 7}, { cond=(AND p2 p1), acceptance={0} source=9 dest: 9}, { cond=(AND p0 p2 (NOT p1)), acceptance={0, 2} source=9 dest: 9}]], initial=0, aps=[p0:(EQ s1296 1), p2:(EQ s1247 1), p1:(EQ s665 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, 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-040B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLFireability-09 finished in 5174 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||X((X(p1) U (p0&&X(p1)))))))))'
Support contains 2 out of 2372 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2372/2372 places, 2172/2172 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 2362 transition count 2162
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 2362 transition count 2162
Applied a total of 20 rules in 226 ms. Remains 2362 /2372 variables (removed 10) and now considering 2162/2172 (removed 10) transitions.
// Phase 1: matrix 2162 rows 2362 cols
[2023-03-19 01:19:50] [INFO ] Computed 361 place invariants in 13 ms
[2023-03-19 01:19:51] [INFO ] Implicit Places using invariants in 759 ms returned []
[2023-03-19 01:19:51] [INFO ] Invariant cache hit.
[2023-03-19 01:19:53] [INFO ] Implicit Places using invariants and state equation in 2378 ms returned []
Implicit Place search using SMT with State Equation took 3168 ms to find 0 implicit places.
[2023-03-19 01:19:53] [INFO ] Invariant cache hit.
[2023-03-19 01:19:55] [INFO ] Dead Transitions using invariants and state equation in 1247 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2362/2372 places, 2162/2172 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4643 ms. Remains : 2362/2372 places, 2162/2172 transitions.
Stuttering acceptance computed with spot in 236 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), true]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=true, acceptance={0} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s1179 1), p1:(OR (EQ s1179 1) (NEQ s1532 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 14326 reset in 460 ms.
Product exploration explored 100000 steps with 14272 reset in 459 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 164 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 300 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 130448 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 130448 steps, saw 84030 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-19 01:20:00] [INFO ] Invariant cache hit.
[2023-03-19 01:20:00] [INFO ] [Real]Absence check using 361 positive place invariants in 121 ms returned sat
[2023-03-19 01:20:01] [INFO ] After 1687ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 01:20:02] [INFO ] [Nat]Absence check using 361 positive place invariants in 130 ms returned sat
[2023-03-19 01:20:03] [INFO ] After 1223ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 01:20:04] [INFO ] Deduced a trap composed of 19 places in 609 ms of which 1 ms to minimize.
[2023-03-19 01:20:05] [INFO ] Deduced a trap composed of 25 places in 525 ms of which 2 ms to minimize.
[2023-03-19 01:20:05] [INFO ] Deduced a trap composed of 16 places in 650 ms of which 2 ms to minimize.
[2023-03-19 01:20:06] [INFO ] Deduced a trap composed of 27 places in 538 ms of which 1 ms to minimize.
[2023-03-19 01:20:06] [INFO ] Deduced a trap composed of 27 places in 445 ms of which 1 ms to minimize.
[2023-03-19 01:20:07] [INFO ] Deduced a trap composed of 20 places in 532 ms of which 3 ms to minimize.
[2023-03-19 01:20:08] [INFO ] Deduced a trap composed of 20 places in 532 ms of which 2 ms to minimize.
[2023-03-19 01:20:08] [INFO ] Deduced a trap composed of 21 places in 521 ms of which 2 ms to minimize.
[2023-03-19 01:20:09] [INFO ] Deduced a trap composed of 28 places in 553 ms of which 3 ms to minimize.
[2023-03-19 01:20:10] [INFO ] Deduced a trap composed of 29 places in 497 ms of which 2 ms to minimize.
[2023-03-19 01:20:10] [INFO ] Deduced a trap composed of 31 places in 418 ms of which 1 ms to minimize.
[2023-03-19 01:20:11] [INFO ] Deduced a trap composed of 23 places in 396 ms of which 1 ms to minimize.
[2023-03-19 01:20:11] [INFO ] Deduced a trap composed of 35 places in 468 ms of which 1 ms to minimize.
[2023-03-19 01:20:12] [INFO ] Deduced a trap composed of 23 places in 477 ms of which 1 ms to minimize.
[2023-03-19 01:20:12] [INFO ] Deduced a trap composed of 30 places in 425 ms of which 1 ms to minimize.
[2023-03-19 01:20:13] [INFO ] Deduced a trap composed of 22 places in 391 ms of which 1 ms to minimize.
[2023-03-19 01:20:13] [INFO ] Deduced a trap composed of 24 places in 564 ms of which 1 ms to minimize.
[2023-03-19 01:20:14] [INFO ] Deduced a trap composed of 31 places in 406 ms of which 2 ms to minimize.
[2023-03-19 01:20:14] [INFO ] Deduced a trap composed of 18 places in 374 ms of which 1 ms to minimize.
[2023-03-19 01:20:15] [INFO ] Deduced a trap composed of 32 places in 367 ms of which 1 ms to minimize.
[2023-03-19 01:20:15] [INFO ] Deduced a trap composed of 26 places in 432 ms of which 1 ms to minimize.
[2023-03-19 01:20:16] [INFO ] Deduced a trap composed of 29 places in 430 ms of which 1 ms to minimize.
[2023-03-19 01:20:16] [INFO ] Deduced a trap composed of 27 places in 397 ms of which 1 ms to minimize.
[2023-03-19 01:20:17] [INFO ] Deduced a trap composed of 35 places in 435 ms of which 1 ms to minimize.
[2023-03-19 01:20:17] [INFO ] Deduced a trap composed of 17 places in 499 ms of which 1 ms to minimize.
[2023-03-19 01:20:18] [INFO ] Deduced a trap composed of 28 places in 405 ms of which 1 ms to minimize.
[2023-03-19 01:20:18] [INFO ] Deduced a trap composed of 36 places in 395 ms of which 0 ms to minimize.
[2023-03-19 01:20:19] [INFO ] Deduced a trap composed of 34 places in 350 ms of which 1 ms to minimize.
[2023-03-19 01:20:19] [INFO ] Deduced a trap composed of 44 places in 354 ms of which 0 ms to minimize.
[2023-03-19 01:20:20] [INFO ] Deduced a trap composed of 37 places in 351 ms of which 1 ms to minimize.
[2023-03-19 01:20:20] [INFO ] Deduced a trap composed of 39 places in 379 ms of which 0 ms to minimize.
[2023-03-19 01:20:21] [INFO ] Deduced a trap composed of 37 places in 322 ms of which 1 ms to minimize.
[2023-03-19 01:20:21] [INFO ] Deduced a trap composed of 38 places in 291 ms of which 1 ms to minimize.
[2023-03-19 01:20:21] [INFO ] Deduced a trap composed of 39 places in 332 ms of which 1 ms to minimize.
[2023-03-19 01:20:22] [INFO ] Deduced a trap composed of 39 places in 349 ms of which 1 ms to minimize.
[2023-03-19 01:20:22] [INFO ] Deduced a trap composed of 39 places in 305 ms of which 1 ms to minimize.
[2023-03-19 01:20:23] [INFO ] Deduced a trap composed of 40 places in 283 ms of which 1 ms to minimize.
[2023-03-19 01:20:23] [INFO ] Deduced a trap composed of 43 places in 292 ms of which 1 ms to minimize.
[2023-03-19 01:20:23] [INFO ] Deduced a trap composed of 40 places in 308 ms of which 1 ms to minimize.
[2023-03-19 01:20:24] [INFO ] Deduced a trap composed of 37 places in 415 ms of which 1 ms to minimize.
[2023-03-19 01:20:24] [INFO ] Deduced a trap composed of 36 places in 302 ms of which 1 ms to minimize.
[2023-03-19 01:20:25] [INFO ] Deduced a trap composed of 50 places in 312 ms of which 2 ms to minimize.
[2023-03-19 01:20:25] [INFO ] Deduced a trap composed of 53 places in 352 ms of which 1 ms to minimize.
[2023-03-19 01:20:26] [INFO ] Deduced a trap composed of 53 places in 317 ms of which 1 ms to minimize.
[2023-03-19 01:20:26] [INFO ] Deduced a trap composed of 49 places in 315 ms of which 1 ms to minimize.
[2023-03-19 01:20:26] [INFO ] Deduced a trap composed of 50 places in 278 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 01:20:26] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 01:20:26] [INFO ] After 25066ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 73 ms.
Support contains 2 out of 2362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2362/2362 places, 2162/2162 transitions.
Drop transitions removed 479 transitions
Trivial Post-agglo rules discarded 479 transitions
Performed 479 trivial Post agglomeration. Transition count delta: 479
Iterating post reduction 0 with 479 rules applied. Total rules applied 479 place count 2362 transition count 1683
Reduce places removed 479 places and 0 transitions.
Iterating post reduction 1 with 479 rules applied. Total rules applied 958 place count 1883 transition count 1683
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 319 Pre rules applied. Total rules applied 958 place count 1883 transition count 1364
Deduced a syphon composed of 319 places in 4 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 2 with 638 rules applied. Total rules applied 1596 place count 1564 transition count 1364
Performed 680 Post agglomeration using F-continuation condition.Transition count delta: 680
Deduced a syphon composed of 680 places in 1 ms
Reduce places removed 680 places and 0 transitions.
Iterating global reduction 2 with 1360 rules applied. Total rules applied 2956 place count 884 transition count 684
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2957 place count 884 transition count 683
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 2959 place count 883 transition count 682
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 3161 place count 782 transition count 748
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3197 place count 764 transition count 761
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3198 place count 764 transition count 760
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3199 place count 764 transition count 759
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3200 place count 763 transition count 759
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 5 with 40 rules applied. Total rules applied 3240 place count 763 transition count 759
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3241 place count 762 transition count 758
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 3243 place count 760 transition count 758
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 3243 place count 760 transition count 757
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 3245 place count 759 transition count 757
Applied a total of 3245 rules in 293 ms. Remains 759 /2362 variables (removed 1603) and now considering 757/2162 (removed 1405) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 293 ms. Remains : 759/2362 places, 757/2162 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) 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 2) seen :0
Interrupted probabilistic random walk after 200374 steps, run timeout after 3029 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 200374 steps, saw 128009 distinct states, run finished after 3029 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 757 rows 759 cols
[2023-03-19 01:20:30] [INFO ] Computed 359 place invariants in 1 ms
[2023-03-19 01:20:30] [INFO ] [Real]Absence check using 359 positive place invariants in 58 ms returned sat
[2023-03-19 01:20:31] [INFO ] After 300ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-19 01:20:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 01:20:31] [INFO ] After 33ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1 real:1
[2023-03-19 01:20:31] [INFO ] After 98ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-19 01:20:31] [INFO ] After 692ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2023-03-19 01:20:31] [INFO ] [Nat]Absence check using 359 positive place invariants in 64 ms returned sat
[2023-03-19 01:20:31] [INFO ] After 456ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 01:20:32] [INFO ] After 72ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 01:20:32] [INFO ] After 221ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 103 ms.
[2023-03-19 01:20:32] [INFO ] After 1037ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 36 ms.
Support contains 2 out of 759 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 757/757 transitions.
Applied a total of 0 rules in 21 ms. Remains 759 /759 variables (removed 0) and now considering 757/757 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 759/759 places, 757/757 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 757/757 transitions.
Applied a total of 0 rules in 19 ms. Remains 759 /759 variables (removed 0) and now considering 757/757 (removed 0) transitions.
[2023-03-19 01:20:32] [INFO ] Invariant cache hit.
[2023-03-19 01:20:32] [INFO ] Implicit Places using invariants in 523 ms returned [748]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 524 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 758/759 places, 757/757 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 757 transition count 756
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 757 transition count 756
Applied a total of 2 rules in 19 ms. Remains 757 /758 variables (removed 1) and now considering 756/757 (removed 1) transitions.
// Phase 1: matrix 756 rows 757 cols
[2023-03-19 01:20:32] [INFO ] Computed 358 place invariants in 3 ms
[2023-03-19 01:20:33] [INFO ] Implicit Places using invariants in 363 ms returned []
[2023-03-19 01:20:33] [INFO ] Invariant cache hit.
[2023-03-19 01:20:34] [INFO ] Implicit Places using invariants and state equation in 1047 ms returned []
Implicit Place search using SMT with State Equation took 1411 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 757/759 places, 756/757 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1973 ms. Remains : 757/759 places, 756/757 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) 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 2) seen :0
Interrupted probabilistic random walk after 162665 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :{}
Probabilistic random walk after 162665 steps, saw 103903 distinct states, run finished after 3001 ms. (steps per millisecond=54 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-19 01:20:37] [INFO ] Invariant cache hit.
[2023-03-19 01:20:37] [INFO ] [Real]Absence check using 358 positive place invariants in 56 ms returned sat
[2023-03-19 01:20:38] [INFO ] After 318ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-19 01:20:38] [INFO ] After 410ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-03-19 01:20:38] [INFO ] After 687ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2023-03-19 01:20:38] [INFO ] [Nat]Absence check using 358 positive place invariants in 71 ms returned sat
[2023-03-19 01:20:38] [INFO ] After 343ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 01:20:39] [INFO ] After 468ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 90 ms.
[2023-03-19 01:20:39] [INFO ] After 856ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 52 ms.
Support contains 2 out of 757 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 756/756 transitions.
Applied a total of 0 rules in 15 ms. Remains 757 /757 variables (removed 0) and now considering 756/756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 757/757 places, 756/756 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 756/756 transitions.
Applied a total of 0 rules in 13 ms. Remains 757 /757 variables (removed 0) and now considering 756/756 (removed 0) transitions.
[2023-03-19 01:20:39] [INFO ] Invariant cache hit.
[2023-03-19 01:20:39] [INFO ] Implicit Places using invariants in 632 ms returned []
[2023-03-19 01:20:39] [INFO ] Invariant cache hit.
[2023-03-19 01:20:40] [INFO ] Implicit Places using invariants and state equation in 957 ms returned []
Implicit Place search using SMT with State Equation took 1590 ms to find 0 implicit places.
[2023-03-19 01:20:40] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-19 01:20:40] [INFO ] Invariant cache hit.
[2023-03-19 01:20:41] [INFO ] Dead Transitions using invariants and state equation in 523 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2147 ms. Remains : 757/757 places, 756/756 transitions.
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 757 transition count 756
Applied a total of 80 rules in 24 ms. Remains 757 /757 variables (removed 0) and now considering 756/756 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 756 rows 757 cols
[2023-03-19 01:20:41] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-19 01:20:41] [INFO ] [Real]Absence check using 358 positive place invariants in 52 ms returned sat
[2023-03-19 01:20:41] [INFO ] After 379ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-19 01:20:41] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-19 01:20:42] [INFO ] After 48ms SMT Verify possible using 78 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 01:20:42] [INFO ] After 663ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 01:20:42] [INFO ] [Nat]Absence check using 358 positive place invariants in 52 ms returned sat
[2023-03-19 01:20:42] [INFO ] After 386ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 01:20:42] [INFO ] After 174ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 01:20:42] [INFO ] After 311ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 106 ms.
[2023-03-19 01:20:43] [INFO ] After 1046ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) p1), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 929 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), true]
Stuttering acceptance computed with spot in 257 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), true]
// Phase 1: matrix 2162 rows 2362 cols
[2023-03-19 01:20:44] [INFO ] Computed 361 place invariants in 13 ms
[2023-03-19 01:20:45] [INFO ] [Real]Absence check using 361 positive place invariants in 322 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) p1), true, (X (X (NOT p0)))]
False Knowledge obtained : [(G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-040B-LTLFireability-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-040B-LTLFireability-10 finished in 55423 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (p1||G(p0))))))'
Support contains 3 out of 2372 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2372/2372 places, 2172/2172 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 477 transitions
Trivial Post-agglo rules discarded 477 transitions
Performed 477 trivial Post agglomeration. Transition count delta: 477
Iterating post reduction 0 with 477 rules applied. Total rules applied 477 place count 2371 transition count 1694
Reduce places removed 477 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 478 rules applied. Total rules applied 955 place count 1894 transition count 1693
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 956 place count 1893 transition count 1693
Performed 314 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 314 Pre rules applied. Total rules applied 956 place count 1893 transition count 1379
Deduced a syphon composed of 314 places in 2 ms
Reduce places removed 314 places and 0 transitions.
Iterating global reduction 3 with 628 rules applied. Total rules applied 1584 place count 1579 transition count 1379
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1591 place count 1572 transition count 1372
Iterating global reduction 3 with 7 rules applied. Total rules applied 1598 place count 1572 transition count 1372
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 1598 place count 1572 transition count 1365
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 1612 place count 1565 transition count 1365
Performed 679 Post agglomeration using F-continuation condition.Transition count delta: 679
Deduced a syphon composed of 679 places in 1 ms
Reduce places removed 679 places and 0 transitions.
Iterating global reduction 3 with 1358 rules applied. Total rules applied 2970 place count 886 transition count 686
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2971 place count 886 transition count 685
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2973 place count 885 transition count 684
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3175 place count 784 transition count 750
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 3209 place count 767 transition count 761
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3211 place count 765 transition count 759
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 3213 place count 763 transition count 759
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 3213 place count 763 transition count 758
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3215 place count 762 transition count 758
Applied a total of 3215 rules in 339 ms. Remains 762 /2372 variables (removed 1610) and now considering 758/2172 (removed 1414) transitions.
// Phase 1: matrix 758 rows 762 cols
[2023-03-19 01:20:46] [INFO ] Computed 359 place invariants in 1 ms
[2023-03-19 01:20:46] [INFO ] Implicit Places using invariants in 600 ms returned [750]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 602 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 761/2372 places, 758/2172 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 760 transition count 757
Applied a total of 2 rules in 22 ms. Remains 760 /761 variables (removed 1) and now considering 757/758 (removed 1) transitions.
// Phase 1: matrix 757 rows 760 cols
[2023-03-19 01:20:46] [INFO ] Computed 358 place invariants in 4 ms
[2023-03-19 01:20:47] [INFO ] Implicit Places using invariants in 561 ms returned []
[2023-03-19 01:20:47] [INFO ] Invariant cache hit.
[2023-03-19 01:20:48] [INFO ] Implicit Places using invariants and state equation in 989 ms returned []
Implicit Place search using SMT with State Equation took 1552 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 760/2372 places, 757/2172 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2515 ms. Remains : 760/2372 places, 757/2172 transitions.
Stuttering acceptance computed with spot in 1348 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (AND (EQ s734 1) (EQ s756 1))) (NEQ s746 1)), p0:(NEQ s746 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 251 steps with 7 reset in 2 ms.
FORMULA ShieldIIPt-PT-040B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLFireability-11 finished in 3889 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)))'
Support contains 2 out of 2372 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2372/2372 places, 2172/2172 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 2361 transition count 2161
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 2361 transition count 2161
Applied a total of 22 rules in 266 ms. Remains 2361 /2372 variables (removed 11) and now considering 2161/2172 (removed 11) transitions.
// Phase 1: matrix 2161 rows 2361 cols
[2023-03-19 01:20:50] [INFO ] Computed 361 place invariants in 14 ms
[2023-03-19 01:20:50] [INFO ] Implicit Places using invariants in 866 ms returned []
[2023-03-19 01:20:50] [INFO ] Invariant cache hit.
[2023-03-19 01:20:53] [INFO ] Implicit Places using invariants and state equation in 2205 ms returned []
Implicit Place search using SMT with State Equation took 3074 ms to find 0 implicit places.
[2023-03-19 01:20:53] [INFO ] Invariant cache hit.
[2023-03-19 01:20:54] [INFO ] Dead Transitions using invariants and state equation in 1196 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2361/2372 places, 2161/2172 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4538 ms. Remains : 2361/2372 places, 2161/2172 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s287 1), p0:(EQ s35 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-040B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLFireability-12 finished in 4652 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((G(p0)&&F(!p1))||(p2 U (p2&&(p1||G(p2))))))))'
Support contains 3 out of 2372 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2372/2372 places, 2172/2172 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 2361 transition count 2161
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 2361 transition count 2161
Applied a total of 22 rules in 200 ms. Remains 2361 /2372 variables (removed 11) and now considering 2161/2172 (removed 11) transitions.
[2023-03-19 01:20:54] [INFO ] Invariant cache hit.
[2023-03-19 01:20:55] [INFO ] Implicit Places using invariants in 683 ms returned []
[2023-03-19 01:20:55] [INFO ] Invariant cache hit.
[2023-03-19 01:20:57] [INFO ] Implicit Places using invariants and state equation in 2043 ms returned []
Implicit Place search using SMT with State Equation took 2730 ms to find 0 implicit places.
[2023-03-19 01:20:57] [INFO ] Invariant cache hit.
[2023-03-19 01:20:58] [INFO ] Dead Transitions using invariants and state equation in 1236 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2361/2372 places, 2161/2172 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4167 ms. Remains : 2361/2372 places, 2161/2172 transitions.
Stuttering acceptance computed with spot in 232 ms :[(OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (AND (NOT p0) (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={1} source=1 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={1} source=2 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s1142 1), p1:(NEQ s1538 1), p2:(NEQ s2061 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1133 ms.
Product exploration explored 100000 steps with 50000 reset in 1111 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) p1 p2)
Knowledge based reduction with 12 factoid took 424 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-040B-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-040B-LTLFireability-13 finished in 7115 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X((F(p1)||G(p2)))))'
Support contains 3 out of 2372 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2372/2372 places, 2172/2172 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 2363 transition count 2163
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 2363 transition count 2163
Applied a total of 18 rules in 273 ms. Remains 2363 /2372 variables (removed 9) and now considering 2163/2172 (removed 9) transitions.
// Phase 1: matrix 2163 rows 2363 cols
[2023-03-19 01:21:01] [INFO ] Computed 361 place invariants in 5 ms
[2023-03-19 01:21:02] [INFO ] Implicit Places using invariants in 660 ms returned []
[2023-03-19 01:21:02] [INFO ] Invariant cache hit.
[2023-03-19 01:21:04] [INFO ] Implicit Places using invariants and state equation in 2028 ms returned []
Implicit Place search using SMT with State Equation took 2690 ms to find 0 implicit places.
[2023-03-19 01:21:04] [INFO ] Invariant cache hit.
[2023-03-19 01:21:05] [INFO ] Dead Transitions using invariants and state equation in 1204 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2363/2372 places, 2163/2172 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4168 ms. Remains : 2363/2372 places, 2163/2172 transitions.
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s1760 1), p1:(EQ s2073 1), p2:(EQ s1724 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 61 reset in 510 ms.
Stack based approach found an accepted trace after 1037 steps with 0 reset with depth 1038 and stack size 1038 in 7 ms.
FORMULA ShieldIIPt-PT-040B-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-040B-LTLFireability-14 finished in 4866 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((G(p1)&&p0))||F(p2))))'
Support contains 4 out of 2372 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2372/2372 places, 2172/2172 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 2362 transition count 2162
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 2362 transition count 2162
Applied a total of 20 rules in 198 ms. Remains 2362 /2372 variables (removed 10) and now considering 2162/2172 (removed 10) transitions.
// Phase 1: matrix 2162 rows 2362 cols
[2023-03-19 01:21:06] [INFO ] Computed 361 place invariants in 13 ms
[2023-03-19 01:21:07] [INFO ] Implicit Places using invariants in 768 ms returned []
[2023-03-19 01:21:07] [INFO ] Invariant cache hit.
[2023-03-19 01:21:09] [INFO ] Implicit Places using invariants and state equation in 2262 ms returned []
Implicit Place search using SMT with State Equation took 3032 ms to find 0 implicit places.
[2023-03-19 01:21:09] [INFO ] Invariant cache hit.
[2023-03-19 01:21:11] [INFO ] Dead Transitions using invariants and state equation in 1573 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2362/2372 places, 2162/2172 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4804 ms. Remains : 2362/2372 places, 2162/2172 transitions.
Stuttering acceptance computed with spot in 220 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(EQ s209 0), p0:(AND (EQ s31 1) (EQ s1139 1)), p1:(EQ s2303 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1142 ms.
Product exploration explored 100000 steps with 50000 reset in 1151 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Detected a total of 638/2362 stabilizing places and 638/2162 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p2), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 5 factoid took 165 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-040B-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-040B-LTLFireability-15 finished in 7542 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((G(p1)||p0)))))'
Found a Lengthening insensitive property : ShieldIIPt-PT-040B-LTLFireability-00
Stuttering acceptance computed with spot in 271 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 2372 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2372/2372 places, 2172/2172 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 478 transitions
Trivial Post-agglo rules discarded 478 transitions
Performed 478 trivial Post agglomeration. Transition count delta: 478
Iterating post reduction 0 with 478 rules applied. Total rules applied 478 place count 2371 transition count 1693
Reduce places removed 478 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 479 rules applied. Total rules applied 957 place count 1893 transition count 1692
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 958 place count 1892 transition count 1692
Performed 312 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 312 Pre rules applied. Total rules applied 958 place count 1892 transition count 1380
Deduced a syphon composed of 312 places in 2 ms
Reduce places removed 312 places and 0 transitions.
Iterating global reduction 3 with 624 rules applied. Total rules applied 1582 place count 1580 transition count 1380
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1589 place count 1573 transition count 1373
Iterating global reduction 3 with 7 rules applied. Total rules applied 1596 place count 1573 transition count 1373
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 1596 place count 1573 transition count 1366
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 1610 place count 1566 transition count 1366
Performed 681 Post agglomeration using F-continuation condition.Transition count delta: 681
Deduced a syphon composed of 681 places in 0 ms
Reduce places removed 681 places and 0 transitions.
Iterating global reduction 3 with 1362 rules applied. Total rules applied 2972 place count 885 transition count 685
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2973 place count 885 transition count 684
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 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2975 place count 884 transition count 683
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 4 with 202 rules applied. Total rules applied 3177 place count 783 transition count 750
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 3211 place count 766 transition count 761
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3213 place count 764 transition count 759
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 3215 place count 762 transition count 759
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 3215 place count 762 transition count 758
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 3217 place count 761 transition count 758
Applied a total of 3217 rules in 365 ms. Remains 761 /2372 variables (removed 1611) and now considering 758/2172 (removed 1414) transitions.
// Phase 1: matrix 758 rows 761 cols
[2023-03-19 01:21:14] [INFO ] Computed 359 place invariants in 3 ms
[2023-03-19 01:21:15] [INFO ] Implicit Places using invariants in 510 ms returned [750]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 511 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 760/2372 places, 758/2172 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 759 transition count 757
Applied a total of 2 rules in 18 ms. Remains 759 /760 variables (removed 1) and now considering 757/758 (removed 1) transitions.
// Phase 1: matrix 757 rows 759 cols
[2023-03-19 01:21:15] [INFO ] Computed 358 place invariants in 3 ms
[2023-03-19 01:21:15] [INFO ] Implicit Places using invariants in 449 ms returned []
[2023-03-19 01:21:15] [INFO ] Invariant cache hit.
[2023-03-19 01:21:16] [INFO ] Implicit Places using invariants and state equation in 837 ms returned []
Implicit Place search using SMT with State Equation took 1288 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 759/2372 places, 757/2172 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2182 ms. Remains : 759/2372 places, 757/2172 transitions.
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(EQ s96 0), p0:(OR (EQ s318 0) (EQ s325 0) (EQ s328 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 574 ms.
Product exploration explored 100000 steps with 0 reset in 718 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 258 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 159437 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 159437 steps, saw 97282 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-19 01:21:21] [INFO ] Invariant cache hit.
[2023-03-19 01:21:21] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 01:21:22] [INFO ] [Nat]Absence check using 358 positive place invariants in 46 ms returned sat
[2023-03-19 01:21:22] [INFO ] After 368ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 01:21:22] [INFO ] After 719ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 211 ms.
[2023-03-19 01:21:23] [INFO ] After 1165ms 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 79 ms.
Support contains 4 out of 759 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 757/757 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 759 transition count 756
Applied a total of 1 rules in 12 ms. Remains 759 /759 variables (removed 0) and now considering 756/757 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 759/759 places, 756/757 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 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 124469 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 124469 steps, saw 78779 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 756 rows 759 cols
[2023-03-19 01:21:26] [INFO ] Computed 358 place invariants in 1 ms
[2023-03-19 01:21:26] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 01:21:26] [INFO ] [Nat]Absence check using 358 positive place invariants in 45 ms returned sat
[2023-03-19 01:21:27] [INFO ] After 401ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 01:21:27] [INFO ] After 614ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 149 ms.
[2023-03-19 01:21:27] [INFO ] After 998ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 19 ms.
Support contains 4 out of 759 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 756/756 transitions.
Applied a total of 0 rules in 11 ms. Remains 759 /759 variables (removed 0) and now considering 756/756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 759/759 places, 756/756 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 756/756 transitions.
Applied a total of 0 rules in 11 ms. Remains 759 /759 variables (removed 0) and now considering 756/756 (removed 0) transitions.
[2023-03-19 01:21:27] [INFO ] Invariant cache hit.
[2023-03-19 01:21:28] [INFO ] Implicit Places using invariants in 477 ms returned []
[2023-03-19 01:21:28] [INFO ] Invariant cache hit.
[2023-03-19 01:21:29] [INFO ] Implicit Places using invariants and state equation in 878 ms returned []
Implicit Place search using SMT with State Equation took 1358 ms to find 0 implicit places.
[2023-03-19 01:21:29] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-19 01:21:29] [INFO ] Invariant cache hit.
[2023-03-19 01:21:29] [INFO ] Dead Transitions using invariants and state equation in 366 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1748 ms. Remains : 759/759 places, 756/756 transitions.
Partial Free-agglomeration rule applied 78 times.
Drop transitions removed 78 transitions
Iterating global reduction 0 with 78 rules applied. Total rules applied 78 place count 759 transition count 756
Applied a total of 78 rules in 19 ms. Remains 759 /759 variables (removed 0) and now considering 756/756 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 756 rows 759 cols
[2023-03-19 01:21:29] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-19 01:21:29] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 01:21:29] [INFO ] [Nat]Absence check using 358 positive place invariants in 71 ms returned sat
[2023-03-19 01:21:30] [INFO ] After 415ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 01:21:30] [INFO ] After 772ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 216 ms.
[2023-03-19 01:21:30] [INFO ] After 1294ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 192 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 241 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 759 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 759/759 places, 757/757 transitions.
Applied a total of 0 rules in 18 ms. Remains 759 /759 variables (removed 0) and now considering 757/757 (removed 0) transitions.
// Phase 1: matrix 757 rows 759 cols
[2023-03-19 01:21:31] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-19 01:21:32] [INFO ] Implicit Places using invariants in 436 ms returned []
[2023-03-19 01:21:32] [INFO ] Invariant cache hit.
[2023-03-19 01:21:33] [INFO ] Implicit Places using invariants and state equation in 923 ms returned []
Implicit Place search using SMT with State Equation took 1375 ms to find 0 implicit places.
[2023-03-19 01:21:33] [INFO ] Invariant cache hit.
[2023-03-19 01:21:33] [INFO ] Dead Transitions using invariants and state equation in 326 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1720 ms. Remains : 759/759 places, 757/757 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 156 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 154791 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 154791 steps, saw 94493 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-19 01:21:37] [INFO ] Invariant cache hit.
[2023-03-19 01:21:37] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 01:21:37] [INFO ] [Nat]Absence check using 358 positive place invariants in 61 ms returned sat
[2023-03-19 01:21:37] [INFO ] After 387ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 01:21:38] [INFO ] After 702ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 214 ms.
[2023-03-19 01:21:38] [INFO ] After 1188ms 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 85 ms.
Support contains 4 out of 759 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 757/757 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 759 transition count 756
Applied a total of 1 rules in 20 ms. Remains 759 /759 variables (removed 0) and now considering 756/757 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 759/759 places, 756/757 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) 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
Interrupted probabilistic random walk after 154876 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 154876 steps, saw 97966 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 756 rows 759 cols
[2023-03-19 01:21:42] [INFO ] Computed 358 place invariants in 3 ms
[2023-03-19 01:21:42] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 01:21:42] [INFO ] [Nat]Absence check using 358 positive place invariants in 70 ms returned sat
[2023-03-19 01:21:42] [INFO ] After 440ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 01:21:43] [INFO ] After 754ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 217 ms.
[2023-03-19 01:21:43] [INFO ] After 1281ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 44 ms.
Support contains 4 out of 759 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 756/756 transitions.
Applied a total of 0 rules in 17 ms. Remains 759 /759 variables (removed 0) and now considering 756/756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 759/759 places, 756/756 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 756/756 transitions.
Applied a total of 0 rules in 14 ms. Remains 759 /759 variables (removed 0) and now considering 756/756 (removed 0) transitions.
[2023-03-19 01:21:43] [INFO ] Invariant cache hit.
[2023-03-19 01:21:43] [INFO ] Implicit Places using invariants in 434 ms returned []
[2023-03-19 01:21:43] [INFO ] Invariant cache hit.
[2023-03-19 01:21:44] [INFO ] Implicit Places using invariants and state equation in 949 ms returned []
Implicit Place search using SMT with State Equation took 1398 ms to find 0 implicit places.
[2023-03-19 01:21:44] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-19 01:21:44] [INFO ] Invariant cache hit.
[2023-03-19 01:21:45] [INFO ] Dead Transitions using invariants and state equation in 371 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1792 ms. Remains : 759/759 places, 756/756 transitions.
Partial Free-agglomeration rule applied 78 times.
Drop transitions removed 78 transitions
Iterating global reduction 0 with 78 rules applied. Total rules applied 78 place count 759 transition count 756
Applied a total of 78 rules in 19 ms. Remains 759 /759 variables (removed 0) and now considering 756/756 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 756 rows 759 cols
[2023-03-19 01:21:45] [INFO ] Computed 358 place invariants in 1 ms
[2023-03-19 01:21:45] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 01:21:45] [INFO ] [Nat]Absence check using 358 positive place invariants in 53 ms returned sat
[2023-03-19 01:21:46] [INFO ] After 422ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 01:21:46] [INFO ] After 740ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 228 ms.
[2023-03-19 01:21:46] [INFO ] After 1222ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 252 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 266 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 279 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 245 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 613 ms.
Product exploration explored 100000 steps with 0 reset in 707 ms.
Applying partial POR strategy [true, true, true, false, false]
Stuttering acceptance computed with spot in 240 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 759 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 759/759 places, 757/757 transitions.
Applied a total of 0 rules in 28 ms. Remains 759 /759 variables (removed 0) and now considering 757/757 (removed 0) transitions.
[2023-03-19 01:21:49] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 757 rows 759 cols
[2023-03-19 01:21:49] [INFO ] Computed 358 place invariants in 3 ms
[2023-03-19 01:21:49] [INFO ] Dead Transitions using invariants and state equation in 461 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 509 ms. Remains : 759/759 places, 757/757 transitions.
Built C files in :
/tmp/ltsmin13728741275436372318
[2023-03-19 01:21:49] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13728741275436372318
Running compilation step : cd /tmp/ltsmin13728741275436372318;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1290 ms.
Running link step : cd /tmp/ltsmin13728741275436372318;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin13728741275436372318;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10729586165569152956.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 759 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 759/759 places, 757/757 transitions.
Applied a total of 0 rules in 11 ms. Remains 759 /759 variables (removed 0) and now considering 757/757 (removed 0) transitions.
[2023-03-19 01:22:05] [INFO ] Invariant cache hit.
[2023-03-19 01:22:05] [INFO ] Implicit Places using invariants in 452 ms returned []
[2023-03-19 01:22:05] [INFO ] Invariant cache hit.
[2023-03-19 01:22:06] [INFO ] Implicit Places using invariants and state equation in 935 ms returned []
Implicit Place search using SMT with State Equation took 1388 ms to find 0 implicit places.
[2023-03-19 01:22:06] [INFO ] Invariant cache hit.
[2023-03-19 01:22:06] [INFO ] Dead Transitions using invariants and state equation in 417 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1816 ms. Remains : 759/759 places, 757/757 transitions.
Built C files in :
/tmp/ltsmin12230653223956673236
[2023-03-19 01:22:06] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12230653223956673236
Running compilation step : cd /tmp/ltsmin12230653223956673236;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1258 ms.
Running link step : cd /tmp/ltsmin12230653223956673236;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin12230653223956673236;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1830813775759559845.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-19 01:22:22] [INFO ] Flatten gal took : 26 ms
[2023-03-19 01:22:22] [INFO ] Flatten gal took : 21 ms
[2023-03-19 01:22:22] [INFO ] Time to serialize gal into /tmp/LTL8990385176821206029.gal : 4 ms
[2023-03-19 01:22:22] [INFO ] Time to serialize properties into /tmp/LTL9107180914655677667.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8990385176821206029.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7217746416667446713.hoa' '-atoms' '/tmp/LTL9107180914655677667.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL9107180914655677667.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7217746416667446713.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.60065e+49 deadlock states
Detected timeout of ITS tools.
[2023-03-19 01:22:37] [INFO ] Flatten gal took : 24 ms
[2023-03-19 01:22:37] [INFO ] Flatten gal took : 20 ms
[2023-03-19 01:22:37] [INFO ] Time to serialize gal into /tmp/LTL8284518395282560642.gal : 3 ms
[2023-03-19 01:22:37] [INFO ] Time to serialize properties into /tmp/LTL4249277888398481348.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8284518395282560642.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4249277888398481348.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("((p1170==0)||(p1202==0))")||(("(p1214==0)")||(G("(p371==0)"))))))))
Formula 0 simplified : XXF(!"((p1170==0)||(p1202==0))" & !"(p1214==0)" & F!"(p371==0)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.60065e+49 deadlock states
Detected timeout of ITS tools.
[2023-03-19 01:22:52] [INFO ] Flatten gal took : 20 ms
[2023-03-19 01:22:52] [INFO ] Applying decomposition
[2023-03-19 01:22:52] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph18113157365541228965.txt' '-o' '/tmp/graph18113157365541228965.bin' '-w' '/tmp/graph18113157365541228965.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph18113157365541228965.bin' '-l' '-1' '-v' '-w' '/tmp/graph18113157365541228965.weights' '-q' '0' '-e' '0.001'
[2023-03-19 01:22:52] [INFO ] Decomposing Gal with order
[2023-03-19 01:22:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 01:22:52] [INFO ] Removed a total of 847 redundant transitions.
[2023-03-19 01:22:52] [INFO ] Flatten gal took : 37 ms
[2023-03-19 01:22:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 356 labels/synchronizations in 10 ms.
[2023-03-19 01:22:52] [INFO ] Time to serialize gal into /tmp/LTL4494226903423010384.gal : 6 ms
[2023-03-19 01:22:52] [INFO ] Time to serialize properties into /tmp/LTL6446046863530550892.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4494226903423010384.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6446046863530550892.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("((i10.u131.p1170==0)||(i10.u132.p1202==0))")||(("(i10.u133.p1214==0)")||(G("(i2.u38.p371==0)"))))))))
Formula 0 simplified : XXF(!"((i10.u131.p1170==0)||(i10.u132.p1202==0))" & !"(i10.u133.p1214==0)" & F!"(i2.u38.p371==0)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.60065e+49 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
122 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.32494,52804,1,0,68863,267,2707,181537,247,1107,107537
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
Treatment of property ShieldIIPt-PT-040B-LTLFireability-00 finished in 99912 ms.
FORMULA ShieldIIPt-PT-040B-LTLFireability-00 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-19 01:22:54] [INFO ] Flatten gal took : 103 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 557482 ms.

BK_STOP 1679188974323

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-040B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ShieldIIPt-PT-040B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r389-oct2-167903713400316"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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