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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.0K Feb 25 17:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 17:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 17:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 17:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 17:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 17:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 25 17:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 686K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679439187389

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-040B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 22:53:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 22:53:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 22:53:10] [INFO ] Load time of PNML (sax parser for PT used): 214 ms
[2023-03-21 22:53:10] [INFO ] Transformed 2803 places.
[2023-03-21 22:53:10] [INFO ] Transformed 2603 transitions.
[2023-03-21 22:53:10] [INFO ] Found NUPN structural information;
[2023-03-21 22:53:10] [INFO ] Parsed PT model containing 2803 places and 2603 transitions and 6486 arcs in 540 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldIIPt-PT-040B-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 2803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2803/2803 places, 2603/2603 transitions.
Discarding 427 places :
Symmetric choice reduction at 0 with 427 rule applications. Total rules 427 place count 2376 transition count 2176
Iterating global reduction 0 with 427 rules applied. Total rules applied 854 place count 2376 transition count 2176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 855 place count 2375 transition count 2175
Iterating global reduction 0 with 1 rules applied. Total rules applied 856 place count 2375 transition count 2175
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 857 place count 2374 transition count 2174
Iterating global reduction 0 with 1 rules applied. Total rules applied 858 place count 2374 transition count 2174
Applied a total of 858 rules in 1478 ms. Remains 2374 /2803 variables (removed 429) and now considering 2174/2603 (removed 429) transitions.
// Phase 1: matrix 2174 rows 2374 cols
[2023-03-21 22:53:12] [INFO ] Computed 361 place invariants in 34 ms
[2023-03-21 22:53:14] [INFO ] Implicit Places using invariants in 1731 ms returned []
[2023-03-21 22:53:14] [INFO ] Invariant cache hit.
[2023-03-21 22:53:17] [INFO ] Implicit Places using invariants and state equation in 3397 ms returned []
Implicit Place search using SMT with State Equation took 5206 ms to find 0 implicit places.
[2023-03-21 22:53:17] [INFO ] Invariant cache hit.
[2023-03-21 22:53:19] [INFO ] Dead Transitions using invariants and state equation in 1790 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2374/2803 places, 2174/2603 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8478 ms. Remains : 2374/2803 places, 2174/2603 transitions.
Support contains 33 out of 2374 places after structural reductions.
[2023-03-21 22:53:19] [INFO ] Flatten gal took : 186 ms
[2023-03-21 22:53:20] [INFO ] Flatten gal took : 78 ms
[2023-03-21 22:53:20] [INFO ] Input system was already deterministic with 2174 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 581 ms. (steps per millisecond=17 ) properties (out of 21) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) 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 9) 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 9) 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 9) 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 9) 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 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) 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 9) seen :0
Running SMT prover for 9 properties.
[2023-03-21 22:53:21] [INFO ] Invariant cache hit.
[2023-03-21 22:53:22] [INFO ] [Real]Absence check using 361 positive place invariants in 199 ms returned sat
[2023-03-21 22:53:22] [INFO ] After 1237ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-21 22:53:23] [INFO ] [Nat]Absence check using 361 positive place invariants in 240 ms returned sat
[2023-03-21 22:53:26] [INFO ] After 3009ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-21 22:53:28] [INFO ] Deduced a trap composed of 17 places in 1263 ms of which 5 ms to minimize.
[2023-03-21 22:53:29] [INFO ] Deduced a trap composed of 20 places in 1312 ms of which 1 ms to minimize.
[2023-03-21 22:53:31] [INFO ] Deduced a trap composed of 16 places in 1828 ms of which 27 ms to minimize.
[2023-03-21 22:53:32] [INFO ] Deduced a trap composed of 21 places in 614 ms of which 12 ms to minimize.
[2023-03-21 22:53:32] [INFO ] Deduced a trap composed of 23 places in 484 ms of which 3 ms to minimize.
[2023-03-21 22:53:33] [INFO ] Deduced a trap composed of 25 places in 509 ms of which 1 ms to minimize.
[2023-03-21 22:53:34] [INFO ] Deduced a trap composed of 25 places in 482 ms of which 2 ms to minimize.
[2023-03-21 22:53:34] [INFO ] Deduced a trap composed of 20 places in 520 ms of which 3 ms to minimize.
[2023-03-21 22:53:35] [INFO ] Deduced a trap composed of 38 places in 390 ms of which 1 ms to minimize.
[2023-03-21 22:53:36] [INFO ] Deduced a trap composed of 19 places in 864 ms of which 2 ms to minimize.
[2023-03-21 22:53:36] [INFO ] Deduced a trap composed of 35 places in 571 ms of which 1 ms to minimize.
[2023-03-21 22:53:37] [INFO ] Deduced a trap composed of 36 places in 362 ms of which 1 ms to minimize.
[2023-03-21 22:53:37] [INFO ] Deduced a trap composed of 26 places in 627 ms of which 1 ms to minimize.
[2023-03-21 22:53:38] [INFO ] Deduced a trap composed of 27 places in 395 ms of which 1 ms to minimize.
[2023-03-21 22:53:38] [INFO ] Deduced a trap composed of 20 places in 430 ms of which 1 ms to minimize.
[2023-03-21 22:53:39] [INFO ] Deduced a trap composed of 26 places in 375 ms of which 1 ms to minimize.
[2023-03-21 22:53:39] [INFO ] Deduced a trap composed of 16 places in 489 ms of which 1 ms to minimize.
[2023-03-21 22:53:40] [INFO ] Deduced a trap composed of 25 places in 387 ms of which 1 ms to minimize.
[2023-03-21 22:53:40] [INFO ] Deduced a trap composed of 23 places in 444 ms of which 1 ms to minimize.
[2023-03-21 22:53:41] [INFO ] Deduced a trap composed of 18 places in 504 ms of which 1 ms to minimize.
[2023-03-21 22:53:42] [INFO ] Deduced a trap composed of 36 places in 666 ms of which 2 ms to minimize.
[2023-03-21 22:53:42] [INFO ] Deduced a trap composed of 37 places in 518 ms of which 14 ms to minimize.
[2023-03-21 22:53:43] [INFO ] Deduced a trap composed of 37 places in 391 ms of which 1 ms to minimize.
[2023-03-21 22:53:43] [INFO ] Deduced a trap composed of 43 places in 346 ms of which 1 ms to minimize.
[2023-03-21 22:53:44] [INFO ] Deduced a trap composed of 40 places in 351 ms of which 1 ms to minimize.
[2023-03-21 22:53:44] [INFO ] Deduced a trap composed of 33 places in 386 ms of which 1 ms to minimize.
[2023-03-21 22:53:45] [INFO ] Deduced a trap composed of 39 places in 879 ms of which 1 ms to minimize.
[2023-03-21 22:53:46] [INFO ] Deduced a trap composed of 37 places in 389 ms of which 1 ms to minimize.
[2023-03-21 22:53:46] [INFO ] Deduced a trap composed of 40 places in 333 ms of which 2 ms to minimize.
[2023-03-21 22:53:47] [INFO ] Deduced a trap composed of 38 places in 509 ms of which 0 ms to minimize.
[2023-03-21 22:53:47] [INFO ] Deduced a trap composed of 49 places in 402 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 22:53:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 22:53:47] [INFO ] After 25179ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Parikh walk visited 0 properties in 917 ms.
Support contains 16 out of 2374 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2374/2374 places, 2174/2174 transitions.
Drop transitions removed 472 transitions
Trivial Post-agglo rules discarded 472 transitions
Performed 472 trivial Post agglomeration. Transition count delta: 472
Iterating post reduction 0 with 472 rules applied. Total rules applied 472 place count 2374 transition count 1702
Reduce places removed 472 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 473 rules applied. Total rules applied 945 place count 1902 transition count 1701
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 946 place count 1901 transition count 1701
Performed 311 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 311 Pre rules applied. Total rules applied 946 place count 1901 transition count 1390
Deduced a syphon composed of 311 places in 2 ms
Reduce places removed 311 places and 0 transitions.
Iterating global reduction 3 with 622 rules applied. Total rules applied 1568 place count 1590 transition count 1390
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1574 place count 1584 transition count 1384
Iterating global reduction 3 with 6 rules applied. Total rules applied 1580 place count 1584 transition count 1384
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 1580 place count 1584 transition count 1378
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 1592 place count 1578 transition count 1378
Performed 676 Post agglomeration using F-continuation condition.Transition count delta: 676
Deduced a syphon composed of 676 places in 3 ms
Reduce places removed 676 places and 0 transitions.
Iterating global reduction 3 with 1352 rules applied. Total rules applied 2944 place count 902 transition count 702
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2945 place count 902 transition count 701
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2947 place count 901 transition count 700
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -63
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3149 place count 800 transition count 763
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 3181 place count 784 transition count 774
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3182 place count 784 transition count 773
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3184 place count 784 transition count 771
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 3186 place count 782 transition count 771
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 6 with 40 rules applied. Total rules applied 3226 place count 782 transition count 771
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3227 place count 781 transition count 770
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 3229 place count 779 transition count 770
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 3229 place count 779 transition count 769
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 3231 place count 778 transition count 769
Applied a total of 3231 rules in 636 ms. Remains 778 /2374 variables (removed 1596) and now considering 769/2174 (removed 1405) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 638 ms. Remains : 778/2374 places, 769/2174 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 769 rows 778 cols
[2023-03-21 22:53:50] [INFO ] Computed 359 place invariants in 3 ms
[2023-03-21 22:53:50] [INFO ] [Real]Absence check using 359 positive place invariants in 78 ms returned sat
[2023-03-21 22:53:50] [INFO ] After 409ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-21 22:53:50] [INFO ] [Nat]Absence check using 359 positive place invariants in 105 ms returned sat
[2023-03-21 22:53:51] [INFO ] After 935ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-21 22:53:51] [INFO ] State equation strengthened by 137 read => feed constraints.
[2023-03-21 22:53:52] [INFO ] After 862ms SMT Verify possible using 137 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-21 22:53:52] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 2 ms to minimize.
[2023-03-21 22:53:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2023-03-21 22:53:53] [INFO ] After 1868ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1143 ms.
[2023-03-21 22:53:54] [INFO ] After 4486ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 328 ms.
Support contains 14 out of 778 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 778/778 places, 769/769 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 778 transition count 768
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 777 transition count 768
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 0 with 2 rules applied. Total rules applied 4 place count 776 transition count 767
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 775 transition count 766
Applied a total of 5 rules in 99 ms. Remains 775 /778 variables (removed 3) and now considering 766/769 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 775/778 places, 766/769 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 436 ms. (steps per millisecond=22 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 97643 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 97643 steps, saw 62670 distinct states, run finished after 3003 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 766 rows 775 cols
[2023-03-21 22:53:59] [INFO ] Computed 359 place invariants in 3 ms
[2023-03-21 22:53:59] [INFO ] [Real]Absence check using 359 positive place invariants in 58 ms returned sat
[2023-03-21 22:53:59] [INFO ] After 257ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-21 22:53:59] [INFO ] [Nat]Absence check using 359 positive place invariants in 59 ms returned sat
[2023-03-21 22:54:00] [INFO ] After 681ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-21 22:54:00] [INFO ] State equation strengthened by 137 read => feed constraints.
[2023-03-21 22:54:02] [INFO ] After 1233ms SMT Verify possible using 137 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-21 22:54:02] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 14 ms to minimize.
[2023-03-21 22:54:02] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 1 ms to minimize.
[2023-03-21 22:54:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 292 ms
[2023-03-21 22:54:03] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 0 ms to minimize.
[2023-03-21 22:54:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2023-03-21 22:54:03] [INFO ] After 2601ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1029 ms.
[2023-03-21 22:54:04] [INFO ] After 4754ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 282 ms.
Support contains 14 out of 775 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 775/775 places, 766/766 transitions.
Applied a total of 0 rules in 33 ms. Remains 775 /775 variables (removed 0) and now considering 766/766 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 775/775 places, 766/766 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 775/775 places, 766/766 transitions.
Applied a total of 0 rules in 31 ms. Remains 775 /775 variables (removed 0) and now considering 766/766 (removed 0) transitions.
[2023-03-21 22:54:04] [INFO ] Invariant cache hit.
[2023-03-21 22:54:06] [INFO ] Implicit Places using invariants in 2083 ms returned [764]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2085 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 774/775 places, 766/766 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 773 transition count 765
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 773 transition count 765
Applied a total of 2 rules in 30 ms. Remains 773 /774 variables (removed 1) and now considering 765/766 (removed 1) transitions.
// Phase 1: matrix 765 rows 773 cols
[2023-03-21 22:54:06] [INFO ] Computed 358 place invariants in 3 ms
[2023-03-21 22:54:07] [INFO ] Implicit Places using invariants in 394 ms returned []
[2023-03-21 22:54:07] [INFO ] Invariant cache hit.
[2023-03-21 22:54:08] [INFO ] State equation strengthened by 136 read => feed constraints.
[2023-03-21 22:54:09] [INFO ] Implicit Places using invariants and state equation in 2178 ms returned []
Implicit Place search using SMT with State Equation took 2578 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 773/775 places, 765/766 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4733 ms. Remains : 773/775 places, 765/766 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 268 ms. (steps per millisecond=37 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 8) 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 8) 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 8) seen :0
Interrupted probabilistic random walk after 93504 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 93504 steps, saw 60373 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 8 properties.
[2023-03-21 22:54:13] [INFO ] Invariant cache hit.
[2023-03-21 22:54:13] [INFO ] [Real]Absence check using 358 positive place invariants in 131 ms returned sat
[2023-03-21 22:54:13] [INFO ] After 331ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-21 22:54:14] [INFO ] [Nat]Absence check using 358 positive place invariants in 71 ms returned sat
[2023-03-21 22:54:15] [INFO ] After 646ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-21 22:54:15] [INFO ] State equation strengthened by 136 read => feed constraints.
[2023-03-21 22:54:16] [INFO ] After 1158ms SMT Verify possible using 136 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-21 22:54:16] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2023-03-21 22:54:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 341 ms
[2023-03-21 22:54:17] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 1 ms to minimize.
[2023-03-21 22:54:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2023-03-21 22:54:17] [INFO ] After 2591ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 550 ms.
[2023-03-21 22:54:18] [INFO ] After 4284ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 291 ms.
Support contains 14 out of 773 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 773/773 places, 765/765 transitions.
Applied a total of 0 rules in 17 ms. Remains 773 /773 variables (removed 0) and now considering 765/765 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 773/773 places, 765/765 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 773/773 places, 765/765 transitions.
Applied a total of 0 rules in 15 ms. Remains 773 /773 variables (removed 0) and now considering 765/765 (removed 0) transitions.
[2023-03-21 22:54:18] [INFO ] Invariant cache hit.
[2023-03-21 22:54:18] [INFO ] Implicit Places using invariants in 366 ms returned []
[2023-03-21 22:54:18] [INFO ] Invariant cache hit.
[2023-03-21 22:54:19] [INFO ] State equation strengthened by 136 read => feed constraints.
[2023-03-21 22:54:20] [INFO ] Implicit Places using invariants and state equation in 1808 ms returned []
Implicit Place search using SMT with State Equation took 2191 ms to find 0 implicit places.
[2023-03-21 22:54:20] [INFO ] Redundant transitions in 42 ms returned []
[2023-03-21 22:54:20] [INFO ] Invariant cache hit.
[2023-03-21 22:54:21] [INFO ] Dead Transitions using invariants and state equation in 505 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2770 ms. Remains : 773/773 places, 765/765 transitions.
Partial Free-agglomeration rule applied 125 times.
Drop transitions removed 125 transitions
Iterating global reduction 0 with 125 rules applied. Total rules applied 125 place count 773 transition count 765
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 126 place count 773 transition count 764
Applied a total of 126 rules in 47 ms. Remains 773 /773 variables (removed 0) and now considering 764/765 (removed 1) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 764 rows 773 cols
[2023-03-21 22:54:21] [INFO ] Computed 358 place invariants in 3 ms
[2023-03-21 22:54:21] [INFO ] [Real]Absence check using 358 positive place invariants in 128 ms returned sat
[2023-03-21 22:54:21] [INFO ] After 338ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-21 22:54:22] [INFO ] [Nat]Absence check using 358 positive place invariants in 127 ms returned sat
[2023-03-21 22:54:22] [INFO ] After 697ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-21 22:54:22] [INFO ] State equation strengthened by 119 read => feed constraints.
[2023-03-21 22:54:23] [INFO ] After 564ms SMT Verify possible using 119 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-21 22:54:23] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 1 ms to minimize.
[2023-03-21 22:54:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 242 ms
[2023-03-21 22:54:24] [INFO ] After 1445ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 372 ms.
[2023-03-21 22:54:24] [INFO ] After 3035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Computed a total of 640 stabilizing places and 640 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' '!((p0 U G(p1)))'
Support contains 3 out of 2374 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2374/2374 places, 2174/2174 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 479 transitions
Trivial Post-agglo rules discarded 479 transitions
Performed 479 trivial Post agglomeration. Transition count delta: 479
Iterating post reduction 0 with 479 rules applied. Total rules applied 479 place count 2373 transition count 1694
Reduce places removed 479 places and 0 transitions.
Iterating post reduction 1 with 479 rules applied. Total rules applied 958 place count 1894 transition count 1694
Performed 313 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 313 Pre rules applied. Total rules applied 958 place count 1894 transition count 1381
Deduced a syphon composed of 313 places in 2 ms
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 2 with 626 rules applied. Total rules applied 1584 place count 1581 transition count 1381
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 1592 place count 1573 transition count 1373
Iterating global reduction 2 with 8 rules applied. Total rules applied 1600 place count 1573 transition count 1373
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 1600 place count 1573 transition count 1366
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 1614 place count 1566 transition count 1366
Performed 680 Post agglomeration using F-continuation condition.Transition count delta: 680
Deduced a syphon composed of 680 places in 1 ms
Reduce places removed 680 places and 0 transitions.
Iterating global reduction 2 with 1360 rules applied. Total rules applied 2974 place count 886 transition count 686
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2975 place count 886 transition count 685
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2977 place count 885 transition count 684
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3179 place count 784 transition count 751
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 3213 place count 767 transition count 762
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 3214 place count 767 transition count 762
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3216 place count 765 transition count 760
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 3218 place count 763 transition count 760
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3218 place count 763 transition count 759
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 3220 place count 762 transition count 759
Applied a total of 3220 rules in 508 ms. Remains 762 /2374 variables (removed 1612) and now considering 759/2174 (removed 1415) transitions.
// Phase 1: matrix 759 rows 762 cols
[2023-03-21 22:54:25] [INFO ] Computed 359 place invariants in 5 ms
[2023-03-21 22:54:26] [INFO ] Implicit Places using invariants in 420 ms returned [751]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 421 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 761/2374 places, 759/2174 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 760 transition count 758
Applied a total of 2 rules in 27 ms. Remains 760 /761 variables (removed 1) and now considering 758/759 (removed 1) transitions.
// Phase 1: matrix 758 rows 760 cols
[2023-03-21 22:54:26] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-21 22:54:26] [INFO ] Implicit Places using invariants in 398 ms returned []
[2023-03-21 22:54:26] [INFO ] Invariant cache hit.
[2023-03-21 22:54:27] [INFO ] Implicit Places using invariants and state equation in 1019 ms returned []
Implicit Place search using SMT with State Equation took 1419 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 760/2374 places, 758/2174 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2375 ms. Remains : 760/2374 places, 758/2174 transitions.
Stuttering acceptance computed with spot in 469 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s397 1) (EQ s303 0) (EQ s454 1)), p0:(EQ s397 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 80450 steps with 0 reset in 657 ms.
FORMULA ShieldIIPt-PT-040B-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLCardinality-00 finished in 3672 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 2374 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2374/2374 places, 2174/2174 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 479 transitions
Trivial Post-agglo rules discarded 479 transitions
Performed 479 trivial Post agglomeration. Transition count delta: 479
Iterating post reduction 0 with 479 rules applied. Total rules applied 479 place count 2373 transition count 1694
Reduce places removed 479 places and 0 transitions.
Iterating post reduction 1 with 479 rules applied. Total rules applied 958 place count 1894 transition count 1694
Performed 313 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 313 Pre rules applied. Total rules applied 958 place count 1894 transition count 1381
Deduced a syphon composed of 313 places in 2 ms
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 2 with 626 rules applied. Total rules applied 1584 place count 1581 transition count 1381
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 1593 place count 1572 transition count 1372
Iterating global reduction 2 with 9 rules applied. Total rules applied 1602 place count 1572 transition count 1372
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 1602 place count 1572 transition count 1364
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 1618 place count 1564 transition count 1364
Performed 679 Post agglomeration using F-continuation condition.Transition count delta: 679
Deduced a syphon composed of 679 places in 0 ms
Reduce places removed 679 places and 0 transitions.
Iterating global reduction 2 with 1358 rules applied. Total rules applied 2976 place count 885 transition count 685
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2977 place count 885 transition count 684
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2979 place count 884 transition count 683
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 3181 place count 783 transition count 749
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3217 place count 765 transition count 762
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 3218 place count 765 transition count 762
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3220 place count 763 transition count 760
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 3222 place count 761 transition count 760
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3222 place count 761 transition count 759
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3224 place count 760 transition count 759
Applied a total of 3224 rules in 479 ms. Remains 760 /2374 variables (removed 1614) and now considering 759/2174 (removed 1415) transitions.
// Phase 1: matrix 759 rows 760 cols
[2023-03-21 22:54:29] [INFO ] Computed 359 place invariants in 2 ms
[2023-03-21 22:54:29] [INFO ] Implicit Places using invariants in 496 ms returned [749]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 498 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 759/2374 places, 759/2174 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 758 transition count 758
Applied a total of 2 rules in 24 ms. Remains 758 /759 variables (removed 1) and now considering 758/759 (removed 1) transitions.
// Phase 1: matrix 758 rows 758 cols
[2023-03-21 22:54:29] [INFO ] Computed 358 place invariants in 1 ms
[2023-03-21 22:54:30] [INFO ] Implicit Places using invariants in 514 ms returned []
[2023-03-21 22:54:30] [INFO ] Invariant cache hit.
[2023-03-21 22:54:31] [INFO ] Implicit Places using invariants and state equation in 963 ms returned []
Implicit Place search using SMT with State Equation took 1480 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 758/2374 places, 758/2174 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2481 ms. Remains : 758/2374 places, 758/2174 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s56 0) (EQ s531 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 731 ms.
Product exploration explored 100000 steps with 0 reset in 958 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 235190 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :{}
Probabilistic random walk after 235190 steps, saw 146730 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 22:54:36] [INFO ] Invariant cache hit.
[2023-03-21 22:54:36] [INFO ] After 184ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:54:36] [INFO ] [Nat]Absence check using 358 positive place invariants in 70 ms returned sat
[2023-03-21 22:54:37] [INFO ] After 381ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 22:54:37] [INFO ] After 448ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-21 22:54:37] [INFO ] After 698ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 16 ms.
Support contains 2 out of 758 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 758/758 places, 758/758 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 758 transition count 757
Applied a total of 1 rules in 18 ms. Remains 758 /758 variables (removed 0) and now considering 757/758 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 758/758 places, 757/758 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 227692 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :{}
Probabilistic random walk after 227692 steps, saw 141934 distinct states, run finished after 3003 ms. (steps per millisecond=75 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 757 rows 758 cols
[2023-03-21 22:54:40] [INFO ] Computed 358 place invariants in 5 ms
[2023-03-21 22:54:40] [INFO ] After 209ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:54:41] [INFO ] [Nat]Absence check using 358 positive place invariants in 92 ms returned sat
[2023-03-21 22:54:41] [INFO ] After 332ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 22:54:41] [INFO ] After 424ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-21 22:54:41] [INFO ] After 754ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 2 out of 758 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 758/758 places, 757/757 transitions.
Applied a total of 0 rules in 27 ms. Remains 758 /758 variables (removed 0) and now considering 757/757 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 758/758 places, 757/757 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 758/758 places, 757/757 transitions.
Applied a total of 0 rules in 18 ms. Remains 758 /758 variables (removed 0) and now considering 757/757 (removed 0) transitions.
[2023-03-21 22:54:41] [INFO ] Invariant cache hit.
[2023-03-21 22:54:42] [INFO ] Implicit Places using invariants in 543 ms returned []
[2023-03-21 22:54:42] [INFO ] Invariant cache hit.
[2023-03-21 22:54:43] [INFO ] Implicit Places using invariants and state equation in 1248 ms returned []
Implicit Place search using SMT with State Equation took 1808 ms to find 0 implicit places.
[2023-03-21 22:54:43] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-21 22:54:43] [INFO ] Invariant cache hit.
[2023-03-21 22:54:43] [INFO ] Dead Transitions using invariants and state equation in 436 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2292 ms. Remains : 758/758 places, 757/757 transitions.
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 758 transition count 757
Applied a total of 80 rules in 31 ms. Remains 758 /758 variables (removed 0) and now considering 757/757 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 757 rows 758 cols
[2023-03-21 22:54:43] [INFO ] Computed 358 place invariants in 17 ms
[2023-03-21 22:54:43] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:54:44] [INFO ] [Nat]Absence check using 358 positive place invariants in 63 ms returned sat
[2023-03-21 22:54:44] [INFO ] After 339ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 22:54:44] [INFO ] After 396ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-21 22:54:44] [INFO ] After 644ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 253 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 758 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 758/758 places, 758/758 transitions.
Applied a total of 0 rules in 30 ms. Remains 758 /758 variables (removed 0) and now considering 758/758 (removed 0) transitions.
// Phase 1: matrix 758 rows 758 cols
[2023-03-21 22:54:45] [INFO ] Computed 358 place invariants in 4 ms
[2023-03-21 22:54:45] [INFO ] Implicit Places using invariants in 510 ms returned []
[2023-03-21 22:54:45] [INFO ] Invariant cache hit.
[2023-03-21 22:54:46] [INFO ] Implicit Places using invariants and state equation in 981 ms returned []
Implicit Place search using SMT with State Equation took 1495 ms to find 0 implicit places.
[2023-03-21 22:54:46] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-21 22:54:46] [INFO ] Invariant cache hit.
[2023-03-21 22:54:47] [INFO ] Dead Transitions using invariants and state equation in 455 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1997 ms. Remains : 758/758 places, 758/758 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 248285 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :{}
Probabilistic random walk after 248285 steps, saw 155791 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 22:54:50] [INFO ] Invariant cache hit.
[2023-03-21 22:54:50] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:54:50] [INFO ] [Nat]Absence check using 358 positive place invariants in 89 ms returned sat
[2023-03-21 22:54:51] [INFO ] After 348ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 22:54:51] [INFO ] After 456ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-21 22:54:51] [INFO ] After 721ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 2 out of 758 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 758/758 places, 758/758 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 758 transition count 757
Applied a total of 1 rules in 26 ms. Remains 758 /758 variables (removed 0) and now considering 757/758 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 758/758 places, 757/758 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 253952 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{}
Probabilistic random walk after 253952 steps, saw 159499 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 757 rows 758 cols
[2023-03-21 22:54:54] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-21 22:54:54] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:54:55] [INFO ] [Nat]Absence check using 358 positive place invariants in 212 ms returned sat
[2023-03-21 22:54:55] [INFO ] After 308ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 22:54:55] [INFO ] After 369ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-21 22:54:55] [INFO ] After 811ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 758 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 758/758 places, 757/757 transitions.
Applied a total of 0 rules in 18 ms. Remains 758 /758 variables (removed 0) and now considering 757/757 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 758/758 places, 757/757 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 758/758 places, 757/757 transitions.
Applied a total of 0 rules in 19 ms. Remains 758 /758 variables (removed 0) and now considering 757/757 (removed 0) transitions.
[2023-03-21 22:54:55] [INFO ] Invariant cache hit.
[2023-03-21 22:54:56] [INFO ] Implicit Places using invariants in 549 ms returned []
[2023-03-21 22:54:56] [INFO ] Invariant cache hit.
[2023-03-21 22:54:57] [INFO ] Implicit Places using invariants and state equation in 951 ms returned []
Implicit Place search using SMT with State Equation took 1504 ms to find 0 implicit places.
[2023-03-21 22:54:57] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-21 22:54:57] [INFO ] Invariant cache hit.
[2023-03-21 22:54:57] [INFO ] Dead Transitions using invariants and state equation in 473 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2037 ms. Remains : 758/758 places, 757/757 transitions.
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 758 transition count 757
Applied a total of 80 rules in 29 ms. Remains 758 /758 variables (removed 0) and now considering 757/757 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 757 rows 758 cols
[2023-03-21 22:54:57] [INFO ] Computed 358 place invariants in 3 ms
[2023-03-21 22:54:57] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:54:58] [INFO ] [Nat]Absence check using 358 positive place invariants in 86 ms returned sat
[2023-03-21 22:54:58] [INFO ] After 311ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 22:54:58] [INFO ] After 373ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-21 22:54:58] [INFO ] After 658ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 202 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 706 ms.
Product exploration explored 100000 steps with 0 reset in 786 ms.
Support contains 2 out of 758 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 758/758 places, 758/758 transitions.
Applied a total of 0 rules in 12 ms. Remains 758 /758 variables (removed 0) and now considering 758/758 (removed 0) transitions.
// Phase 1: matrix 758 rows 758 cols
[2023-03-21 22:55:00] [INFO ] Computed 358 place invariants in 3 ms
[2023-03-21 22:55:01] [INFO ] Implicit Places using invariants in 567 ms returned []
[2023-03-21 22:55:01] [INFO ] Invariant cache hit.
[2023-03-21 22:55:02] [INFO ] Implicit Places using invariants and state equation in 1127 ms returned []
Implicit Place search using SMT with State Equation took 1697 ms to find 0 implicit places.
[2023-03-21 22:55:02] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-21 22:55:02] [INFO ] Invariant cache hit.
[2023-03-21 22:55:02] [INFO ] Dead Transitions using invariants and state equation in 479 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2216 ms. Remains : 758/758 places, 758/758 transitions.
Treatment of property ShieldIIPt-PT-040B-LTLCardinality-02 finished in 34402 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&F(p1)&&(G(p3)||p2))))'
Support contains 5 out of 2374 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2374/2374 places, 2174/2174 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 2362 transition count 2162
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 2362 transition count 2162
Applied a total of 24 rules in 297 ms. Remains 2362 /2374 variables (removed 12) and now considering 2162/2174 (removed 12) transitions.
// Phase 1: matrix 2162 rows 2362 cols
[2023-03-21 22:55:03] [INFO ] Computed 361 place invariants in 13 ms
[2023-03-21 22:55:04] [INFO ] Implicit Places using invariants in 930 ms returned []
[2023-03-21 22:55:04] [INFO ] Invariant cache hit.
[2023-03-21 22:55:07] [INFO ] Implicit Places using invariants and state equation in 2854 ms returned []
Implicit Place search using SMT with State Equation took 3792 ms to find 0 implicit places.
[2023-03-21 22:55:07] [INFO ] Invariant cache hit.
[2023-03-21 22:55:09] [INFO ] Dead Transitions using invariants and state equation in 1822 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2362/2374 places, 2162/2174 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5913 ms. Remains : 2362/2374 places, 2162/2174 transitions.
Stuttering acceptance computed with spot in 416 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p0), (NOT p1), (NOT p3)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p3))), acceptance={} source=1 dest: 2}, { cond=(OR (AND p0 p2) (AND p0 p3)), acceptance={} source=1 dest: 3}, { cond=(OR (AND p0 (NOT p1) p2) (AND p0 (NOT p1) p3)), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p2) p3), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 2}, { cond=p3, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s1216 1), p2:(OR (EQ s1715 0) (EQ s945 1)), p3:(AND (OR (EQ s1271 0) (EQ s1674 1)) (EQ s1216 1)), p1:(OR (EQ s1715 0) (EQ s945 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-040B-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLCardinality-03 finished in 6368 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0&&(G(p1) U !p2)))&&F(G(p3)))))'
Support contains 5 out of 2374 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2374/2374 places, 2174/2174 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 476 transitions
Trivial Post-agglo rules discarded 476 transitions
Performed 476 trivial Post agglomeration. Transition count delta: 476
Iterating post reduction 0 with 476 rules applied. Total rules applied 476 place count 2373 transition count 1697
Reduce places removed 476 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 478 rules applied. Total rules applied 954 place count 1897 transition count 1695
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 956 place count 1895 transition count 1695
Performed 313 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 313 Pre rules applied. Total rules applied 956 place count 1895 transition count 1382
Deduced a syphon composed of 313 places in 3 ms
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 3 with 626 rules applied. Total rules applied 1582 place count 1582 transition count 1382
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1590 place count 1574 transition count 1374
Iterating global reduction 3 with 8 rules applied. Total rules applied 1598 place count 1574 transition count 1374
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 1598 place count 1574 transition count 1367
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 1612 place count 1567 transition count 1367
Performed 679 Post agglomeration using F-continuation condition.Transition count delta: 679
Deduced a syphon composed of 679 places in 1 ms
Reduce places removed 679 places and 0 transitions.
Iterating global reduction 3 with 1358 rules applied. Total rules applied 2970 place count 888 transition count 688
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2971 place count 888 transition count 687
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2973 place count 887 transition count 686
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3175 place count 786 transition count 752
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 3209 place count 769 transition count 763
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3211 place count 767 transition count 761
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 3213 place count 765 transition count 761
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 3213 place count 765 transition count 760
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3215 place count 764 transition count 760
Applied a total of 3215 rules in 508 ms. Remains 764 /2374 variables (removed 1610) and now considering 760/2174 (removed 1414) transitions.
// Phase 1: matrix 760 rows 764 cols
[2023-03-21 22:55:10] [INFO ] Computed 359 place invariants in 2 ms
[2023-03-21 22:55:10] [INFO ] Implicit Places using invariants in 531 ms returned [753]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 532 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 763/2374 places, 760/2174 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 762 transition count 759
Applied a total of 2 rules in 32 ms. Remains 762 /763 variables (removed 1) and now considering 759/760 (removed 1) transitions.
// Phase 1: matrix 759 rows 762 cols
[2023-03-21 22:55:10] [INFO ] Computed 358 place invariants in 3 ms
[2023-03-21 22:55:11] [INFO ] Implicit Places using invariants in 563 ms returned []
[2023-03-21 22:55:11] [INFO ] Invariant cache hit.
[2023-03-21 22:55:11] [INFO ] State equation strengthened by 144 read => feed constraints.
[2023-03-21 22:55:13] [INFO ] Implicit Places using invariants and state equation in 2423 ms returned []
Implicit Place search using SMT with State Equation took 3006 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 762/2374 places, 759/2174 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4080 ms. Remains : 762/2374 places, 759/2174 transitions.
Stuttering acceptance computed with spot in 552 ms :[(OR (NOT p0) (NOT p3) p2), (OR (NOT p0) p2), (NOT p3), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), p2]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (AND p2 (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=0 dest: 4}], [{ cond=(OR (NOT p0) (AND p2 (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p2 p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 p2 p1), acceptance={0} source=1 dest: 4}], [{ cond=p3, acceptance={} source=2 dest: 2}, { cond=(NOT p3), acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND p2 (NOT p1))), acceptance={0} source=3 dest: 1}, { cond=(OR (AND (NOT p0) p1) (AND p2 p1)), acceptance={} source=3 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND p2 p1), acceptance={} source=4 dest: 3}, { cond=(AND p2 p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s342 1), p2:(OR (EQ s597 0) (EQ s536 1)), p1:(OR (EQ s169 0) (EQ s289 1)), p3:(AND (EQ s536 0) (EQ s597 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-040B-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLCardinality-04 finished in 4671 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 4 out of 2374 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2374/2374 places, 2174/2174 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 2362 transition count 2162
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 2362 transition count 2162
Applied a total of 24 rules in 346 ms. Remains 2362 /2374 variables (removed 12) and now considering 2162/2174 (removed 12) transitions.
// Phase 1: matrix 2162 rows 2362 cols
[2023-03-21 22:55:14] [INFO ] Computed 361 place invariants in 14 ms
[2023-03-21 22:55:15] [INFO ] Implicit Places using invariants in 1101 ms returned []
[2023-03-21 22:55:15] [INFO ] Invariant cache hit.
[2023-03-21 22:55:18] [INFO ] Implicit Places using invariants and state equation in 2794 ms returned []
Implicit Place search using SMT with State Equation took 3896 ms to find 0 implicit places.
[2023-03-21 22:55:18] [INFO ] Invariant cache hit.
[2023-03-21 22:55:20] [INFO ] Dead Transitions using invariants and state equation in 2091 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2362/2374 places, 2162/2174 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6342 ms. Remains : 2362/2374 places, 2162/2174 transitions.
Stuttering acceptance computed with spot in 185 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s1721 0) (EQ s1560 1)), p0:(OR (EQ s1890 0) (EQ s1309 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1882 ms.
Product exploration explored 100000 steps with 50000 reset in 1901 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 7 factoid took 208 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-040B-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-040B-LTLCardinality-05 finished in 10579 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(F(p1)))))'
Support contains 4 out of 2374 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2374/2374 places, 2174/2174 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 2362 transition count 2162
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 2362 transition count 2162
Applied a total of 24 rules in 306 ms. Remains 2362 /2374 variables (removed 12) and now considering 2162/2174 (removed 12) transitions.
// Phase 1: matrix 2162 rows 2362 cols
[2023-03-21 22:55:25] [INFO ] Computed 361 place invariants in 28 ms
[2023-03-21 22:55:26] [INFO ] Implicit Places using invariants in 944 ms returned []
[2023-03-21 22:55:26] [INFO ] Invariant cache hit.
[2023-03-21 22:55:28] [INFO ] Implicit Places using invariants and state equation in 2661 ms returned []
Implicit Place search using SMT with State Equation took 3617 ms to find 0 implicit places.
[2023-03-21 22:55:28] [INFO ] Invariant cache hit.
[2023-03-21 22:55:30] [INFO ] Dead Transitions using invariants and state equation in 1645 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2362/2374 places, 2162/2174 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5581 ms. Remains : 2362/2374 places, 2162/2174 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (EQ s252 0) (EQ s4 1)), p0:(OR (EQ s317 0) (EQ s448 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 6566 reset in 436 ms.
Product exploration explored 100000 steps with 6792 reset in 461 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 272 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p1) p0), (X p0), true, (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 314 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2023-03-21 22:55:32] [INFO ] Invariant cache hit.
[2023-03-21 22:55:34] [INFO ] [Real]Absence check using 361 positive place invariants in 338 ms returned sat
[2023-03-21 22:55:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:55:44] [INFO ] [Real]Absence check using state equation in 10355 ms returned sat
[2023-03-21 22:55:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:55:46] [INFO ] [Nat]Absence check using 361 positive place invariants in 183 ms returned sat
[2023-03-21 22:55:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:55:48] [INFO ] [Nat]Absence check using state equation in 1530 ms returned sat
[2023-03-21 22:55:48] [INFO ] Computed and/alt/rep : 2161/3242/2161 causal constraints (skipped 0 transitions) in 114 ms.
[2023-03-21 22:56:01] [INFO ] Deduced a trap composed of 22 places in 1518 ms of which 33 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java: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 22:56:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Support contains 2 out of 2362 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 2362/2362 places, 2162/2162 transitions.
Applied a total of 0 rules in 140 ms. Remains 2362 /2362 variables (removed 0) and now considering 2162/2162 (removed 0) transitions.
[2023-03-21 22:56:01] [INFO ] Invariant cache hit.
[2023-03-21 22:56:02] [INFO ] Implicit Places using invariants in 1013 ms returned []
[2023-03-21 22:56:02] [INFO ] Invariant cache hit.
[2023-03-21 22:56:05] [INFO ] Implicit Places using invariants and state equation in 2785 ms returned []
Implicit Place search using SMT with State Equation took 3799 ms to find 0 implicit places.
[2023-03-21 22:56:05] [INFO ] Invariant cache hit.
[2023-03-21 22:56:07] [INFO ] Dead Transitions using invariants and state equation in 1605 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5547 ms. Remains : 2362/2362 places, 2162/2162 transitions.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
Knowledge obtained : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 193 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 210 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2023-03-21 22:56:08] [INFO ] Invariant cache hit.
[2023-03-21 22:56:10] [INFO ] [Real]Absence check using 361 positive place invariants in 552 ms returned sat
[2023-03-21 22:56:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:56:22] [INFO ] [Real]Absence check using state equation in 11704 ms returned sat
[2023-03-21 22:56:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:56:23] [INFO ] [Nat]Absence check using 361 positive place invariants in 213 ms returned sat
[2023-03-21 22:56:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:56:25] [INFO ] [Nat]Absence check using state equation in 1762 ms returned sat
[2023-03-21 22:56:25] [INFO ] Computed and/alt/rep : 2161/3242/2161 causal constraints (skipped 0 transitions) in 239 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 22:56:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 180 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 6675 reset in 441 ms.
Product exploration explored 100000 steps with 6630 reset in 417 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 2362 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2362/2362 places, 2162/2162 transitions.
Performed 477 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 477 rules applied. Total rules applied 477 place count 2362 transition count 2162
Performed 162 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 162 Pre rules applied. Total rules applied 477 place count 2362 transition count 2284
Deduced a syphon composed of 639 places in 5 ms
Iterating global reduction 1 with 162 rules applied. Total rules applied 639 place count 2362 transition count 2284
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 640 place count 2361 transition count 2283
Deduced a syphon composed of 639 places in 3 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 641 place count 2361 transition count 2283
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 641 place count 2361 transition count 2284
Deduced a syphon composed of 640 places in 3 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 642 place count 2361 transition count 2284
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 643 place count 2360 transition count 2282
Deduced a syphon composed of 639 places in 4 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 644 place count 2360 transition count 2282
Performed 797 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1436 places in 3 ms
Iterating global reduction 1 with 797 rules applied. Total rules applied 1441 place count 2360 transition count 2282
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1442 place count 2360 transition count 2281
Renaming transitions due to excessive name length > 1024 char.
Discarding 319 places :
Symmetric choice reduction at 2 with 319 rule applications. Total rules 1761 place count 2041 transition count 1962
Deduced a syphon composed of 1117 places in 2 ms
Iterating global reduction 2 with 319 rules applied. Total rules applied 2080 place count 2041 transition count 1962
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1118 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2081 place count 2041 transition count 1962
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2083 place count 2039 transition count 1960
Deduced a syphon composed of 1116 places in 3 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2085 place count 2039 transition count 1960
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -529
Deduced a syphon composed of 1217 places in 4 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2186 place count 2039 transition count 2489
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2287 place count 1938 transition count 2287
Deduced a syphon composed of 1116 places in 3 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2388 place count 1938 transition count 2287
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -309
Deduced a syphon composed of 1174 places in 6 ms
Iterating global reduction 2 with 58 rules applied. Total rules applied 2446 place count 1938 transition count 2596
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 2504 place count 1880 transition count 2480
Deduced a syphon composed of 1116 places in 3 ms
Iterating global reduction 2 with 58 rules applied. Total rules applied 2562 place count 1880 transition count 2480
Deduced a syphon composed of 1116 places in 3 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 2571 place count 1880 transition count 2471
Deduced a syphon composed of 1116 places in 2 ms
Applied a total of 2571 rules in 1901 ms. Remains 1880 /2362 variables (removed 482) and now considering 2471/2162 (removed -309) transitions.
[2023-03-21 22:56:40] [INFO ] Redundant transitions in 48 ms returned []
// Phase 1: matrix 2471 rows 1880 cols
[2023-03-21 22:56:40] [INFO ] Computed 361 place invariants in 39 ms
[2023-03-21 22:56:42] [INFO ] Dead Transitions using invariants and state equation in 1510 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1880/2362 places, 2471/2162 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3476 ms. Remains : 1880/2362 places, 2471/2162 transitions.
Support contains 2 out of 2362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2362/2362 places, 2162/2162 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 2361 transition count 2161
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 2361 transition count 2161
Applied a total of 2 rules in 228 ms. Remains 2361 /2362 variables (removed 1) and now considering 2161/2162 (removed 1) transitions.
// Phase 1: matrix 2161 rows 2361 cols
[2023-03-21 22:56:42] [INFO ] Computed 361 place invariants in 18 ms
[2023-03-21 22:56:43] [INFO ] Implicit Places using invariants in 996 ms returned []
[2023-03-21 22:56:43] [INFO ] Invariant cache hit.
[2023-03-21 22:56:46] [INFO ] Implicit Places using invariants and state equation in 2713 ms returned []
Implicit Place search using SMT with State Equation took 3732 ms to find 0 implicit places.
[2023-03-21 22:56:46] [INFO ] Invariant cache hit.
[2023-03-21 22:56:47] [INFO ] Dead Transitions using invariants and state equation in 1636 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2361/2362 places, 2161/2162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5600 ms. Remains : 2361/2362 places, 2161/2162 transitions.
Treatment of property ShieldIIPt-PT-040B-LTLCardinality-09 finished in 83047 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)))'
Support contains 2 out of 2374 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2374/2374 places, 2174/2174 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 2361 transition count 2161
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 2361 transition count 2161
Applied a total of 26 rules in 250 ms. Remains 2361 /2374 variables (removed 13) and now considering 2161/2174 (removed 13) transitions.
[2023-03-21 22:56:48] [INFO ] Invariant cache hit.
[2023-03-21 22:56:49] [INFO ] Implicit Places using invariants in 1052 ms returned []
[2023-03-21 22:56:49] [INFO ] Invariant cache hit.
[2023-03-21 22:56:52] [INFO ] Implicit Places using invariants and state equation in 2888 ms returned []
Implicit Place search using SMT with State Equation took 3955 ms to find 0 implicit places.
[2023-03-21 22:56:52] [INFO ] Invariant cache hit.
[2023-03-21 22:56:53] [INFO ] Dead Transitions using invariants and state equation in 1537 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2361/2374 places, 2161/2174 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5742 ms. Remains : 2361/2374 places, 2161/2174 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s970 0) (EQ s982 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 539 steps with 0 reset in 7 ms.
FORMULA ShieldIIPt-PT-040B-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLCardinality-10 finished in 5916 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((X(X(p1)) U G(!p0)))))'
Support contains 4 out of 2374 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2374/2374 places, 2174/2174 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 2364 transition count 2164
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 2364 transition count 2164
Applied a total of 20 rules in 304 ms. Remains 2364 /2374 variables (removed 10) and now considering 2164/2174 (removed 10) transitions.
// Phase 1: matrix 2164 rows 2364 cols
[2023-03-21 22:56:54] [INFO ] Computed 361 place invariants in 6 ms
[2023-03-21 22:56:54] [INFO ] Implicit Places using invariants in 715 ms returned []
[2023-03-21 22:56:54] [INFO ] Invariant cache hit.
[2023-03-21 22:56:57] [INFO ] Implicit Places using invariants and state equation in 2674 ms returned []
Implicit Place search using SMT with State Equation took 3439 ms to find 0 implicit places.
[2023-03-21 22:56:57] [INFO ] Invariant cache hit.
[2023-03-21 22:56:58] [INFO ] Dead Transitions using invariants and state equation in 1424 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2364/2374 places, 2164/2174 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5169 ms. Remains : 2364/2374 places, 2164/2174 transitions.
Stuttering acceptance computed with spot in 381 ms :[true, (NOT p0), p0, (NOT p1), (AND (NOT p1) p0), (NOT p1), true, (AND p0 (NOT p1)), (AND p0 p1)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 5}, { cond=(NOT p0), acceptance={} source=4 dest: 7}], [{ cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 8}], [{ cond=(AND p0 p1), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(OR (EQ s2293 0) (EQ s774 1)), p1:(OR (EQ s78 0) (EQ s1105 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 19930 reset in 878 ms.
Product exploration explored 100000 steps with 19989 reset in 893 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 286 ms. Reduced automaton from 9 states, 16 edges and 2 AP (stutter sensitive) to 8 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 471 ms :[p0, p0, (NOT p1), (AND (NOT p1) p0), (NOT p1), true, (AND p0 (NOT p1)), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) 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 3) 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 3) seen :0
Running SMT prover for 3 properties.
[2023-03-21 22:57:02] [INFO ] Invariant cache hit.
[2023-03-21 22:57:02] [INFO ] After 279ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 22:57:02] [INFO ] [Nat]Absence check using 361 positive place invariants in 128 ms returned sat
[2023-03-21 22:57:04] [INFO ] After 1410ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 22:57:05] [INFO ] Deduced a trap composed of 19 places in 510 ms of which 2 ms to minimize.
[2023-03-21 22:57:06] [INFO ] Deduced a trap composed of 19 places in 812 ms of which 2 ms to minimize.
[2023-03-21 22:57:07] [INFO ] Deduced a trap composed of 35 places in 831 ms of which 3 ms to minimize.
[2023-03-21 22:57:07] [INFO ] Deduced a trap composed of 20 places in 501 ms of which 1 ms to minimize.
[2023-03-21 22:57:08] [INFO ] Deduced a trap composed of 18 places in 600 ms of which 2 ms to minimize.
[2023-03-21 22:57:08] [INFO ] Deduced a trap composed of 21 places in 495 ms of which 1 ms to minimize.
[2023-03-21 22:57:09] [INFO ] Deduced a trap composed of 23 places in 463 ms of which 1 ms to minimize.
[2023-03-21 22:57:09] [INFO ] Deduced a trap composed of 22 places in 526 ms of which 1 ms to minimize.
[2023-03-21 22:57:10] [INFO ] Deduced a trap composed of 24 places in 494 ms of which 1 ms to minimize.
[2023-03-21 22:57:11] [INFO ] Deduced a trap composed of 18 places in 578 ms of which 2 ms to minimize.
[2023-03-21 22:57:11] [INFO ] Deduced a trap composed of 31 places in 553 ms of which 1 ms to minimize.
[2023-03-21 22:57:12] [INFO ] Deduced a trap composed of 23 places in 449 ms of which 1 ms to minimize.
[2023-03-21 22:57:12] [INFO ] Deduced a trap composed of 28 places in 470 ms of which 1 ms to minimize.
[2023-03-21 22:57:13] [INFO ] Deduced a trap composed of 26 places in 563 ms of which 1 ms to minimize.
[2023-03-21 22:57:14] [INFO ] Deduced a trap composed of 27 places in 508 ms of which 1 ms to minimize.
[2023-03-21 22:57:14] [INFO ] Deduced a trap composed of 28 places in 532 ms of which 2 ms to minimize.
[2023-03-21 22:57:15] [INFO ] Deduced a trap composed of 30 places in 742 ms of which 1 ms to minimize.
[2023-03-21 22:57:16] [INFO ] Deduced a trap composed of 30 places in 510 ms of which 1 ms to minimize.
[2023-03-21 22:57:16] [INFO ] Deduced a trap composed of 29 places in 504 ms of which 1 ms to minimize.
[2023-03-21 22:57:17] [INFO ] Deduced a trap composed of 24 places in 564 ms of which 1 ms to minimize.
[2023-03-21 22:57:18] [INFO ] Deduced a trap composed of 31 places in 464 ms of which 1 ms to minimize.
[2023-03-21 22:57:18] [INFO ] Deduced a trap composed of 41 places in 469 ms of which 1 ms to minimize.
[2023-03-21 22:57:19] [INFO ] Deduced a trap composed of 30 places in 451 ms of which 1 ms to minimize.
[2023-03-21 22:57:19] [INFO ] Deduced a trap composed of 31 places in 471 ms of which 1 ms to minimize.
[2023-03-21 22:57:20] [INFO ] Deduced a trap composed of 29 places in 417 ms of which 1 ms to minimize.
[2023-03-21 22:57:20] [INFO ] Deduced a trap composed of 25 places in 499 ms of which 1 ms to minimize.
[2023-03-21 22:57:21] [INFO ] Deduced a trap composed of 34 places in 532 ms of which 1 ms to minimize.
[2023-03-21 22:57:21] [INFO ] Deduced a trap composed of 38 places in 549 ms of which 1 ms to minimize.
[2023-03-21 22:57:22] [INFO ] Deduced a trap composed of 41 places in 357 ms of which 1 ms to minimize.
[2023-03-21 22:57:22] [INFO ] Deduced a trap composed of 44 places in 424 ms of which 1 ms to minimize.
[2023-03-21 22:57:23] [INFO ] Deduced a trap composed of 29 places in 536 ms of which 1 ms to minimize.
[2023-03-21 22:57:23] [INFO ] Deduced a trap composed of 42 places in 459 ms of which 1 ms to minimize.
[2023-03-21 22:57:24] [INFO ] Deduced a trap composed of 34 places in 467 ms of which 1 ms to minimize.
[2023-03-21 22:57:24] [INFO ] Deduced a trap composed of 40 places in 347 ms of which 1 ms to minimize.
[2023-03-21 22:57:25] [INFO ] Deduced a trap composed of 41 places in 312 ms of which 1 ms to minimize.
[2023-03-21 22:57:25] [INFO ] Deduced a trap composed of 38 places in 459 ms of which 1 ms to minimize.
[2023-03-21 22:57:26] [INFO ] Deduced a trap composed of 41 places in 393 ms of which 1 ms to minimize.
[2023-03-21 22:57:26] [INFO ] Deduced a trap composed of 45 places in 414 ms of which 1 ms to minimize.
[2023-03-21 22:57:27] [INFO ] Deduced a trap composed of 38 places in 572 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 22:57:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 22:57:27] [INFO ] After 25075ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 175 ms.
Support contains 4 out of 2364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2364/2364 places, 2164/2164 transitions.
Drop transitions removed 479 transitions
Trivial Post-agglo rules discarded 479 transitions
Performed 479 trivial Post agglomeration. Transition count delta: 479
Iterating post reduction 0 with 479 rules applied. Total rules applied 479 place count 2364 transition count 1685
Reduce places removed 479 places and 0 transitions.
Iterating post reduction 1 with 479 rules applied. Total rules applied 958 place count 1885 transition count 1685
Performed 318 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 318 Pre rules applied. Total rules applied 958 place count 1885 transition count 1367
Deduced a syphon composed of 318 places in 2 ms
Reduce places removed 318 places and 0 transitions.
Iterating global reduction 2 with 636 rules applied. Total rules applied 1594 place count 1567 transition count 1367
Performed 681 Post agglomeration using F-continuation condition.Transition count delta: 681
Deduced a syphon composed of 681 places in 1 ms
Reduce places removed 681 places and 0 transitions.
Iterating global reduction 2 with 1362 rules applied. Total rules applied 2956 place count 886 transition count 686
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2957 place count 886 transition count 685
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2959 place count 885 transition count 684
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3161 place count 784 transition count 750
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3197 place count 766 transition count 763
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3198 place count 766 transition count 762
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3199 place count 766 transition count 761
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3200 place count 765 transition count 761
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 5 with 40 rules applied. Total rules applied 3240 place count 765 transition count 761
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3241 place count 764 transition count 760
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 3243 place count 762 transition count 760
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 3243 place count 762 transition count 759
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 3245 place count 761 transition count 759
Applied a total of 3245 rules in 373 ms. Remains 761 /2364 variables (removed 1603) and now considering 759/2164 (removed 1405) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 373 ms. Remains : 761/2364 places, 759/2164 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 168997 steps, run timeout after 3012 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 168997 steps, saw 93772 distinct states, run finished after 3012 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 759 rows 761 cols
[2023-03-21 22:57:31] [INFO ] Computed 359 place invariants in 4 ms
[2023-03-21 22:57:31] [INFO ] After 176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 22:57:31] [INFO ] [Nat]Absence check using 359 positive place invariants in 139 ms returned sat
[2023-03-21 22:57:32] [INFO ] After 386ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 22:57:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 22:57:32] [INFO ] After 111ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-21 22:57:32] [INFO ] After 316ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 111 ms.
[2023-03-21 22:57:32] [INFO ] After 1112ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 63 ms.
Support contains 4 out of 761 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 759/759 transitions.
Applied a total of 0 rules in 11 ms. Remains 761 /761 variables (removed 0) and now considering 759/759 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 761/761 places, 759/759 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 759/759 transitions.
Applied a total of 0 rules in 10 ms. Remains 761 /761 variables (removed 0) and now considering 759/759 (removed 0) transitions.
[2023-03-21 22:57:32] [INFO ] Invariant cache hit.
[2023-03-21 22:57:33] [INFO ] Implicit Places using invariants in 415 ms returned [750]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 431 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 760/761 places, 759/759 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 759 transition count 758
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 759 transition count 758
Applied a total of 2 rules in 17 ms. Remains 759 /760 variables (removed 1) and now considering 758/759 (removed 1) transitions.
// Phase 1: matrix 758 rows 759 cols
[2023-03-21 22:57:33] [INFO ] Computed 358 place invariants in 1 ms
[2023-03-21 22:57:33] [INFO ] Implicit Places using invariants in 367 ms returned []
[2023-03-21 22:57:33] [INFO ] Invariant cache hit.
[2023-03-21 22:57:34] [INFO ] Implicit Places using invariants and state equation in 984 ms returned []
Implicit Place search using SMT with State Equation took 1370 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 759/761 places, 758/759 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1828 ms. Remains : 759/761 places, 758/759 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 155835 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 155835 steps, saw 84691 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-21 22:57:37] [INFO ] Invariant cache hit.
[2023-03-21 22:57:38] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 22:57:38] [INFO ] [Nat]Absence check using 358 positive place invariants in 84 ms returned sat
[2023-03-21 22:57:38] [INFO ] After 414ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 22:57:38] [INFO ] After 563ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 93 ms.
[2023-03-21 22:57:39] [INFO ] After 953ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 122 ms.
Support contains 4 out of 759 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 758/758 transitions.
Applied a total of 0 rules in 11 ms. Remains 759 /759 variables (removed 0) and now considering 758/758 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 759/759 places, 758/758 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 758/758 transitions.
Applied a total of 0 rules in 11 ms. Remains 759 /759 variables (removed 0) and now considering 758/758 (removed 0) transitions.
[2023-03-21 22:57:39] [INFO ] Invariant cache hit.
[2023-03-21 22:57:39] [INFO ] Implicit Places using invariants in 531 ms returned []
[2023-03-21 22:57:39] [INFO ] Invariant cache hit.
[2023-03-21 22:57:40] [INFO ] Implicit Places using invariants and state equation in 1047 ms returned []
Implicit Place search using SMT with State Equation took 1609 ms to find 0 implicit places.
[2023-03-21 22:57:40] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-21 22:57:40] [INFO ] Invariant cache hit.
[2023-03-21 22:57:41] [INFO ] Dead Transitions using invariants and state equation in 506 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2168 ms. Remains : 759/759 places, 758/758 transitions.
Partial Free-agglomeration rule applied 79 times.
Drop transitions removed 79 transitions
Iterating global reduction 0 with 79 rules applied. Total rules applied 79 place count 759 transition count 758
Applied a total of 79 rules in 21 ms. Remains 759 /759 variables (removed 0) and now considering 758/758 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 758 rows 759 cols
[2023-03-21 22:57:41] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-21 22:57:41] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 22:57:41] [INFO ] [Nat]Absence check using 358 positive place invariants in 81 ms returned sat
[2023-03-21 22:57:42] [INFO ] After 380ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 22:57:42] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-21 22:57:42] [INFO ] After 281ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-21 22:57:42] [INFO ] After 632ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 210 ms.
[2023-03-21 22:57:43] [INFO ] After 1585ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT (AND p1 p0))), (F (AND p1 (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 349 ms. Reduced automaton from 8 states, 14 edges and 2 AP (stutter sensitive) to 8 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 458 ms :[p0, p0, (NOT p1), (AND (NOT p1) p0), (NOT p1), true, (AND p0 (NOT p1)), (AND p0 p1)]
Stuttering acceptance computed with spot in 467 ms :[p0, p0, (NOT p1), (AND (NOT p1) p0), (NOT p1), true, (AND p0 (NOT p1)), (AND p0 p1)]
// Phase 1: matrix 2164 rows 2364 cols
[2023-03-21 22:57:44] [INFO ] Computed 361 place invariants in 13 ms
[2023-03-21 22:57:46] [INFO ] [Real]Absence check using 361 positive place invariants in 445 ms returned sat
[2023-03-21 22:57:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:57:58] [INFO ] [Real]Absence check using state equation in 12016 ms returned sat
[2023-03-21 22:57:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:58:00] [INFO ] [Nat]Absence check using 361 positive place invariants in 643 ms returned sat
[2023-03-21 22:58:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:58:13] [INFO ] [Nat]Absence check using state equation in 12903 ms returned unknown
Could not prove EG p0
Support contains 4 out of 2364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2364/2364 places, 2164/2164 transitions.
Applied a total of 0 rules in 110 ms. Remains 2364 /2364 variables (removed 0) and now considering 2164/2164 (removed 0) transitions.
[2023-03-21 22:58:13] [INFO ] Invariant cache hit.
[2023-03-21 22:58:14] [INFO ] Implicit Places using invariants in 926 ms returned []
[2023-03-21 22:58:14] [INFO ] Invariant cache hit.
[2023-03-21 22:58:17] [INFO ] Implicit Places using invariants and state equation in 3022 ms returned []
Implicit Place search using SMT with State Equation took 3962 ms to find 0 implicit places.
[2023-03-21 22:58:17] [INFO ] Invariant cache hit.
[2023-03-21 22:58:19] [INFO ] Dead Transitions using invariants and state equation in 1838 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5926 ms. Remains : 2364/2364 places, 2164/2164 transitions.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 196 ms. Reduced automaton from 8 states, 14 edges and 2 AP (stutter sensitive) to 8 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 394 ms :[p0, p0, (NOT p1), (AND (NOT p1) p0), (NOT p1), true, (AND p0 (NOT p1)), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-21 22:58:20] [INFO ] Invariant cache hit.
[2023-03-21 22:58:20] [INFO ] After 569ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 22:58:21] [INFO ] [Nat]Absence check using 361 positive place invariants in 239 ms returned sat
[2023-03-21 22:58:23] [INFO ] After 1586ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 22:58:23] [INFO ] Deduced a trap composed of 19 places in 601 ms of which 2 ms to minimize.
[2023-03-21 22:58:24] [INFO ] Deduced a trap composed of 19 places in 605 ms of which 1 ms to minimize.
[2023-03-21 22:58:25] [INFO ] Deduced a trap composed of 35 places in 878 ms of which 1 ms to minimize.
[2023-03-21 22:58:26] [INFO ] Deduced a trap composed of 20 places in 705 ms of which 1 ms to minimize.
[2023-03-21 22:58:27] [INFO ] Deduced a trap composed of 18 places in 704 ms of which 3 ms to minimize.
[2023-03-21 22:58:27] [INFO ] Deduced a trap composed of 21 places in 652 ms of which 2 ms to minimize.
[2023-03-21 22:58:28] [INFO ] Deduced a trap composed of 23 places in 947 ms of which 2 ms to minimize.
[2023-03-21 22:58:29] [INFO ] Deduced a trap composed of 22 places in 628 ms of which 1 ms to minimize.
[2023-03-21 22:58:30] [INFO ] Deduced a trap composed of 24 places in 665 ms of which 1 ms to minimize.
[2023-03-21 22:58:30] [INFO ] Deduced a trap composed of 18 places in 569 ms of which 1 ms to minimize.
[2023-03-21 22:58:31] [INFO ] Deduced a trap composed of 31 places in 605 ms of which 1 ms to minimize.
[2023-03-21 22:58:32] [INFO ] Deduced a trap composed of 23 places in 484 ms of which 2 ms to minimize.
[2023-03-21 22:58:33] [INFO ] Deduced a trap composed of 28 places in 724 ms of which 2 ms to minimize.
[2023-03-21 22:58:33] [INFO ] Deduced a trap composed of 26 places in 624 ms of which 2 ms to minimize.
[2023-03-21 22:58:34] [INFO ] Deduced a trap composed of 27 places in 689 ms of which 2 ms to minimize.
[2023-03-21 22:58:35] [INFO ] Deduced a trap composed of 28 places in 527 ms of which 2 ms to minimize.
[2023-03-21 22:58:35] [INFO ] Deduced a trap composed of 30 places in 638 ms of which 2 ms to minimize.
[2023-03-21 22:58:36] [INFO ] Deduced a trap composed of 30 places in 696 ms of which 2 ms to minimize.
[2023-03-21 22:58:37] [INFO ] Deduced a trap composed of 29 places in 638 ms of which 2 ms to minimize.
[2023-03-21 22:58:38] [INFO ] Deduced a trap composed of 24 places in 767 ms of which 2 ms to minimize.
[2023-03-21 22:58:39] [INFO ] Deduced a trap composed of 31 places in 563 ms of which 1 ms to minimize.
[2023-03-21 22:58:39] [INFO ] Deduced a trap composed of 41 places in 432 ms of which 1 ms to minimize.
[2023-03-21 22:58:40] [INFO ] Deduced a trap composed of 30 places in 563 ms of which 1 ms to minimize.
[2023-03-21 22:58:40] [INFO ] Deduced a trap composed of 31 places in 487 ms of which 1 ms to minimize.
[2023-03-21 22:58:41] [INFO ] Deduced a trap composed of 29 places in 501 ms of which 2 ms to minimize.
[2023-03-21 22:58:42] [INFO ] Deduced a trap composed of 25 places in 455 ms of which 2 ms to minimize.
[2023-03-21 22:58:42] [INFO ] Deduced a trap composed of 34 places in 530 ms of which 1 ms to minimize.
[2023-03-21 22:58:43] [INFO ] Deduced a trap composed of 38 places in 516 ms of which 1 ms to minimize.
[2023-03-21 22:58:44] [INFO ] Deduced a trap composed of 41 places in 836 ms of which 1 ms to minimize.
[2023-03-21 22:58:46] [INFO ] Deduced a trap composed of 44 places in 2506 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 22:58:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 22:58:46] [INFO ] After 26000ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 268 ms.
Support contains 4 out of 2364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2364/2364 places, 2164/2164 transitions.
Drop transitions removed 479 transitions
Trivial Post-agglo rules discarded 479 transitions
Performed 479 trivial Post agglomeration. Transition count delta: 479
Iterating post reduction 0 with 479 rules applied. Total rules applied 479 place count 2364 transition count 1685
Reduce places removed 479 places and 0 transitions.
Iterating post reduction 1 with 479 rules applied. Total rules applied 958 place count 1885 transition count 1685
Performed 318 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 318 Pre rules applied. Total rules applied 958 place count 1885 transition count 1367
Deduced a syphon composed of 318 places in 1 ms
Reduce places removed 318 places and 0 transitions.
Iterating global reduction 2 with 636 rules applied. Total rules applied 1594 place count 1567 transition count 1367
Performed 681 Post agglomeration using F-continuation condition.Transition count delta: 681
Deduced a syphon composed of 681 places in 1 ms
Reduce places removed 681 places and 0 transitions.
Iterating global reduction 2 with 1362 rules applied. Total rules applied 2956 place count 886 transition count 686
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2957 place count 886 transition count 685
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2959 place count 885 transition count 684
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3161 place count 784 transition count 750
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3197 place count 766 transition count 763
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3198 place count 766 transition count 762
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3199 place count 766 transition count 761
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3200 place count 765 transition count 761
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 5 with 40 rules applied. Total rules applied 3240 place count 765 transition count 761
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3241 place count 764 transition count 760
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 3243 place count 762 transition count 760
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 3243 place count 762 transition count 759
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 3245 place count 761 transition count 759
Applied a total of 3245 rules in 345 ms. Remains 761 /2364 variables (removed 1603) and now considering 759/2164 (removed 1405) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 345 ms. Remains : 761/2364 places, 759/2164 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 136972 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 136972 steps, saw 76071 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 759 rows 761 cols
[2023-03-21 22:58:50] [INFO ] Computed 359 place invariants in 2 ms
[2023-03-21 22:58:50] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 22:58:51] [INFO ] [Nat]Absence check using 359 positive place invariants in 161 ms returned sat
[2023-03-21 22:58:51] [INFO ] After 551ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 22:58:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 22:58:51] [INFO ] After 181ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-21 22:58:52] [INFO ] After 373ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 75 ms.
[2023-03-21 22:58:52] [INFO ] After 1437ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 34 ms.
Support contains 4 out of 761 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 759/759 transitions.
Applied a total of 0 rules in 15 ms. Remains 761 /761 variables (removed 0) and now considering 759/759 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 761/761 places, 759/759 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 759/759 transitions.
Applied a total of 0 rules in 10 ms. Remains 761 /761 variables (removed 0) and now considering 759/759 (removed 0) transitions.
[2023-03-21 22:58:52] [INFO ] Invariant cache hit.
[2023-03-21 22:58:53] [INFO ] Implicit Places using invariants in 1049 ms returned [750]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1064 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 760/761 places, 759/759 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 759 transition count 758
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 759 transition count 758
Applied a total of 2 rules in 21 ms. Remains 759 /760 variables (removed 1) and now considering 758/759 (removed 1) transitions.
// Phase 1: matrix 758 rows 759 cols
[2023-03-21 22:58:53] [INFO ] Computed 358 place invariants in 1 ms
[2023-03-21 22:58:53] [INFO ] Implicit Places using invariants in 522 ms returned []
[2023-03-21 22:58:53] [INFO ] Invariant cache hit.
[2023-03-21 22:58:55] [INFO ] Implicit Places using invariants and state equation in 1349 ms returned []
Implicit Place search using SMT with State Equation took 1885 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 759/761 places, 758/759 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2994 ms. Remains : 759/761 places, 758/759 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 150644 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 150644 steps, saw 81714 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-21 22:58:58] [INFO ] Invariant cache hit.
[2023-03-21 22:58:58] [INFO ] After 177ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 22:58:59] [INFO ] [Nat]Absence check using 358 positive place invariants in 83 ms returned sat
[2023-03-21 22:58:59] [INFO ] After 398ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 22:58:59] [INFO ] After 582ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 98 ms.
[2023-03-21 22:58:59] [INFO ] After 991ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 165 ms.
Support contains 4 out of 759 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 758/758 transitions.
Applied a total of 0 rules in 11 ms. Remains 759 /759 variables (removed 0) and now considering 758/758 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 759/759 places, 758/758 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 758/758 transitions.
Applied a total of 0 rules in 10 ms. Remains 759 /759 variables (removed 0) and now considering 758/758 (removed 0) transitions.
[2023-03-21 22:59:00] [INFO ] Invariant cache hit.
[2023-03-21 22:59:00] [INFO ] Implicit Places using invariants in 711 ms returned []
[2023-03-21 22:59:00] [INFO ] Invariant cache hit.
[2023-03-21 22:59:01] [INFO ] Implicit Places using invariants and state equation in 1065 ms returned []
Implicit Place search using SMT with State Equation took 1780 ms to find 0 implicit places.
[2023-03-21 22:59:01] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-21 22:59:01] [INFO ] Invariant cache hit.
[2023-03-21 22:59:02] [INFO ] Dead Transitions using invariants and state equation in 512 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2340 ms. Remains : 759/759 places, 758/758 transitions.
Partial Free-agglomeration rule applied 79 times.
Drop transitions removed 79 transitions
Iterating global reduction 0 with 79 rules applied. Total rules applied 79 place count 759 transition count 758
Applied a total of 79 rules in 25 ms. Remains 759 /759 variables (removed 0) and now considering 758/758 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 758 rows 759 cols
[2023-03-21 22:59:02] [INFO ] Computed 358 place invariants in 4 ms
[2023-03-21 22:59:02] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 22:59:02] [INFO ] [Nat]Absence check using 358 positive place invariants in 149 ms returned sat
[2023-03-21 22:59:03] [INFO ] After 522ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 22:59:03] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-21 22:59:03] [INFO ] After 217ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-21 22:59:04] [INFO ] After 487ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 187 ms.
[2023-03-21 22:59:04] [INFO ] After 1716ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT (AND p1 p0))), (F (AND p1 (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 317 ms. Reduced automaton from 8 states, 14 edges and 2 AP (stutter sensitive) to 8 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 421 ms :[p0, p0, (NOT p1), (AND (NOT p1) p0), (NOT p1), true, (AND p0 (NOT p1)), (AND p0 p1)]
Stuttering acceptance computed with spot in 433 ms :[p0, p0, (NOT p1), (AND (NOT p1) p0), (NOT p1), true, (AND p0 (NOT p1)), (AND p0 p1)]
// Phase 1: matrix 2164 rows 2364 cols
[2023-03-21 22:59:05] [INFO ] Computed 361 place invariants in 6 ms
[2023-03-21 22:59:07] [INFO ] [Real]Absence check using 361 positive place invariants in 414 ms returned sat
[2023-03-21 22:59:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:59:20] [INFO ] [Real]Absence check using state equation in 12626 ms returned unknown
Could not prove EG p0
Stuttering acceptance computed with spot in 517 ms :[p0, p0, (NOT p1), (AND (NOT p1) p0), (NOT p1), true, (AND p0 (NOT p1)), (AND p0 p1)]
Product exploration explored 100000 steps with 20025 reset in 842 ms.
Product exploration explored 100000 steps with 19993 reset in 883 ms.
Applying partial POR strategy [false, false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 390 ms :[p0, p0, (NOT p1), (AND (NOT p1) p0), (NOT p1), true, (AND p0 (NOT p1)), (AND p0 p1)]
Support contains 4 out of 2364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2364/2364 places, 2164/2164 transitions.
Performed 479 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 479 rules applied. Total rules applied 479 place count 2364 transition count 2164
Performed 159 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 159 Pre rules applied. Total rules applied 479 place count 2364 transition count 2286
Deduced a syphon composed of 638 places in 4 ms
Iterating global reduction 1 with 159 rules applied. Total rules applied 638 place count 2364 transition count 2286
Performed 802 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1440 places in 2 ms
Iterating global reduction 1 with 802 rules applied. Total rules applied 1440 place count 2364 transition count 2287
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1441 place count 2364 transition count 2286
Renaming transitions due to excessive name length > 1024 char.
Discarding 323 places :
Symmetric choice reduction at 2 with 323 rule applications. Total rules 1764 place count 2041 transition count 1962
Deduced a syphon composed of 1117 places in 2 ms
Iterating global reduction 2 with 323 rules applied. Total rules applied 2087 place count 2041 transition count 1962
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1118 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2088 place count 2041 transition count 1962
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2090 place count 2039 transition count 1960
Deduced a syphon composed of 1116 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2092 place count 2039 transition count 1960
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -533
Deduced a syphon composed of 1217 places in 4 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2193 place count 2039 transition count 2493
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2294 place count 1938 transition count 2291
Deduced a syphon composed of 1116 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2395 place count 1938 transition count 2291
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: -307
Deduced a syphon composed of 1172 places in 3 ms
Iterating global reduction 2 with 56 rules applied. Total rules applied 2451 place count 1938 transition count 2598
Discarding 56 places :
Symmetric choice reduction at 2 with 56 rule applications. Total rules 2507 place count 1882 transition count 2486
Deduced a syphon composed of 1116 places in 2 ms
Iterating global reduction 2 with 56 rules applied. Total rules applied 2563 place count 1882 transition count 2486
Deduced a syphon composed of 1116 places in 2 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 2572 place count 1882 transition count 2477
Deduced a syphon composed of 1116 places in 2 ms
Applied a total of 2572 rules in 1476 ms. Remains 1882 /2364 variables (removed 482) and now considering 2477/2164 (removed -313) transitions.
[2023-03-21 22:59:24] [INFO ] Redundant transitions in 44 ms returned []
// Phase 1: matrix 2477 rows 1882 cols
[2023-03-21 22:59:24] [INFO ] Computed 361 place invariants in 15 ms
[2023-03-21 22:59:27] [INFO ] Dead Transitions using invariants and state equation in 2233 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1882/2364 places, 2477/2164 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3781 ms. Remains : 1882/2364 places, 2477/2164 transitions.
Support contains 4 out of 2364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2364/2364 places, 2164/2164 transitions.
Applied a total of 0 rules in 104 ms. Remains 2364 /2364 variables (removed 0) and now considering 2164/2164 (removed 0) transitions.
// Phase 1: matrix 2164 rows 2364 cols
[2023-03-21 22:59:27] [INFO ] Computed 361 place invariants in 26 ms
[2023-03-21 22:59:31] [INFO ] Implicit Places using invariants in 4057 ms returned []
[2023-03-21 22:59:31] [INFO ] Invariant cache hit.
[2023-03-21 22:59:34] [INFO ] Implicit Places using invariants and state equation in 3328 ms returned []
Implicit Place search using SMT with State Equation took 7406 ms to find 0 implicit places.
[2023-03-21 22:59:34] [INFO ] Invariant cache hit.
[2023-03-21 22:59:36] [INFO ] Dead Transitions using invariants and state equation in 1784 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9301 ms. Remains : 2364/2364 places, 2164/2164 transitions.
Treatment of property ShieldIIPt-PT-040B-LTLCardinality-14 finished in 162778 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(X(p1))&&G(p2)&&p0)))'
Support contains 4 out of 2374 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2374/2374 places, 2174/2174 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 2364 transition count 2164
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 2364 transition count 2164
Applied a total of 20 rules in 266 ms. Remains 2364 /2374 variables (removed 10) and now considering 2164/2174 (removed 10) transitions.
// Phase 1: matrix 2164 rows 2364 cols
[2023-03-21 22:59:36] [INFO ] Computed 361 place invariants in 9 ms
[2023-03-21 22:59:37] [INFO ] Implicit Places using invariants in 897 ms returned []
[2023-03-21 22:59:37] [INFO ] Invariant cache hit.
[2023-03-21 22:59:40] [INFO ] Implicit Places using invariants and state equation in 3235 ms returned []
Implicit Place search using SMT with State Equation took 4135 ms to find 0 implicit places.
[2023-03-21 22:59:40] [INFO ] Invariant cache hit.
[2023-03-21 22:59:42] [INFO ] Dead Transitions using invariants and state equation in 1571 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2364/2374 places, 2164/2174 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5988 ms. Remains : 2364/2374 places, 2164/2174 transitions.
Stuttering acceptance computed with spot in 298 ms :[true, (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p2), acceptance={} source=2 dest: 4}], [{ cond=(OR (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p2 p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 3}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(AND (OR (EQ s2049 0) (EQ s624 1)) (OR (EQ s1293 0) (EQ s385 1))), p2:(OR (EQ s1293 0) (EQ s385 1)), p1:(OR (EQ s2049 0) (EQ s624 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]]
Product exploration explored 100000 steps with 0 reset in 616 ms.
Product exploration explored 100000 steps with 0 reset in 781 ms.
Computed a total of 639 stabilizing places and 639 stable transitions
Computed a total of 639 stabilizing places and 639 stable transitions
Detected a total of 639/2364 stabilizing places and 639/2164 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (OR (NOT p0) (NOT p2)))), (X (AND p0 p2)), true, (X (X p2)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 326 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 293 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-21 22:59:45] [INFO ] Invariant cache hit.
[2023-03-21 22:59:45] [INFO ] After 378ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:59:46] [INFO ] [Nat]Absence check using 361 positive place invariants in 203 ms returned sat
[2023-03-21 22:59:48] [INFO ] After 2064ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 22:59:48] [INFO ] Deduced a trap composed of 24 places in 630 ms of which 2 ms to minimize.
[2023-03-21 22:59:49] [INFO ] Deduced a trap composed of 20 places in 643 ms of which 2 ms to minimize.
[2023-03-21 22:59:50] [INFO ] Deduced a trap composed of 21 places in 749 ms of which 1 ms to minimize.
[2023-03-21 22:59:51] [INFO ] Deduced a trap composed of 21 places in 539 ms of which 1 ms to minimize.
[2023-03-21 22:59:51] [INFO ] Deduced a trap composed of 29 places in 581 ms of which 1 ms to minimize.
[2023-03-21 22:59:52] [INFO ] Deduced a trap composed of 27 places in 451 ms of which 1 ms to minimize.
[2023-03-21 22:59:53] [INFO ] Deduced a trap composed of 29 places in 793 ms of which 1 ms to minimize.
[2023-03-21 22:59:53] [INFO ] Deduced a trap composed of 22 places in 691 ms of which 2 ms to minimize.
[2023-03-21 22:59:54] [INFO ] Deduced a trap composed of 25 places in 581 ms of which 3 ms to minimize.
[2023-03-21 22:59:55] [INFO ] Deduced a trap composed of 23 places in 505 ms of which 1 ms to minimize.
[2023-03-21 22:59:55] [INFO ] Deduced a trap composed of 19 places in 440 ms of which 1 ms to minimize.
[2023-03-21 22:59:56] [INFO ] Deduced a trap composed of 17 places in 443 ms of which 1 ms to minimize.
[2023-03-21 22:59:56] [INFO ] Deduced a trap composed of 23 places in 504 ms of which 2 ms to minimize.
[2023-03-21 22:59:57] [INFO ] Deduced a trap composed of 20 places in 409 ms of which 1 ms to minimize.
[2023-03-21 22:59:57] [INFO ] Deduced a trap composed of 33 places in 475 ms of which 1 ms to minimize.
[2023-03-21 22:59:58] [INFO ] Deduced a trap composed of 32 places in 429 ms of which 1 ms to minimize.
[2023-03-21 22:59:58] [INFO ] Deduced a trap composed of 28 places in 483 ms of which 1 ms to minimize.
[2023-03-21 22:59:59] [INFO ] Deduced a trap composed of 37 places in 466 ms of which 14 ms to minimize.
[2023-03-21 23:00:00] [INFO ] Deduced a trap composed of 37 places in 1058 ms of which 1 ms to minimize.
[2023-03-21 23:00:02] [INFO ] Deduced a trap composed of 34 places in 1510 ms of which 2 ms to minimize.
[2023-03-21 23:00:02] [INFO ] Deduced a trap composed of 27 places in 453 ms of which 0 ms to minimize.
[2023-03-21 23:00:03] [INFO ] Deduced a trap composed of 33 places in 1045 ms of which 1 ms to minimize.
[2023-03-21 23:00:04] [INFO ] Deduced a trap composed of 28 places in 403 ms of which 1 ms to minimize.
[2023-03-21 23:00:05] [INFO ] Deduced a trap composed of 44 places in 977 ms of which 1 ms to minimize.
[2023-03-21 23:00:06] [INFO ] Deduced a trap composed of 37 places in 783 ms of which 1 ms to minimize.
[2023-03-21 23:00:07] [INFO ] Deduced a trap composed of 20 places in 510 ms of which 1 ms to minimize.
[2023-03-21 23:00:07] [INFO ] Deduced a trap composed of 40 places in 404 ms of which 0 ms to minimize.
[2023-03-21 23:00:09] [INFO ] Deduced a trap composed of 39 places in 1584 ms of which 1 ms to minimize.
[2023-03-21 23:00:10] [INFO ] Deduced a trap composed of 36 places in 1117 ms of which 1 ms to minimize.
[2023-03-21 23:00:13] [INFO ] Deduced a trap composed of 17 places in 2576 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 23:00:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 23:00:13] [INFO ] After 27619ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 32 ms.
Support contains 2 out of 2364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2364/2364 places, 2164/2164 transitions.
Drop transitions removed 479 transitions
Trivial Post-agglo rules discarded 479 transitions
Performed 479 trivial Post agglomeration. Transition count delta: 479
Iterating post reduction 0 with 479 rules applied. Total rules applied 479 place count 2364 transition count 1685
Reduce places removed 479 places and 0 transitions.
Iterating post reduction 1 with 479 rules applied. Total rules applied 958 place count 1885 transition count 1685
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 319 Pre rules applied. Total rules applied 958 place count 1885 transition count 1366
Deduced a syphon composed of 319 places in 2 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 2 with 638 rules applied. Total rules applied 1596 place count 1566 transition count 1366
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1597 place count 1565 transition count 1365
Iterating global reduction 2 with 1 rules applied. Total rules applied 1598 place count 1565 transition count 1365
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1598 place count 1565 transition count 1364
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1600 place count 1564 transition count 1364
Performed 681 Post agglomeration using F-continuation condition.Transition count delta: 681
Deduced a syphon composed of 681 places in 1 ms
Reduce places removed 681 places and 0 transitions.
Iterating global reduction 2 with 1362 rules applied. Total rules applied 2962 place count 883 transition count 683
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2963 place count 883 transition count 682
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2965 place count 882 transition count 681
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3167 place count 781 transition count 746
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 3201 place count 764 transition count 757
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3202 place count 764 transition count 756
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3203 place count 764 transition count 755
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3204 place count 763 transition count 755
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 5 with 40 rules applied. Total rules applied 3244 place count 763 transition count 755
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3245 place count 762 transition count 754
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 3247 place count 760 transition count 754
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 3247 place count 760 transition count 753
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 3249 place count 759 transition count 753
Applied a total of 3249 rules in 439 ms. Remains 759 /2364 variables (removed 1605) and now considering 753/2164 (removed 1411) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 439 ms. Remains : 759/2364 places, 753/2164 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 240243 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :{}
Probabilistic random walk after 240243 steps, saw 153515 distinct states, run finished after 3001 ms. (steps per millisecond=80 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 753 rows 759 cols
[2023-03-21 23:00:16] [INFO ] Computed 359 place invariants in 7 ms
[2023-03-21 23:00:16] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 23:00:17] [INFO ] [Nat]Absence check using 359 positive place invariants in 152 ms returned sat
[2023-03-21 23:00:17] [INFO ] After 421ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 23:00:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 23:00:17] [INFO ] After 25ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 23:00:17] [INFO ] After 62ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-21 23:00:17] [INFO ] After 826ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 759 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 753/753 transitions.
Applied a total of 0 rules in 26 ms. Remains 759 /759 variables (removed 0) and now considering 753/753 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 759/759 places, 753/753 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 753/753 transitions.
Applied a total of 0 rules in 14 ms. Remains 759 /759 variables (removed 0) and now considering 753/753 (removed 0) transitions.
[2023-03-21 23:00:17] [INFO ] Invariant cache hit.
[2023-03-21 23:00:18] [INFO ] Implicit Places using invariants in 430 ms returned [748]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 448 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 758/759 places, 753/753 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 757 transition count 752
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 757 transition count 752
Applied a total of 2 rules in 19 ms. Remains 757 /758 variables (removed 1) and now considering 752/753 (removed 1) transitions.
// Phase 1: matrix 752 rows 757 cols
[2023-03-21 23:00:18] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-21 23:00:18] [INFO ] Implicit Places using invariants in 568 ms returned []
[2023-03-21 23:00:18] [INFO ] Invariant cache hit.
[2023-03-21 23:00:20] [INFO ] Implicit Places using invariants and state equation in 1395 ms returned []
Implicit Place search using SMT with State Equation took 1983 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 757/759 places, 752/753 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2464 ms. Remains : 757/759 places, 752/753 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 243251 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 243251 steps, saw 155229 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 23:00:23] [INFO ] Invariant cache hit.
[2023-03-21 23:00:23] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 23:00:23] [INFO ] [Nat]Absence check using 358 positive place invariants in 105 ms returned sat
[2023-03-21 23:00:24] [INFO ] After 403ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 23:00:24] [INFO ] After 446ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 61 ms.
[2023-03-21 23:00:24] [INFO ] After 780ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 757 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 752/752 transitions.
Applied a total of 0 rules in 10 ms. Remains 757 /757 variables (removed 0) and now considering 752/752 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 757/757 places, 752/752 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 752/752 transitions.
Applied a total of 0 rules in 10 ms. Remains 757 /757 variables (removed 0) and now considering 752/752 (removed 0) transitions.
[2023-03-21 23:00:24] [INFO ] Invariant cache hit.
[2023-03-21 23:00:24] [INFO ] Implicit Places using invariants in 475 ms returned []
[2023-03-21 23:00:24] [INFO ] Invariant cache hit.
[2023-03-21 23:00:26] [INFO ] Implicit Places using invariants and state equation in 1849 ms returned []
Implicit Place search using SMT with State Equation took 2338 ms to find 0 implicit places.
[2023-03-21 23:00:26] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-21 23:00:26] [INFO ] Invariant cache hit.
[2023-03-21 23:00:27] [INFO ] Dead Transitions using invariants and state equation in 545 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2904 ms. Remains : 757/757 places, 752/752 transitions.
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 757 transition count 752
Applied a total of 80 rules in 34 ms. Remains 757 /757 variables (removed 0) and now considering 752/752 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 752 rows 757 cols
[2023-03-21 23:00:27] [INFO ] Computed 358 place invariants in 1 ms
[2023-03-21 23:00:27] [INFO ] After 201ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 23:00:27] [INFO ] [Nat]Absence check using 358 positive place invariants in 97 ms returned sat
[2023-03-21 23:00:28] [INFO ] After 707ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 23:00:28] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-21 23:00:28] [INFO ] After 70ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 23:00:28] [INFO ] After 140ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-21 23:00:28] [INFO ] After 1174ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (OR (NOT p0) (NOT p2)))), (X (AND p0 p2)), true, (X (X p2)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p2 p1))), (F (OR (NOT p2) (NOT p1)))]
Knowledge based reduction with 6 factoid took 351 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 342 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 265 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Support contains 4 out of 2364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2364/2364 places, 2164/2164 transitions.
Applied a total of 0 rules in 118 ms. Remains 2364 /2364 variables (removed 0) and now considering 2164/2164 (removed 0) transitions.
// Phase 1: matrix 2164 rows 2364 cols
[2023-03-21 23:00:29] [INFO ] Computed 361 place invariants in 14 ms
[2023-03-21 23:00:30] [INFO ] Implicit Places using invariants in 930 ms returned []
[2023-03-21 23:00:30] [INFO ] Invariant cache hit.
[2023-03-21 23:00:34] [INFO ] Implicit Places using invariants and state equation in 4330 ms returned []
Implicit Place search using SMT with State Equation took 5278 ms to find 0 implicit places.
[2023-03-21 23:00:34] [INFO ] Invariant cache hit.
[2023-03-21 23:00:36] [INFO ] Dead Transitions using invariants and state equation in 1849 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7248 ms. Remains : 2364/2364 places, 2164/2164 transitions.
Computed a total of 639 stabilizing places and 639 stable transitions
Computed a total of 639 stabilizing places and 639 stable transitions
Detected a total of 639/2364 stabilizing places and 639/2164 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p2 p1), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 152 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 397 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-21 23:00:37] [INFO ] Invariant cache hit.
[2023-03-21 23:00:37] [INFO ] After 328ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 23:00:38] [INFO ] [Nat]Absence check using 361 positive place invariants in 187 ms returned sat
[2023-03-21 23:00:40] [INFO ] After 1855ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 23:00:40] [INFO ] Deduced a trap composed of 24 places in 601 ms of which 1 ms to minimize.
[2023-03-21 23:00:41] [INFO ] Deduced a trap composed of 20 places in 688 ms of which 4 ms to minimize.
[2023-03-21 23:00:42] [INFO ] Deduced a trap composed of 21 places in 1018 ms of which 1 ms to minimize.
[2023-03-21 23:00:43] [INFO ] Deduced a trap composed of 21 places in 647 ms of which 2 ms to minimize.
[2023-03-21 23:00:44] [INFO ] Deduced a trap composed of 29 places in 663 ms of which 2 ms to minimize.
[2023-03-21 23:00:44] [INFO ] Deduced a trap composed of 27 places in 470 ms of which 1 ms to minimize.
[2023-03-21 23:00:45] [INFO ] Deduced a trap composed of 29 places in 508 ms of which 1 ms to minimize.
[2023-03-21 23:00:45] [INFO ] Deduced a trap composed of 22 places in 589 ms of which 1 ms to minimize.
[2023-03-21 23:00:46] [INFO ] Deduced a trap composed of 25 places in 552 ms of which 1 ms to minimize.
[2023-03-21 23:00:47] [INFO ] Deduced a trap composed of 23 places in 600 ms of which 1 ms to minimize.
[2023-03-21 23:00:47] [INFO ] Deduced a trap composed of 19 places in 458 ms of which 2 ms to minimize.
[2023-03-21 23:00:48] [INFO ] Deduced a trap composed of 17 places in 580 ms of which 1 ms to minimize.
[2023-03-21 23:00:48] [INFO ] Deduced a trap composed of 23 places in 483 ms of which 2 ms to minimize.
[2023-03-21 23:00:49] [INFO ] Deduced a trap composed of 20 places in 644 ms of which 1 ms to minimize.
[2023-03-21 23:00:50] [INFO ] Deduced a trap composed of 33 places in 404 ms of which 2 ms to minimize.
[2023-03-21 23:00:51] [INFO ] Deduced a trap composed of 32 places in 1020 ms of which 2 ms to minimize.
[2023-03-21 23:00:52] [INFO ] Deduced a trap composed of 28 places in 727 ms of which 1 ms to minimize.
[2023-03-21 23:00:52] [INFO ] Deduced a trap composed of 37 places in 611 ms of which 14 ms to minimize.
[2023-03-21 23:00:53] [INFO ] Deduced a trap composed of 37 places in 543 ms of which 2 ms to minimize.
[2023-03-21 23:00:54] [INFO ] Deduced a trap composed of 34 places in 623 ms of which 1 ms to minimize.
[2023-03-21 23:00:54] [INFO ] Deduced a trap composed of 27 places in 387 ms of which 1 ms to minimize.
[2023-03-21 23:00:55] [INFO ] Deduced a trap composed of 33 places in 465 ms of which 1 ms to minimize.
[2023-03-21 23:00:55] [INFO ] Deduced a trap composed of 28 places in 573 ms of which 1 ms to minimize.
[2023-03-21 23:00:56] [INFO ] Deduced a trap composed of 44 places in 403 ms of which 1 ms to minimize.
[2023-03-21 23:00:56] [INFO ] Deduced a trap composed of 37 places in 413 ms of which 1 ms to minimize.
[2023-03-21 23:00:57] [INFO ] Deduced a trap composed of 20 places in 389 ms of which 1 ms to minimize.
[2023-03-21 23:00:57] [INFO ] Deduced a trap composed of 40 places in 408 ms of which 1 ms to minimize.
[2023-03-21 23:00:58] [INFO ] Deduced a trap composed of 39 places in 376 ms of which 1 ms to minimize.
[2023-03-21 23:00:58] [INFO ] Deduced a trap composed of 36 places in 335 ms of which 0 ms to minimize.
[2023-03-21 23:00:59] [INFO ] Deduced a trap composed of 31 places in 459 ms of which 1 ms to minimize.
[2023-03-21 23:00:59] [INFO ] Deduced a trap composed of 44 places in 445 ms of which 1 ms to minimize.
[2023-03-21 23:01:00] [INFO ] Deduced a trap composed of 34 places in 627 ms of which 1 ms to minimize.
[2023-03-21 23:01:01] [INFO ] Deduced a trap composed of 41 places in 629 ms of which 2 ms to minimize.
[2023-03-21 23:01:01] [INFO ] Deduced a trap composed of 37 places in 565 ms of which 1 ms to minimize.
[2023-03-21 23:01:02] [INFO ] Deduced a trap composed of 35 places in 278 ms of which 1 ms to minimize.
[2023-03-21 23:01:02] [INFO ] Deduced a trap composed of 31 places in 361 ms of which 1 ms to minimize.
[2023-03-21 23:01:03] [INFO ] Deduced a trap composed of 40 places in 339 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 23:01:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 23:01:03] [INFO ] After 25298ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 21 ms.
Support contains 2 out of 2364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2364/2364 places, 2164/2164 transitions.
Drop transitions removed 479 transitions
Trivial Post-agglo rules discarded 479 transitions
Performed 479 trivial Post agglomeration. Transition count delta: 479
Iterating post reduction 0 with 479 rules applied. Total rules applied 479 place count 2364 transition count 1685
Reduce places removed 479 places and 0 transitions.
Iterating post reduction 1 with 479 rules applied. Total rules applied 958 place count 1885 transition count 1685
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 319 Pre rules applied. Total rules applied 958 place count 1885 transition count 1366
Deduced a syphon composed of 319 places in 2 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 2 with 638 rules applied. Total rules applied 1596 place count 1566 transition count 1366
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1597 place count 1565 transition count 1365
Iterating global reduction 2 with 1 rules applied. Total rules applied 1598 place count 1565 transition count 1365
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1598 place count 1565 transition count 1364
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1600 place count 1564 transition count 1364
Performed 681 Post agglomeration using F-continuation condition.Transition count delta: 681
Deduced a syphon composed of 681 places in 1 ms
Reduce places removed 681 places and 0 transitions.
Iterating global reduction 2 with 1362 rules applied. Total rules applied 2962 place count 883 transition count 683
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2963 place count 883 transition count 682
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2965 place count 882 transition count 681
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3167 place count 781 transition count 746
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 3201 place count 764 transition count 757
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3202 place count 764 transition count 756
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3203 place count 764 transition count 755
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3204 place count 763 transition count 755
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 5 with 40 rules applied. Total rules applied 3244 place count 763 transition count 755
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3245 place count 762 transition count 754
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 3247 place count 760 transition count 754
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 3247 place count 760 transition count 753
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 3249 place count 759 transition count 753
Applied a total of 3249 rules in 332 ms. Remains 759 /2364 variables (removed 1605) and now considering 753/2164 (removed 1411) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 332 ms. Remains : 759/2364 places, 753/2164 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 243246 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 243246 steps, saw 155283 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 753 rows 759 cols
[2023-03-21 23:01:06] [INFO ] Computed 359 place invariants in 3 ms
[2023-03-21 23:01:06] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 23:01:06] [INFO ] [Nat]Absence check using 359 positive place invariants in 53 ms returned sat
[2023-03-21 23:01:07] [INFO ] After 303ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 23:01:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 23:01:07] [INFO ] After 23ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 23:01:07] [INFO ] After 111ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-21 23:01:07] [INFO ] After 619ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 1110 steps, including 343 resets, run visited all 1 properties in 15 ms. (steps per millisecond=74 )
Parikh walk visited 1 properties in 14 ms.
Knowledge obtained : [(AND p2 p1), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (AND p2 p1))), (F (OR (NOT p2) (NOT p1)))]
Knowledge based reduction with 3 factoid took 347 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 326 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 339 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 416 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 624 ms.
Product exploration explored 100000 steps with 0 reset in 751 ms.
Applying partial POR strategy [true, true, true, false, false, false]
Stuttering acceptance computed with spot in 351 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Support contains 4 out of 2364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2364/2364 places, 2164/2164 transitions.
Performed 477 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 477 rules applied. Total rules applied 477 place count 2364 transition count 2164
Performed 163 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 163 Pre rules applied. Total rules applied 477 place count 2364 transition count 2287
Deduced a syphon composed of 640 places in 3 ms
Iterating global reduction 1 with 163 rules applied. Total rules applied 640 place count 2364 transition count 2287
Performed 797 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1437 places in 3 ms
Iterating global reduction 1 with 797 rules applied. Total rules applied 1437 place count 2364 transition count 2287
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1438 place count 2364 transition count 2286
Renaming transitions due to excessive name length > 1024 char.
Discarding 316 places :
Symmetric choice reduction at 2 with 316 rule applications. Total rules 1754 place count 2048 transition count 1970
Deduced a syphon composed of 1121 places in 3 ms
Iterating global reduction 2 with 316 rules applied. Total rules applied 2070 place count 2048 transition count 1970
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1122 places in 3 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2071 place count 2048 transition count 1970
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2073 place count 2046 transition count 1968
Deduced a syphon composed of 1120 places in 3 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2075 place count 2046 transition count 1968
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -520
Deduced a syphon composed of 1221 places in 3 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2176 place count 2046 transition count 2488
Discarding 102 places :
Symmetric choice reduction at 2 with 102 rule applications. Total rules 2278 place count 1944 transition count 2284
Deduced a syphon composed of 1119 places in 3 ms
Iterating global reduction 2 with 102 rules applied. Total rules applied 2380 place count 1944 transition count 2284
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: -312
Deduced a syphon composed of 1176 places in 6 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 2437 place count 1944 transition count 2596
Discarding 57 places :
Symmetric choice reduction at 2 with 57 rule applications. Total rules 2494 place count 1887 transition count 2482
Deduced a syphon composed of 1119 places in 3 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 2551 place count 1887 transition count 2482
Deduced a syphon composed of 1119 places in 3 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 2560 place count 1887 transition count 2473
Deduced a syphon composed of 1119 places in 3 ms
Applied a total of 2560 rules in 1131 ms. Remains 1887 /2364 variables (removed 477) and now considering 2473/2164 (removed -309) transitions.
[2023-03-21 23:01:11] [INFO ] Redundant transitions in 45 ms returned []
// Phase 1: matrix 2473 rows 1887 cols
[2023-03-21 23:01:11] [INFO ] Computed 361 place invariants in 24 ms
[2023-03-21 23:01:13] [INFO ] Dead Transitions using invariants and state equation in 1825 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1887/2364 places, 2473/2164 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3011 ms. Remains : 1887/2364 places, 2473/2164 transitions.
Support contains 4 out of 2364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2364/2364 places, 2164/2164 transitions.
Applied a total of 0 rules in 108 ms. Remains 2364 /2364 variables (removed 0) and now considering 2164/2164 (removed 0) transitions.
// Phase 1: matrix 2164 rows 2364 cols
[2023-03-21 23:01:13] [INFO ] Computed 361 place invariants in 9 ms
[2023-03-21 23:01:14] [INFO ] Implicit Places using invariants in 1027 ms returned []
[2023-03-21 23:01:14] [INFO ] Invariant cache hit.
[2023-03-21 23:01:18] [INFO ] Implicit Places using invariants and state equation in 3626 ms returned []
Implicit Place search using SMT with State Equation took 4668 ms to find 0 implicit places.
[2023-03-21 23:01:18] [INFO ] Invariant cache hit.
[2023-03-21 23:01:20] [INFO ] Dead Transitions using invariants and state equation in 1866 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6648 ms. Remains : 2364/2364 places, 2164/2164 transitions.
Treatment of property ShieldIIPt-PT-040B-LTLCardinality-15 finished in 103764 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((X(X(p1)) U G(!p0)))))'
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(X(p1))&&G(p2)&&p0)))'
[2023-03-21 23:01:20] [INFO ] Flatten gal took : 102 ms
[2023-03-21 23:01:20] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-21 23:01:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2374 places, 2174 transitions and 5628 arcs took 11 ms.
Total runtime 490850 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2562/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2562/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2562/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2562/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldIIPt-PT-040B-LTLCardinality-02
Could not compute solution for formula : ShieldIIPt-PT-040B-LTLCardinality-09
Could not compute solution for formula : ShieldIIPt-PT-040B-LTLCardinality-14
Could not compute solution for formula : ShieldIIPt-PT-040B-LTLCardinality-15

BK_STOP 1679439686098

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

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

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name ShieldIIPt-PT-040B-LTLCardinality-14
ltl formula formula --ltl=/tmp/2562/ltl_2_
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 2374 places, 2174 transitions and 5628 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.430 real 0.150 user 0.180 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2562/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2562/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2562/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2562/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name ShieldIIPt-PT-040B-LTLCardinality-15
ltl formula formula --ltl=/tmp/2562/ltl_3_
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 2374 places, 2174 transitions and 5628 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.400 real 0.070 user 0.190 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2562/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2562/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2562/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2562/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-040B"
export BK_EXAMINATION="LTLCardinality"
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-040B, examination is LTLCardinality"
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-167903716900315"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-040B.tgz
mv ShieldIIPt-PT-040B execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;