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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 964K
-rw-r--r-- 1 mcc users 6.4K Feb 25 16:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 16:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 16:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 25 16:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 16:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Feb 25 16:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 16:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 16:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 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 503K 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 ShieldIIPs-PT-030B-LTLFireability-00
FORMULA_NAME ShieldIIPs-PT-030B-LTLFireability-01
FORMULA_NAME ShieldIIPs-PT-030B-LTLFireability-02
FORMULA_NAME ShieldIIPs-PT-030B-LTLFireability-03
FORMULA_NAME ShieldIIPs-PT-030B-LTLFireability-04
FORMULA_NAME ShieldIIPs-PT-030B-LTLFireability-05
FORMULA_NAME ShieldIIPs-PT-030B-LTLFireability-06
FORMULA_NAME ShieldIIPs-PT-030B-LTLFireability-07
FORMULA_NAME ShieldIIPs-PT-030B-LTLFireability-08
FORMULA_NAME ShieldIIPs-PT-030B-LTLFireability-09
FORMULA_NAME ShieldIIPs-PT-030B-LTLFireability-10
FORMULA_NAME ShieldIIPs-PT-030B-LTLFireability-11
FORMULA_NAME ShieldIIPs-PT-030B-LTLFireability-12
FORMULA_NAME ShieldIIPs-PT-030B-LTLFireability-13
FORMULA_NAME ShieldIIPs-PT-030B-LTLFireability-14
FORMULA_NAME ShieldIIPs-PT-030B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679424600164

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-030B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 18:50:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 18:50:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 18:50:03] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2023-03-21 18:50:03] [INFO ] Transformed 1803 places.
[2023-03-21 18:50:03] [INFO ] Transformed 1773 transitions.
[2023-03-21 18:50:03] [INFO ] Found NUPN structural information;
[2023-03-21 18:50:03] [INFO ] Parsed PT model containing 1803 places and 1773 transitions and 5346 arcs in 289 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA ShieldIIPs-PT-030B-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030B-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030B-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030B-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030B-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030B-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 1803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1803/1803 places, 1773/1773 transitions.
Discarding 206 places :
Symmetric choice reduction at 0 with 206 rule applications. Total rules 206 place count 1597 transition count 1567
Iterating global reduction 0 with 206 rules applied. Total rules applied 412 place count 1597 transition count 1567
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 413 place count 1596 transition count 1566
Iterating global reduction 0 with 1 rules applied. Total rules applied 414 place count 1596 transition count 1566
Applied a total of 414 rules in 485 ms. Remains 1596 /1803 variables (removed 207) and now considering 1566/1773 (removed 207) transitions.
// Phase 1: matrix 1566 rows 1596 cols
[2023-03-21 18:50:03] [INFO ] Computed 271 place invariants in 18 ms
[2023-03-21 18:50:05] [INFO ] Implicit Places using invariants in 1456 ms returned []
[2023-03-21 18:50:05] [INFO ] Invariant cache hit.
[2023-03-21 18:50:08] [INFO ] Implicit Places using invariants and state equation in 2999 ms returned []
Implicit Place search using SMT with State Equation took 4488 ms to find 0 implicit places.
[2023-03-21 18:50:08] [INFO ] Invariant cache hit.
[2023-03-21 18:50:09] [INFO ] Dead Transitions using invariants and state equation in 1243 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1596/1803 places, 1566/1773 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6223 ms. Remains : 1596/1803 places, 1566/1773 transitions.
Support contains 47 out of 1596 places after structural reductions.
[2023-03-21 18:50:10] [INFO ] Flatten gal took : 160 ms
[2023-03-21 18:50:10] [INFO ] Flatten gal took : 80 ms
[2023-03-21 18:50:10] [INFO ] Input system was already deterministic with 1566 transitions.
Support contains 42 out of 1596 places (down from 47) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 490 ms. (steps per millisecond=20 ) properties (out of 22) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) 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 5) 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 5) 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 5) 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 5) seen :0
Running SMT prover for 5 properties.
[2023-03-21 18:50:10] [INFO ] Invariant cache hit.
[2023-03-21 18:50:11] [INFO ] [Real]Absence check using 271 positive place invariants in 124 ms returned sat
[2023-03-21 18:50:13] [INFO ] After 1685ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:1
[2023-03-21 18:50:14] [INFO ] Deduced a trap composed of 26 places in 942 ms of which 20 ms to minimize.
[2023-03-21 18:50:15] [INFO ] Deduced a trap composed of 20 places in 716 ms of which 2 ms to minimize.
[2023-03-21 18:50:16] [INFO ] Deduced a trap composed of 24 places in 747 ms of which 1 ms to minimize.
[2023-03-21 18:50:16] [INFO ] Deduced a trap composed of 22 places in 808 ms of which 15 ms to minimize.
[2023-03-21 18:50:17] [INFO ] Deduced a trap composed of 24 places in 428 ms of which 21 ms to minimize.
[2023-03-21 18:50:17] [INFO ] Deduced a trap composed of 25 places in 384 ms of which 1 ms to minimize.
[2023-03-21 18:50:18] [INFO ] Deduced a trap composed of 22 places in 408 ms of which 18 ms to minimize.
[2023-03-21 18:50:18] [INFO ] Deduced a trap composed of 32 places in 296 ms of which 1 ms to minimize.
[2023-03-21 18:50:19] [INFO ] Deduced a trap composed of 39 places in 345 ms of which 1 ms to minimize.
[2023-03-21 18:50:19] [INFO ] Deduced a trap composed of 35 places in 327 ms of which 11 ms to minimize.
[2023-03-21 18:50:19] [INFO ] Deduced a trap composed of 22 places in 363 ms of which 2 ms to minimize.
[2023-03-21 18:50:20] [INFO ] Deduced a trap composed of 43 places in 397 ms of which 1 ms to minimize.
[2023-03-21 18:50:20] [INFO ] Deduced a trap composed of 22 places in 358 ms of which 1 ms to minimize.
[2023-03-21 18:50:21] [INFO ] Deduced a trap composed of 36 places in 471 ms of which 1 ms to minimize.
[2023-03-21 18:50:21] [INFO ] Deduced a trap composed of 30 places in 341 ms of which 1 ms to minimize.
[2023-03-21 18:50:22] [INFO ] Deduced a trap composed of 27 places in 323 ms of which 1 ms to minimize.
[2023-03-21 18:50:22] [INFO ] Deduced a trap composed of 27 places in 369 ms of which 1 ms to minimize.
[2023-03-21 18:50:23] [INFO ] Deduced a trap composed of 33 places in 517 ms of which 14 ms to minimize.
[2023-03-21 18:50:23] [INFO ] Deduced a trap composed of 22 places in 371 ms of which 1 ms to minimize.
[2023-03-21 18:50:24] [INFO ] Deduced a trap composed of 25 places in 488 ms of which 2 ms to minimize.
[2023-03-21 18:50:24] [INFO ] Deduced a trap composed of 29 places in 368 ms of which 1 ms to minimize.
[2023-03-21 18:50:25] [INFO ] Deduced a trap composed of 25 places in 561 ms of which 3 ms to minimize.
[2023-03-21 18:50:25] [INFO ] Deduced a trap composed of 30 places in 375 ms of which 1 ms to minimize.
[2023-03-21 18:50:26] [INFO ] Deduced a trap composed of 35 places in 512 ms of which 1 ms to minimize.
[2023-03-21 18:50:27] [INFO ] Deduced a trap composed of 24 places in 607 ms of which 1 ms to minimize.
[2023-03-21 18:50:27] [INFO ] Deduced a trap composed of 37 places in 310 ms of which 3 ms to minimize.
[2023-03-21 18:50:27] [INFO ] Deduced a trap composed of 31 places in 281 ms of which 1 ms to minimize.
[2023-03-21 18:50:28] [INFO ] Deduced a trap composed of 39 places in 588 ms of which 1 ms to minimize.
[2023-03-21 18:50:28] [INFO ] Deduced a trap composed of 41 places in 335 ms of which 1 ms to minimize.
[2023-03-21 18:50:29] [INFO ] Deduced a trap composed of 24 places in 582 ms of which 22 ms to minimize.
[2023-03-21 18:50:30] [INFO ] Deduced a trap composed of 36 places in 370 ms of which 1 ms to minimize.
[2023-03-21 18:50:30] [INFO ] Deduced a trap composed of 43 places in 244 ms of which 0 ms to minimize.
[2023-03-21 18:50:30] [INFO ] Deduced a trap composed of 42 places in 285 ms of which 1 ms to minimize.
[2023-03-21 18:50:32] [INFO ] Deduced a trap composed of 33 places in 1909 ms of which 13 ms to minimize.
[2023-03-21 18:50:33] [INFO ] Deduced a trap composed of 30 places in 247 ms of which 1 ms to minimize.
[2023-03-21 18:50:33] [INFO ] Deduced a trap composed of 37 places in 238 ms of which 0 ms to minimize.
[2023-03-21 18:50:35] [INFO ] Deduced a trap composed of 41 places in 2213 ms of which 1 ms to minimize.
[2023-03-21 18:50:35] [INFO ] Deduced a trap composed of 41 places in 242 ms of which 1 ms to minimize.
[2023-03-21 18:50:37] [INFO ] Deduced a trap composed of 12 places in 1159 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
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 18:50:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 18:50:37] [INFO ] After 26194ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 1 properties in 249 ms.
Support contains 9 out of 1596 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1596/1596 places, 1566/1566 transitions.
Drop transitions removed 149 transitions
Trivial Post-agglo rules discarded 149 transitions
Performed 149 trivial Post agglomeration. Transition count delta: 149
Iterating post reduction 0 with 149 rules applied. Total rules applied 149 place count 1596 transition count 1417
Reduce places removed 149 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 151 rules applied. Total rules applied 300 place count 1447 transition count 1415
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 302 place count 1445 transition count 1415
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 151 Pre rules applied. Total rules applied 302 place count 1445 transition count 1264
Deduced a syphon composed of 151 places in 3 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 3 with 302 rules applied. Total rules applied 604 place count 1294 transition count 1264
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 606 place count 1292 transition count 1262
Iterating global reduction 3 with 2 rules applied. Total rules applied 608 place count 1292 transition count 1262
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 608 place count 1292 transition count 1261
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 610 place count 1291 transition count 1261
Performed 534 Post agglomeration using F-continuation condition.Transition count delta: 534
Deduced a syphon composed of 534 places in 4 ms
Reduce places removed 534 places and 0 transitions.
Iterating global reduction 3 with 1068 rules applied. Total rules applied 1678 place count 757 transition count 727
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 206 times.
Drop transitions removed 206 transitions
Iterating global reduction 3 with 206 rules applied. Total rules applied 1884 place count 757 transition count 727
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1885 place count 756 transition count 726
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1886 place count 755 transition count 726
Applied a total of 1886 rules in 495 ms. Remains 755 /1596 variables (removed 841) and now considering 726/1566 (removed 840) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 495 ms. Remains : 755/1596 places, 726/1566 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 726 rows 755 cols
[2023-03-21 18:50:38] [INFO ] Computed 270 place invariants in 46 ms
[2023-03-21 18:50:38] [INFO ] [Real]Absence check using 269 positive place invariants in 44 ms returned sat
[2023-03-21 18:50:38] [INFO ] [Real]Absence check using 269 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-21 18:50:38] [INFO ] After 570ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 18:50:39] [INFO ] [Nat]Absence check using 269 positive place invariants in 161 ms returned sat
[2023-03-21 18:50:39] [INFO ] [Nat]Absence check using 269 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-21 18:50:39] [INFO ] After 427ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 18:50:39] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 1 ms to minimize.
[2023-03-21 18:50:39] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 0 ms to minimize.
[2023-03-21 18:50:39] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2023-03-21 18:50:40] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 12 ms to minimize.
[2023-03-21 18:50:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 529 ms
[2023-03-21 18:50:40] [INFO ] After 1004ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 62 ms.
[2023-03-21 18:50:40] [INFO ] After 1466ms 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 755 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 755/755 places, 726/726 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 752 transition count 723
Applied a total of 6 rules in 82 ms. Remains 752 /755 variables (removed 3) and now considering 723/726 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 752/755 places, 723/726 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 201034 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 201034 steps, saw 164757 distinct states, run finished after 3015 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 723 rows 752 cols
[2023-03-21 18:50:43] [INFO ] Computed 270 place invariants in 11 ms
[2023-03-21 18:50:43] [INFO ] [Real]Absence check using 269 positive place invariants in 53 ms returned sat
[2023-03-21 18:50:43] [INFO ] [Real]Absence check using 269 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-21 18:50:44] [INFO ] After 692ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 18:50:44] [INFO ] [Nat]Absence check using 269 positive place invariants in 74 ms returned sat
[2023-03-21 18:50:44] [INFO ] [Nat]Absence check using 269 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-21 18:50:44] [INFO ] After 283ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 18:50:44] [INFO ] Deduced a trap composed of 8 places in 172 ms of which 1 ms to minimize.
[2023-03-21 18:50:44] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2023-03-21 18:50:45] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 0 ms to minimize.
[2023-03-21 18:50:45] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 1 ms to minimize.
[2023-03-21 18:50:45] [INFO ] Deduced a trap composed of 17 places in 191 ms of which 1 ms to minimize.
[2023-03-21 18:50:45] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 0 ms to minimize.
[2023-03-21 18:50:45] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 1 ms to minimize.
[2023-03-21 18:50:45] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 0 ms to minimize.
[2023-03-21 18:50:46] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 0 ms to minimize.
[2023-03-21 18:50:46] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 1 ms to minimize.
[2023-03-21 18:50:46] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1673 ms
[2023-03-21 18:50:46] [INFO ] After 1993ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-21 18:50:46] [INFO ] After 2272ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 25 ms.
Support contains 2 out of 752 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 723/723 transitions.
Applied a total of 0 rules in 44 ms. Remains 752 /752 variables (removed 0) and now considering 723/723 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 752/752 places, 723/723 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 723/723 transitions.
Applied a total of 0 rules in 26 ms. Remains 752 /752 variables (removed 0) and now considering 723/723 (removed 0) transitions.
[2023-03-21 18:50:46] [INFO ] Invariant cache hit.
[2023-03-21 18:50:47] [INFO ] Implicit Places using invariants in 510 ms returned []
[2023-03-21 18:50:47] [INFO ] Invariant cache hit.
[2023-03-21 18:50:48] [INFO ] Implicit Places using invariants and state equation in 1197 ms returned []
Implicit Place search using SMT with State Equation took 1734 ms to find 0 implicit places.
[2023-03-21 18:50:48] [INFO ] Redundant transitions in 62 ms returned []
[2023-03-21 18:50:48] [INFO ] Invariant cache hit.
[2023-03-21 18:50:48] [INFO ] Dead Transitions using invariants and state equation in 425 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2258 ms. Remains : 752/752 places, 723/723 transitions.
Applied a total of 0 rules in 16 ms. Remains 752 /752 variables (removed 0) and now considering 723/723 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-21 18:50:48] [INFO ] Invariant cache hit.
[2023-03-21 18:50:48] [INFO ] [Real]Absence check using 269 positive place invariants in 45 ms returned sat
[2023-03-21 18:50:48] [INFO ] [Real]Absence check using 269 positive and 1 generalized place invariants in 14 ms returned sat
[2023-03-21 18:50:49] [INFO ] After 615ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 18:50:49] [INFO ] [Nat]Absence check using 269 positive place invariants in 40 ms returned sat
[2023-03-21 18:50:49] [INFO ] [Nat]Absence check using 269 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-21 18:50:50] [INFO ] After 398ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 18:50:50] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 18 ms to minimize.
[2023-03-21 18:50:50] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 0 ms to minimize.
[2023-03-21 18:50:50] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 0 ms to minimize.
[2023-03-21 18:50:50] [INFO ] Deduced a trap composed of 9 places in 180 ms of which 1 ms to minimize.
[2023-03-21 18:50:51] [INFO ] Deduced a trap composed of 5 places in 143 ms of which 0 ms to minimize.
[2023-03-21 18:50:51] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 0 ms to minimize.
[2023-03-21 18:50:51] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 1 ms to minimize.
[2023-03-21 18:50:51] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 0 ms to minimize.
[2023-03-21 18:50:52] [INFO ] Deduced a trap composed of 6 places in 808 ms of which 23 ms to minimize.
[2023-03-21 18:50:52] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 1 ms to minimize.
[2023-03-21 18:50:52] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 1 ms to minimize.
[2023-03-21 18:50:52] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2625 ms
[2023-03-21 18:50:52] [INFO ] After 3113ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-21 18:50:52] [INFO ] After 3407ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Computed a total of 361 stabilizing places and 361 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(p1))))'
Support contains 6 out of 1596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1596/1596 places, 1566/1566 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1592 transition count 1562
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1592 transition count 1562
Applied a total of 8 rules in 133 ms. Remains 1592 /1596 variables (removed 4) and now considering 1562/1566 (removed 4) transitions.
// Phase 1: matrix 1562 rows 1592 cols
[2023-03-21 18:50:53] [INFO ] Computed 271 place invariants in 5 ms
[2023-03-21 18:50:54] [INFO ] Implicit Places using invariants in 831 ms returned []
[2023-03-21 18:50:54] [INFO ] Invariant cache hit.
[2023-03-21 18:50:56] [INFO ] Implicit Places using invariants and state equation in 2014 ms returned []
Implicit Place search using SMT with State Equation took 2856 ms to find 0 implicit places.
[2023-03-21 18:50:56] [INFO ] Invariant cache hit.
[2023-03-21 18:50:58] [INFO ] Dead Transitions using invariants and state equation in 1835 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1592/1596 places, 1562/1566 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4838 ms. Remains : 1592/1596 places, 1562/1566 transitions.
Stuttering acceptance computed with spot in 699 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-030B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ 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: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 1}, { cond=(NOT p0), acceptance={} source=5 dest: 3}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=5, aps=[p1:(OR (EQ s450 1) (EQ s293 1) (AND (EQ s1193 1) (EQ s1217 1))), p0:(AND (EQ s1499 1) (EQ s1523 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA ShieldIIPs-PT-030B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-030B-LTLFireability-01 finished in 5637 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 5 out of 1596 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1596/1596 places, 1566/1566 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 149 transitions
Trivial Post-agglo rules discarded 149 transitions
Performed 149 trivial Post agglomeration. Transition count delta: 149
Iterating post reduction 0 with 149 rules applied. Total rules applied 149 place count 1595 transition count 1416
Reduce places removed 149 places and 0 transitions.
Iterating post reduction 1 with 149 rules applied. Total rules applied 298 place count 1446 transition count 1416
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 151 Pre rules applied. Total rules applied 298 place count 1446 transition count 1265
Deduced a syphon composed of 151 places in 2 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 302 rules applied. Total rules applied 600 place count 1295 transition count 1265
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 604 place count 1291 transition count 1261
Iterating global reduction 2 with 4 rules applied. Total rules applied 608 place count 1291 transition count 1261
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 608 place count 1291 transition count 1260
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 610 place count 1290 transition count 1260
Performed 535 Post agglomeration using F-continuation condition.Transition count delta: 535
Deduced a syphon composed of 535 places in 2 ms
Reduce places removed 535 places and 0 transitions.
Iterating global reduction 2 with 1070 rules applied. Total rules applied 1680 place count 755 transition count 725
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1682 place count 753 transition count 723
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1683 place count 752 transition count 723
Applied a total of 1683 rules in 400 ms. Remains 752 /1596 variables (removed 844) and now considering 723/1566 (removed 843) transitions.
// Phase 1: matrix 723 rows 752 cols
[2023-03-21 18:50:59] [INFO ] Computed 270 place invariants in 2 ms
[2023-03-21 18:51:00] [INFO ] Implicit Places using invariants in 715 ms returned []
[2023-03-21 18:51:00] [INFO ] Invariant cache hit.
[2023-03-21 18:51:00] [INFO ] Implicit Places using invariants and state equation in 707 ms returned []
Implicit Place search using SMT with State Equation took 1448 ms to find 0 implicit places.
[2023-03-21 18:51:01] [INFO ] Redundant transitions in 483 ms returned [722]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 722 rows 752 cols
[2023-03-21 18:51:01] [INFO ] Computed 270 place invariants in 2 ms
[2023-03-21 18:51:01] [INFO ] Dead Transitions using invariants and state equation in 481 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 752/1596 places, 722/1566 transitions.
Applied a total of 0 rules in 18 ms. Remains 752 /752 variables (removed 0) and now considering 722/722 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2892 ms. Remains : 752/1596 places, 722/1566 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-030B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (EQ s10 0) (EQ s17 0) (EQ s28 0)) (OR (EQ s383 0) (EQ s394 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 64 reset in 818 ms.
Product exploration explored 100000 steps with 64 reset in 825 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 123 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Finished random walk after 1441 steps, including 0 resets, run visited all 1 properties in 14 ms. (steps per millisecond=102 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 250 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Support contains 5 out of 752 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 752/752 places, 722/722 transitions.
Applied a total of 0 rules in 57 ms. Remains 752 /752 variables (removed 0) and now considering 722/722 (removed 0) transitions.
[2023-03-21 18:51:04] [INFO ] Invariant cache hit.
[2023-03-21 18:51:04] [INFO ] Implicit Places using invariants in 520 ms returned []
[2023-03-21 18:51:04] [INFO ] Invariant cache hit.
[2023-03-21 18:51:06] [INFO ] Implicit Places using invariants and state equation in 1367 ms returned []
Implicit Place search using SMT with State Equation took 1900 ms to find 0 implicit places.
[2023-03-21 18:51:06] [INFO ] Redundant transitions in 121 ms returned []
[2023-03-21 18:51:06] [INFO ] Invariant cache hit.
[2023-03-21 18:51:06] [INFO ] Dead Transitions using invariants and state equation in 569 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2680 ms. Remains : 752/752 places, 722/722 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 165 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 1375 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=125 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 192 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0)]
Product exploration explored 100000 steps with 64 reset in 658 ms.
Product exploration explored 100000 steps with 64 reset in 744 ms.
Support contains 5 out of 752 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 752/752 places, 722/722 transitions.
Applied a total of 0 rules in 58 ms. Remains 752 /752 variables (removed 0) and now considering 722/722 (removed 0) transitions.
[2023-03-21 18:51:09] [INFO ] Invariant cache hit.
[2023-03-21 18:51:09] [INFO ] Implicit Places using invariants in 370 ms returned []
[2023-03-21 18:51:09] [INFO ] Invariant cache hit.
[2023-03-21 18:51:10] [INFO ] Implicit Places using invariants and state equation in 1117 ms returned []
Implicit Place search using SMT with State Equation took 1503 ms to find 0 implicit places.
[2023-03-21 18:51:10] [INFO ] Redundant transitions in 267 ms returned []
[2023-03-21 18:51:10] [INFO ] Invariant cache hit.
[2023-03-21 18:51:11] [INFO ] Dead Transitions using invariants and state equation in 516 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2375 ms. Remains : 752/752 places, 722/722 transitions.
Treatment of property ShieldIIPs-PT-030B-LTLFireability-02 finished in 12670 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 6 out of 1596 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1596/1596 places, 1566/1566 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 149 transitions
Trivial Post-agglo rules discarded 149 transitions
Performed 149 trivial Post agglomeration. Transition count delta: 149
Iterating post reduction 0 with 149 rules applied. Total rules applied 149 place count 1595 transition count 1416
Reduce places removed 149 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 151 rules applied. Total rules applied 300 place count 1446 transition count 1414
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 302 place count 1444 transition count 1414
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 150 Pre rules applied. Total rules applied 302 place count 1444 transition count 1264
Deduced a syphon composed of 150 places in 3 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 3 with 300 rules applied. Total rules applied 602 place count 1294 transition count 1264
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 606 place count 1290 transition count 1260
Iterating global reduction 3 with 4 rules applied. Total rules applied 610 place count 1290 transition count 1260
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 610 place count 1290 transition count 1259
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 612 place count 1289 transition count 1259
Performed 534 Post agglomeration using F-continuation condition.Transition count delta: 534
Deduced a syphon composed of 534 places in 1 ms
Reduce places removed 534 places and 0 transitions.
Iterating global reduction 3 with 1068 rules applied. Total rules applied 1680 place count 755 transition count 725
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1682 place count 753 transition count 723
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1683 place count 752 transition count 723
Applied a total of 1683 rules in 317 ms. Remains 752 /1596 variables (removed 844) and now considering 723/1566 (removed 843) transitions.
// Phase 1: matrix 723 rows 752 cols
[2023-03-21 18:51:11] [INFO ] Computed 270 place invariants in 2 ms
[2023-03-21 18:51:12] [INFO ] Implicit Places using invariants in 538 ms returned []
[2023-03-21 18:51:12] [INFO ] Invariant cache hit.
[2023-03-21 18:51:13] [INFO ] Implicit Places using invariants and state equation in 1019 ms returned []
Implicit Place search using SMT with State Equation took 1586 ms to find 0 implicit places.
[2023-03-21 18:51:13] [INFO ] Redundant transitions in 171 ms returned [722]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 722 rows 752 cols
[2023-03-21 18:51:13] [INFO ] Computed 270 place invariants in 2 ms
[2023-03-21 18:51:14] [INFO ] Dead Transitions using invariants and state equation in 418 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 752/1596 places, 722/1566 transitions.
Applied a total of 0 rules in 14 ms. Remains 752 /752 variables (removed 0) and now considering 722/722 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2519 ms. Remains : 752/1596 places, 722/1566 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-030B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s553 1) (EQ s576 1)), p0:(AND (EQ s659 1) (EQ s661 1) (EQ s206 1) (EQ s208 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1581 steps with 0 reset in 12 ms.
FORMULA ShieldIIPs-PT-030B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-030B-LTLFireability-03 finished in 2678 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G(p0))&&(p1||G(p2)))))'
Support contains 3 out of 1596 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1596/1596 places, 1566/1566 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 150 transitions
Trivial Post-agglo rules discarded 150 transitions
Performed 150 trivial Post agglomeration. Transition count delta: 150
Iterating post reduction 0 with 150 rules applied. Total rules applied 150 place count 1595 transition count 1415
Reduce places removed 150 places and 0 transitions.
Iterating post reduction 1 with 150 rules applied. Total rules applied 300 place count 1445 transition count 1415
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 300 place count 1445 transition count 1265
Deduced a syphon composed of 150 places in 2 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 600 place count 1295 transition count 1265
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 603 place count 1292 transition count 1262
Iterating global reduction 2 with 3 rules applied. Total rules applied 606 place count 1292 transition count 1262
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 606 place count 1292 transition count 1261
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 608 place count 1291 transition count 1261
Performed 534 Post agglomeration using F-continuation condition.Transition count delta: 534
Deduced a syphon composed of 534 places in 1 ms
Reduce places removed 534 places and 0 transitions.
Iterating global reduction 2 with 1068 rules applied. Total rules applied 1676 place count 757 transition count 727
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1678 place count 755 transition count 725
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1679 place count 754 transition count 725
Applied a total of 1679 rules in 200 ms. Remains 754 /1596 variables (removed 842) and now considering 725/1566 (removed 841) transitions.
// Phase 1: matrix 725 rows 754 cols
[2023-03-21 18:51:14] [INFO ] Computed 270 place invariants in 4 ms
[2023-03-21 18:51:14] [INFO ] Implicit Places using invariants in 512 ms returned []
[2023-03-21 18:51:14] [INFO ] Invariant cache hit.
[2023-03-21 18:51:15] [INFO ] Implicit Places using invariants and state equation in 1001 ms returned []
Implicit Place search using SMT with State Equation took 1514 ms to find 0 implicit places.
[2023-03-21 18:51:16] [INFO ] Redundant transitions in 101 ms returned [724]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 724 rows 754 cols
[2023-03-21 18:51:16] [INFO ] Computed 270 place invariants in 2 ms
[2023-03-21 18:51:16] [INFO ] Dead Transitions using invariants and state equation in 413 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 754/1596 places, 724/1566 transitions.
Applied a total of 0 rules in 41 ms. Remains 754 /754 variables (removed 0) and now considering 724/724 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2274 ms. Remains : 754/1596 places, 724/1566 transitions.
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-030B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=0 dest: 0}, { cond=(OR p1 p2), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={1} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={0} source=1 dest: 1}, { cond=(OR (AND p1 (NOT p0)) (AND p2 (NOT p0))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={1} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={1} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={1} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=3 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={1} source=3 dest: 2}, { cond=(AND p2 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s546 0), p2:(EQ s282 0), p0:(AND (EQ s3 1) (EQ s546 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 1589 steps with 0 reset in 14 ms.
FORMULA ShieldIIPs-PT-030B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-030B-LTLFireability-06 finished in 2498 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1596/1596 places, 1566/1566 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1592 transition count 1562
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1592 transition count 1562
Applied a total of 8 rules in 116 ms. Remains 1592 /1596 variables (removed 4) and now considering 1562/1566 (removed 4) transitions.
// Phase 1: matrix 1562 rows 1592 cols
[2023-03-21 18:51:16] [INFO ] Computed 271 place invariants in 14 ms
[2023-03-21 18:51:17] [INFO ] Implicit Places using invariants in 748 ms returned []
[2023-03-21 18:51:17] [INFO ] Invariant cache hit.
[2023-03-21 18:51:19] [INFO ] Implicit Places using invariants and state equation in 1926 ms returned []
Implicit Place search using SMT with State Equation took 2704 ms to find 0 implicit places.
[2023-03-21 18:51:19] [INFO ] Invariant cache hit.
[2023-03-21 18:51:21] [INFO ] Dead Transitions using invariants and state equation in 1409 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1592/1596 places, 1562/1566 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4230 ms. Remains : 1592/1596 places, 1562/1566 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-030B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s203 1) (EQ s219 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 35 reset in 730 ms.
Product exploration explored 100000 steps with 34 reset in 778 ms.
Computed a total of 359 stabilizing places and 359 stable transitions
Computed a total of 359 stabilizing places and 359 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 238 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Finished random walk after 3090 steps, including 0 resets, run visited all 1 properties in 28 ms. (steps per millisecond=110 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 227 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
[2023-03-21 18:51:23] [INFO ] Invariant cache hit.
[2023-03-21 18:51:24] [INFO ] [Real]Absence check using 271 positive place invariants in 259 ms returned sat
[2023-03-21 18:51:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 18:51:32] [INFO ] [Real]Absence check using state equation in 8466 ms returned sat
[2023-03-21 18:51:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 18:51:34] [INFO ] [Nat]Absence check using 271 positive place invariants in 351 ms returned sat
[2023-03-21 18:51:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 18:51:42] [INFO ] [Nat]Absence check using state equation in 8662 ms returned sat
[2023-03-21 18:51:43] [INFO ] Computed and/alt/rep : 1561/3512/1561 causal constraints (skipped 0 transitions) in 116 ms.
[2023-03-21 18:51:49] [INFO ] Deduced a trap composed of 21 places in 1120 ms of which 18 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 18:51:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 2 out of 1592 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1592/1592 places, 1562/1562 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 150 transitions
Trivial Post-agglo rules discarded 150 transitions
Performed 150 trivial Post agglomeration. Transition count delta: 150
Iterating post reduction 0 with 150 rules applied. Total rules applied 150 place count 1591 transition count 1411
Reduce places removed 150 places and 0 transitions.
Iterating post reduction 1 with 150 rules applied. Total rules applied 300 place count 1441 transition count 1411
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 151 Pre rules applied. Total rules applied 300 place count 1441 transition count 1260
Deduced a syphon composed of 151 places in 2 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 302 rules applied. Total rules applied 602 place count 1290 transition count 1260
Performed 536 Post agglomeration using F-continuation condition.Transition count delta: 536
Deduced a syphon composed of 536 places in 1 ms
Reduce places removed 536 places and 0 transitions.
Iterating global reduction 2 with 1072 rules applied. Total rules applied 1674 place count 754 transition count 724
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1676 place count 752 transition count 722
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1677 place count 751 transition count 722
Applied a total of 1677 rules in 200 ms. Remains 751 /1592 variables (removed 841) and now considering 722/1562 (removed 840) transitions.
// Phase 1: matrix 722 rows 751 cols
[2023-03-21 18:51:49] [INFO ] Computed 270 place invariants in 3 ms
[2023-03-21 18:51:49] [INFO ] Implicit Places using invariants in 550 ms returned []
[2023-03-21 18:51:49] [INFO ] Invariant cache hit.
[2023-03-21 18:51:50] [INFO ] Implicit Places using invariants and state equation in 899 ms returned []
Implicit Place search using SMT with State Equation took 1477 ms to find 0 implicit places.
[2023-03-21 18:51:51] [INFO ] Redundant transitions in 198 ms returned [721]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 721 rows 751 cols
[2023-03-21 18:51:51] [INFO ] Computed 270 place invariants in 1 ms
[2023-03-21 18:51:51] [INFO ] Dead Transitions using invariants and state equation in 420 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 751/1592 places, 721/1562 transitions.
Applied a total of 0 rules in 15 ms. Remains 751 /751 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2350 ms. Remains : 751/1592 places, 721/1562 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 201 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Finished random walk after 1425 steps, including 0 resets, run visited all 1 properties in 21 ms. (steps per millisecond=67 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 173 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
[2023-03-21 18:51:52] [INFO ] Invariant cache hit.
[2023-03-21 18:51:52] [INFO ] [Real]Absence check using 270 positive place invariants in 115 ms returned sat
[2023-03-21 18:51:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 18:51:53] [INFO ] [Real]Absence check using state equation in 1243 ms returned sat
[2023-03-21 18:51:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 18:51:54] [INFO ] [Nat]Absence check using 270 positive place invariants in 114 ms returned sat
[2023-03-21 18:51:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 18:51:55] [INFO ] [Nat]Absence check using state equation in 1193 ms returned sat
[2023-03-21 18:51:55] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2023-03-21 18:51:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
[2023-03-21 18:51:56] [INFO ] Computed and/alt/rep : 719/1791/719 causal constraints (skipped 0 transitions) in 82 ms.
[2023-03-21 18:52:08] [INFO ] Added : 525 causal constraints over 105 iterations in 12980 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Product exploration explored 100000 steps with 79 reset in 660 ms.
Product exploration explored 100000 steps with 79 reset in 714 ms.
Support contains 2 out of 751 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 751/751 places, 721/721 transitions.
Applied a total of 0 rules in 14 ms. Remains 751 /751 variables (removed 0) and now considering 721/721 (removed 0) transitions.
[2023-03-21 18:52:10] [INFO ] Invariant cache hit.
[2023-03-21 18:52:10] [INFO ] Implicit Places using invariants in 443 ms returned []
[2023-03-21 18:52:10] [INFO ] Invariant cache hit.
[2023-03-21 18:52:12] [INFO ] Implicit Places using invariants and state equation in 1280 ms returned []
Implicit Place search using SMT with State Equation took 1725 ms to find 0 implicit places.
[2023-03-21 18:52:12] [INFO ] Redundant transitions in 86 ms returned []
[2023-03-21 18:52:12] [INFO ] Invariant cache hit.
[2023-03-21 18:52:12] [INFO ] Dead Transitions using invariants and state equation in 560 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2405 ms. Remains : 751/751 places, 721/721 transitions.
Treatment of property ShieldIIPs-PT-030B-LTLFireability-07 finished in 56146 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||G((F(p2)&&F(p0)&&p1))))))'
Support contains 3 out of 1596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1596/1596 places, 1566/1566 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1592 transition count 1562
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1592 transition count 1562
Applied a total of 8 rules in 106 ms. Remains 1592 /1596 variables (removed 4) and now considering 1562/1566 (removed 4) transitions.
// Phase 1: matrix 1562 rows 1592 cols
[2023-03-21 18:52:13] [INFO ] Computed 271 place invariants in 27 ms
[2023-03-21 18:52:13] [INFO ] Implicit Places using invariants in 659 ms returned []
[2023-03-21 18:52:13] [INFO ] Invariant cache hit.
[2023-03-21 18:52:15] [INFO ] Implicit Places using invariants and state equation in 2133 ms returned []
Implicit Place search using SMT with State Equation took 2813 ms to find 0 implicit places.
[2023-03-21 18:52:15] [INFO ] Invariant cache hit.
[2023-03-21 18:52:16] [INFO ] Dead Transitions using invariants and state equation in 994 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1592/1596 places, 1562/1566 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3918 ms. Remains : 1592/1596 places, 1562/1566 transitions.
Stuttering acceptance computed with spot in 313 ms :[(NOT p0), (NOT p0), true, (NOT p2), (NOT p0), (OR (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-030B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s1128 1), p1:(AND (EQ s150 1) (EQ s1128 1)), p2:(EQ s1554 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 0 ms.
FORMULA ShieldIIPs-PT-030B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-030B-LTLFireability-10 finished in 4274 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 2 out of 1596 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1596/1596 places, 1566/1566 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 151 transitions
Trivial Post-agglo rules discarded 151 transitions
Performed 151 trivial Post agglomeration. Transition count delta: 151
Iterating post reduction 0 with 151 rules applied. Total rules applied 151 place count 1595 transition count 1414
Reduce places removed 151 places and 0 transitions.
Iterating post reduction 1 with 151 rules applied. Total rules applied 302 place count 1444 transition count 1414
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 151 Pre rules applied. Total rules applied 302 place count 1444 transition count 1263
Deduced a syphon composed of 151 places in 3 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 302 rules applied. Total rules applied 604 place count 1293 transition count 1263
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 607 place count 1290 transition count 1260
Iterating global reduction 2 with 3 rules applied. Total rules applied 610 place count 1290 transition count 1260
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 610 place count 1290 transition count 1259
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 612 place count 1289 transition count 1259
Performed 536 Post agglomeration using F-continuation condition.Transition count delta: 536
Deduced a syphon composed of 536 places in 1 ms
Reduce places removed 536 places and 0 transitions.
Iterating global reduction 2 with 1072 rules applied. Total rules applied 1684 place count 753 transition count 723
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1686 place count 751 transition count 721
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1687 place count 750 transition count 721
Applied a total of 1687 rules in 320 ms. Remains 750 /1596 variables (removed 846) and now considering 721/1566 (removed 845) transitions.
// Phase 1: matrix 721 rows 750 cols
[2023-03-21 18:52:17] [INFO ] Computed 270 place invariants in 2 ms
[2023-03-21 18:52:18] [INFO ] Implicit Places using invariants in 478 ms returned []
[2023-03-21 18:52:18] [INFO ] Invariant cache hit.
[2023-03-21 18:52:18] [INFO ] Implicit Places using invariants and state equation in 832 ms returned []
Implicit Place search using SMT with State Equation took 1335 ms to find 0 implicit places.
[2023-03-21 18:52:18] [INFO ] Redundant transitions in 102 ms returned [720]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 720 rows 750 cols
[2023-03-21 18:52:18] [INFO ] Computed 270 place invariants in 2 ms
[2023-03-21 18:52:19] [INFO ] Dead Transitions using invariants and state equation in 583 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 750/1596 places, 720/1566 transitions.
Applied a total of 0 rules in 15 ms. Remains 750 /750 variables (removed 0) and now considering 720/720 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2405 ms. Remains : 750/1596 places, 720/1566 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-030B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s75 1), p1:(EQ s423 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1581 steps with 0 reset in 17 ms.
FORMULA ShieldIIPs-PT-030B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-030B-LTLFireability-11 finished in 2603 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 1596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1596/1596 places, 1566/1566 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1592 transition count 1562
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1592 transition count 1562
Applied a total of 8 rules in 140 ms. Remains 1592 /1596 variables (removed 4) and now considering 1562/1566 (removed 4) transitions.
// Phase 1: matrix 1562 rows 1592 cols
[2023-03-21 18:52:19] [INFO ] Computed 271 place invariants in 11 ms
[2023-03-21 18:52:20] [INFO ] Implicit Places using invariants in 873 ms returned []
[2023-03-21 18:52:20] [INFO ] Invariant cache hit.
[2023-03-21 18:52:23] [INFO ] Implicit Places using invariants and state equation in 2422 ms returned []
Implicit Place search using SMT with State Equation took 3304 ms to find 0 implicit places.
[2023-03-21 18:52:23] [INFO ] Invariant cache hit.
[2023-03-21 18:52:24] [INFO ] Dead Transitions using invariants and state equation in 1000 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1592/1596 places, 1562/1566 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4445 ms. Remains : 1592/1596 places, 1562/1566 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-030B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s109 1) (AND (EQ s1393 1) (EQ s1430 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 256 reset in 474 ms.
Product exploration explored 100000 steps with 238 reset in 541 ms.
Computed a total of 359 stabilizing places and 359 stable transitions
Computed a total of 359 stabilizing places and 359 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 316 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=158 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 197 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0)]
[2023-03-21 18:52:25] [INFO ] Invariant cache hit.
[2023-03-21 18:52:27] [INFO ] [Real]Absence check using 271 positive place invariants in 243 ms returned sat
[2023-03-21 18:52:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 18:52:33] [INFO ] [Real]Absence check using state equation in 6787 ms returned sat
[2023-03-21 18:52:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 18:52:35] [INFO ] [Nat]Absence check using 271 positive place invariants in 441 ms returned sat
[2023-03-21 18:52:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 18:52:44] [INFO ] [Nat]Absence check using state equation in 8736 ms returned sat
[2023-03-21 18:52:44] [INFO ] Deduced a trap composed of 47 places in 115 ms of which 0 ms to minimize.
[2023-03-21 18:52:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 523 ms
[2023-03-21 18:52:44] [INFO ] Computed and/alt/rep : 1561/3512/1561 causal constraints (skipped 0 transitions) in 113 ms.
[2023-03-21 18:52:49] [INFO ] Added : 90 causal constraints over 18 iterations in 4475 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 3 out of 1592 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1592/1592 places, 1562/1562 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 151 transitions
Trivial Post-agglo rules discarded 151 transitions
Performed 151 trivial Post agglomeration. Transition count delta: 151
Iterating post reduction 0 with 151 rules applied. Total rules applied 151 place count 1591 transition count 1410
Reduce places removed 151 places and 0 transitions.
Iterating post reduction 1 with 151 rules applied. Total rules applied 302 place count 1440 transition count 1410
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 302 place count 1440 transition count 1260
Deduced a syphon composed of 150 places in 2 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 602 place count 1290 transition count 1260
Performed 533 Post agglomeration using F-continuation condition.Transition count delta: 533
Deduced a syphon composed of 533 places in 2 ms
Reduce places removed 533 places and 0 transitions.
Iterating global reduction 2 with 1066 rules applied. Total rules applied 1668 place count 757 transition count 727
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1670 place count 755 transition count 725
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1671 place count 754 transition count 725
Applied a total of 1671 rules in 224 ms. Remains 754 /1592 variables (removed 838) and now considering 725/1562 (removed 837) transitions.
// Phase 1: matrix 725 rows 754 cols
[2023-03-21 18:52:49] [INFO ] Computed 270 place invariants in 2 ms
[2023-03-21 18:52:49] [INFO ] Implicit Places using invariants in 522 ms returned []
[2023-03-21 18:52:49] [INFO ] Invariant cache hit.
[2023-03-21 18:52:50] [INFO ] Implicit Places using invariants and state equation in 1101 ms returned []
Implicit Place search using SMT with State Equation took 1632 ms to find 0 implicit places.
[2023-03-21 18:52:51] [INFO ] Redundant transitions in 166 ms returned [724]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 724 rows 754 cols
[2023-03-21 18:52:51] [INFO ] Computed 270 place invariants in 1 ms
[2023-03-21 18:52:51] [INFO ] Dead Transitions using invariants and state equation in 547 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 754/1592 places, 724/1562 transitions.
Applied a total of 0 rules in 13 ms. Remains 754 /754 variables (removed 0) and now considering 724/724 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2608 ms. Remains : 754/1592 places, 724/1562 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 151 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 232 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
[2023-03-21 18:52:52] [INFO ] Invariant cache hit.
[2023-03-21 18:52:53] [INFO ] [Real]Absence check using 270 positive place invariants in 281 ms returned sat
[2023-03-21 18:52:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 18:52:55] [INFO ] [Real]Absence check using state equation in 2574 ms returned sat
[2023-03-21 18:52:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 18:52:56] [INFO ] [Nat]Absence check using 270 positive place invariants in 110 ms returned sat
[2023-03-21 18:52:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 18:52:58] [INFO ] [Nat]Absence check using state equation in 1507 ms returned sat
[2023-03-21 18:52:58] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2023-03-21 18:52:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2023-03-21 18:52:58] [INFO ] Computed and/alt/rep : 719/1794/719 causal constraints (skipped 2 transitions) in 73 ms.
[2023-03-21 18:53:10] [INFO ] Added : 575 causal constraints over 115 iterations in 12507 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 85 ms :[(NOT p0)]
Product exploration explored 100000 steps with 23954 reset in 805 ms.
Product exploration explored 100000 steps with 24106 reset in 827 ms.
Support contains 3 out of 754 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 754/754 places, 724/724 transitions.
Applied a total of 0 rules in 15 ms. Remains 754 /754 variables (removed 0) and now considering 724/724 (removed 0) transitions.
[2023-03-21 18:53:12] [INFO ] Invariant cache hit.
[2023-03-21 18:53:13] [INFO ] Implicit Places using invariants in 570 ms returned []
[2023-03-21 18:53:13] [INFO ] Invariant cache hit.
[2023-03-21 18:53:14] [INFO ] Implicit Places using invariants and state equation in 941 ms returned []
Implicit Place search using SMT with State Equation took 1535 ms to find 0 implicit places.
[2023-03-21 18:53:14] [INFO ] Redundant transitions in 291 ms returned []
[2023-03-21 18:53:14] [INFO ] Invariant cache hit.
[2023-03-21 18:53:14] [INFO ] Dead Transitions using invariants and state equation in 463 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2356 ms. Remains : 754/754 places, 724/724 transitions.
Treatment of property ShieldIIPs-PT-030B-LTLFireability-12 finished in 55207 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(X(X(G((G(p1)||X(F(p2)))))))))'
Support contains 8 out of 1596 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1596/1596 places, 1566/1566 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1592 transition count 1562
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1592 transition count 1562
Applied a total of 8 rules in 134 ms. Remains 1592 /1596 variables (removed 4) and now considering 1562/1566 (removed 4) transitions.
// Phase 1: matrix 1562 rows 1592 cols
[2023-03-21 18:53:15] [INFO ] Computed 271 place invariants in 6 ms
[2023-03-21 18:53:15] [INFO ] Implicit Places using invariants in 621 ms returned []
[2023-03-21 18:53:15] [INFO ] Invariant cache hit.
[2023-03-21 18:53:17] [INFO ] Implicit Places using invariants and state equation in 1899 ms returned []
Implicit Place search using SMT with State Equation took 2607 ms to find 0 implicit places.
[2023-03-21 18:53:17] [INFO ] Invariant cache hit.
[2023-03-21 18:53:18] [INFO ] Dead Transitions using invariants and state equation in 1078 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1592/1596 places, 1562/1566 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3835 ms. Remains : 1592/1596 places, 1562/1566 transitions.
Stuttering acceptance computed with spot in 1249 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-030B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 8}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 9}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 5}, { cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={0, 1} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=7 dest: 7}], [{ cond=(NOT p0), acceptance={} source=8 dest: 5}, { cond=p0, acceptance={} source=8 dest: 10}], [{ cond=(NOT p0), acceptance={} source=9 dest: 1}, { cond=p0, acceptance={} source=9 dest: 2}, { cond=p0, acceptance={} source=9 dest: 11}], [{ cond=(NOT p0), acceptance={} source=10 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=10 dest: 6}, { cond=p0, acceptance={} source=10 dest: 10}, { cond=(AND p0 (NOT p1)), acceptance={} source=10 dest: 12}], [{ cond=(NOT p0), acceptance={} source=11 dest: 1}, { cond=p0, acceptance={} source=11 dest: 2}, { cond=p0, acceptance={} source=11 dest: 11}, { cond=(AND p0 (NOT p1)), acceptance={} source=11 dest: 18}, { cond=(AND p0 p1), acceptance={} source=11 dest: 19}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=12 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=12 dest: 12}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=13 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=13 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=13 dest: 12}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=13 dest: 13}], [{ cond=(NOT p2), acceptance={} source=14 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=15 dest: 7}, { cond=(AND p0 (NOT p2)), acceptance={} source=15 dest: 13}], [{ cond=(NOT p2), acceptance={} source=16 dest: 14}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=17 dest: 14}, { cond=(AND p0 (NOT p2)), acceptance={} source=17 dest: 15}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=18 dest: 16}, { cond=(AND p0 (NOT p2)), acceptance={} source=18 dest: 17}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=18 dest: 18}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=18 dest: 18}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=18 dest: 19}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=19 dest: 16}, { cond=(AND p0 (NOT p2)), acceptance={} source=19 dest: 17}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=19 dest: 18}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=19 dest: 19}]], initial=0, aps=[p0:(AND (EQ s1096 1) (EQ s1114 1) (EQ s1121 1)), p1:(AND (EQ s1353 1) (EQ s1363 1) (EQ s1383 1)), p2:(AND (EQ s569 1) (EQ s594 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 45 reset in 615 ms.
Product exploration explored 100000 steps with 45 reset in 771 ms.
Computed a total of 359 stabilizing places and 359 stable transitions
Computed a total of 359 stabilizing places and 359 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 387 ms. Reduced automaton from 20 states, 50 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Finished random walk after 2435 steps, including 0 resets, run visited all 2 properties in 65 ms. (steps per millisecond=37 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p2)]
Knowledge based reduction with 4 factoid took 367 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 301 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 300 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
[2023-03-21 18:53:23] [INFO ] Invariant cache hit.
[2023-03-21 18:53:24] [INFO ] [Real]Absence check using 271 positive place invariants in 253 ms returned sat
[2023-03-21 18:53:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 18:53:32] [INFO ] [Real]Absence check using state equation in 7726 ms returned sat
[2023-03-21 18:53:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 18:53:33] [INFO ] [Nat]Absence check using 271 positive place invariants in 352 ms returned sat
[2023-03-21 18:53:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 18:53:43] [INFO ] [Nat]Absence check using state equation in 10481 ms returned sat
[2023-03-21 18:53:44] [INFO ] Computed and/alt/rep : 1561/3512/1561 causal constraints (skipped 0 transitions) in 145 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: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 18:53:47] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p1) (NOT p2))
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 5 out of 1592 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1592/1592 places, 1562/1562 transitions.
Applied a total of 0 rules in 86 ms. Remains 1592 /1592 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
[2023-03-21 18:53:47] [INFO ] Invariant cache hit.
[2023-03-21 18:53:47] [INFO ] Implicit Places using invariants in 599 ms returned []
[2023-03-21 18:53:47] [INFO ] Invariant cache hit.
[2023-03-21 18:53:49] [INFO ] Implicit Places using invariants and state equation in 1899 ms returned []
Implicit Place search using SMT with State Equation took 2549 ms to find 0 implicit places.
[2023-03-21 18:53:49] [INFO ] Invariant cache hit.
[2023-03-21 18:53:51] [INFO ] Dead Transitions using invariants and state equation in 1257 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3906 ms. Remains : 1592/1592 places, 1562/1562 transitions.
Computed a total of 359 stabilizing places and 359 stable transitions
Computed a total of 359 stabilizing places and 359 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 302 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Finished random walk after 2194 steps, including 0 resets, run visited all 2 properties in 31 ms. (steps per millisecond=70 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), true]
False Knowledge obtained : [(F p1), (F p2)]
Knowledge based reduction with 2 factoid took 203 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 327 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 288 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
[2023-03-21 18:53:52] [INFO ] Invariant cache hit.
[2023-03-21 18:53:53] [INFO ] [Real]Absence check using 271 positive place invariants in 240 ms returned sat
[2023-03-21 18:53:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 18:54:02] [INFO ] [Real]Absence check using state equation in 9081 ms returned sat
[2023-03-21 18:54:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 18:54:04] [INFO ] [Nat]Absence check using 271 positive place invariants in 327 ms returned sat
[2023-03-21 18:54:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 18:54:12] [INFO ] [Nat]Absence check using state equation in 8406 ms returned sat
[2023-03-21 18:54:12] [INFO ] Computed and/alt/rep : 1561/3512/1561 causal constraints (skipped 0 transitions) in 153 ms.
[2023-03-21 18:54:17] [INFO ] Added : 165 causal constraints over 33 iterations in 5089 ms. Result :unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 358 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 46 reset in 618 ms.
Product exploration explored 100000 steps with 46 reset in 775 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 276 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Support contains 5 out of 1592 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1592/1592 places, 1562/1562 transitions.
Performed 147 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 147 rules applied. Total rules applied 147 place count 1592 transition count 1562
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 64 Pre rules applied. Total rules applied 147 place count 1592 transition count 1564
Deduced a syphon composed of 211 places in 2 ms
Iterating global reduction 1 with 64 rules applied. Total rules applied 211 place count 1592 transition count 1564
Performed 626 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 837 places in 1 ms
Iterating global reduction 1 with 626 rules applied. Total rules applied 837 place count 1592 transition count 1564
Renaming transitions due to excessive name length > 1024 char.
Discarding 205 places :
Symmetric choice reduction at 1 with 205 rule applications. Total rules 1042 place count 1387 transition count 1359
Deduced a syphon composed of 632 places in 1 ms
Iterating global reduction 1 with 205 rules applied. Total rules applied 1247 place count 1387 transition count 1359
Deduced a syphon composed of 632 places in 1 ms
Applied a total of 1247 rules in 664 ms. Remains 1387 /1592 variables (removed 205) and now considering 1359/1562 (removed 203) transitions.
[2023-03-21 18:54:21] [INFO ] Redundant transitions in 388 ms returned [1358]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 1358 rows 1387 cols
[2023-03-21 18:54:21] [INFO ] Computed 271 place invariants in 19 ms
[2023-03-21 18:54:22] [INFO ] Dead Transitions using invariants and state equation in 975 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1387/1592 places, 1358/1562 transitions.
Deduced a syphon composed of 632 places in 1 ms
Applied a total of 0 rules in 62 ms. Remains 1387 /1387 variables (removed 0) and now considering 1358/1358 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2139 ms. Remains : 1387/1592 places, 1358/1562 transitions.
Support contains 5 out of 1592 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1592/1592 places, 1562/1562 transitions.
Applied a total of 0 rules in 101 ms. Remains 1592 /1592 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
// Phase 1: matrix 1562 rows 1592 cols
[2023-03-21 18:54:22] [INFO ] Computed 271 place invariants in 4 ms
[2023-03-21 18:54:23] [INFO ] Implicit Places using invariants in 779 ms returned []
[2023-03-21 18:54:23] [INFO ] Invariant cache hit.
[2023-03-21 18:54:25] [INFO ] Implicit Places using invariants and state equation in 2207 ms returned []
Implicit Place search using SMT with State Equation took 2999 ms to find 0 implicit places.
[2023-03-21 18:54:25] [INFO ] Invariant cache hit.
[2023-03-21 18:54:26] [INFO ] Dead Transitions using invariants and state equation in 973 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4115 ms. Remains : 1592/1592 places, 1562/1562 transitions.
Treatment of property ShieldIIPs-PT-030B-LTLFireability-13 finished in 71413 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(G(p1)) U (F(p3)&&p2)))))'
Support contains 4 out of 1596 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1596/1596 places, 1566/1566 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 151 transitions
Trivial Post-agglo rules discarded 151 transitions
Performed 151 trivial Post agglomeration. Transition count delta: 151
Iterating post reduction 0 with 151 rules applied. Total rules applied 151 place count 1595 transition count 1414
Reduce places removed 151 places and 0 transitions.
Iterating post reduction 1 with 151 rules applied. Total rules applied 302 place count 1444 transition count 1414
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 151 Pre rules applied. Total rules applied 302 place count 1444 transition count 1263
Deduced a syphon composed of 151 places in 3 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 302 rules applied. Total rules applied 604 place count 1293 transition count 1263
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 606 place count 1291 transition count 1261
Iterating global reduction 2 with 2 rules applied. Total rules applied 608 place count 1291 transition count 1261
Performed 534 Post agglomeration using F-continuation condition.Transition count delta: 534
Deduced a syphon composed of 534 places in 2 ms
Reduce places removed 534 places and 0 transitions.
Iterating global reduction 2 with 1068 rules applied. Total rules applied 1676 place count 757 transition count 727
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1678 place count 755 transition count 725
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1679 place count 754 transition count 725
Applied a total of 1679 rules in 226 ms. Remains 754 /1596 variables (removed 842) and now considering 725/1566 (removed 841) transitions.
// Phase 1: matrix 725 rows 754 cols
[2023-03-21 18:54:26] [INFO ] Computed 270 place invariants in 2 ms
[2023-03-21 18:54:27] [INFO ] Implicit Places using invariants in 460 ms returned []
[2023-03-21 18:54:27] [INFO ] Invariant cache hit.
[2023-03-21 18:54:27] [INFO ] Implicit Places using invariants and state equation in 811 ms returned []
Implicit Place search using SMT with State Equation took 1292 ms to find 0 implicit places.
[2023-03-21 18:54:28] [INFO ] Redundant transitions in 96 ms returned [724]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 724 rows 754 cols
[2023-03-21 18:54:28] [INFO ] Computed 270 place invariants in 2 ms
[2023-03-21 18:54:28] [INFO ] Dead Transitions using invariants and state equation in 905 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 754/1596 places, 724/1566 transitions.
Applied a total of 0 rules in 32 ms. Remains 754 /754 variables (removed 0) and now considering 724/724 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2582 ms. Remains : 754/1596 places, 724/1566 transitions.
Stuttering acceptance computed with spot in 393 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)) (AND p1 (NOT p3))), (AND (NOT p3) (NOT p1)), (NOT p3)]
Running random walk in product with property : ShieldIIPs-PT-030B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=0 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=0 dest: 2}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p2) p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND p0 p2 (NOT p3) p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 p2 (NOT p3) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p0) p2 (NOT p3)) (AND p2 (NOT p3) p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p3) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s20 1), p2:(AND (EQ s12 1) (EQ s525 1)), p3:(EQ s12 1), p1:(EQ s380 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]]
Product exploration explored 100000 steps with 73 reset in 673 ms.
Product exploration explored 100000 steps with 73 reset in 841 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/754 stabilizing places and 2/724 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 (NOT p3) p1))), (X (NOT p0)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1))), (X (NOT (AND p0 p2 (NOT p3) (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2 (NOT p3)) (AND p2 (NOT p3) p1)))), (X (NOT (AND p0 p2 (NOT p3)))), (X (NOT p3)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p3) p1)))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2 (NOT p3) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2 (NOT p3)) (AND p2 (NOT p3) p1))))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT p3))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR (AND (NOT p0) p1) (AND (NOT p2) p1))), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p2) p1)))), (X (X (OR (AND (NOT p0) p1) (AND (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p2) p1))))), (X (X (AND (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p3) p1))), (X (X (NOT (AND (NOT p3) p1))))]
Knowledge based reduction with 20 factoid took 2216 ms. Reduced automaton from 5 states, 16 edges and 4 AP (stutter insensitive) to 5 states, 16 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 369 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)) (AND p1 (NOT p3))), (AND (NOT p3) (NOT p1)), (NOT p3)]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 324 ms. (steps per millisecond=30 ) properties (out of 13) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-21 18:54:34] [INFO ] Invariant cache hit.
[2023-03-21 18:54:34] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 (NOT p3) p1))), (X (NOT p0)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1))), (X (NOT (AND p0 p2 (NOT p3) (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2 (NOT p3)) (AND p2 (NOT p3) p1)))), (X (NOT (AND p0 p2 (NOT p3)))), (X (NOT p3)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p3) p1)))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2 (NOT p3) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2 (NOT p3)) (AND p2 (NOT p3) p1))))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT p3))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (G (NOT (OR (AND (NOT p0) p2 (NOT p3)) (AND p1 p2 (NOT p3))))), (G (NOT (AND p0 p1 p2 (NOT p3)))), (G (NOT (AND p0 p2 (NOT p3))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR (AND (NOT p0) p1) (AND (NOT p2) p1))), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p2) p1)))), (X (X (OR (AND (NOT p0) p1) (AND (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p2) p1))))), (X (X (AND (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p3) p1))), (X (X (NOT (AND (NOT p3) p1)))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (F (OR (AND (NOT p0) p1) (AND p1 (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p3), (F (AND p0 (NOT p1) (NOT p2))), (F p0), (F (AND p0 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p3)))), (F (AND p1 (NOT p3)))]
Knowledge based reduction with 24 factoid took 2611 ms. Reduced automaton from 5 states, 16 edges and 4 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))]
[2023-03-21 18:54:37] [INFO ] Invariant cache hit.
Proved EG (NOT p2)
[2023-03-21 18:54:37] [INFO ] Invariant cache hit.
[2023-03-21 18:54:38] [INFO ] [Real]Absence check using 270 positive place invariants in 194 ms returned sat
[2023-03-21 18:54:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 18:54:39] [INFO ] [Real]Absence check using state equation in 1174 ms returned sat
[2023-03-21 18:54:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 18:54:40] [INFO ] [Nat]Absence check using 270 positive place invariants in 107 ms returned sat
[2023-03-21 18:54:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 18:54:41] [INFO ] [Nat]Absence check using state equation in 1085 ms returned sat
[2023-03-21 18:54:41] [INFO ] Computed and/alt/rep : 721/1793/721 causal constraints (skipped 1 transitions) in 69 ms.
[2023-03-21 18:54:54] [INFO ] Added : 600 causal constraints over 120 iterations in 13326 ms. Result :unknown
Could not prove EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 (NOT p3) p1))), (X (NOT p0)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1))), (X (NOT (AND p0 p2 (NOT p3) (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2 (NOT p3)) (AND p2 (NOT p3) p1)))), (X (NOT (AND p0 p2 (NOT p3)))), (X (NOT p3)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p3) p1)))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2 (NOT p3) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2 (NOT p3)) (AND p2 (NOT p3) p1))))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT p3))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (G (NOT (OR (AND (NOT p0) p2 (NOT p3)) (AND p1 p2 (NOT p3))))), (G (NOT (AND p0 p1 p2 (NOT p3)))), (G (NOT (AND p0 p2 (NOT p3))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR (AND (NOT p0) p1) (AND (NOT p2) p1))), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p2) p1)))), (X (X (OR (AND (NOT p0) p1) (AND (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p2) p1))))), (X (X (AND (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p3) p1))), (X (X (NOT (AND (NOT p3) p1)))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (F (OR (AND (NOT p0) p1) (AND p1 (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p3), (F (AND p0 (NOT p1) (NOT p2))), (F p0), (F (AND p0 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p3)))), (F (AND p1 (NOT p3))), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 24 factoid took 1390 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-030B-LTLFireability-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-030B-LTLFireability-15 finished in 29795 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a Shortening insensitive property : ShieldIIPs-PT-030B-LTLFireability-07
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1596 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1596/1596 places, 1566/1566 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 150 transitions
Trivial Post-agglo rules discarded 150 transitions
Performed 150 trivial Post agglomeration. Transition count delta: 150
Iterating post reduction 0 with 150 rules applied. Total rules applied 150 place count 1595 transition count 1415
Reduce places removed 150 places and 0 transitions.
Iterating post reduction 1 with 150 rules applied. Total rules applied 300 place count 1445 transition count 1415
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 151 Pre rules applied. Total rules applied 300 place count 1445 transition count 1264
Deduced a syphon composed of 151 places in 2 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 302 rules applied. Total rules applied 602 place count 1294 transition count 1264
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 606 place count 1290 transition count 1260
Iterating global reduction 2 with 4 rules applied. Total rules applied 610 place count 1290 transition count 1260
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 610 place count 1290 transition count 1259
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 612 place count 1289 transition count 1259
Performed 535 Post agglomeration using F-continuation condition.Transition count delta: 535
Deduced a syphon composed of 535 places in 2 ms
Reduce places removed 535 places and 0 transitions.
Iterating global reduction 2 with 1070 rules applied. Total rules applied 1682 place count 754 transition count 724
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1684 place count 752 transition count 722
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1685 place count 751 transition count 722
Applied a total of 1685 rules in 327 ms. Remains 751 /1596 variables (removed 845) and now considering 722/1566 (removed 844) transitions.
// Phase 1: matrix 722 rows 751 cols
[2023-03-21 18:54:56] [INFO ] Computed 270 place invariants in 1 ms
[2023-03-21 18:54:57] [INFO ] Implicit Places using invariants in 430 ms returned []
[2023-03-21 18:54:57] [INFO ] Invariant cache hit.
[2023-03-21 18:54:58] [INFO ] Implicit Places using invariants and state equation in 894 ms returned []
Implicit Place search using SMT with State Equation took 1347 ms to find 0 implicit places.
[2023-03-21 18:54:58] [INFO ] Invariant cache hit.
[2023-03-21 18:55:01] [INFO ] Dead Transitions using invariants and state equation in 3629 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 751/1596 places, 722/1566 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 5328 ms. Remains : 751/1596 places, 722/1566 transitions.
Running random walk in product with property : ShieldIIPs-PT-030B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s81 1) (EQ s93 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 80 reset in 643 ms.
Product exploration explored 100000 steps with 79 reset in 731 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 270 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Finished random walk after 1198 steps, including 0 resets, run visited all 1 properties in 23 ms. (steps per millisecond=52 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 339 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2023-03-21 18:55:04] [INFO ] Invariant cache hit.
[2023-03-21 18:55:04] [INFO ] [Real]Absence check using 270 positive place invariants in 213 ms returned sat
[2023-03-21 18:55:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 18:55:07] [INFO ] [Real]Absence check using state equation in 2539 ms returned sat
[2023-03-21 18:55:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 18:55:07] [INFO ] [Nat]Absence check using 270 positive place invariants in 112 ms returned sat
[2023-03-21 18:55:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 18:55:11] [INFO ] [Nat]Absence check using state equation in 3538 ms returned sat
[2023-03-21 18:55:11] [INFO ] Computed and/alt/rep : 720/1796/720 causal constraints (skipped 0 transitions) in 38 ms.
[2023-03-21 18:55:22] [INFO ] Deduced a trap composed of 2 places in 585 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.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.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
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 18:55:23] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 2 out of 751 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 751/751 places, 722/722 transitions.
Applied a total of 0 rules in 15 ms. Remains 751 /751 variables (removed 0) and now considering 722/722 (removed 0) transitions.
[2023-03-21 18:55:23] [INFO ] Invariant cache hit.
[2023-03-21 18:55:24] [INFO ] Implicit Places using invariants in 1004 ms returned []
[2023-03-21 18:55:24] [INFO ] Invariant cache hit.
[2023-03-21 18:55:25] [INFO ] Implicit Places using invariants and state equation in 1032 ms returned []
Implicit Place search using SMT with State Equation took 2057 ms to find 0 implicit places.
[2023-03-21 18:55:25] [INFO ] Redundant transitions in 171 ms returned [721]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 721 rows 751 cols
[2023-03-21 18:55:25] [INFO ] Computed 270 place invariants in 2 ms
[2023-03-21 18:55:25] [INFO ] Dead Transitions using invariants and state equation in 706 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 751/751 places, 721/722 transitions.
Applied a total of 0 rules in 13 ms. Remains 751 /751 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2993 ms. Remains : 751/751 places, 721/722 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 150 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 1316 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=146 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0)]
[2023-03-21 18:55:26] [INFO ] Invariant cache hit.
[2023-03-21 18:55:27] [INFO ] [Real]Absence check using 270 positive place invariants in 151 ms returned sat
[2023-03-21 18:55:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 18:55:28] [INFO ] [Real]Absence check using state equation in 1260 ms returned sat
[2023-03-21 18:55:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 18:55:29] [INFO ] [Nat]Absence check using 270 positive place invariants in 102 ms returned sat
[2023-03-21 18:55:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 18:55:32] [INFO ] [Nat]Absence check using state equation in 3234 ms returned sat
[2023-03-21 18:55:32] [INFO ] Computed and/alt/rep : 719/1791/719 causal constraints (skipped 0 transitions) in 82 ms.
[2023-03-21 18:55:43] [INFO ] Added : 485 causal constraints over 97 iterations in 11294 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Product exploration explored 100000 steps with 79 reset in 673 ms.
Product exploration explored 100000 steps with 79 reset in 723 ms.
Support contains 2 out of 751 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 751/751 places, 721/721 transitions.
Applied a total of 0 rules in 16 ms. Remains 751 /751 variables (removed 0) and now considering 721/721 (removed 0) transitions.
[2023-03-21 18:55:45] [INFO ] Invariant cache hit.
[2023-03-21 18:55:45] [INFO ] Implicit Places using invariants in 367 ms returned []
[2023-03-21 18:55:45] [INFO ] Invariant cache hit.
[2023-03-21 18:55:46] [INFO ] Implicit Places using invariants and state equation in 963 ms returned []
Implicit Place search using SMT with State Equation took 1344 ms to find 0 implicit places.
[2023-03-21 18:55:46] [INFO ] Redundant transitions in 134 ms returned []
[2023-03-21 18:55:46] [INFO ] Invariant cache hit.
[2023-03-21 18:55:47] [INFO ] Dead Transitions using invariants and state equation in 444 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1950 ms. Remains : 751/751 places, 721/721 transitions.
Treatment of property ShieldIIPs-PT-030B-LTLFireability-07 finished in 50895 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a Shortening insensitive property : ShieldIIPs-PT-030B-LTLFireability-12
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 1596 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1596/1596 places, 1566/1566 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 151 transitions
Trivial Post-agglo rules discarded 151 transitions
Performed 151 trivial Post agglomeration. Transition count delta: 151
Iterating post reduction 0 with 151 rules applied. Total rules applied 151 place count 1595 transition count 1414
Reduce places removed 151 places and 0 transitions.
Iterating post reduction 1 with 151 rules applied. Total rules applied 302 place count 1444 transition count 1414
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 302 place count 1444 transition count 1264
Deduced a syphon composed of 150 places in 5 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 602 place count 1294 transition count 1264
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 606 place count 1290 transition count 1260
Iterating global reduction 2 with 4 rules applied. Total rules applied 610 place count 1290 transition count 1260
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 610 place count 1290 transition count 1259
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 612 place count 1289 transition count 1259
Performed 532 Post agglomeration using F-continuation condition.Transition count delta: 532
Deduced a syphon composed of 532 places in 2 ms
Reduce places removed 532 places and 0 transitions.
Iterating global reduction 2 with 1064 rules applied. Total rules applied 1676 place count 757 transition count 727
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1678 place count 755 transition count 725
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1679 place count 754 transition count 725
Applied a total of 1679 rules in 297 ms. Remains 754 /1596 variables (removed 842) and now considering 725/1566 (removed 841) transitions.
// Phase 1: matrix 725 rows 754 cols
[2023-03-21 18:55:47] [INFO ] Computed 270 place invariants in 2 ms
[2023-03-21 18:55:48] [INFO ] Implicit Places using invariants in 557 ms returned []
[2023-03-21 18:55:48] [INFO ] Invariant cache hit.
[2023-03-21 18:55:49] [INFO ] Implicit Places using invariants and state equation in 880 ms returned []
Implicit Place search using SMT with State Equation took 1453 ms to find 0 implicit places.
[2023-03-21 18:55:49] [INFO ] Invariant cache hit.
[2023-03-21 18:55:49] [INFO ] Dead Transitions using invariants and state equation in 711 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 754/1596 places, 725/1566 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2463 ms. Remains : 754/1596 places, 725/1566 transitions.
Running random walk in product with property : ShieldIIPs-PT-030B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s39 1) (AND (EQ s655 1) (EQ s678 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 23818 reset in 749 ms.
Product exploration explored 100000 steps with 24065 reset in 809 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 203 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 281 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0)]
[2023-03-21 18:55:52] [INFO ] Invariant cache hit.
[2023-03-21 18:55:52] [INFO ] [Real]Absence check using 270 positive place invariants in 211 ms returned sat
[2023-03-21 18:55:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 18:55:54] [INFO ] [Real]Absence check using state equation in 1213 ms returned sat
[2023-03-21 18:55:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 18:55:54] [INFO ] [Nat]Absence check using 270 positive place invariants in 135 ms returned sat
[2023-03-21 18:55:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 18:55:56] [INFO ] [Nat]Absence check using state equation in 1300 ms returned sat
[2023-03-21 18:55:56] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-21 18:55:56] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2023-03-21 18:55:56] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2023-03-21 18:55:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 310 ms
[2023-03-21 18:55:56] [INFO ] Computed and/alt/rep : 720/1799/720 causal constraints (skipped 2 transitions) in 71 ms.
[2023-03-21 18:56:09] [INFO ] Added : 585 causal constraints over 117 iterations in 12786 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 3 out of 754 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 754/754 places, 725/725 transitions.
Applied a total of 0 rules in 43 ms. Remains 754 /754 variables (removed 0) and now considering 725/725 (removed 0) transitions.
[2023-03-21 18:56:09] [INFO ] Invariant cache hit.
[2023-03-21 18:56:09] [INFO ] Implicit Places using invariants in 636 ms returned []
[2023-03-21 18:56:09] [INFO ] Invariant cache hit.
[2023-03-21 18:56:11] [INFO ] Implicit Places using invariants and state equation in 1384 ms returned []
Implicit Place search using SMT with State Equation took 2051 ms to find 0 implicit places.
[2023-03-21 18:56:11] [INFO ] Redundant transitions in 79 ms returned [724]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 724 rows 754 cols
[2023-03-21 18:56:11] [INFO ] Computed 270 place invariants in 1 ms
[2023-03-21 18:56:12] [INFO ] Dead Transitions using invariants and state equation in 699 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 754/754 places, 724/725 transitions.
Applied a total of 0 rules in 12 ms. Remains 754 /754 variables (removed 0) and now considering 724/724 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2907 ms. Remains : 754/754 places, 724/725 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 134 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 240 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0)]
[2023-03-21 18:56:12] [INFO ] Invariant cache hit.
[2023-03-21 18:56:13] [INFO ] [Real]Absence check using 270 positive place invariants in 119 ms returned sat
[2023-03-21 18:56:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 18:56:14] [INFO ] [Real]Absence check using state equation in 1568 ms returned sat
[2023-03-21 18:56:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 18:56:15] [INFO ] [Nat]Absence check using 270 positive place invariants in 113 ms returned sat
[2023-03-21 18:56:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 18:56:16] [INFO ] [Nat]Absence check using state equation in 1368 ms returned sat
[2023-03-21 18:56:16] [INFO ] Computed and/alt/rep : 719/1794/719 causal constraints (skipped 2 transitions) in 38 ms.
[2023-03-21 18:56:29] [INFO ] Added : 545 causal constraints over 109 iterations in 12998 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 84 ms :[(NOT p0)]
Product exploration explored 100000 steps with 24047 reset in 794 ms.
Product exploration explored 100000 steps with 24018 reset in 824 ms.
Support contains 3 out of 754 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 754/754 places, 724/724 transitions.
Applied a total of 0 rules in 13 ms. Remains 754 /754 variables (removed 0) and now considering 724/724 (removed 0) transitions.
[2023-03-21 18:56:31] [INFO ] Invariant cache hit.
[2023-03-21 18:56:33] [INFO ] Implicit Places using invariants in 1825 ms returned []
[2023-03-21 18:56:33] [INFO ] Invariant cache hit.
[2023-03-21 18:56:34] [INFO ] Implicit Places using invariants and state equation in 1003 ms returned []
Implicit Place search using SMT with State Equation took 2833 ms to find 0 implicit places.
[2023-03-21 18:56:34] [INFO ] Redundant transitions in 77 ms returned []
[2023-03-21 18:56:34] [INFO ] Invariant cache hit.
[2023-03-21 18:56:34] [INFO ] Dead Transitions using invariants and state equation in 323 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3254 ms. Remains : 754/754 places, 724/724 transitions.
Treatment of property ShieldIIPs-PT-030B-LTLFireability-12 finished in 47693 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(X(X(G((G(p1)||X(F(p2)))))))))'
Found a Lengthening insensitive property : ShieldIIPs-PT-030B-LTLFireability-13
Stuttering acceptance computed with spot in 1223 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 8 out of 1596 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1596/1596 places, 1566/1566 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 147 transitions
Trivial Post-agglo rules discarded 147 transitions
Performed 147 trivial Post agglomeration. Transition count delta: 147
Iterating post reduction 0 with 147 rules applied. Total rules applied 147 place count 1595 transition count 1418
Reduce places removed 147 places and 0 transitions.
Iterating post reduction 1 with 147 rules applied. Total rules applied 294 place count 1448 transition count 1418
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 151 Pre rules applied. Total rules applied 294 place count 1448 transition count 1267
Deduced a syphon composed of 151 places in 2 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 302 rules applied. Total rules applied 596 place count 1297 transition count 1267
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 600 place count 1293 transition count 1263
Iterating global reduction 2 with 4 rules applied. Total rules applied 604 place count 1293 transition count 1263
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 604 place count 1293 transition count 1262
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 606 place count 1292 transition count 1262
Performed 535 Post agglomeration using F-continuation condition.Transition count delta: 535
Deduced a syphon composed of 535 places in 2 ms
Reduce places removed 535 places and 0 transitions.
Iterating global reduction 2 with 1070 rules applied. Total rules applied 1676 place count 757 transition count 727
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1678 place count 755 transition count 725
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1679 place count 754 transition count 725
Applied a total of 1679 rules in 189 ms. Remains 754 /1596 variables (removed 842) and now considering 725/1566 (removed 841) transitions.
// Phase 1: matrix 725 rows 754 cols
[2023-03-21 18:56:36] [INFO ] Computed 270 place invariants in 2 ms
[2023-03-21 18:56:37] [INFO ] Implicit Places using invariants in 527 ms returned []
[2023-03-21 18:56:37] [INFO ] Invariant cache hit.
[2023-03-21 18:56:41] [INFO ] Implicit Places using invariants and state equation in 4815 ms returned []
Implicit Place search using SMT with State Equation took 5370 ms to find 0 implicit places.
[2023-03-21 18:56:41] [INFO ] Invariant cache hit.
[2023-03-21 18:56:42] [INFO ] Dead Transitions using invariants and state equation in 581 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 754/1596 places, 725/1566 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 6165 ms. Remains : 754/1596 places, 725/1566 transitions.
Running random walk in product with property : ShieldIIPs-PT-030B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 8}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 9}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 5}, { cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={0, 1} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=7 dest: 7}], [{ cond=(NOT p0), acceptance={} source=8 dest: 5}, { cond=p0, acceptance={} source=8 dest: 10}], [{ cond=(NOT p0), acceptance={} source=9 dest: 1}, { cond=p0, acceptance={} source=9 dest: 2}, { cond=p0, acceptance={} source=9 dest: 11}], [{ cond=(NOT p0), acceptance={} source=10 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=10 dest: 6}, { cond=p0, acceptance={} source=10 dest: 10}, { cond=(AND p0 (NOT p1)), acceptance={} source=10 dest: 12}], [{ cond=(NOT p0), acceptance={} source=11 dest: 1}, { cond=p0, acceptance={} source=11 dest: 2}, { cond=p0, acceptance={} source=11 dest: 11}, { cond=(AND p0 (NOT p1)), acceptance={} source=11 dest: 18}, { cond=(AND p0 p1), acceptance={} source=11 dest: 19}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=12 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=12 dest: 12}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=13 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=13 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=13 dest: 12}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=13 dest: 13}], [{ cond=(NOT p2), acceptance={} source=14 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=15 dest: 7}, { cond=(AND p0 (NOT p2)), acceptance={} source=15 dest: 13}], [{ cond=(NOT p2), acceptance={} source=16 dest: 14}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=17 dest: 14}, { cond=(AND p0 (NOT p2)), acceptance={} source=17 dest: 15}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=18 dest: 16}, { cond=(AND p0 (NOT p2)), acceptance={} source=18 dest: 17}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=18 dest: 18}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=18 dest: 18}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=18 dest: 19}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=19 dest: 16}, { cond=(AND p0 (NOT p2)), acceptance={} source=19 dest: 17}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=19 dest: 18}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=19 dest: 19}]], initial=0, aps=[p0:(AND (EQ s514 1) (EQ s525 1) (EQ s528 1)), p1:(AND (EQ s638 1) (EQ s645 1) (EQ s656 1)), p2:(AND (EQ s258 1) (EQ s274 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 108 reset in 608 ms.
Product exploration explored 100000 steps with 109 reset in 767 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 277 ms. Reduced automaton from 20 states, 50 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 317 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Finished random walk after 908 steps, including 0 resets, run visited all 2 properties in 10 ms. (steps per millisecond=90 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p2)]
Knowledge based reduction with 4 factoid took 320 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 330 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 304 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
[2023-03-21 18:56:45] [INFO ] Invariant cache hit.
[2023-03-21 18:56:46] [INFO ] [Real]Absence check using 270 positive place invariants in 113 ms returned sat
[2023-03-21 18:56:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 18:56:47] [INFO ] [Real]Absence check using state equation in 1374 ms returned sat
[2023-03-21 18:56:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 18:56:48] [INFO ] [Nat]Absence check using 270 positive place invariants in 141 ms returned sat
[2023-03-21 18:56:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 18:56:49] [INFO ] [Nat]Absence check using state equation in 1322 ms returned sat
[2023-03-21 18:56:49] [INFO ] Computed and/alt/rep : 720/1806/720 causal constraints (skipped 0 transitions) in 63 ms.
[2023-03-21 18:57:02] [INFO ] Added : 530 causal constraints over 106 iterations in 13026 ms. Result :unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 5 out of 754 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 754/754 places, 725/725 transitions.
Applied a total of 0 rules in 17 ms. Remains 754 /754 variables (removed 0) and now considering 725/725 (removed 0) transitions.
[2023-03-21 18:57:02] [INFO ] Invariant cache hit.
[2023-03-21 18:57:03] [INFO ] Implicit Places using invariants in 479 ms returned []
[2023-03-21 18:57:03] [INFO ] Invariant cache hit.
[2023-03-21 18:57:04] [INFO ] Implicit Places using invariants and state equation in 916 ms returned []
Implicit Place search using SMT with State Equation took 1430 ms to find 0 implicit places.
[2023-03-21 18:57:04] [INFO ] Invariant cache hit.
[2023-03-21 18:57:04] [INFO ] Dead Transitions using invariants and state equation in 419 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1888 ms. Remains : 754/754 places, 725/725 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 275 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Finished random walk after 1822 steps, including 1 resets, run visited all 2 properties in 40 ms. (steps per millisecond=45 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), true]
False Knowledge obtained : [(F p1), (F p2)]
Knowledge based reduction with 2 factoid took 162 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 343 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 291 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
[2023-03-21 18:57:06] [INFO ] Invariant cache hit.
[2023-03-21 18:57:06] [INFO ] [Real]Absence check using 270 positive place invariants in 128 ms returned sat
[2023-03-21 18:57:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 18:57:08] [INFO ] [Real]Absence check using state equation in 1398 ms returned sat
[2023-03-21 18:57:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 18:57:08] [INFO ] [Nat]Absence check using 270 positive place invariants in 101 ms returned sat
[2023-03-21 18:57:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 18:57:10] [INFO ] [Nat]Absence check using state equation in 1741 ms returned sat
[2023-03-21 18:57:10] [INFO ] Computed and/alt/rep : 720/1806/720 causal constraints (skipped 0 transitions) in 54 ms.
[2023-03-21 18:57:23] [INFO ] Added : 505 causal constraints over 101 iterations in 12590 ms. Result :unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 354 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 106 reset in 637 ms.
Product exploration explored 100000 steps with 107 reset in 715 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 306 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Support contains 5 out of 754 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 754/754 places, 725/725 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 754 transition count 727
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 754 transition count 727
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 1 rules in 36 ms. Remains 754 /754 variables (removed 0) and now considering 727/725 (removed -2) transitions.
[2023-03-21 18:57:25] [INFO ] Redundant transitions in 109 ms returned [723]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 726 rows 754 cols
[2023-03-21 18:57:25] [INFO ] Computed 270 place invariants in 2 ms
[2023-03-21 18:57:26] [INFO ] Dead Transitions using invariants and state equation in 573 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 754/754 places, 726/725 transitions.
Deduced a syphon composed of 1 places in 6 ms
Applied a total of 0 rules in 22 ms. Remains 754 /754 variables (removed 0) and now considering 726/726 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 775 ms. Remains : 754/754 places, 726/725 transitions.
Support contains 5 out of 754 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 754/754 places, 725/725 transitions.
Applied a total of 0 rules in 20 ms. Remains 754 /754 variables (removed 0) and now considering 725/725 (removed 0) transitions.
// Phase 1: matrix 725 rows 754 cols
[2023-03-21 18:57:26] [INFO ] Computed 270 place invariants in 1 ms
[2023-03-21 18:57:26] [INFO ] Implicit Places using invariants in 390 ms returned []
[2023-03-21 18:57:26] [INFO ] Invariant cache hit.
[2023-03-21 18:57:27] [INFO ] Implicit Places using invariants and state equation in 881 ms returned []
Implicit Place search using SMT with State Equation took 1294 ms to find 0 implicit places.
[2023-03-21 18:57:27] [INFO ] Invariant cache hit.
[2023-03-21 18:57:27] [INFO ] Dead Transitions using invariants and state equation in 585 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1915 ms. Remains : 754/754 places, 725/725 transitions.
Treatment of property ShieldIIPs-PT-030B-LTLFireability-13 finished in 53099 ms.
[2023-03-21 18:57:28] [INFO ] Flatten gal took : 73 ms
[2023-03-21 18:57:28] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-21 18:57:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1596 places, 1566 transitions and 4932 arcs took 10 ms.
Total runtime 445220 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2747/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2747/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2747/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2747/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldIIPs-PT-030B-LTLFireability-02
Could not compute solution for formula : ShieldIIPs-PT-030B-LTLFireability-07
Could not compute solution for formula : ShieldIIPs-PT-030B-LTLFireability-12
Could not compute solution for formula : ShieldIIPs-PT-030B-LTLFireability-13

BK_STOP 1679425051674

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name ShieldIIPs-PT-030B-LTLFireability-02
ltl formula formula --ltl=/tmp/2747/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 1596 places, 1566 transitions and 4932 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2747/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2747/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.230 real 0.090 user 0.100 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2747/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2747/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
ltl formula name ShieldIIPs-PT-030B-LTLFireability-07
ltl formula formula --ltl=/tmp/2747/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1596 places, 1566 transitions and 4932 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.220 real 0.090 user 0.100 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2747/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2747/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2747/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2747/ltl_1_
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 ShieldIIPs-PT-030B-LTLFireability-12
ltl formula formula --ltl=/tmp/2747/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 1596 places, 1566 transitions and 4932 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.270 real 0.100 user 0.090 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2747/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2747/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2747/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2747/ltl_2_
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 ShieldIIPs-PT-030B-LTLFireability-13
ltl formula formula --ltl=/tmp/2747/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 1596 places, 1566 transitions and 4932 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.300 real 0.120 user 0.120 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2747/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2747/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2747/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2747/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 20 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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