Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.2K Feb 25 17:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 17:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 17:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 17:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 17:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Feb 25 17:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 17:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 17:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 860K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679440390152

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-050B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 23:13:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 23:13:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 23:13:13] [INFO ] Load time of PNML (sax parser for PT used): 326 ms
[2023-03-21 23:13:13] [INFO ] Transformed 3503 places.
[2023-03-21 23:13:13] [INFO ] Transformed 3253 transitions.
[2023-03-21 23:13:13] [INFO ] Found NUPN structural information;
[2023-03-21 23:13:13] [INFO ] Parsed PT model containing 3503 places and 3253 transitions and 8106 arcs in 694 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ShieldIIPt-PT-050B-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050B-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050B-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050B-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050B-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 3503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3503/3503 places, 3253/3253 transitions.
Discarding 543 places :
Symmetric choice reduction at 0 with 543 rule applications. Total rules 543 place count 2960 transition count 2710
Iterating global reduction 0 with 543 rules applied. Total rules applied 1086 place count 2960 transition count 2710
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1087 place count 2959 transition count 2709
Iterating global reduction 0 with 1 rules applied. Total rules applied 1088 place count 2959 transition count 2709
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1089 place count 2958 transition count 2708
Iterating global reduction 0 with 1 rules applied. Total rules applied 1090 place count 2958 transition count 2708
Applied a total of 1090 rules in 1433 ms. Remains 2958 /3503 variables (removed 545) and now considering 2708/3253 (removed 545) transitions.
// Phase 1: matrix 2708 rows 2958 cols
[2023-03-21 23:13:15] [INFO ] Computed 451 place invariants in 68 ms
[2023-03-21 23:13:18] [INFO ] Implicit Places using invariants in 2687 ms returned []
[2023-03-21 23:13:18] [INFO ] Invariant cache hit.
[2023-03-21 23:13:23] [INFO ] Implicit Places using invariants and state equation in 4628 ms returned []
Implicit Place search using SMT with State Equation took 7547 ms to find 0 implicit places.
[2023-03-21 23:13:23] [INFO ] Invariant cache hit.
[2023-03-21 23:13:26] [INFO ] Dead Transitions using invariants and state equation in 3122 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2958/3503 places, 2708/3253 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12123 ms. Remains : 2958/3503 places, 2708/3253 transitions.
Support contains 30 out of 2958 places after structural reductions.
[2023-03-21 23:13:26] [INFO ] Flatten gal took : 238 ms
[2023-03-21 23:13:27] [INFO ] Flatten gal took : 105 ms
[2023-03-21 23:13:27] [INFO ] Input system was already deterministic with 2708 transitions.
Support contains 27 out of 2958 places (down from 30) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 546 ms. (steps per millisecond=18 ) properties (out of 21) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 13) 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 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-21 23:13:28] [INFO ] Invariant cache hit.
[2023-03-21 23:13:29] [INFO ] [Real]Absence check using 451 positive place invariants in 411 ms returned sat
[2023-03-21 23:13:30] [INFO ] After 2583ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-21 23:13:32] [INFO ] [Nat]Absence check using 451 positive place invariants in 336 ms returned sat
[2023-03-21 23:13:37] [INFO ] After 4198ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-21 23:13:38] [INFO ] Deduced a trap composed of 23 places in 1038 ms of which 13 ms to minimize.
[2023-03-21 23:13:39] [INFO ] Deduced a trap composed of 18 places in 732 ms of which 2 ms to minimize.
[2023-03-21 23:13:41] [INFO ] Deduced a trap composed of 22 places in 1168 ms of which 14 ms to minimize.
[2023-03-21 23:13:42] [INFO ] Deduced a trap composed of 19 places in 1329 ms of which 31 ms to minimize.
[2023-03-21 23:13:43] [INFO ] Deduced a trap composed of 26 places in 664 ms of which 14 ms to minimize.
[2023-03-21 23:13:44] [INFO ] Deduced a trap composed of 30 places in 717 ms of which 1 ms to minimize.
[2023-03-21 23:13:45] [INFO ] Deduced a trap composed of 22 places in 1105 ms of which 6 ms to minimize.
[2023-03-21 23:13:46] [INFO ] Deduced a trap composed of 27 places in 732 ms of which 2 ms to minimize.
[2023-03-21 23:13:47] [INFO ] Deduced a trap composed of 20 places in 931 ms of which 2 ms to minimize.
[2023-03-21 23:13:48] [INFO ] Deduced a trap composed of 28 places in 1245 ms of which 1 ms to minimize.
[2023-03-21 23:13:49] [INFO ] Deduced a trap composed of 28 places in 593 ms of which 1 ms to minimize.
[2023-03-21 23:13:50] [INFO ] Deduced a trap composed of 36 places in 773 ms of which 1 ms to minimize.
[2023-03-21 23:13:51] [INFO ] Deduced a trap composed of 34 places in 663 ms of which 1 ms to minimize.
[2023-03-21 23:13:51] [INFO ] Deduced a trap composed of 36 places in 605 ms of which 1 ms to minimize.
[2023-03-21 23:13:52] [INFO ] Deduced a trap composed of 43 places in 519 ms of which 1 ms to minimize.
[2023-03-21 23:13:53] [INFO ] Deduced a trap composed of 24 places in 889 ms of which 10 ms to minimize.
[2023-03-21 23:13:54] [INFO ] Deduced a trap composed of 29 places in 528 ms of which 2 ms to minimize.
[2023-03-21 23:13:54] [INFO ] Deduced a trap composed of 33 places in 554 ms of which 1 ms to minimize.
[2023-03-21 23:13:55] [INFO ] Deduced a trap composed of 43 places in 583 ms of which 1 ms to minimize.
[2023-03-21 23:13:56] [INFO ] Deduced a trap composed of 31 places in 547 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 23:13:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 23:13:56] [INFO ] After 25116ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
Parikh walk visited 0 properties in 2464 ms.
Support contains 17 out of 2958 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2958/2958 places, 2708/2708 transitions.
Drop transitions removed 587 transitions
Trivial Post-agglo rules discarded 587 transitions
Performed 587 trivial Post agglomeration. Transition count delta: 587
Iterating post reduction 0 with 587 rules applied. Total rules applied 587 place count 2958 transition count 2121
Reduce places removed 587 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 588 rules applied. Total rules applied 1175 place count 2371 transition count 2120
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1176 place count 2370 transition count 2120
Performed 395 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 395 Pre rules applied. Total rules applied 1176 place count 2370 transition count 1725
Deduced a syphon composed of 395 places in 4 ms
Reduce places removed 395 places and 0 transitions.
Iterating global reduction 3 with 790 rules applied. Total rules applied 1966 place count 1975 transition count 1725
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1968 place count 1973 transition count 1723
Iterating global reduction 3 with 2 rules applied. Total rules applied 1970 place count 1973 transition count 1723
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1970 place count 1973 transition count 1721
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1974 place count 1971 transition count 1721
Performed 853 Post agglomeration using F-continuation condition.Transition count delta: 853
Deduced a syphon composed of 853 places in 3 ms
Reduce places removed 853 places and 0 transitions.
Iterating global reduction 3 with 1706 rules applied. Total rules applied 3680 place count 1118 transition count 868
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3681 place count 1118 transition count 867
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3683 place count 1117 transition count 866
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -63
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3885 place count 1016 transition count 929
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 42 places in 4 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 4 with 84 rules applied. Total rules applied 3969 place count 974 transition count 954
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3970 place count 974 transition count 953
Partial Free-agglomeration rule applied 50 times.
Drop transitions removed 50 transitions
Iterating global reduction 5 with 50 rules applied. Total rules applied 4020 place count 974 transition count 953
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4021 place count 973 transition count 952
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 4023 place count 971 transition count 952
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 4023 place count 971 transition count 951
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4025 place count 970 transition count 951
Applied a total of 4025 rules in 723 ms. Remains 970 /2958 variables (removed 1988) and now considering 951/2708 (removed 1757) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 723 ms. Remains : 970/2958 places, 951/2708 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 497 ms. (steps per millisecond=20 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 951 rows 970 cols
[2023-03-21 23:14:00] [INFO ] Computed 449 place invariants in 3 ms
[2023-03-21 23:14:01] [INFO ] [Real]Absence check using 449 positive place invariants in 174 ms returned sat
[2023-03-21 23:14:02] [INFO ] After 470ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:9
[2023-03-21 23:14:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 23:14:02] [INFO ] After 84ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-21 23:14:02] [INFO ] After 1358ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-21 23:14:02] [INFO ] [Nat]Absence check using 449 positive place invariants in 109 ms returned sat
[2023-03-21 23:14:03] [INFO ] After 1152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-21 23:14:04] [INFO ] After 562ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-21 23:14:05] [INFO ] After 1611ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 683 ms.
[2023-03-21 23:14:06] [INFO ] After 4156ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 307 ms.
Support contains 15 out of 970 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 970/970 places, 951/951 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 970 transition count 950
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 969 transition count 950
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 967 transition count 951
Applied a total of 6 rules in 86 ms. Remains 967 /970 variables (removed 3) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 967/970 places, 951/951 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 86196 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 86196 steps, saw 55274 distinct states, run finished after 3005 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 951 rows 967 cols
[2023-03-21 23:14:10] [INFO ] Computed 449 place invariants in 2 ms
[2023-03-21 23:14:11] [INFO ] [Real]Absence check using 449 positive place invariants in 82 ms returned sat
[2023-03-21 23:14:12] [INFO ] After 1211ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-21 23:14:12] [INFO ] [Nat]Absence check using 449 positive place invariants in 113 ms returned sat
[2023-03-21 23:14:14] [INFO ] After 1076ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-21 23:14:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 23:14:14] [INFO ] After 529ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-21 23:14:15] [INFO ] After 1609ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 665 ms.
[2023-03-21 23:14:16] [INFO ] After 4238ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 324 ms.
Support contains 15 out of 967 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 967/967 places, 951/951 transitions.
Applied a total of 0 rules in 20 ms. Remains 967 /967 variables (removed 0) and now considering 951/951 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 967/967 places, 951/951 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 967/967 places, 951/951 transitions.
Applied a total of 0 rules in 23 ms. Remains 967 /967 variables (removed 0) and now considering 951/951 (removed 0) transitions.
[2023-03-21 23:14:16] [INFO ] Invariant cache hit.
[2023-03-21 23:14:17] [INFO ] Implicit Places using invariants in 610 ms returned [956]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 621 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 966/967 places, 951/951 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 965 transition count 950
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 965 transition count 950
Applied a total of 2 rules in 55 ms. Remains 965 /966 variables (removed 1) and now considering 950/951 (removed 1) transitions.
// Phase 1: matrix 950 rows 965 cols
[2023-03-21 23:14:17] [INFO ] Computed 448 place invariants in 6 ms
[2023-03-21 23:14:18] [INFO ] Implicit Places using invariants in 891 ms returned []
[2023-03-21 23:14:18] [INFO ] Invariant cache hit.
[2023-03-21 23:14:19] [INFO ] Implicit Places using invariants and state equation in 1613 ms returned []
Implicit Place search using SMT with State Equation took 2518 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 965/967 places, 950/951 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3219 ms. Remains : 965/967 places, 950/951 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 380 ms. (steps per millisecond=26 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 82739 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 82739 steps, saw 51942 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 10 properties.
[2023-03-21 23:14:24] [INFO ] Invariant cache hit.
[2023-03-21 23:14:24] [INFO ] [Real]Absence check using 448 positive place invariants in 120 ms returned sat
[2023-03-21 23:14:25] [INFO ] After 1335ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-21 23:14:25] [INFO ] [Nat]Absence check using 448 positive place invariants in 86 ms returned sat
[2023-03-21 23:14:26] [INFO ] After 793ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-21 23:14:27] [INFO ] After 1881ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 665 ms.
[2023-03-21 23:14:28] [INFO ] After 3081ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 322 ms.
Support contains 15 out of 965 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 965/965 places, 950/950 transitions.
Applied a total of 0 rules in 36 ms. Remains 965 /965 variables (removed 0) and now considering 950/950 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 965/965 places, 950/950 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 965/965 places, 950/950 transitions.
Applied a total of 0 rules in 19 ms. Remains 965 /965 variables (removed 0) and now considering 950/950 (removed 0) transitions.
[2023-03-21 23:14:29] [INFO ] Invariant cache hit.
[2023-03-21 23:14:29] [INFO ] Implicit Places using invariants in 619 ms returned []
[2023-03-21 23:14:29] [INFO ] Invariant cache hit.
[2023-03-21 23:14:31] [INFO ] Implicit Places using invariants and state equation in 1680 ms returned []
Implicit Place search using SMT with State Equation took 2316 ms to find 0 implicit places.
[2023-03-21 23:14:31] [INFO ] Redundant transitions in 67 ms returned []
[2023-03-21 23:14:31] [INFO ] Invariant cache hit.
[2023-03-21 23:14:31] [INFO ] Dead Transitions using invariants and state equation in 572 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3009 ms. Remains : 965/965 places, 950/950 transitions.
Partial Free-agglomeration rule applied 97 times.
Drop transitions removed 97 transitions
Iterating global reduction 0 with 97 rules applied. Total rules applied 97 place count 965 transition count 950
Applied a total of 97 rules in 42 ms. Remains 965 /965 variables (removed 0) and now considering 950/950 (removed 0) transitions.
Running SMT prover for 10 properties.
// Phase 1: matrix 950 rows 965 cols
[2023-03-21 23:14:32] [INFO ] Computed 448 place invariants in 6 ms
[2023-03-21 23:14:32] [INFO ] [Real]Absence check using 448 positive place invariants in 83 ms returned sat
[2023-03-21 23:14:33] [INFO ] After 1063ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-21 23:14:33] [INFO ] [Nat]Absence check using 448 positive place invariants in 107 ms returned sat
[2023-03-21 23:14:34] [INFO ] After 973ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-21 23:14:34] [INFO ] State equation strengthened by 94 read => feed constraints.
[2023-03-21 23:14:35] [INFO ] After 682ms SMT Verify possible using 94 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-21 23:14:36] [INFO ] After 1724ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 713 ms.
[2023-03-21 23:14:37] [INFO ] After 4025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Computed a total of 799 stabilizing places and 799 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G((p0||F(p1))) U p2) U G(p3)))'
Support contains 4 out of 2958 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2958/2958 places, 2708/2708 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 594 transitions
Trivial Post-agglo rules discarded 594 transitions
Performed 594 trivial Post agglomeration. Transition count delta: 594
Iterating post reduction 0 with 594 rules applied. Total rules applied 594 place count 2957 transition count 2113
Reduce places removed 594 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 595 rules applied. Total rules applied 1189 place count 2363 transition count 2112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1190 place count 2362 transition count 2112
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 399 Pre rules applied. Total rules applied 1190 place count 2362 transition count 1713
Deduced a syphon composed of 399 places in 2 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 3 with 798 rules applied. Total rules applied 1988 place count 1963 transition count 1713
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 1993 place count 1958 transition count 1708
Iterating global reduction 3 with 5 rules applied. Total rules applied 1998 place count 1958 transition count 1708
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 1998 place count 1958 transition count 1703
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 2008 place count 1953 transition count 1703
Performed 846 Post agglomeration using F-continuation condition.Transition count delta: 846
Deduced a syphon composed of 846 places in 2 ms
Reduce places removed 846 places and 0 transitions.
Iterating global reduction 3 with 1692 rules applied. Total rules applied 3700 place count 1107 transition count 857
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3701 place count 1107 transition count 856
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3703 place count 1106 transition count 855
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3905 place count 1005 transition count 921
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 4001 place count 957 transition count 953
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4003 place count 955 transition count 951
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 4005 place count 953 transition count 951
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4005 place count 953 transition count 950
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4007 place count 952 transition count 950
Applied a total of 4007 rules in 650 ms. Remains 952 /2958 variables (removed 2006) and now considering 950/2708 (removed 1758) transitions.
// Phase 1: matrix 950 rows 952 cols
[2023-03-21 23:14:38] [INFO ] Computed 449 place invariants in 4 ms
[2023-03-21 23:14:39] [INFO ] Implicit Places using invariants in 799 ms returned [941]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 806 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 951/2958 places, 950/2708 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 950 transition count 949
Applied a total of 2 rules in 31 ms. Remains 950 /951 variables (removed 1) and now considering 949/950 (removed 1) transitions.
// Phase 1: matrix 949 rows 950 cols
[2023-03-21 23:14:39] [INFO ] Computed 448 place invariants in 3 ms
[2023-03-21 23:14:39] [INFO ] Implicit Places using invariants in 571 ms returned []
[2023-03-21 23:14:39] [INFO ] Invariant cache hit.
[2023-03-21 23:14:40] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-21 23:14:41] [INFO ] Implicit Places using invariants and state equation in 1451 ms returned []
Implicit Place search using SMT with State Equation took 2024 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 950/2958 places, 949/2708 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3511 ms. Remains : 950/2958 places, 949/2708 transitions.
Stuttering acceptance computed with spot in 611 ms :[(NOT p3), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p3) p0), (AND (NOT p1) (NOT p0) (NOT p3) p2)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={} source=0 dest: 0}, { cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p3 (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND p3 (NOT p2)), acceptance={} source=0 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p3) p0 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p3 p0 (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=5 dest: 2}, { cond=(AND p3 p2 (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p3 p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p3:(NEQ s818 1), p2:(EQ s842 1), p0:(EQ s381 1), p1:(EQ s181 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 27 steps with 10 reset in 14 ms.
FORMULA ShieldIIPt-PT-050B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-LTLFireability-00 finished in 4252 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 2958 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2958/2958 places, 2708/2708 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 593 transitions
Trivial Post-agglo rules discarded 593 transitions
Performed 593 trivial Post agglomeration. Transition count delta: 593
Iterating post reduction 0 with 593 rules applied. Total rules applied 593 place count 2957 transition count 2114
Reduce places removed 593 places and 0 transitions.
Iterating post reduction 1 with 593 rules applied. Total rules applied 1186 place count 2364 transition count 2114
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 400 Pre rules applied. Total rules applied 1186 place count 2364 transition count 1714
Deduced a syphon composed of 400 places in 3 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 2 with 800 rules applied. Total rules applied 1986 place count 1964 transition count 1714
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1992 place count 1958 transition count 1708
Iterating global reduction 2 with 6 rules applied. Total rules applied 1998 place count 1958 transition count 1708
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 1998 place count 1958 transition count 1702
Deduced a syphon composed of 6 places in 11 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 2010 place count 1952 transition count 1702
Performed 846 Post agglomeration using F-continuation condition.Transition count delta: 846
Deduced a syphon composed of 846 places in 1 ms
Reduce places removed 846 places and 0 transitions.
Iterating global reduction 2 with 1692 rules applied. Total rules applied 3702 place count 1106 transition count 856
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3703 place count 1106 transition count 855
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3705 place count 1105 transition count 854
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3907 place count 1004 transition count 920
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 4003 place count 956 transition count 953
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4005 place count 954 transition count 951
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 4007 place count 952 transition count 951
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 4007 place count 952 transition count 950
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4009 place count 951 transition count 950
Applied a total of 4009 rules in 591 ms. Remains 951 /2958 variables (removed 2007) and now considering 950/2708 (removed 1758) transitions.
// Phase 1: matrix 950 rows 951 cols
[2023-03-21 23:14:42] [INFO ] Computed 449 place invariants in 24 ms
[2023-03-21 23:14:43] [INFO ] Implicit Places using invariants in 573 ms returned [940]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 587 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 950/2958 places, 950/2708 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 949 transition count 949
Applied a total of 2 rules in 30 ms. Remains 949 /950 variables (removed 1) and now considering 949/950 (removed 1) transitions.
// Phase 1: matrix 949 rows 949 cols
[2023-03-21 23:14:43] [INFO ] Computed 448 place invariants in 3 ms
[2023-03-21 23:14:43] [INFO ] Implicit Places using invariants in 602 ms returned []
[2023-03-21 23:14:43] [INFO ] Invariant cache hit.
[2023-03-21 23:14:44] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-21 23:14:45] [INFO ] Implicit Places using invariants and state equation in 1692 ms returned []
Implicit Place search using SMT with State Equation took 2313 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 949/2958 places, 949/2708 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3521 ms. Remains : 949/2958 places, 949/2708 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s784 1) (EQ s96 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-050B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-LTLFireability-01 finished in 3615 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 2958 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2958/2958 places, 2708/2708 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 595 transitions
Trivial Post-agglo rules discarded 595 transitions
Performed 595 trivial Post agglomeration. Transition count delta: 595
Iterating post reduction 0 with 595 rules applied. Total rules applied 595 place count 2957 transition count 2112
Reduce places removed 595 places and 0 transitions.
Iterating post reduction 1 with 595 rules applied. Total rules applied 1190 place count 2362 transition count 2112
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 399 Pre rules applied. Total rules applied 1190 place count 2362 transition count 1713
Deduced a syphon composed of 399 places in 3 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 2 with 798 rules applied. Total rules applied 1988 place count 1963 transition count 1713
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1994 place count 1957 transition count 1707
Iterating global reduction 2 with 6 rules applied. Total rules applied 2000 place count 1957 transition count 1707
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2000 place count 1957 transition count 1701
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 2012 place count 1951 transition count 1701
Performed 848 Post agglomeration using F-continuation condition.Transition count delta: 848
Deduced a syphon composed of 848 places in 1 ms
Reduce places removed 848 places and 0 transitions.
Iterating global reduction 2 with 1696 rules applied. Total rules applied 3708 place count 1103 transition count 853
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3709 place count 1103 transition count 852
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3711 place count 1102 transition count 851
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3913 place count 1001 transition count 917
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 4009 place count 953 transition count 949
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4011 place count 951 transition count 947
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 4013 place count 949 transition count 947
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 4013 place count 949 transition count 946
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4015 place count 948 transition count 946
Applied a total of 4015 rules in 513 ms. Remains 948 /2958 variables (removed 2010) and now considering 946/2708 (removed 1762) transitions.
// Phase 1: matrix 946 rows 948 cols
[2023-03-21 23:14:45] [INFO ] Computed 449 place invariants in 2 ms
[2023-03-21 23:14:46] [INFO ] Implicit Places using invariants in 644 ms returned [937]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 645 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 947/2958 places, 946/2708 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 946 transition count 945
Applied a total of 2 rules in 35 ms. Remains 946 /947 variables (removed 1) and now considering 945/946 (removed 1) transitions.
// Phase 1: matrix 945 rows 946 cols
[2023-03-21 23:14:46] [INFO ] Computed 448 place invariants in 2 ms
[2023-03-21 23:14:47] [INFO ] Implicit Places using invariants in 1001 ms returned []
[2023-03-21 23:14:47] [INFO ] Invariant cache hit.
[2023-03-21 23:14:48] [INFO ] Implicit Places using invariants and state equation in 1302 ms returned []
Implicit Place search using SMT with State Equation took 2304 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 946/2958 places, 945/2708 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3497 ms. Remains : 946/2958 places, 945/2708 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s684 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 980 ms.
Stuttering criterion allowed to conclude after 3681 steps with 0 reset in 49 ms.
FORMULA ShieldIIPt-PT-050B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-LTLFireability-02 finished in 4578 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(((G(p0) U p1)&&F(p2)))&&F(p0)))'
Support contains 6 out of 2958 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2958/2958 places, 2708/2708 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2951 transition count 2701
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2951 transition count 2701
Applied a total of 14 rules in 370 ms. Remains 2951 /2958 variables (removed 7) and now considering 2701/2708 (removed 7) transitions.
// Phase 1: matrix 2701 rows 2951 cols
[2023-03-21 23:14:50] [INFO ] Computed 451 place invariants in 9 ms
[2023-03-21 23:14:51] [INFO ] Implicit Places using invariants in 1192 ms returned []
[2023-03-21 23:14:51] [INFO ] Invariant cache hit.
[2023-03-21 23:14:54] [INFO ] Implicit Places using invariants and state equation in 3294 ms returned []
Implicit Place search using SMT with State Equation took 4505 ms to find 0 implicit places.
[2023-03-21 23:14:54] [INFO ] Invariant cache hit.
[2023-03-21 23:14:57] [INFO ] Dead Transitions using invariants and state equation in 2596 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2951/2958 places, 2701/2708 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7484 ms. Remains : 2951/2958 places, 2701/2708 transitions.
Stuttering acceptance computed with spot in 427 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2)), (NOT p0), true, (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 5}, { cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s383 1), p1:(AND (EQ s1642 1) (EQ s1667 1) (EQ s1676 1)), p2:(AND (EQ s1685 1) (EQ s1730 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-050B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-LTLFireability-03 finished in 7987 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 2958 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2958/2958 places, 2708/2708 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2951 transition count 2701
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2951 transition count 2701
Applied a total of 14 rules in 393 ms. Remains 2951 /2958 variables (removed 7) and now considering 2701/2708 (removed 7) transitions.
[2023-03-21 23:14:58] [INFO ] Invariant cache hit.
[2023-03-21 23:14:59] [INFO ] Implicit Places using invariants in 894 ms returned []
[2023-03-21 23:14:59] [INFO ] Invariant cache hit.
[2023-03-21 23:15:03] [INFO ] Implicit Places using invariants and state equation in 3949 ms returned []
Implicit Place search using SMT with State Equation took 4867 ms to find 0 implicit places.
[2023-03-21 23:15:03] [INFO ] Invariant cache hit.
[2023-03-21 23:15:05] [INFO ] Dead Transitions using invariants and state equation in 2638 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2951/2958 places, 2701/2708 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7899 ms. Remains : 2951/2958 places, 2701/2708 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s1434 1) (EQ s1610 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 188 reset in 607 ms.
Product exploration explored 100000 steps with 191 reset in 686 ms.
Computed a total of 798 stabilizing places and 798 stable transitions
Computed a total of 798 stabilizing places and 798 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 154 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Finished random walk after 555 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=111 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 184 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
[2023-03-21 23:15:08] [INFO ] Invariant cache hit.
[2023-03-21 23:15:10] [INFO ] [Real]Absence check using 451 positive place invariants in 1223 ms returned sat
[2023-03-21 23:15:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:15:23] [INFO ] [Real]Absence check using state equation in 12058 ms returned unknown
Could not prove EG (NOT p0)
Support contains 2 out of 2951 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2951/2951 places, 2701/2701 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 597 transitions
Trivial Post-agglo rules discarded 597 transitions
Performed 597 trivial Post agglomeration. Transition count delta: 597
Iterating post reduction 0 with 597 rules applied. Total rules applied 597 place count 2950 transition count 2103
Reduce places removed 597 places and 0 transitions.
Iterating post reduction 1 with 597 rules applied. Total rules applied 1194 place count 2353 transition count 2103
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 400 Pre rules applied. Total rules applied 1194 place count 2353 transition count 1703
Deduced a syphon composed of 400 places in 3 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 2 with 800 rules applied. Total rules applied 1994 place count 1953 transition count 1703
Performed 848 Post agglomeration using F-continuation condition.Transition count delta: 848
Deduced a syphon composed of 848 places in 1 ms
Reduce places removed 848 places and 0 transitions.
Iterating global reduction 2 with 1696 rules applied. Total rules applied 3690 place count 1105 transition count 855
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3691 place count 1105 transition count 854
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3693 place count 1104 transition count 853
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3895 place count 1003 transition count 920
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 3989 place count 956 transition count 951
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3991 place count 954 transition count 949
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 3993 place count 952 transition count 949
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3993 place count 952 transition count 948
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3995 place count 951 transition count 948
Applied a total of 3995 rules in 453 ms. Remains 951 /2951 variables (removed 2000) and now considering 948/2701 (removed 1753) transitions.
// Phase 1: matrix 948 rows 951 cols
[2023-03-21 23:15:23] [INFO ] Computed 449 place invariants in 2 ms
[2023-03-21 23:15:24] [INFO ] Implicit Places using invariants in 1087 ms returned [940]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1104 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 950/2951 places, 948/2701 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 949 transition count 947
Applied a total of 2 rules in 30 ms. Remains 949 /950 variables (removed 1) and now considering 947/948 (removed 1) transitions.
// Phase 1: matrix 947 rows 949 cols
[2023-03-21 23:15:24] [INFO ] Computed 448 place invariants in 2 ms
[2023-03-21 23:15:26] [INFO ] Implicit Places using invariants in 1595 ms returned []
[2023-03-21 23:15:26] [INFO ] Invariant cache hit.
[2023-03-21 23:15:27] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-21 23:15:27] [INFO ] Implicit Places using invariants and state equation in 1715 ms returned []
Implicit Place search using SMT with State Equation took 3312 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 949/2951 places, 947/2701 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4899 ms. Remains : 949/2951 places, 947/2701 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 246 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 229 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2023-03-21 23:15:28] [INFO ] Invariant cache hit.
[2023-03-21 23:15:30] [INFO ] [Real]Absence check using 448 positive place invariants in 452 ms returned sat
[2023-03-21 23:15:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:15:32] [INFO ] [Real]Absence check using state equation in 1471 ms returned sat
[2023-03-21 23:15:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 23:15:33] [INFO ] [Nat]Absence check using 448 positive place invariants in 219 ms returned sat
[2023-03-21 23:15:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 23:15:35] [INFO ] [Nat]Absence check using state equation in 2608 ms returned sat
[2023-03-21 23:15:35] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-21 23:15:35] [INFO ] [Nat]Added 3 Read/Feed constraints in 66 ms returned sat
[2023-03-21 23:15:35] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2023-03-21 23:15:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2023-03-21 23:15:36] [INFO ] Computed and/alt/rep : 942/1446/942 causal constraints (skipped 0 transitions) in 51 ms.
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.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 23:15:47] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 64 ms :[(NOT p0)]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-050B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-LTLFireability-05 finished in 49308 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p0) U G(p1))) U ((p1 U X(p1))||G(F(p2)))))'
Support contains 3 out of 2958 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2958/2958 places, 2708/2708 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 2953 transition count 2703
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 2953 transition count 2703
Applied a total of 10 rules in 349 ms. Remains 2953 /2958 variables (removed 5) and now considering 2703/2708 (removed 5) transitions.
// Phase 1: matrix 2703 rows 2953 cols
[2023-03-21 23:15:47] [INFO ] Computed 451 place invariants in 7 ms
[2023-03-21 23:15:48] [INFO ] Implicit Places using invariants in 1156 ms returned []
[2023-03-21 23:15:48] [INFO ] Invariant cache hit.
[2023-03-21 23:15:54] [INFO ] Implicit Places using invariants and state equation in 5511 ms returned []
Implicit Place search using SMT with State Equation took 6669 ms to find 0 implicit places.
[2023-03-21 23:15:54] [INFO ] Invariant cache hit.
[2023-03-21 23:15:57] [INFO ] Dead Transitions using invariants and state equation in 3026 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2953/2958 places, 2703/2708 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10058 ms. Remains : 2953/2958 places, 2703/2708 transitions.
Stuttering acceptance computed with spot in 532 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) p1)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 6}, { cond=(NOT p1), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=7 dest: 6}, { cond=true, acceptance={} source=7 dest: 7}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 8}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=8 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p2:(EQ s1429 1), p1:(EQ s1477 1), p0:(EQ s2306 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 8 reset in 893 ms.
Stack based approach found an accepted trace after 1782 steps with 0 reset with depth 1783 and stack size 1783 in 14 ms.
FORMULA ShieldIIPt-PT-050B-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-050B-LTLFireability-07 finished in 11538 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 2958 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2958/2958 places, 2708/2708 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 594 transitions
Trivial Post-agglo rules discarded 594 transitions
Performed 594 trivial Post agglomeration. Transition count delta: 594
Iterating post reduction 0 with 594 rules applied. Total rules applied 594 place count 2957 transition count 2113
Reduce places removed 594 places and 0 transitions.
Iterating post reduction 1 with 594 rules applied. Total rules applied 1188 place count 2363 transition count 2113
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 399 Pre rules applied. Total rules applied 1188 place count 2363 transition count 1714
Deduced a syphon composed of 399 places in 2 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 2 with 798 rules applied. Total rules applied 1986 place count 1964 transition count 1714
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1993 place count 1957 transition count 1707
Iterating global reduction 2 with 7 rules applied. Total rules applied 2000 place count 1957 transition count 1707
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 2000 place count 1957 transition count 1700
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 2014 place count 1950 transition count 1700
Performed 847 Post agglomeration using F-continuation condition.Transition count delta: 847
Deduced a syphon composed of 847 places in 1 ms
Reduce places removed 847 places and 0 transitions.
Iterating global reduction 2 with 1694 rules applied. Total rules applied 3708 place count 1103 transition count 853
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3709 place count 1103 transition count 852
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3711 place count 1102 transition count 851
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3913 place count 1001 transition count 917
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 47 places in 2 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 4007 place count 954 transition count 948
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4009 place count 952 transition count 946
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 4011 place count 950 transition count 946
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 4011 place count 950 transition count 945
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4013 place count 949 transition count 945
Applied a total of 4013 rules in 436 ms. Remains 949 /2958 variables (removed 2009) and now considering 945/2708 (removed 1763) transitions.
// Phase 1: matrix 945 rows 949 cols
[2023-03-21 23:15:59] [INFO ] Computed 449 place invariants in 4 ms
[2023-03-21 23:16:00] [INFO ] Implicit Places using invariants in 699 ms returned [938]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 715 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 948/2958 places, 945/2708 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 947 transition count 944
Applied a total of 2 rules in 40 ms. Remains 947 /948 variables (removed 1) and now considering 944/945 (removed 1) transitions.
// Phase 1: matrix 944 rows 947 cols
[2023-03-21 23:16:00] [INFO ] Computed 448 place invariants in 3 ms
[2023-03-21 23:16:00] [INFO ] Implicit Places using invariants in 789 ms returned []
[2023-03-21 23:16:00] [INFO ] Invariant cache hit.
[2023-03-21 23:16:02] [INFO ] Implicit Places using invariants and state equation in 1477 ms returned []
Implicit Place search using SMT with State Equation took 2282 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 947/2958 places, 944/2708 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3485 ms. Remains : 947/2958 places, 944/2708 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s364 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-050B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-LTLFireability-08 finished in 3589 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 2958 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2958/2958 places, 2708/2708 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2951 transition count 2701
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2951 transition count 2701
Applied a total of 14 rules in 328 ms. Remains 2951 /2958 variables (removed 7) and now considering 2701/2708 (removed 7) transitions.
// Phase 1: matrix 2701 rows 2951 cols
[2023-03-21 23:16:02] [INFO ] Computed 451 place invariants in 8 ms
[2023-03-21 23:16:04] [INFO ] Implicit Places using invariants in 1440 ms returned []
[2023-03-21 23:16:04] [INFO ] Invariant cache hit.
[2023-03-21 23:16:10] [INFO ] Implicit Places using invariants and state equation in 5954 ms returned []
Implicit Place search using SMT with State Equation took 7404 ms to find 0 implicit places.
[2023-03-21 23:16:10] [INFO ] Invariant cache hit.
[2023-03-21 23:16:13] [INFO ] Dead Transitions using invariants and state equation in 2829 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2951/2958 places, 2701/2708 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10575 ms. Remains : 2951/2958 places, 2701/2708 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s1742 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 192 reset in 471 ms.
Product exploration explored 100000 steps with 186 reset in 897 ms.
Computed a total of 798 stabilizing places and 798 stable transitions
Computed a total of 798 stabilizing places and 798 stable transitions
Detected a total of 798/2951 stabilizing places and 798/2701 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 222 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 571 steps, including 0 resets, run visited all 1 properties in 18 ms. (steps per millisecond=31 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 246 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0)]
[2023-03-21 23:16:15] [INFO ] Invariant cache hit.
[2023-03-21 23:16:18] [INFO ] [Real]Absence check using 451 positive place invariants in 780 ms returned sat
[2023-03-21 23:16:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:16:30] [INFO ] [Real]Absence check using state equation in 12142 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1 out of 2951 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2951/2951 places, 2701/2701 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 599 transitions
Trivial Post-agglo rules discarded 599 transitions
Performed 599 trivial Post agglomeration. Transition count delta: 599
Iterating post reduction 0 with 599 rules applied. Total rules applied 599 place count 2950 transition count 2101
Reduce places removed 599 places and 0 transitions.
Iterating post reduction 1 with 599 rules applied. Total rules applied 1198 place count 2351 transition count 2101
Performed 401 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 401 Pre rules applied. Total rules applied 1198 place count 2351 transition count 1700
Deduced a syphon composed of 401 places in 4 ms
Reduce places removed 401 places and 0 transitions.
Iterating global reduction 2 with 802 rules applied. Total rules applied 2000 place count 1950 transition count 1700
Performed 846 Post agglomeration using F-continuation condition.Transition count delta: 846
Deduced a syphon composed of 846 places in 1 ms
Reduce places removed 846 places and 0 transitions.
Iterating global reduction 2 with 1692 rules applied. Total rules applied 3692 place count 1104 transition count 854
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3693 place count 1104 transition count 853
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3695 place count 1103 transition count 852
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3897 place count 1002 transition count 918
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 3993 place count 954 transition count 951
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3995 place count 952 transition count 949
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 3997 place count 950 transition count 949
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3997 place count 950 transition count 948
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3999 place count 949 transition count 948
Applied a total of 3999 rules in 491 ms. Remains 949 /2951 variables (removed 2002) and now considering 948/2701 (removed 1753) transitions.
// Phase 1: matrix 948 rows 949 cols
[2023-03-21 23:16:30] [INFO ] Computed 449 place invariants in 4 ms
[2023-03-21 23:16:31] [INFO ] Implicit Places using invariants in 784 ms returned [938]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 787 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 948/2951 places, 948/2701 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 947 transition count 947
Applied a total of 2 rules in 40 ms. Remains 947 /948 variables (removed 1) and now considering 947/948 (removed 1) transitions.
// Phase 1: matrix 947 rows 947 cols
[2023-03-21 23:16:31] [INFO ] Computed 448 place invariants in 2 ms
[2023-03-21 23:16:32] [INFO ] Implicit Places using invariants in 829 ms returned []
[2023-03-21 23:16:32] [INFO ] Invariant cache hit.
[2023-03-21 23:16:33] [INFO ] Implicit Places using invariants and state equation in 1304 ms returned []
Implicit Place search using SMT with State Equation took 2137 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 947/2951 places, 947/2701 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3455 ms. Remains : 947/2951 places, 947/2701 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/947 stabilizing places and 2/947 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 219 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 227 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
[2023-03-21 23:16:34] [INFO ] Invariant cache hit.
[2023-03-21 23:16:35] [INFO ] [Real]Absence check using 448 positive place invariants in 242 ms returned sat
[2023-03-21 23:16:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:16:37] [INFO ] [Real]Absence check using state equation in 1363 ms returned sat
[2023-03-21 23:16:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 23:16:38] [INFO ] [Nat]Absence check using 448 positive place invariants in 443 ms returned sat
[2023-03-21 23:16:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 23:16:40] [INFO ] [Nat]Absence check using state equation in 1550 ms returned sat
[2023-03-21 23:16:40] [INFO ] Computed and/alt/rep : 942/1446/942 causal constraints (skipped 0 transitions) in 77 ms.
[2023-03-21 23:16:52] [INFO ] Added : 590 causal constraints over 118 iterations in 12094 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 104 ms :[(NOT p0)]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-050B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-LTLFireability-09 finished in 49889 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&(!p1 U (p2||G(!p1))))))'
Support contains 3 out of 2958 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2958/2958 places, 2708/2708 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2952 transition count 2702
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2952 transition count 2702
Applied a total of 12 rules in 376 ms. Remains 2952 /2958 variables (removed 6) and now considering 2702/2708 (removed 6) transitions.
// Phase 1: matrix 2702 rows 2952 cols
[2023-03-21 23:16:52] [INFO ] Computed 451 place invariants in 18 ms
[2023-03-21 23:16:53] [INFO ] Implicit Places using invariants in 1183 ms returned []
[2023-03-21 23:16:53] [INFO ] Invariant cache hit.
[2023-03-21 23:17:02] [INFO ] Implicit Places using invariants and state equation in 8960 ms returned []
Implicit Place search using SMT with State Equation took 10181 ms to find 0 implicit places.
[2023-03-21 23:17:02] [INFO ] Invariant cache hit.
[2023-03-21 23:17:05] [INFO ] Dead Transitions using invariants and state equation in 2109 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2952/2958 places, 2702/2708 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12703 ms. Remains : 2952/2958 places, 2702/2708 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(OR p2 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s1316 1) (NOT (AND (EQ s2772 1) (EQ s1316 1)))), p1:(AND (EQ s2772 1) (EQ s1316 1)), p0:(EQ s1436 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 835 ms.
Product exploration explored 100000 steps with 0 reset in 1147 ms.
Computed a total of 798 stabilizing places and 798 stable transitions
Computed a total of 798 stabilizing places and 798 stable transitions
Detected a total of 798/2952 stabilizing places and 798/2702 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0)))), (X (AND (NOT p2) (NOT p1))), (X (OR p2 (NOT p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (OR p2 (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 1044 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 343 ms. (steps per millisecond=29 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 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 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-21 23:17:09] [INFO ] Invariant cache hit.
[2023-03-21 23:17:10] [INFO ] [Real]Absence check using 451 positive place invariants in 324 ms returned sat
[2023-03-21 23:17:12] [INFO ] After 3636ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 23:17:14] [INFO ] [Nat]Absence check using 451 positive place invariants in 689 ms returned sat
[2023-03-21 23:17:17] [INFO ] After 2544ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 23:17:18] [INFO ] Deduced a trap composed of 16 places in 941 ms of which 2 ms to minimize.
[2023-03-21 23:17:19] [INFO ] Deduced a trap composed of 25 places in 871 ms of which 2 ms to minimize.
[2023-03-21 23:17:20] [INFO ] Deduced a trap composed of 18 places in 1360 ms of which 3 ms to minimize.
[2023-03-21 23:17:21] [INFO ] Deduced a trap composed of 21 places in 900 ms of which 2 ms to minimize.
[2023-03-21 23:17:22] [INFO ] Deduced a trap composed of 31 places in 864 ms of which 2 ms to minimize.
[2023-03-21 23:17:23] [INFO ] Deduced a trap composed of 26 places in 738 ms of which 2 ms to minimize.
[2023-03-21 23:17:24] [INFO ] Deduced a trap composed of 24 places in 928 ms of which 2 ms to minimize.
[2023-03-21 23:17:25] [INFO ] Deduced a trap composed of 38 places in 762 ms of which 3 ms to minimize.
[2023-03-21 23:17:26] [INFO ] Deduced a trap composed of 42 places in 764 ms of which 14 ms to minimize.
[2023-03-21 23:17:27] [INFO ] Deduced a trap composed of 27 places in 677 ms of which 2 ms to minimize.
[2023-03-21 23:17:28] [INFO ] Deduced a trap composed of 21 places in 688 ms of which 10 ms to minimize.
[2023-03-21 23:17:28] [INFO ] Deduced a trap composed of 40 places in 751 ms of which 1 ms to minimize.
[2023-03-21 23:17:29] [INFO ] Deduced a trap composed of 43 places in 681 ms of which 1 ms to minimize.
[2023-03-21 23:17:30] [INFO ] Deduced a trap composed of 40 places in 837 ms of which 15 ms to minimize.
[2023-03-21 23:17:31] [INFO ] Deduced a trap composed of 36 places in 621 ms of which 1 ms to minimize.
[2023-03-21 23:17:32] [INFO ] Deduced a trap composed of 34 places in 983 ms of which 1 ms to minimize.
[2023-03-21 23:17:33] [INFO ] Deduced a trap composed of 26 places in 1058 ms of which 1 ms to minimize.
[2023-03-21 23:17:34] [INFO ] Deduced a trap composed of 35 places in 835 ms of which 13 ms to minimize.
[2023-03-21 23:17:35] [INFO ] Deduced a trap composed of 32 places in 677 ms of which 2 ms to minimize.
[2023-03-21 23:17:36] [INFO ] Deduced a trap composed of 28 places in 659 ms of which 2 ms to minimize.
[2023-03-21 23:17:36] [INFO ] Deduced a trap composed of 42 places in 620 ms of which 2 ms to minimize.
[2023-03-21 23:17:37] [INFO ] Deduced a trap composed of 30 places in 744 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-21 23:17:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 23:17:37] [INFO ] After 25081ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 308 ms.
Support contains 3 out of 2952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2952/2952 places, 2702/2702 transitions.
Drop transitions removed 596 transitions
Trivial Post-agglo rules discarded 596 transitions
Performed 596 trivial Post agglomeration. Transition count delta: 596
Iterating post reduction 0 with 596 rules applied. Total rules applied 596 place count 2952 transition count 2106
Reduce places removed 596 places and 0 transitions.
Iterating post reduction 1 with 596 rules applied. Total rules applied 1192 place count 2356 transition count 2106
Performed 401 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 401 Pre rules applied. Total rules applied 1192 place count 2356 transition count 1705
Deduced a syphon composed of 401 places in 3 ms
Reduce places removed 401 places and 0 transitions.
Iterating global reduction 2 with 802 rules applied. Total rules applied 1994 place count 1955 transition count 1705
Performed 850 Post agglomeration using F-continuation condition.Transition count delta: 850
Deduced a syphon composed of 850 places in 1 ms
Reduce places removed 850 places and 0 transitions.
Iterating global reduction 2 with 1700 rules applied. Total rules applied 3694 place count 1105 transition count 855
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3695 place count 1105 transition count 854
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3697 place count 1104 transition count 853
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3899 place count 1003 transition count 920
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 47 places in 2 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 3993 place count 956 transition count 950
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3994 place count 956 transition count 949
Partial Free-agglomeration rule applied 50 times.
Drop transitions removed 50 transitions
Iterating global reduction 4 with 50 rules applied. Total rules applied 4044 place count 956 transition count 949
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4045 place count 955 transition count 948
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 4047 place count 953 transition count 948
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4047 place count 953 transition count 947
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4049 place count 952 transition count 947
Applied a total of 4049 rules in 382 ms. Remains 952 /2952 variables (removed 2000) and now considering 947/2702 (removed 1755) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 382 ms. Remains : 952/2952 places, 947/2702 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 190 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 77 ms. (steps per millisecond=129 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 86348 steps, run timeout after 3006 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 86348 steps, saw 55325 distinct states, run finished after 3007 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 947 rows 952 cols
[2023-03-21 23:17:42] [INFO ] Computed 449 place invariants in 2 ms
[2023-03-21 23:17:42] [INFO ] [Real]Absence check using 449 positive place invariants in 204 ms returned sat
[2023-03-21 23:17:43] [INFO ] After 943ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 23:17:43] [INFO ] [Nat]Absence check using 449 positive place invariants in 104 ms returned sat
[2023-03-21 23:17:44] [INFO ] After 786ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 23:17:44] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 23:17:44] [INFO ] After 166ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-21 23:17:44] [INFO ] After 425ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 174 ms.
[2023-03-21 23:17:45] [INFO ] After 1851ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 141 ms.
Support contains 3 out of 952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 947/947 transitions.
Applied a total of 0 rules in 16 ms. Remains 952 /952 variables (removed 0) and now considering 947/947 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 952/952 places, 947/947 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 947/947 transitions.
Applied a total of 0 rules in 15 ms. Remains 952 /952 variables (removed 0) and now considering 947/947 (removed 0) transitions.
[2023-03-21 23:17:45] [INFO ] Invariant cache hit.
[2023-03-21 23:17:45] [INFO ] Implicit Places using invariants in 546 ms returned [941]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 549 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 951/952 places, 947/947 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 950 transition count 946
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 950 transition count 946
Applied a total of 2 rules in 35 ms. Remains 950 /951 variables (removed 1) and now considering 946/947 (removed 1) transitions.
// Phase 1: matrix 946 rows 950 cols
[2023-03-21 23:17:45] [INFO ] Computed 448 place invariants in 3 ms
[2023-03-21 23:17:46] [INFO ] Implicit Places using invariants in 731 ms returned []
[2023-03-21 23:17:46] [INFO ] Invariant cache hit.
[2023-03-21 23:17:47] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-21 23:17:48] [INFO ] Implicit Places using invariants and state equation in 1609 ms returned []
Implicit Place search using SMT with State Equation took 2390 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 950/952 places, 946/947 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2989 ms. Remains : 950/952 places, 946/947 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 297 ms. (steps per millisecond=33 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 88747 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 88747 steps, saw 56388 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-21 23:17:52] [INFO ] Invariant cache hit.
[2023-03-21 23:17:52] [INFO ] [Real]Absence check using 448 positive place invariants in 59 ms returned sat
[2023-03-21 23:17:52] [INFO ] After 846ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 23:17:53] [INFO ] [Nat]Absence check using 448 positive place invariants in 91 ms returned sat
[2023-03-21 23:17:53] [INFO ] After 526ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 23:17:53] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-21 23:17:53] [INFO ] After 219ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-21 23:17:54] [INFO ] After 654ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 240 ms.
[2023-03-21 23:17:54] [INFO ] After 1829ms 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 122 ms.
Support contains 3 out of 950 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 950/950 places, 946/946 transitions.
Applied a total of 0 rules in 15 ms. Remains 950 /950 variables (removed 0) and now considering 946/946 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 950/950 places, 946/946 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 950/950 places, 946/946 transitions.
Applied a total of 0 rules in 16 ms. Remains 950 /950 variables (removed 0) and now considering 946/946 (removed 0) transitions.
[2023-03-21 23:17:54] [INFO ] Invariant cache hit.
[2023-03-21 23:17:55] [INFO ] Implicit Places using invariants in 596 ms returned []
[2023-03-21 23:17:55] [INFO ] Invariant cache hit.
[2023-03-21 23:17:55] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-21 23:17:56] [INFO ] Implicit Places using invariants and state equation in 1478 ms returned []
Implicit Place search using SMT with State Equation took 2099 ms to find 0 implicit places.
[2023-03-21 23:17:56] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-21 23:17:56] [INFO ] Invariant cache hit.
[2023-03-21 23:17:57] [INFO ] Dead Transitions using invariants and state equation in 633 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2793 ms. Remains : 950/950 places, 946/946 transitions.
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 99 place count 950 transition count 946
Applied a total of 99 rules in 31 ms. Remains 950 /950 variables (removed 0) and now considering 946/946 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 946 rows 950 cols
[2023-03-21 23:17:57] [INFO ] Computed 448 place invariants in 4 ms
[2023-03-21 23:17:58] [INFO ] [Real]Absence check using 448 positive place invariants in 527 ms returned sat
[2023-03-21 23:17:59] [INFO ] After 1465ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 23:17:59] [INFO ] [Nat]Absence check using 448 positive place invariants in 145 ms returned sat
[2023-03-21 23:18:00] [INFO ] After 614ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 23:18:00] [INFO ] State equation strengthened by 97 read => feed constraints.
[2023-03-21 23:18:00] [INFO ] After 313ms SMT Verify possible using 97 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-21 23:18:00] [INFO ] After 777ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 242 ms.
[2023-03-21 23:18:01] [INFO ] After 2022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0)))), (X (AND (NOT p2) (NOT p1))), (X (OR p2 (NOT p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (OR p2 (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) p2)))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2))))]
Knowledge based reduction with 14 factoid took 1111 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
// Phase 1: matrix 2702 rows 2952 cols
[2023-03-21 23:18:02] [INFO ] Computed 451 place invariants in 18 ms
[2023-03-21 23:18:05] [INFO ] [Real]Absence check using 451 positive place invariants in 828 ms returned sat
[2023-03-21 23:18:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:18:17] [INFO ] [Real]Absence check using state equation in 12229 ms returned unknown
Could not prove EG (NOT p0)
Support contains 3 out of 2952 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2952/2952 places, 2702/2702 transitions.
Applied a total of 0 rules in 190 ms. Remains 2952 /2952 variables (removed 0) and now considering 2702/2702 (removed 0) transitions.
[2023-03-21 23:18:17] [INFO ] Invariant cache hit.
[2023-03-21 23:18:19] [INFO ] Implicit Places using invariants in 1159 ms returned []
[2023-03-21 23:18:19] [INFO ] Invariant cache hit.
[2023-03-21 23:18:20] [INFO ] Implicit Places using invariants and state equation in 1031 ms returned []
Implicit Place search using SMT with State Equation took 2193 ms to find 0 implicit places.
[2023-03-21 23:18:20] [INFO ] Invariant cache hit.
[2023-03-21 23:18:23] [INFO ] Dead Transitions using invariants and state equation in 2920 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5309 ms. Remains : 2952/2952 places, 2702/2702 transitions.
Computed a total of 798 stabilizing places and 798 stable transitions
Computed a total of 798 stabilizing places and 798 stable transitions
Detected a total of 798/2952 stabilizing places and 798/2702 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (OR (NOT p1) p2)), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (NOT p1) p2))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 1055 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 278 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-21 23:18:24] [INFO ] Invariant cache hit.
[2023-03-21 23:18:25] [INFO ] [Real]Absence check using 451 positive place invariants in 213 ms returned sat
[2023-03-21 23:18:27] [INFO ] After 3005ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 23:18:28] [INFO ] [Nat]Absence check using 451 positive place invariants in 443 ms returned sat
[2023-03-21 23:18:31] [INFO ] After 2177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 23:18:32] [INFO ] Deduced a trap composed of 16 places in 814 ms of which 1 ms to minimize.
[2023-03-21 23:18:33] [INFO ] Deduced a trap composed of 25 places in 674 ms of which 1 ms to minimize.
[2023-03-21 23:18:33] [INFO ] Deduced a trap composed of 18 places in 755 ms of which 2 ms to minimize.
[2023-03-21 23:18:34] [INFO ] Deduced a trap composed of 21 places in 758 ms of which 2 ms to minimize.
[2023-03-21 23:18:35] [INFO ] Deduced a trap composed of 31 places in 715 ms of which 2 ms to minimize.
[2023-03-21 23:18:36] [INFO ] Deduced a trap composed of 26 places in 772 ms of which 14 ms to minimize.
[2023-03-21 23:18:37] [INFO ] Deduced a trap composed of 24 places in 710 ms of which 4 ms to minimize.
[2023-03-21 23:18:38] [INFO ] Deduced a trap composed of 38 places in 870 ms of which 1 ms to minimize.
[2023-03-21 23:18:39] [INFO ] Deduced a trap composed of 42 places in 1007 ms of which 3 ms to minimize.
[2023-03-21 23:18:40] [INFO ] Deduced a trap composed of 27 places in 736 ms of which 10 ms to minimize.
[2023-03-21 23:18:41] [INFO ] Deduced a trap composed of 21 places in 775 ms of which 2 ms to minimize.
[2023-03-21 23:18:42] [INFO ] Deduced a trap composed of 40 places in 672 ms of which 20 ms to minimize.
[2023-03-21 23:18:42] [INFO ] Deduced a trap composed of 43 places in 657 ms of which 1 ms to minimize.
[2023-03-21 23:18:43] [INFO ] Deduced a trap composed of 40 places in 857 ms of which 10 ms to minimize.
[2023-03-21 23:18:45] [INFO ] Deduced a trap composed of 36 places in 981 ms of which 2 ms to minimize.
[2023-03-21 23:18:45] [INFO ] Deduced a trap composed of 34 places in 814 ms of which 9 ms to minimize.
[2023-03-21 23:18:46] [INFO ] Deduced a trap composed of 26 places in 696 ms of which 2 ms to minimize.
[2023-03-21 23:18:47] [INFO ] Deduced a trap composed of 35 places in 847 ms of which 37 ms to minimize.
[2023-03-21 23:18:48] [INFO ] Deduced a trap composed of 32 places in 764 ms of which 24 ms to minimize.
[2023-03-21 23:18:49] [INFO ] Deduced a trap composed of 28 places in 592 ms of which 1 ms to minimize.
[2023-03-21 23:18:50] [INFO ] Deduced a trap composed of 42 places in 1043 ms of which 2 ms to minimize.
[2023-03-21 23:18:51] [INFO ] Deduced a trap composed of 30 places in 533 ms of which 1 ms to minimize.
[2023-03-21 23:18:51] [INFO ] Deduced a trap composed of 37 places in 562 ms of which 1 ms to minimize.
[2023-03-21 23:18:52] [INFO ] Deduced a trap composed of 38 places in 492 ms of which 1 ms to minimize.
[2023-03-21 23:18:53] [INFO ] Deduced a trap composed of 42 places in 1261 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java: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-21 23:18:53] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 23:18:53] [INFO ] After 25692ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 292 ms.
Support contains 3 out of 2952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2952/2952 places, 2702/2702 transitions.
Drop transitions removed 596 transitions
Trivial Post-agglo rules discarded 596 transitions
Performed 596 trivial Post agglomeration. Transition count delta: 596
Iterating post reduction 0 with 596 rules applied. Total rules applied 596 place count 2952 transition count 2106
Reduce places removed 596 places and 0 transitions.
Iterating post reduction 1 with 596 rules applied. Total rules applied 1192 place count 2356 transition count 2106
Performed 401 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 401 Pre rules applied. Total rules applied 1192 place count 2356 transition count 1705
Deduced a syphon composed of 401 places in 3 ms
Reduce places removed 401 places and 0 transitions.
Iterating global reduction 2 with 802 rules applied. Total rules applied 1994 place count 1955 transition count 1705
Performed 850 Post agglomeration using F-continuation condition.Transition count delta: 850
Deduced a syphon composed of 850 places in 1 ms
Reduce places removed 850 places and 0 transitions.
Iterating global reduction 2 with 1700 rules applied. Total rules applied 3694 place count 1105 transition count 855
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3695 place count 1105 transition count 854
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3697 place count 1104 transition count 853
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3899 place count 1003 transition count 920
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 3993 place count 956 transition count 950
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3994 place count 956 transition count 949
Partial Free-agglomeration rule applied 50 times.
Drop transitions removed 50 transitions
Iterating global reduction 4 with 50 rules applied. Total rules applied 4044 place count 956 transition count 949
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4045 place count 955 transition count 948
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 4047 place count 953 transition count 948
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4047 place count 953 transition count 947
Deduced a syphon composed of 1 places in 16 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4049 place count 952 transition count 947
Applied a total of 4049 rules in 418 ms. Remains 952 /2952 variables (removed 2000) and now considering 947/2702 (removed 1755) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 419 ms. Remains : 952/2952 places, 947/2702 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 106381 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 106381 steps, saw 68582 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 947 rows 952 cols
[2023-03-21 23:18:58] [INFO ] Computed 449 place invariants in 4 ms
[2023-03-21 23:18:58] [INFO ] [Real]Absence check using 449 positive place invariants in 60 ms returned sat
[2023-03-21 23:18:58] [INFO ] After 836ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 23:18:59] [INFO ] [Nat]Absence check using 449 positive place invariants in 108 ms returned sat
[2023-03-21 23:19:00] [INFO ] After 659ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 23:19:00] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 23:19:00] [INFO ] After 251ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-21 23:19:00] [INFO ] After 649ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 245 ms.
[2023-03-21 23:19:00] [INFO ] After 2081ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 187 ms.
Support contains 3 out of 952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 947/947 transitions.
Applied a total of 0 rules in 20 ms. Remains 952 /952 variables (removed 0) and now considering 947/947 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 952/952 places, 947/947 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 947/947 transitions.
Applied a total of 0 rules in 17 ms. Remains 952 /952 variables (removed 0) and now considering 947/947 (removed 0) transitions.
[2023-03-21 23:19:01] [INFO ] Invariant cache hit.
[2023-03-21 23:19:01] [INFO ] Implicit Places using invariants in 649 ms returned [941]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 663 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 951/952 places, 947/947 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 950 transition count 946
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 950 transition count 946
Applied a total of 2 rules in 28 ms. Remains 950 /951 variables (removed 1) and now considering 946/947 (removed 1) transitions.
// Phase 1: matrix 946 rows 950 cols
[2023-03-21 23:19:01] [INFO ] Computed 448 place invariants in 2 ms
[2023-03-21 23:19:02] [INFO ] Implicit Places using invariants in 808 ms returned []
[2023-03-21 23:19:02] [INFO ] Invariant cache hit.
[2023-03-21 23:19:03] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-21 23:19:04] [INFO ] Implicit Places using invariants and state equation in 1643 ms returned []
Implicit Place search using SMT with State Equation took 2461 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 950/952 places, 946/947 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3169 ms. Remains : 950/952 places, 946/947 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 80030 steps, run timeout after 3006 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 80030 steps, saw 50883 distinct states, run finished after 3006 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-21 23:19:07] [INFO ] Invariant cache hit.
[2023-03-21 23:19:08] [INFO ] [Real]Absence check using 448 positive place invariants in 102 ms returned sat
[2023-03-21 23:19:08] [INFO ] After 859ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 23:19:09] [INFO ] [Nat]Absence check using 448 positive place invariants in 64 ms returned sat
[2023-03-21 23:19:09] [INFO ] After 504ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 23:19:09] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-21 23:19:09] [INFO ] After 217ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-21 23:19:10] [INFO ] After 621ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 258 ms.
[2023-03-21 23:19:10] [INFO ] After 1662ms 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 88 ms.
Support contains 3 out of 950 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 950/950 places, 946/946 transitions.
Applied a total of 0 rules in 16 ms. Remains 950 /950 variables (removed 0) and now considering 946/946 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 950/950 places, 946/946 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 950/950 places, 946/946 transitions.
Applied a total of 0 rules in 14 ms. Remains 950 /950 variables (removed 0) and now considering 946/946 (removed 0) transitions.
[2023-03-21 23:19:10] [INFO ] Invariant cache hit.
[2023-03-21 23:19:11] [INFO ] Implicit Places using invariants in 756 ms returned []
[2023-03-21 23:19:11] [INFO ] Invariant cache hit.
[2023-03-21 23:19:11] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-21 23:19:12] [INFO ] Implicit Places using invariants and state equation in 1588 ms returned []
Implicit Place search using SMT with State Equation took 2359 ms to find 0 implicit places.
[2023-03-21 23:19:12] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-21 23:19:12] [INFO ] Invariant cache hit.
[2023-03-21 23:19:13] [INFO ] Dead Transitions using invariants and state equation in 619 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3045 ms. Remains : 950/950 places, 946/946 transitions.
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 99 place count 950 transition count 946
Applied a total of 99 rules in 35 ms. Remains 950 /950 variables (removed 0) and now considering 946/946 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 946 rows 950 cols
[2023-03-21 23:19:13] [INFO ] Computed 448 place invariants in 2 ms
[2023-03-21 23:19:14] [INFO ] [Real]Absence check using 448 positive place invariants in 98 ms returned sat
[2023-03-21 23:19:14] [INFO ] After 939ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 23:19:14] [INFO ] [Nat]Absence check using 448 positive place invariants in 82 ms returned sat
[2023-03-21 23:19:15] [INFO ] After 694ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 23:19:15] [INFO ] State equation strengthened by 97 read => feed constraints.
[2023-03-21 23:19:16] [INFO ] After 334ms SMT Verify possible using 97 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-21 23:19:16] [INFO ] After 834ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 297 ms.
[2023-03-21 23:19:16] [INFO ] After 2235ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (OR (NOT p1) p2)), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (NOT p1) p2))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) p2)))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2))))]
Knowledge based reduction with 14 factoid took 993 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
// Phase 1: matrix 2702 rows 2952 cols
[2023-03-21 23:19:18] [INFO ] Computed 451 place invariants in 8 ms
[2023-03-21 23:19:21] [INFO ] [Real]Absence check using 451 positive place invariants in 815 ms returned sat
[2023-03-21 23:19:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:19:33] [INFO ] [Real]Absence check using state equation in 12032 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 959 ms.
Product exploration explored 100000 steps with 0 reset in 1222 ms.
Support contains 3 out of 2952 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2952/2952 places, 2702/2702 transitions.
Applied a total of 0 rules in 212 ms. Remains 2952 /2952 variables (removed 0) and now considering 2702/2702 (removed 0) transitions.
[2023-03-21 23:19:36] [INFO ] Invariant cache hit.
[2023-03-21 23:19:37] [INFO ] Implicit Places using invariants in 1353 ms returned []
[2023-03-21 23:19:37] [INFO ] Invariant cache hit.
[2023-03-21 23:19:40] [INFO ] Implicit Places using invariants and state equation in 3464 ms returned []
Implicit Place search using SMT with State Equation took 4850 ms to find 0 implicit places.
[2023-03-21 23:19:40] [INFO ] Invariant cache hit.
[2023-03-21 23:19:43] [INFO ] Dead Transitions using invariants and state equation in 2308 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7371 ms. Remains : 2952/2952 places, 2702/2702 transitions.
Treatment of property ShieldIIPt-PT-050B-LTLFireability-10 finished in 171151 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&G(p1))))'
Support contains 3 out of 2958 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2958/2958 places, 2708/2708 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2951 transition count 2701
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2951 transition count 2701
Applied a total of 14 rules in 389 ms. Remains 2951 /2958 variables (removed 7) and now considering 2701/2708 (removed 7) transitions.
// Phase 1: matrix 2701 rows 2951 cols
[2023-03-21 23:19:43] [INFO ] Computed 451 place invariants in 18 ms
[2023-03-21 23:19:45] [INFO ] Implicit Places using invariants in 1358 ms returned []
[2023-03-21 23:19:45] [INFO ] Invariant cache hit.
[2023-03-21 23:19:48] [INFO ] Implicit Places using invariants and state equation in 3289 ms returned []
Implicit Place search using SMT with State Equation took 4674 ms to find 0 implicit places.
[2023-03-21 23:19:48] [INFO ] Invariant cache hit.
[2023-03-21 23:19:50] [INFO ] Dead Transitions using invariants and state equation in 2208 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2951/2958 places, 2701/2708 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7271 ms. Remains : 2951/2958 places, 2701/2708 transitions.
Stuttering acceptance computed with spot in 255 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(AND (OR (EQ s1666 1) (EQ s862 1)) (EQ s2285 0)), p0:(OR (EQ s862 1) (EQ s2285 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-050B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-LTLFireability-12 finished in 7573 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&X(G((p0||X(G(p0)))))))))'
Support contains 1 out of 2958 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2958/2958 places, 2708/2708 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2951 transition count 2701
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2951 transition count 2701
Applied a total of 14 rules in 321 ms. Remains 2951 /2958 variables (removed 7) and now considering 2701/2708 (removed 7) transitions.
[2023-03-21 23:19:51] [INFO ] Invariant cache hit.
[2023-03-21 23:19:52] [INFO ] Implicit Places using invariants in 1257 ms returned []
[2023-03-21 23:19:52] [INFO ] Invariant cache hit.
[2023-03-21 23:19:55] [INFO ] Implicit Places using invariants and state equation in 3221 ms returned []
Implicit Place search using SMT with State Equation took 4499 ms to find 0 implicit places.
[2023-03-21 23:19:55] [INFO ] Invariant cache hit.
[2023-03-21 23:19:58] [INFO ] Dead Transitions using invariants and state equation in 2528 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2951/2958 places, 2701/2708 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7356 ms. Remains : 2951/2958 places, 2701/2708 transitions.
Stuttering acceptance computed with spot in 312 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 3}]], initial=2, aps=[p0:(NEQ s2529 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 112 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-050B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-050B-LTLFireability-15 finished in 7701 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&(!p1 U (p2||G(!p1))))))'
Found a Shortening insensitive property : ShieldIIPt-PT-050B-LTLFireability-10
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Support contains 3 out of 2958 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2958/2958 places, 2708/2708 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 593 transitions
Trivial Post-agglo rules discarded 593 transitions
Performed 593 trivial Post agglomeration. Transition count delta: 593
Iterating post reduction 0 with 593 rules applied. Total rules applied 593 place count 2957 transition count 2114
Reduce places removed 593 places and 0 transitions.
Iterating post reduction 1 with 593 rules applied. Total rules applied 1186 place count 2364 transition count 2114
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 399 Pre rules applied. Total rules applied 1186 place count 2364 transition count 1715
Deduced a syphon composed of 399 places in 3 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 2 with 798 rules applied. Total rules applied 1984 place count 1965 transition count 1715
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1990 place count 1959 transition count 1709
Iterating global reduction 2 with 6 rules applied. Total rules applied 1996 place count 1959 transition count 1709
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 1996 place count 1959 transition count 1703
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 2008 place count 1953 transition count 1703
Performed 847 Post agglomeration using F-continuation condition.Transition count delta: 847
Deduced a syphon composed of 847 places in 2 ms
Reduce places removed 847 places and 0 transitions.
Iterating global reduction 2 with 1694 rules applied. Total rules applied 3702 place count 1106 transition count 856
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3703 place count 1106 transition count 855
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3705 place count 1105 transition count 854
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3907 place count 1004 transition count 921
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 4001 place count 957 transition count 951
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4003 place count 955 transition count 949
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 4005 place count 953 transition count 949
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 4005 place count 953 transition count 948
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4007 place count 952 transition count 948
Applied a total of 4007 rules in 572 ms. Remains 952 /2958 variables (removed 2006) and now considering 948/2708 (removed 1760) transitions.
// Phase 1: matrix 948 rows 952 cols
[2023-03-21 23:19:59] [INFO ] Computed 449 place invariants in 1 ms
[2023-03-21 23:20:00] [INFO ] Implicit Places using invariants in 615 ms returned [941]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 617 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 951/2958 places, 948/2708 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 950 transition count 947
Applied a total of 2 rules in 27 ms. Remains 950 /951 variables (removed 1) and now considering 947/948 (removed 1) transitions.
// Phase 1: matrix 947 rows 950 cols
[2023-03-21 23:20:00] [INFO ] Computed 448 place invariants in 2 ms
[2023-03-21 23:20:00] [INFO ] Implicit Places using invariants in 650 ms returned []
[2023-03-21 23:20:00] [INFO ] Invariant cache hit.
[2023-03-21 23:20:01] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-21 23:20:02] [INFO ] Implicit Places using invariants and state equation in 1699 ms returned []
Implicit Place search using SMT with State Equation took 2375 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 950/2958 places, 947/2708 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 3591 ms. Remains : 950/2958 places, 947/2708 transitions.
Running random walk in product with property : ShieldIIPt-PT-050B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(OR p2 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s419 1) (NOT (AND (EQ s897 1) (EQ s419 1)))), p1:(AND (EQ s897 1) (EQ s419 1)), p0:(EQ s459 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
Treatment of property ShieldIIPt-PT-050B-LTLFireability-10 finished in 3842 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-21 23:20:02] [INFO ] Flatten gal took : 112 ms
[2023-03-21 23:20:02] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-21 23:20:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2958 places, 2708 transitions and 7016 arcs took 19 ms.
Total runtime 409563 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1734/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldIIPt-PT-050B-LTLFireability-10

BK_STOP 1679440805032

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

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-050B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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