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-167903717100476.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 ShieldPPPs-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-167903717100476
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 988K
-rw-r--r-- 1 mcc users 5.8K Feb 26 01:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 26 01:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 01:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 01:50 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.5K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 01:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Feb 26 01:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 01:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 26 01:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 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 528K 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 ShieldPPPs-PT-030B-LTLFireability-00
FORMULA_NAME ShieldPPPs-PT-030B-LTLFireability-01
FORMULA_NAME ShieldPPPs-PT-030B-LTLFireability-02
FORMULA_NAME ShieldPPPs-PT-030B-LTLFireability-03
FORMULA_NAME ShieldPPPs-PT-030B-LTLFireability-04
FORMULA_NAME ShieldPPPs-PT-030B-LTLFireability-05
FORMULA_NAME ShieldPPPs-PT-030B-LTLFireability-06
FORMULA_NAME ShieldPPPs-PT-030B-LTLFireability-07
FORMULA_NAME ShieldPPPs-PT-030B-LTLFireability-08
FORMULA_NAME ShieldPPPs-PT-030B-LTLFireability-09
FORMULA_NAME ShieldPPPs-PT-030B-LTLFireability-10
FORMULA_NAME ShieldPPPs-PT-030B-LTLFireability-11
FORMULA_NAME ShieldPPPs-PT-030B-LTLFireability-12
FORMULA_NAME ShieldPPPs-PT-030B-LTLFireability-13
FORMULA_NAME ShieldPPPs-PT-030B-LTLFireability-14
FORMULA_NAME ShieldPPPs-PT-030B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679452535504

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=ShieldPPPs-PT-030B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 02:35:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 02:35:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 02:35:38] [INFO ] Load time of PNML (sax parser for PT used): 196 ms
[2023-03-22 02:35:38] [INFO ] Transformed 2043 places.
[2023-03-22 02:35:38] [INFO ] Transformed 1893 transitions.
[2023-03-22 02:35:38] [INFO ] Found NUPN structural information;
[2023-03-22 02:35:38] [INFO ] Parsed PT model containing 2043 places and 1893 transitions and 5226 arcs in 431 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldPPPs-PT-030B-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-030B-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 2043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2043/2043 places, 1893/1893 transitions.
Discarding 201 places :
Symmetric choice reduction at 0 with 201 rule applications. Total rules 201 place count 1842 transition count 1692
Iterating global reduction 0 with 201 rules applied. Total rules applied 402 place count 1842 transition count 1692
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 403 place count 1841 transition count 1691
Iterating global reduction 0 with 1 rules applied. Total rules applied 404 place count 1841 transition count 1691
Applied a total of 404 rules in 521 ms. Remains 1841 /2043 variables (removed 202) and now considering 1691/1893 (removed 202) transitions.
// Phase 1: matrix 1691 rows 1841 cols
[2023-03-22 02:35:39] [INFO ] Computed 331 place invariants in 37 ms
[2023-03-22 02:35:41] [INFO ] Implicit Places using invariants in 1558 ms returned []
[2023-03-22 02:35:41] [INFO ] Invariant cache hit.
[2023-03-22 02:35:44] [INFO ] Implicit Places using invariants and state equation in 2722 ms returned []
Implicit Place search using SMT with State Equation took 4317 ms to find 0 implicit places.
[2023-03-22 02:35:44] [INFO ] Invariant cache hit.
[2023-03-22 02:35:45] [INFO ] Dead Transitions using invariants and state equation in 1516 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1841/2043 places, 1691/1893 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6369 ms. Remains : 1841/2043 places, 1691/1893 transitions.
Support contains 53 out of 1841 places after structural reductions.
[2023-03-22 02:35:45] [INFO ] Flatten gal took : 154 ms
[2023-03-22 02:35:46] [INFO ] Flatten gal took : 88 ms
[2023-03-22 02:35:46] [INFO ] Input system was already deterministic with 1691 transitions.
Support contains 50 out of 1841 places (down from 53) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 589 ms. (steps per millisecond=16 ) properties (out of 26) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-22 02:35:47] [INFO ] Invariant cache hit.
[2023-03-22 02:35:48] [INFO ] [Real]Absence check using 331 positive place invariants in 211 ms returned sat
[2023-03-22 02:35:49] [INFO ] After 1374ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:11
[2023-03-22 02:35:50] [INFO ] Deduced a trap composed of 19 places in 686 ms of which 24 ms to minimize.
[2023-03-22 02:35:51] [INFO ] Deduced a trap composed of 17 places in 1007 ms of which 3 ms to minimize.
[2023-03-22 02:35:52] [INFO ] Deduced a trap composed of 28 places in 635 ms of which 15 ms to minimize.
[2023-03-22 02:35:53] [INFO ] Deduced a trap composed of 25 places in 518 ms of which 3 ms to minimize.
[2023-03-22 02:35:53] [INFO ] Deduced a trap composed of 21 places in 458 ms of which 3 ms to minimize.
[2023-03-22 02:35:54] [INFO ] Deduced a trap composed of 24 places in 661 ms of which 1 ms to minimize.
[2023-03-22 02:35:54] [INFO ] Deduced a trap composed of 27 places in 526 ms of which 17 ms to minimize.
[2023-03-22 02:35:55] [INFO ] Deduced a trap composed of 32 places in 453 ms of which 1 ms to minimize.
[2023-03-22 02:35:56] [INFO ] Deduced a trap composed of 37 places in 483 ms of which 1 ms to minimize.
[2023-03-22 02:35:56] [INFO ] Deduced a trap composed of 33 places in 678 ms of which 1 ms to minimize.
[2023-03-22 02:35:57] [INFO ] Deduced a trap composed of 41 places in 622 ms of which 1 ms to minimize.
[2023-03-22 02:35:58] [INFO ] Deduced a trap composed of 35 places in 565 ms of which 1 ms to minimize.
[2023-03-22 02:35:58] [INFO ] Deduced a trap composed of 35 places in 371 ms of which 1 ms to minimize.
[2023-03-22 02:35:59] [INFO ] Deduced a trap composed of 32 places in 446 ms of which 19 ms to minimize.
[2023-03-22 02:35:59] [INFO ] Deduced a trap composed of 36 places in 454 ms of which 1 ms to minimize.
[2023-03-22 02:36:00] [INFO ] Deduced a trap composed of 28 places in 461 ms of which 2 ms to minimize.
[2023-03-22 02:36:00] [INFO ] Deduced a trap composed of 31 places in 555 ms of which 2 ms to minimize.
[2023-03-22 02:36:01] [INFO ] Deduced a trap composed of 34 places in 346 ms of which 1 ms to minimize.
[2023-03-22 02:36:01] [INFO ] Deduced a trap composed of 32 places in 368 ms of which 1 ms to minimize.
[2023-03-22 02:36:02] [INFO ] Deduced a trap composed of 23 places in 305 ms of which 1 ms to minimize.
[2023-03-22 02:36:02] [INFO ] Deduced a trap composed of 46 places in 668 ms of which 1 ms to minimize.
[2023-03-22 02:36:03] [INFO ] Deduced a trap composed of 38 places in 811 ms of which 2 ms to minimize.
[2023-03-22 02:36:04] [INFO ] Deduced a trap composed of 41 places in 279 ms of which 1 ms to minimize.
[2023-03-22 02:36:04] [INFO ] Deduced a trap composed of 33 places in 396 ms of which 1 ms to minimize.
[2023-03-22 02:36:05] [INFO ] Deduced a trap composed of 44 places in 378 ms of which 0 ms to minimize.
[2023-03-22 02:36:05] [INFO ] Deduced a trap composed of 37 places in 276 ms of which 1 ms to minimize.
[2023-03-22 02:36:05] [INFO ] Deduced a trap composed of 24 places in 315 ms of which 1 ms to minimize.
[2023-03-22 02:36:06] [INFO ] Deduced a trap composed of 44 places in 309 ms of which 1 ms to minimize.
[2023-03-22 02:36:06] [INFO ] Deduced a trap composed of 34 places in 201 ms of which 1 ms to minimize.
[2023-03-22 02:36:06] [INFO ] Deduced a trap composed of 37 places in 281 ms of which 0 ms to minimize.
[2023-03-22 02:36:07] [INFO ] Deduced a trap composed of 45 places in 170 ms of which 1 ms to minimize.
[2023-03-22 02:36:07] [INFO ] Deduced a trap composed of 35 places in 411 ms of which 1 ms to minimize.
[2023-03-22 02:36:07] [INFO ] Deduced a trap composed of 39 places in 358 ms of which 1 ms to minimize.
[2023-03-22 02:36:08] [INFO ] Deduced a trap composed of 36 places in 272 ms of which 13 ms to minimize.
[2023-03-22 02:36:08] [INFO ] Deduced a trap composed of 43 places in 284 ms of which 1 ms to minimize.
[2023-03-22 02:36:09] [INFO ] Deduced a trap composed of 47 places in 302 ms of which 1 ms to minimize.
[2023-03-22 02:36:09] [INFO ] Deduced a trap composed of 38 places in 296 ms of which 2 ms to minimize.
[2023-03-22 02:36:09] [INFO ] Deduced a trap composed of 45 places in 210 ms of which 1 ms to minimize.
[2023-03-22 02:36:10] [INFO ] Deduced a trap composed of 47 places in 285 ms of which 1 ms to minimize.
[2023-03-22 02:36:10] [INFO ] Deduced a trap composed of 43 places in 386 ms of which 9 ms to minimize.
[2023-03-22 02:36:11] [INFO ] Deduced a trap composed of 47 places in 252 ms of which 2 ms to minimize.
[2023-03-22 02:36:11] [INFO ] Deduced a trap composed of 66 places in 262 ms of which 1 ms to minimize.
[2023-03-22 02:36:11] [INFO ] Trap strengthening (SAT) tested/added 43/42 trap constraints in 21498 ms
[2023-03-22 02:36:11] [INFO ] After 23242ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-22 02:36:11] [INFO ] After 24403ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-22 02:36:12] [INFO ] [Nat]Absence check using 331 positive place invariants in 252 ms returned sat
[2023-03-22 02:36:16] [INFO ] After 2717ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :12
[2023-03-22 02:36:16] [INFO ] Deduced a trap composed of 20 places in 463 ms of which 1 ms to minimize.
[2023-03-22 02:36:17] [INFO ] Deduced a trap composed of 21 places in 446 ms of which 1 ms to minimize.
[2023-03-22 02:36:17] [INFO ] Deduced a trap composed of 23 places in 373 ms of which 1 ms to minimize.
[2023-03-22 02:36:18] [INFO ] Deduced a trap composed of 32 places in 359 ms of which 1 ms to minimize.
[2023-03-22 02:36:18] [INFO ] Deduced a trap composed of 27 places in 406 ms of which 0 ms to minimize.
[2023-03-22 02:36:19] [INFO ] Deduced a trap composed of 17 places in 492 ms of which 1 ms to minimize.
[2023-03-22 02:36:19] [INFO ] Deduced a trap composed of 32 places in 358 ms of which 1 ms to minimize.
[2023-03-22 02:36:20] [INFO ] Deduced a trap composed of 33 places in 407 ms of which 1 ms to minimize.
[2023-03-22 02:36:20] [INFO ] Deduced a trap composed of 35 places in 390 ms of which 15 ms to minimize.
[2023-03-22 02:36:20] [INFO ] Deduced a trap composed of 30 places in 356 ms of which 1 ms to minimize.
[2023-03-22 02:36:21] [INFO ] Deduced a trap composed of 22 places in 361 ms of which 2 ms to minimize.
[2023-03-22 02:36:21] [INFO ] Deduced a trap composed of 29 places in 429 ms of which 1 ms to minimize.
[2023-03-22 02:36:22] [INFO ] Deduced a trap composed of 28 places in 456 ms of which 1 ms to minimize.
[2023-03-22 02:36:22] [INFO ] Deduced a trap composed of 29 places in 594 ms of which 1 ms to minimize.
[2023-03-22 02:36:23] [INFO ] Deduced a trap composed of 30 places in 352 ms of which 1 ms to minimize.
[2023-03-22 02:36:24] [INFO ] Deduced a trap composed of 25 places in 1324 ms of which 2 ms to minimize.
[2023-03-22 02:36:25] [INFO ] Deduced a trap composed of 24 places in 437 ms of which 1 ms to minimize.
[2023-03-22 02:36:25] [INFO ] Deduced a trap composed of 24 places in 529 ms of which 2 ms to minimize.
[2023-03-22 02:36:26] [INFO ] Deduced a trap composed of 18 places in 436 ms of which 1 ms to minimize.
[2023-03-22 02:36:26] [INFO ] Deduced a trap composed of 26 places in 476 ms of which 1 ms to minimize.
[2023-03-22 02:36:27] [INFO ] Deduced a trap composed of 29 places in 484 ms of which 1 ms to minimize.
[2023-03-22 02:36:27] [INFO ] Deduced a trap composed of 24 places in 328 ms of which 2 ms to minimize.
[2023-03-22 02:36:28] [INFO ] Deduced a trap composed of 27 places in 319 ms of which 4 ms to minimize.
[2023-03-22 02:36:28] [INFO ] Deduced a trap composed of 32 places in 342 ms of which 0 ms to minimize.
[2023-03-22 02:36:29] [INFO ] Deduced a trap composed of 35 places in 338 ms of which 1 ms to minimize.
[2023-03-22 02:36:29] [INFO ] Deduced a trap composed of 37 places in 541 ms of which 13 ms to minimize.
[2023-03-22 02:36:30] [INFO ] Deduced a trap composed of 24 places in 317 ms of which 20 ms to minimize.
[2023-03-22 02:36:30] [INFO ] Deduced a trap composed of 35 places in 465 ms of which 7 ms to minimize.
[2023-03-22 02:36:31] [INFO ] Deduced a trap composed of 35 places in 422 ms of which 1 ms to minimize.
[2023-03-22 02:36:31] [INFO ] Deduced a trap composed of 32 places in 436 ms of which 0 ms to minimize.
[2023-03-22 02:36:32] [INFO ] Deduced a trap composed of 28 places in 464 ms of which 1 ms to minimize.
[2023-03-22 02:36:32] [INFO ] Deduced a trap composed of 36 places in 470 ms of which 1 ms to minimize.
[2023-03-22 02:36:33] [INFO ] Deduced a trap composed of 34 places in 330 ms of which 1 ms to minimize.
[2023-03-22 02:36:33] [INFO ] Deduced a trap composed of 31 places in 368 ms of which 1 ms to minimize.
[2023-03-22 02:36:34] [INFO ] Deduced a trap composed of 34 places in 347 ms of which 1 ms to minimize.
[2023-03-22 02:36:34] [INFO ] Deduced a trap composed of 31 places in 397 ms of which 1 ms to minimize.
[2023-03-22 02:36:34] [INFO ] Deduced a trap composed of 27 places in 359 ms of which 1 ms to minimize.
[2023-03-22 02:36:35] [INFO ] Deduced a trap composed of 28 places in 381 ms of which 1 ms to minimize.
[2023-03-22 02:36:36] [INFO ] Deduced a trap composed of 39 places in 688 ms of which 2 ms to minimize.
[2023-03-22 02:36:36] [INFO ] Deduced a trap composed of 25 places in 365 ms of which 1 ms to minimize.
[2023-03-22 02:36:36] [INFO ] Deduced a trap composed of 39 places in 277 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 02:36:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 02:36:36] [INFO ] After 25112ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
Fused 13 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 1110 ms.
Support contains 24 out of 1841 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1841/1841 places, 1691/1691 transitions.
Drop transitions removed 205 transitions
Trivial Post-agglo rules discarded 205 transitions
Performed 205 trivial Post agglomeration. Transition count delta: 205
Iterating post reduction 0 with 205 rules applied. Total rules applied 205 place count 1841 transition count 1486
Reduce places removed 205 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 208 rules applied. Total rules applied 413 place count 1636 transition count 1483
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 416 place count 1633 transition count 1483
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 151 Pre rules applied. Total rules applied 416 place count 1633 transition count 1332
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 718 place count 1482 transition count 1332
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 724 place count 1476 transition count 1326
Iterating global reduction 3 with 6 rules applied. Total rules applied 730 place count 1476 transition count 1326
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 730 place count 1476 transition count 1324
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 734 place count 1474 transition count 1324
Performed 527 Post agglomeration using F-continuation condition.Transition count delta: 527
Deduced a syphon composed of 527 places in 2 ms
Reduce places removed 527 places and 0 transitions.
Iterating global reduction 3 with 1054 rules applied. Total rules applied 1788 place count 947 transition count 797
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 259 times.
Drop transitions removed 259 transitions
Iterating global reduction 3 with 259 rules applied. Total rules applied 2047 place count 947 transition count 797
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2048 place count 946 transition count 796
Applied a total of 2048 rules in 485 ms. Remains 946 /1841 variables (removed 895) and now considering 796/1691 (removed 895) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 485 ms. Remains : 946/1841 places, 796/1691 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 425 ms. (steps per millisecond=23 ) properties (out of 12) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 796 rows 946 cols
[2023-03-22 02:36:39] [INFO ] Computed 331 place invariants in 50 ms
[2023-03-22 02:36:39] [INFO ] [Real]Absence check using 311 positive place invariants in 52 ms returned sat
[2023-03-22 02:36:39] [INFO ] [Real]Absence check using 311 positive and 20 generalized place invariants in 8 ms returned sat
[2023-03-22 02:36:39] [INFO ] After 820ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 02:36:40] [INFO ] [Nat]Absence check using 311 positive place invariants in 56 ms returned sat
[2023-03-22 02:36:40] [INFO ] [Nat]Absence check using 311 positive and 20 generalized place invariants in 18 ms returned sat
[2023-03-22 02:36:40] [INFO ] After 561ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 02:36:41] [INFO ] Deduced a trap composed of 5 places in 199 ms of which 1 ms to minimize.
[2023-03-22 02:36:41] [INFO ] Deduced a trap composed of 6 places in 304 ms of which 1 ms to minimize.
[2023-03-22 02:36:41] [INFO ] Deduced a trap composed of 6 places in 260 ms of which 1 ms to minimize.
[2023-03-22 02:36:41] [INFO ] Deduced a trap composed of 9 places in 169 ms of which 0 ms to minimize.
[2023-03-22 02:36:42] [INFO ] Deduced a trap composed of 19 places in 182 ms of which 0 ms to minimize.
[2023-03-22 02:36:42] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 1 ms to minimize.
[2023-03-22 02:36:42] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 1 ms to minimize.
[2023-03-22 02:36:42] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1749 ms
[2023-03-22 02:36:42] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 0 ms to minimize.
[2023-03-22 02:36:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2023-03-22 02:36:42] [INFO ] After 2633ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 121 ms.
[2023-03-22 02:36:43] [INFO ] After 3074ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 51 ms.
Support contains 6 out of 946 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 946/946 places, 796/796 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 946 transition count 795
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 945 transition count 795
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 945 transition count 793
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 943 transition count 793
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 22 place count 935 transition count 785
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 25 place count 935 transition count 785
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 28 place count 932 transition count 782
Applied a total of 28 rules in 135 ms. Remains 932 /946 variables (removed 14) and now considering 782/796 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 932/946 places, 782/796 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 782 rows 932 cols
[2023-03-22 02:36:43] [INFO ] Computed 331 place invariants in 18 ms
[2023-03-22 02:36:43] [INFO ] [Real]Absence check using 312 positive place invariants in 70 ms returned sat
[2023-03-22 02:36:43] [INFO ] [Real]Absence check using 312 positive and 19 generalized place invariants in 7 ms returned sat
[2023-03-22 02:36:44] [INFO ] After 648ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 02:36:44] [INFO ] [Nat]Absence check using 312 positive place invariants in 133 ms returned sat
[2023-03-22 02:36:44] [INFO ] [Nat]Absence check using 312 positive and 19 generalized place invariants in 4 ms returned sat
[2023-03-22 02:36:44] [INFO ] After 421ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 02:36:45] [INFO ] Deduced a trap composed of 6 places in 208 ms of which 0 ms to minimize.
[2023-03-22 02:36:45] [INFO ] Deduced a trap composed of 5 places in 232 ms of which 0 ms to minimize.
[2023-03-22 02:36:45] [INFO ] Deduced a trap composed of 5 places in 230 ms of which 0 ms to minimize.
[2023-03-22 02:36:45] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 1 ms to minimize.
[2023-03-22 02:36:46] [INFO ] Deduced a trap composed of 5 places in 145 ms of which 1 ms to minimize.
[2023-03-22 02:36:46] [INFO ] Deduced a trap composed of 5 places in 172 ms of which 0 ms to minimize.
[2023-03-22 02:36:46] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2023-03-22 02:36:46] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2023-03-22 02:36:46] [INFO ] Deduced a trap composed of 6 places in 140 ms of which 1 ms to minimize.
[2023-03-22 02:36:46] [INFO ] Deduced a trap composed of 6 places in 167 ms of which 0 ms to minimize.
[2023-03-22 02:36:47] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 1 ms to minimize.
[2023-03-22 02:36:47] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 1 ms to minimize.
[2023-03-22 02:36:47] [INFO ] Deduced a trap composed of 9 places in 221 ms of which 1 ms to minimize.
[2023-03-22 02:36:47] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 0 ms to minimize.
[2023-03-22 02:36:47] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 1 ms to minimize.
[2023-03-22 02:36:48] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 1 ms to minimize.
[2023-03-22 02:36:48] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3236 ms
[2023-03-22 02:36:48] [INFO ] After 3704ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 64 ms.
[2023-03-22 02:36:48] [INFO ] After 4102ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 4 out of 932 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 932/932 places, 782/782 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 931 transition count 781
Applied a total of 2 rules in 69 ms. Remains 931 /932 variables (removed 1) and now considering 781/782 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 931/932 places, 781/782 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 57553 steps, run visited all 1 properties in 778 ms. (steps per millisecond=73 )
Probabilistic random walk after 57553 steps, saw 51771 distinct states, run finished after 778 ms. (steps per millisecond=73 ) properties seen :1
FORMULA ShieldPPPs-PT-030B-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA ShieldPPPs-PT-030B-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 362 stabilizing places and 362 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X((!p0 U (G(!p0)||(!p0&&G(p1)))))&&F(!p2))||X(G(!p0))))'
Support contains 8 out of 1841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1841/1841 places, 1691/1691 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1832 transition count 1682
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1832 transition count 1682
Applied a total of 18 rules in 138 ms. Remains 1832 /1841 variables (removed 9) and now considering 1682/1691 (removed 9) transitions.
// Phase 1: matrix 1682 rows 1832 cols
[2023-03-22 02:36:50] [INFO ] Computed 331 place invariants in 6 ms
[2023-03-22 02:36:50] [INFO ] Implicit Places using invariants in 855 ms returned []
[2023-03-22 02:36:50] [INFO ] Invariant cache hit.
[2023-03-22 02:36:52] [INFO ] Implicit Places using invariants and state equation in 1975 ms returned []
Implicit Place search using SMT with State Equation took 2877 ms to find 0 implicit places.
[2023-03-22 02:36:52] [INFO ] Invariant cache hit.
[2023-03-22 02:36:54] [INFO ] Dead Transitions using invariants and state equation in 1571 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1832/1841 places, 1682/1691 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4586 ms. Remains : 1832/1841 places, 1682/1691 transitions.
Stuttering acceptance computed with spot in 563 ms :[p0, p0, (AND p2 p0), true, (AND p0 (NOT p1)), p2, (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-030B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p2 p0), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={} source=4 dest: 6}], [{ cond=p2, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 3}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (EQ s1315 1) (EQ s1317 1) (EQ s301 1) (EQ s329 1)), p0:(AND (EQ s49 1) (EQ s81 1)), p1:(AND (EQ s289 1) (EQ s321 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, 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 4225 steps with 0 reset in 124 ms.
FORMULA ShieldPPPs-PT-030B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-030B-LTLFireability-00 finished in 5389 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 4 out of 1841 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1841/1841 places, 1691/1691 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 212 transitions
Trivial Post-agglo rules discarded 212 transitions
Performed 212 trivial Post agglomeration. Transition count delta: 212
Iterating post reduction 0 with 212 rules applied. Total rules applied 212 place count 1840 transition count 1478
Reduce places removed 212 places and 0 transitions.
Iterating post reduction 1 with 212 rules applied. Total rules applied 424 place count 1628 transition count 1478
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 149 Pre rules applied. Total rules applied 424 place count 1628 transition count 1329
Deduced a syphon composed of 149 places in 2 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 298 rules applied. Total rules applied 722 place count 1479 transition count 1329
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 731 place count 1470 transition count 1320
Iterating global reduction 2 with 9 rules applied. Total rules applied 740 place count 1470 transition count 1320
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 740 place count 1470 transition count 1318
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 744 place count 1468 transition count 1318
Performed 532 Post agglomeration using F-continuation condition.Transition count delta: 532
Deduced a syphon composed of 532 places in 1 ms
Reduce places removed 532 places and 0 transitions.
Iterating global reduction 2 with 1064 rules applied. Total rules applied 1808 place count 936 transition count 786
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 1810 place count 934 transition count 784
Applied a total of 1810 rules in 351 ms. Remains 934 /1841 variables (removed 907) and now considering 784/1691 (removed 907) transitions.
// Phase 1: matrix 784 rows 934 cols
[2023-03-22 02:36:55] [INFO ] Computed 331 place invariants in 2 ms
[2023-03-22 02:36:55] [INFO ] Implicit Places using invariants in 381 ms returned []
[2023-03-22 02:36:55] [INFO ] Invariant cache hit.
[2023-03-22 02:36:57] [INFO ] Implicit Places using invariants and state equation in 1088 ms returned []
Implicit Place search using SMT with State Equation took 1487 ms to find 0 implicit places.
[2023-03-22 02:36:57] [INFO ] Redundant transitions in 47 ms returned []
[2023-03-22 02:36:57] [INFO ] Invariant cache hit.
[2023-03-22 02:36:57] [INFO ] Dead Transitions using invariants and state equation in 446 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 934/1841 places, 784/1691 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2342 ms. Remains : 934/1841 places, 784/1691 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-030B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s72 0), p0:(OR (EQ s590 1) (AND (EQ s753 1) (EQ s770 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 48 reset in 777 ms.
Product exploration explored 100000 steps with 49 reset in 903 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 328 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1555 steps, including 0 resets, run visited all 2 properties in 56 ms. (steps per millisecond=27 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 498 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 934 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 934/934 places, 784/784 transitions.
Applied a total of 0 rules in 36 ms. Remains 934 /934 variables (removed 0) and now considering 784/784 (removed 0) transitions.
[2023-03-22 02:37:00] [INFO ] Invariant cache hit.
[2023-03-22 02:37:02] [INFO ] Implicit Places using invariants in 1391 ms returned []
[2023-03-22 02:37:02] [INFO ] Invariant cache hit.
[2023-03-22 02:37:04] [INFO ] Implicit Places using invariants and state equation in 2279 ms returned []
Implicit Place search using SMT with State Equation took 3675 ms to find 0 implicit places.
[2023-03-22 02:37:04] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-22 02:37:04] [INFO ] Invariant cache hit.
[2023-03-22 02:37:05] [INFO ] Dead Transitions using invariants and state equation in 1162 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4900 ms. Remains : 934/934 places, 784/784 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 p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 361 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1836 steps, including 0 resets, run visited all 2 properties in 26 ms. (steps per millisecond=70 )
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 448 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 49 reset in 666 ms.
Product exploration explored 100000 steps with 48 reset in 899 ms.
Support contains 4 out of 934 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 934/934 places, 784/784 transitions.
Applied a total of 0 rules in 21 ms. Remains 934 /934 variables (removed 0) and now considering 784/784 (removed 0) transitions.
[2023-03-22 02:37:08] [INFO ] Invariant cache hit.
[2023-03-22 02:37:09] [INFO ] Implicit Places using invariants in 689 ms returned []
[2023-03-22 02:37:09] [INFO ] Invariant cache hit.
[2023-03-22 02:37:11] [INFO ] Implicit Places using invariants and state equation in 1549 ms returned []
Implicit Place search using SMT with State Equation took 2258 ms to find 0 implicit places.
[2023-03-22 02:37:11] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-22 02:37:11] [INFO ] Invariant cache hit.
[2023-03-22 02:37:12] [INFO ] Dead Transitions using invariants and state equation in 844 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3171 ms. Remains : 934/934 places, 784/784 transitions.
Treatment of property ShieldPPPs-PT-030B-LTLFireability-01 finished in 16946 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) U X(G(p1))))'
Support contains 3 out of 1841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1841/1841 places, 1691/1691 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1833 transition count 1683
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1833 transition count 1683
Applied a total of 16 rules in 181 ms. Remains 1833 /1841 variables (removed 8) and now considering 1683/1691 (removed 8) transitions.
// Phase 1: matrix 1683 rows 1833 cols
[2023-03-22 02:37:12] [INFO ] Computed 331 place invariants in 6 ms
[2023-03-22 02:37:13] [INFO ] Implicit Places using invariants in 685 ms returned []
[2023-03-22 02:37:13] [INFO ] Invariant cache hit.
[2023-03-22 02:37:15] [INFO ] Implicit Places using invariants and state equation in 2318 ms returned []
Implicit Place search using SMT with State Equation took 3018 ms to find 0 implicit places.
[2023-03-22 02:37:15] [INFO ] Invariant cache hit.
[2023-03-22 02:37:16] [INFO ] Dead Transitions using invariants and state equation in 1413 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1833/1841 places, 1683/1691 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4627 ms. Remains : 1833/1841 places, 1683/1691 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (AND p0 (NOT p1)), p0]
Running random walk in product with property : ShieldPPPs-PT-030B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s734 1), p0:(AND (EQ s61 1) (EQ s89 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 8413 steps with 1 reset in 72 ms.
FORMULA ShieldPPPs-PT-030B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-030B-LTLFireability-02 finished in 4917 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(p1)||p0) U X(X(X(!p2)))))'
Support contains 4 out of 1841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1841/1841 places, 1691/1691 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1833 transition count 1683
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1833 transition count 1683
Applied a total of 16 rules in 120 ms. Remains 1833 /1841 variables (removed 8) and now considering 1683/1691 (removed 8) transitions.
// Phase 1: matrix 1683 rows 1833 cols
[2023-03-22 02:37:17] [INFO ] Computed 331 place invariants in 13 ms
[2023-03-22 02:37:18] [INFO ] Implicit Places using invariants in 895 ms returned []
[2023-03-22 02:37:18] [INFO ] Invariant cache hit.
[2023-03-22 02:37:20] [INFO ] Implicit Places using invariants and state equation in 2149 ms returned []
Implicit Place search using SMT with State Equation took 3060 ms to find 0 implicit places.
[2023-03-22 02:37:20] [INFO ] Invariant cache hit.
[2023-03-22 02:37:21] [INFO ] Dead Transitions using invariants and state equation in 1116 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1833/1841 places, 1683/1691 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4306 ms. Remains : 1833/1841 places, 1683/1691 transitions.
Stuttering acceptance computed with spot in 1213 ms :[p2, p2, (AND p2 (NOT p1)), p2, p2, p2, true, (AND p2 (NOT p1)), p2, (AND (NOT p1) p2), p2, (AND (NOT p1) p2), p2, (AND p2 (NOT p1)), p2, (AND (NOT p1) p2), p2, (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-030B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(OR p0 p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}, { cond=p1, acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 8}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 9}, { cond=(OR p0 p1), acceptance={} source=3 dest: 10}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=p2, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 5}, { cond=p1, acceptance={} source=7 dest: 11}], [{ cond=true, acceptance={} source=8 dest: 12}], [{ cond=(NOT p1), acceptance={} source=9 dest: 12}, { cond=p1, acceptance={} source=9 dest: 13}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=10 dest: 14}, { cond=(AND (NOT p0) p1), acceptance={} source=10 dest: 15}, { cond=(OR p0 p1), acceptance={} source=10 dest: 16}], [{ cond=(AND (NOT p1) p2), acceptance={} source=11 dest: 6}, { cond=(AND p1 p2), acceptance={} source=11 dest: 17}], [{ cond=p2, acceptance={} source=12 dest: 5}], [{ cond=(AND (NOT p1) p2), acceptance={} source=13 dest: 5}, { cond=(AND p1 p2), acceptance={} source=13 dest: 11}], [{ cond=p2, acceptance={} source=14 dest: 12}], [{ cond=(AND (NOT p1) p2), acceptance={} source=15 dest: 12}, { cond=(AND p1 p2), acceptance={} source=15 dest: 13}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=16 dest: 14}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=16 dest: 15}, { cond=(OR (AND p0 p2) (AND p1 p2)), acceptance={0} source=16 dest: 16}], [{ cond=(NOT p1), acceptance={} source=17 dest: 6}, { cond=p1, acceptance={} source=17 dest: 17}]], initial=0, aps=[p0:(OR (EQ s1313 1) (EQ s1770 1)), p1:(NEQ s1770 1), p2:(AND (EQ s1746 1) (EQ s1461 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, 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]]
Product exploration explored 100000 steps with 25000 reset in 837 ms.
Product exploration explored 100000 steps with 25000 reset in 730 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) p1 (NOT p2)), (X p1), (X (OR p0 p1)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1)), (X (X (OR p0 p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 901 ms. Reduced automaton from 18 states, 33 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 524 ms :[(NOT p1), p2, (OR (NOT p1) p2), p2, p2, true, p2]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 02:37:25] [INFO ] Invariant cache hit.
[2023-03-22 02:37:26] [INFO ] [Real]Absence check using 331 positive place invariants in 160 ms returned sat
[2023-03-22 02:37:28] [INFO ] After 1708ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-22 02:37:29] [INFO ] Deduced a trap composed of 24 places in 972 ms of which 1 ms to minimize.
[2023-03-22 02:37:29] [INFO ] Deduced a trap composed of 20 places in 559 ms of which 1 ms to minimize.
[2023-03-22 02:37:30] [INFO ] Deduced a trap composed of 33 places in 314 ms of which 1 ms to minimize.
[2023-03-22 02:37:30] [INFO ] Deduced a trap composed of 21 places in 362 ms of which 6 ms to minimize.
[2023-03-22 02:37:31] [INFO ] Deduced a trap composed of 32 places in 590 ms of which 2 ms to minimize.
[2023-03-22 02:37:32] [INFO ] Deduced a trap composed of 26 places in 546 ms of which 2 ms to minimize.
[2023-03-22 02:37:32] [INFO ] Deduced a trap composed of 35 places in 409 ms of which 1 ms to minimize.
[2023-03-22 02:37:32] [INFO ] Deduced a trap composed of 28 places in 385 ms of which 1 ms to minimize.
[2023-03-22 02:37:33] [INFO ] Deduced a trap composed of 35 places in 326 ms of which 1 ms to minimize.
[2023-03-22 02:37:33] [INFO ] Deduced a trap composed of 36 places in 343 ms of which 1 ms to minimize.
[2023-03-22 02:37:34] [INFO ] Deduced a trap composed of 16 places in 486 ms of which 1 ms to minimize.
[2023-03-22 02:37:35] [INFO ] Deduced a trap composed of 27 places in 668 ms of which 1 ms to minimize.
[2023-03-22 02:37:35] [INFO ] Deduced a trap composed of 23 places in 462 ms of which 0 ms to minimize.
[2023-03-22 02:37:36] [INFO ] Deduced a trap composed of 24 places in 333 ms of which 1 ms to minimize.
[2023-03-22 02:37:36] [INFO ] Deduced a trap composed of 18 places in 350 ms of which 1 ms to minimize.
[2023-03-22 02:37:37] [INFO ] Deduced a trap composed of 41 places in 510 ms of which 1 ms to minimize.
[2023-03-22 02:37:37] [INFO ] Deduced a trap composed of 27 places in 481 ms of which 0 ms to minimize.
[2023-03-22 02:37:37] [INFO ] Deduced a trap composed of 30 places in 332 ms of which 1 ms to minimize.
[2023-03-22 02:37:38] [INFO ] Deduced a trap composed of 33 places in 397 ms of which 1 ms to minimize.
[2023-03-22 02:37:38] [INFO ] Deduced a trap composed of 33 places in 339 ms of which 1 ms to minimize.
[2023-03-22 02:37:39] [INFO ] Deduced a trap composed of 36 places in 431 ms of which 1 ms to minimize.
[2023-03-22 02:37:39] [INFO ] Deduced a trap composed of 27 places in 364 ms of which 1 ms to minimize.
[2023-03-22 02:37:40] [INFO ] Deduced a trap composed of 26 places in 318 ms of which 0 ms to minimize.
[2023-03-22 02:37:40] [INFO ] Deduced a trap composed of 30 places in 295 ms of which 1 ms to minimize.
[2023-03-22 02:37:40] [INFO ] Deduced a trap composed of 33 places in 292 ms of which 0 ms to minimize.
[2023-03-22 02:37:41] [INFO ] Deduced a trap composed of 37 places in 277 ms of which 1 ms to minimize.
[2023-03-22 02:37:41] [INFO ] Deduced a trap composed of 38 places in 305 ms of which 0 ms to minimize.
[2023-03-22 02:37:42] [INFO ] Deduced a trap composed of 30 places in 307 ms of which 1 ms to minimize.
[2023-03-22 02:37:42] [INFO ] Deduced a trap composed of 38 places in 322 ms of which 0 ms to minimize.
[2023-03-22 02:37:42] [INFO ] Deduced a trap composed of 19 places in 262 ms of which 0 ms to minimize.
[2023-03-22 02:37:43] [INFO ] Deduced a trap composed of 32 places in 342 ms of which 1 ms to minimize.
[2023-03-22 02:37:43] [INFO ] Deduced a trap composed of 21 places in 299 ms of which 1 ms to minimize.
[2023-03-22 02:37:43] [INFO ] Deduced a trap composed of 43 places in 280 ms of which 1 ms to minimize.
[2023-03-22 02:37:44] [INFO ] Deduced a trap composed of 43 places in 400 ms of which 1 ms to minimize.
[2023-03-22 02:37:44] [INFO ] Deduced a trap composed of 41 places in 309 ms of which 0 ms to minimize.
[2023-03-22 02:37:45] [INFO ] Deduced a trap composed of 36 places in 300 ms of which 0 ms to minimize.
[2023-03-22 02:37:45] [INFO ] Deduced a trap composed of 42 places in 260 ms of which 1 ms to minimize.
[2023-03-22 02:37:45] [INFO ] Deduced a trap composed of 38 places in 302 ms of which 1 ms to minimize.
[2023-03-22 02:37:46] [INFO ] Deduced a trap composed of 65 places in 348 ms of which 1 ms to minimize.
[2023-03-22 02:37:46] [INFO ] Deduced a trap composed of 50 places in 310 ms of which 1 ms to minimize.
[2023-03-22 02:37:47] [INFO ] Deduced a trap composed of 52 places in 283 ms of which 1 ms to minimize.
[2023-03-22 02:37:47] [INFO ] Deduced a trap composed of 52 places in 178 ms of which 0 ms to minimize.
[2023-03-22 02:37:47] [INFO ] Trap strengthening (SAT) tested/added 43/42 trap constraints in 19279 ms
[2023-03-22 02:37:47] [INFO ] After 21109ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 02:37:47] [INFO ] After 21654ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 02:37:48] [INFO ] [Nat]Absence check using 331 positive place invariants in 167 ms returned sat
[2023-03-22 02:37:49] [INFO ] After 1544ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 02:37:50] [INFO ] Deduced a trap composed of 24 places in 468 ms of which 1 ms to minimize.
[2023-03-22 02:37:50] [INFO ] Deduced a trap composed of 20 places in 418 ms of which 2 ms to minimize.
[2023-03-22 02:37:51] [INFO ] Deduced a trap composed of 33 places in 564 ms of which 1 ms to minimize.
[2023-03-22 02:37:51] [INFO ] Deduced a trap composed of 21 places in 351 ms of which 1 ms to minimize.
[2023-03-22 02:37:52] [INFO ] Deduced a trap composed of 32 places in 443 ms of which 1 ms to minimize.
[2023-03-22 02:37:52] [INFO ] Deduced a trap composed of 26 places in 484 ms of which 1 ms to minimize.
[2023-03-22 02:37:53] [INFO ] Deduced a trap composed of 35 places in 400 ms of which 2 ms to minimize.
[2023-03-22 02:37:53] [INFO ] Deduced a trap composed of 29 places in 416 ms of which 1 ms to minimize.
[2023-03-22 02:37:54] [INFO ] Deduced a trap composed of 20 places in 562 ms of which 2 ms to minimize.
[2023-03-22 02:37:55] [INFO ] Deduced a trap composed of 22 places in 568 ms of which 1 ms to minimize.
[2023-03-22 02:37:55] [INFO ] Deduced a trap composed of 16 places in 387 ms of which 1 ms to minimize.
[2023-03-22 02:37:55] [INFO ] Deduced a trap composed of 26 places in 448 ms of which 1 ms to minimize.
[2023-03-22 02:37:56] [INFO ] Deduced a trap composed of 18 places in 397 ms of which 1 ms to minimize.
[2023-03-22 02:37:56] [INFO ] Deduced a trap composed of 28 places in 407 ms of which 1 ms to minimize.
[2023-03-22 02:37:57] [INFO ] Deduced a trap composed of 19 places in 394 ms of which 1 ms to minimize.
[2023-03-22 02:37:58] [INFO ] Deduced a trap composed of 24 places in 725 ms of which 1 ms to minimize.
[2023-03-22 02:37:58] [INFO ] Deduced a trap composed of 23 places in 432 ms of which 1 ms to minimize.
[2023-03-22 02:37:59] [INFO ] Deduced a trap composed of 24 places in 443 ms of which 1 ms to minimize.
[2023-03-22 02:37:59] [INFO ] Deduced a trap composed of 19 places in 337 ms of which 1 ms to minimize.
[2023-03-22 02:38:00] [INFO ] Deduced a trap composed of 25 places in 659 ms of which 1 ms to minimize.
[2023-03-22 02:38:00] [INFO ] Deduced a trap composed of 23 places in 367 ms of which 1 ms to minimize.
[2023-03-22 02:38:01] [INFO ] Deduced a trap composed of 30 places in 395 ms of which 1 ms to minimize.
[2023-03-22 02:38:01] [INFO ] Deduced a trap composed of 21 places in 413 ms of which 1 ms to minimize.
[2023-03-22 02:38:02] [INFO ] Deduced a trap composed of 27 places in 400 ms of which 1 ms to minimize.
[2023-03-22 02:38:02] [INFO ] Deduced a trap composed of 29 places in 405 ms of which 1 ms to minimize.
[2023-03-22 02:38:03] [INFO ] Deduced a trap composed of 32 places in 270 ms of which 1 ms to minimize.
[2023-03-22 02:38:04] [INFO ] Deduced a trap composed of 39 places in 848 ms of which 0 ms to minimize.
[2023-03-22 02:38:04] [INFO ] Deduced a trap composed of 35 places in 326 ms of which 0 ms to minimize.
[2023-03-22 02:38:04] [INFO ] Deduced a trap composed of 31 places in 323 ms of which 1 ms to minimize.
[2023-03-22 02:38:05] [INFO ] Deduced a trap composed of 39 places in 306 ms of which 1 ms to minimize.
[2023-03-22 02:38:05] [INFO ] Deduced a trap composed of 36 places in 392 ms of which 1 ms to minimize.
[2023-03-22 02:38:06] [INFO ] Deduced a trap composed of 36 places in 686 ms of which 1 ms to minimize.
[2023-03-22 02:38:06] [INFO ] Deduced a trap composed of 32 places in 395 ms of which 1 ms to minimize.
[2023-03-22 02:38:07] [INFO ] Deduced a trap composed of 40 places in 450 ms of which 1 ms to minimize.
[2023-03-22 02:38:07] [INFO ] Deduced a trap composed of 39 places in 313 ms of which 1 ms to minimize.
[2023-03-22 02:38:08] [INFO ] Deduced a trap composed of 37 places in 474 ms of which 2 ms to minimize.
[2023-03-22 02:38:08] [INFO ] Deduced a trap composed of 24 places in 331 ms of which 1 ms to minimize.
[2023-03-22 02:38:08] [INFO ] Deduced a trap composed of 38 places in 271 ms of which 1 ms to minimize.
[2023-03-22 02:38:09] [INFO ] Deduced a trap composed of 59 places in 445 ms of which 2 ms to minimize.
[2023-03-22 02:38:10] [INFO ] Deduced a trap composed of 41 places in 435 ms of which 0 ms to minimize.
[2023-03-22 02:38:10] [INFO ] Deduced a trap composed of 38 places in 195 ms of which 1 ms to minimize.
[2023-03-22 02:38:10] [INFO ] Deduced a trap composed of 38 places in 361 ms of which 1 ms to minimize.
[2023-03-22 02:38:11] [INFO ] Deduced a trap composed of 38 places in 359 ms of which 1 ms to minimize.
[2023-03-22 02:38:11] [INFO ] Deduced a trap composed of 36 places in 415 ms of which 2 ms to minimize.
[2023-03-22 02:38:12] [INFO ] Deduced a trap composed of 50 places in 372 ms of which 1 ms to minimize.
[2023-03-22 02:38:12] [INFO ] Deduced a trap composed of 43 places in 270 ms of which 0 ms to minimize.
[2023-03-22 02:38:12] [INFO ] Deduced a trap composed of 52 places in 353 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 02:38:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 02:38:12] [INFO ] After 25264ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 58 ms.
Support contains 3 out of 1833 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1833/1833 places, 1683/1683 transitions.
Drop transitions removed 212 transitions
Trivial Post-agglo rules discarded 212 transitions
Performed 212 trivial Post agglomeration. Transition count delta: 212
Iterating post reduction 0 with 212 rules applied. Total rules applied 212 place count 1833 transition count 1471
Reduce places removed 212 places and 0 transitions.
Iterating post reduction 1 with 212 rules applied. Total rules applied 424 place count 1621 transition count 1471
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 424 place count 1621 transition count 1321
Deduced a syphon composed of 150 places in 3 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 724 place count 1471 transition count 1321
Performed 537 Post agglomeration using F-continuation condition.Transition count delta: 537
Deduced a syphon composed of 537 places in 1 ms
Reduce places removed 537 places and 0 transitions.
Iterating global reduction 2 with 1074 rules applied. Total rules applied 1798 place count 934 transition count 784
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 266 times.
Drop transitions removed 266 transitions
Iterating global reduction 2 with 266 rules applied. Total rules applied 2064 place count 934 transition count 784
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2065 place count 933 transition count 783
Applied a total of 2065 rules in 271 ms. Remains 933 /1833 variables (removed 900) and now considering 783/1683 (removed 900) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 271 ms. Remains : 933/1833 places, 783/1683 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 783 rows 933 cols
[2023-03-22 02:38:13] [INFO ] Computed 331 place invariants in 12 ms
[2023-03-22 02:38:13] [INFO ] [Real]Absence check using 317 positive place invariants in 121 ms returned sat
[2023-03-22 02:38:13] [INFO ] [Real]Absence check using 317 positive and 14 generalized place invariants in 39 ms returned sat
[2023-03-22 02:38:14] [INFO ] After 1095ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 02:38:14] [INFO ] [Nat]Absence check using 317 positive place invariants in 221 ms returned sat
[2023-03-22 02:38:14] [INFO ] [Nat]Absence check using 317 positive and 14 generalized place invariants in 5 ms returned sat
[2023-03-22 02:38:15] [INFO ] After 714ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 02:38:16] [INFO ] Deduced a trap composed of 7 places in 289 ms of which 1 ms to minimize.
[2023-03-22 02:38:16] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 2 ms to minimize.
[2023-03-22 02:38:16] [INFO ] Deduced a trap composed of 6 places in 176 ms of which 0 ms to minimize.
[2023-03-22 02:38:16] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 1 ms to minimize.
[2023-03-22 02:38:16] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 1 ms to minimize.
[2023-03-22 02:38:16] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 1 ms to minimize.
[2023-03-22 02:38:17] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 1 ms to minimize.
[2023-03-22 02:38:17] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 1 ms to minimize.
[2023-03-22 02:38:17] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 0 ms to minimize.
[2023-03-22 02:38:17] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 0 ms to minimize.
[2023-03-22 02:38:17] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 0 ms to minimize.
[2023-03-22 02:38:18] [INFO ] Deduced a trap composed of 5 places in 191 ms of which 1 ms to minimize.
[2023-03-22 02:38:18] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 0 ms to minimize.
[2023-03-22 02:38:18] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2023-03-22 02:38:18] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2023-03-22 02:38:18] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 0 ms to minimize.
[2023-03-22 02:38:18] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 0 ms to minimize.
[2023-03-22 02:38:18] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 1 ms to minimize.
[2023-03-22 02:38:18] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 10 ms to minimize.
[2023-03-22 02:38:19] [INFO ] Deduced a trap composed of 8 places in 219 ms of which 0 ms to minimize.
[2023-03-22 02:38:19] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3593 ms
[2023-03-22 02:38:19] [INFO ] After 4359ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-22 02:38:19] [INFO ] After 4851ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 1408 steps, including 8 resets, run visited all 1 properties in 16 ms. (steps per millisecond=88 )
Parikh walk visited 1 properties in 15 ms.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X p1), (X (OR p0 p1)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1)), (X (X (OR p0 p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) p1))), (F (NOT p1)), (F (AND p2 (NOT p1))), (F (AND p2 p1))]
Knowledge based reduction with 10 factoid took 760 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 595 ms :[(NOT p1), p2, (OR (NOT p1) p2), p2, p2, true, p2]
Stuttering acceptance computed with spot in 404 ms :[(NOT p1), p2, (OR (NOT p1) p2), p2, p2, true, p2]
Support contains 3 out of 1833 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1833/1833 places, 1683/1683 transitions.
Applied a total of 0 rules in 90 ms. Remains 1833 /1833 variables (removed 0) and now considering 1683/1683 (removed 0) transitions.
// Phase 1: matrix 1683 rows 1833 cols
[2023-03-22 02:38:21] [INFO ] Computed 331 place invariants in 7 ms
[2023-03-22 02:38:22] [INFO ] Implicit Places using invariants in 764 ms returned []
[2023-03-22 02:38:22] [INFO ] Invariant cache hit.
[2023-03-22 02:38:24] [INFO ] Implicit Places using invariants and state equation in 2511 ms returned []
Implicit Place search using SMT with State Equation took 3291 ms to find 0 implicit places.
[2023-03-22 02:38:24] [INFO ] Invariant cache hit.
[2023-03-22 02:38:25] [INFO ] Dead Transitions using invariants and state equation in 1417 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4803 ms. Remains : 1833/1833 places, 1683/1683 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 p1 (NOT p2)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 174 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 336 ms :[(NOT p1), p2, (OR (NOT p1) p2), p2, p2, true, p2]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 02:38:26] [INFO ] Invariant cache hit.
[2023-03-22 02:38:27] [INFO ] [Real]Absence check using 331 positive place invariants in 259 ms returned sat
[2023-03-22 02:38:28] [INFO ] After 956ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-22 02:38:29] [INFO ] Deduced a trap composed of 24 places in 509 ms of which 1 ms to minimize.
[2023-03-22 02:38:29] [INFO ] Deduced a trap composed of 20 places in 356 ms of which 1 ms to minimize.
[2023-03-22 02:38:29] [INFO ] Deduced a trap composed of 33 places in 330 ms of which 1 ms to minimize.
[2023-03-22 02:38:31] [INFO ] Deduced a trap composed of 21 places in 1056 ms of which 2 ms to minimize.
[2023-03-22 02:38:31] [INFO ] Deduced a trap composed of 32 places in 367 ms of which 1 ms to minimize.
[2023-03-22 02:38:32] [INFO ] Deduced a trap composed of 26 places in 878 ms of which 15 ms to minimize.
[2023-03-22 02:38:32] [INFO ] Deduced a trap composed of 35 places in 528 ms of which 1 ms to minimize.
[2023-03-22 02:38:33] [INFO ] Deduced a trap composed of 28 places in 638 ms of which 1 ms to minimize.
[2023-03-22 02:38:34] [INFO ] Deduced a trap composed of 35 places in 623 ms of which 1 ms to minimize.
[2023-03-22 02:38:34] [INFO ] Deduced a trap composed of 36 places in 363 ms of which 1 ms to minimize.
[2023-03-22 02:38:35] [INFO ] Deduced a trap composed of 16 places in 428 ms of which 1 ms to minimize.
[2023-03-22 02:38:35] [INFO ] Deduced a trap composed of 27 places in 376 ms of which 1 ms to minimize.
[2023-03-22 02:38:36] [INFO ] Deduced a trap composed of 23 places in 438 ms of which 5 ms to minimize.
[2023-03-22 02:38:36] [INFO ] Deduced a trap composed of 24 places in 400 ms of which 1 ms to minimize.
[2023-03-22 02:38:37] [INFO ] Deduced a trap composed of 18 places in 351 ms of which 1 ms to minimize.
[2023-03-22 02:38:37] [INFO ] Deduced a trap composed of 41 places in 404 ms of which 1 ms to minimize.
[2023-03-22 02:38:38] [INFO ] Deduced a trap composed of 27 places in 321 ms of which 1 ms to minimize.
[2023-03-22 02:38:38] [INFO ] Deduced a trap composed of 30 places in 300 ms of which 1 ms to minimize.
[2023-03-22 02:38:38] [INFO ] Deduced a trap composed of 33 places in 350 ms of which 1 ms to minimize.
[2023-03-22 02:38:39] [INFO ] Deduced a trap composed of 33 places in 279 ms of which 1 ms to minimize.
[2023-03-22 02:38:39] [INFO ] Deduced a trap composed of 36 places in 304 ms of which 1 ms to minimize.
[2023-03-22 02:38:40] [INFO ] Deduced a trap composed of 27 places in 398 ms of which 1 ms to minimize.
[2023-03-22 02:38:40] [INFO ] Deduced a trap composed of 26 places in 551 ms of which 1 ms to minimize.
[2023-03-22 02:38:41] [INFO ] Deduced a trap composed of 30 places in 480 ms of which 1 ms to minimize.
[2023-03-22 02:38:41] [INFO ] Deduced a trap composed of 33 places in 370 ms of which 1 ms to minimize.
[2023-03-22 02:38:41] [INFO ] Deduced a trap composed of 37 places in 288 ms of which 1 ms to minimize.
[2023-03-22 02:38:42] [INFO ] Deduced a trap composed of 38 places in 411 ms of which 1 ms to minimize.
[2023-03-22 02:38:42] [INFO ] Deduced a trap composed of 30 places in 276 ms of which 1 ms to minimize.
[2023-03-22 02:38:43] [INFO ] Deduced a trap composed of 38 places in 508 ms of which 1 ms to minimize.
[2023-03-22 02:38:43] [INFO ] Deduced a trap composed of 19 places in 258 ms of which 15 ms to minimize.
[2023-03-22 02:38:44] [INFO ] Deduced a trap composed of 32 places in 298 ms of which 1 ms to minimize.
[2023-03-22 02:38:44] [INFO ] Deduced a trap composed of 21 places in 385 ms of which 1 ms to minimize.
[2023-03-22 02:38:45] [INFO ] Deduced a trap composed of 43 places in 341 ms of which 1 ms to minimize.
[2023-03-22 02:38:45] [INFO ] Deduced a trap composed of 43 places in 261 ms of which 1 ms to minimize.
[2023-03-22 02:38:45] [INFO ] Deduced a trap composed of 41 places in 266 ms of which 8 ms to minimize.
[2023-03-22 02:38:46] [INFO ] Deduced a trap composed of 36 places in 291 ms of which 4 ms to minimize.
[2023-03-22 02:38:46] [INFO ] Deduced a trap composed of 42 places in 367 ms of which 12 ms to minimize.
[2023-03-22 02:38:46] [INFO ] Deduced a trap composed of 38 places in 308 ms of which 0 ms to minimize.
[2023-03-22 02:38:47] [INFO ] Deduced a trap composed of 65 places in 271 ms of which 1 ms to minimize.
[2023-03-22 02:38:47] [INFO ] Deduced a trap composed of 50 places in 197 ms of which 1 ms to minimize.
[2023-03-22 02:38:47] [INFO ] Deduced a trap composed of 52 places in 246 ms of which 0 ms to minimize.
[2023-03-22 02:38:48] [INFO ] Deduced a trap composed of 52 places in 189 ms of which 1 ms to minimize.
[2023-03-22 02:38:48] [INFO ] Trap strengthening (SAT) tested/added 43/42 trap constraints in 19646 ms
[2023-03-22 02:38:48] [INFO ] After 20715ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 02:38:48] [INFO ] After 21376ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 02:38:48] [INFO ] [Nat]Absence check using 331 positive place invariants in 202 ms returned sat
[2023-03-22 02:38:49] [INFO ] After 938ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 02:38:50] [INFO ] Deduced a trap composed of 24 places in 424 ms of which 1 ms to minimize.
[2023-03-22 02:38:50] [INFO ] Deduced a trap composed of 20 places in 470 ms of which 1 ms to minimize.
[2023-03-22 02:38:51] [INFO ] Deduced a trap composed of 33 places in 539 ms of which 14 ms to minimize.
[2023-03-22 02:38:51] [INFO ] Deduced a trap composed of 21 places in 545 ms of which 0 ms to minimize.
[2023-03-22 02:38:52] [INFO ] Deduced a trap composed of 32 places in 469 ms of which 0 ms to minimize.
[2023-03-22 02:38:53] [INFO ] Deduced a trap composed of 16 places in 764 ms of which 1 ms to minimize.
[2023-03-22 02:38:53] [INFO ] Deduced a trap composed of 30 places in 335 ms of which 1 ms to minimize.
[2023-03-22 02:38:54] [INFO ] Deduced a trap composed of 23 places in 550 ms of which 1 ms to minimize.
[2023-03-22 02:38:54] [INFO ] Deduced a trap composed of 33 places in 430 ms of which 1 ms to minimize.
[2023-03-22 02:38:55] [INFO ] Deduced a trap composed of 16 places in 396 ms of which 1 ms to minimize.
[2023-03-22 02:38:55] [INFO ] Deduced a trap composed of 30 places in 480 ms of which 1 ms to minimize.
[2023-03-22 02:38:56] [INFO ] Deduced a trap composed of 16 places in 389 ms of which 1 ms to minimize.
[2023-03-22 02:38:57] [INFO ] Deduced a trap composed of 35 places in 765 ms of which 6 ms to minimize.
[2023-03-22 02:38:57] [INFO ] Deduced a trap composed of 30 places in 435 ms of which 1 ms to minimize.
[2023-03-22 02:38:58] [INFO ] Deduced a trap composed of 19 places in 382 ms of which 2 ms to minimize.
[2023-03-22 02:38:58] [INFO ] Deduced a trap composed of 37 places in 345 ms of which 1 ms to minimize.
[2023-03-22 02:38:58] [INFO ] Deduced a trap composed of 40 places in 282 ms of which 1 ms to minimize.
[2023-03-22 02:38:59] [INFO ] Deduced a trap composed of 29 places in 347 ms of which 1 ms to minimize.
[2023-03-22 02:38:59] [INFO ] Deduced a trap composed of 27 places in 357 ms of which 0 ms to minimize.
[2023-03-22 02:39:00] [INFO ] Deduced a trap composed of 28 places in 544 ms of which 1 ms to minimize.
[2023-03-22 02:39:00] [INFO ] Deduced a trap composed of 31 places in 333 ms of which 1 ms to minimize.
[2023-03-22 02:39:01] [INFO ] Deduced a trap composed of 26 places in 302 ms of which 1 ms to minimize.
[2023-03-22 02:39:01] [INFO ] Deduced a trap composed of 27 places in 305 ms of which 1 ms to minimize.
[2023-03-22 02:39:02] [INFO ] Deduced a trap composed of 35 places in 656 ms of which 1 ms to minimize.
[2023-03-22 02:39:02] [INFO ] Deduced a trap composed of 37 places in 303 ms of which 0 ms to minimize.
[2023-03-22 02:39:02] [INFO ] Deduced a trap composed of 24 places in 327 ms of which 0 ms to minimize.
[2023-03-22 02:39:03] [INFO ] Deduced a trap composed of 38 places in 283 ms of which 1 ms to minimize.
[2023-03-22 02:39:03] [INFO ] Deduced a trap composed of 38 places in 496 ms of which 2 ms to minimize.
[2023-03-22 02:39:04] [INFO ] Deduced a trap composed of 32 places in 276 ms of which 1 ms to minimize.
[2023-03-22 02:39:04] [INFO ] Deduced a trap composed of 36 places in 293 ms of which 1 ms to minimize.
[2023-03-22 02:39:04] [INFO ] Deduced a trap composed of 47 places in 296 ms of which 0 ms to minimize.
[2023-03-22 02:39:05] [INFO ] Deduced a trap composed of 47 places in 329 ms of which 1 ms to minimize.
[2023-03-22 02:39:05] [INFO ] Deduced a trap composed of 26 places in 288 ms of which 1 ms to minimize.
[2023-03-22 02:39:05] [INFO ] Deduced a trap composed of 38 places in 245 ms of which 2 ms to minimize.
[2023-03-22 02:39:06] [INFO ] Deduced a trap composed of 46 places in 235 ms of which 1 ms to minimize.
[2023-03-22 02:39:06] [INFO ] Deduced a trap composed of 36 places in 386 ms of which 1 ms to minimize.
[2023-03-22 02:39:06] [INFO ] Deduced a trap composed of 29 places in 202 ms of which 1 ms to minimize.
[2023-03-22 02:39:07] [INFO ] Deduced a trap composed of 21 places in 214 ms of which 0 ms to minimize.
[2023-03-22 02:39:07] [INFO ] Deduced a trap composed of 40 places in 382 ms of which 1 ms to minimize.
[2023-03-22 02:39:08] [INFO ] Deduced a trap composed of 26 places in 230 ms of which 1 ms to minimize.
[2023-03-22 02:39:08] [INFO ] Deduced a trap composed of 42 places in 309 ms of which 0 ms to minimize.
[2023-03-22 02:39:08] [INFO ] Deduced a trap composed of 46 places in 252 ms of which 1 ms to minimize.
[2023-03-22 02:39:08] [INFO ] Deduced a trap composed of 38 places in 259 ms of which 0 ms to minimize.
[2023-03-22 02:39:09] [INFO ] Deduced a trap composed of 54 places in 316 ms of which 1 ms to minimize.
[2023-03-22 02:39:09] [INFO ] Deduced a trap composed of 65 places in 288 ms of which 0 ms to minimize.
[2023-03-22 02:39:10] [INFO ] Deduced a trap composed of 39 places in 246 ms of which 1 ms to minimize.
[2023-03-22 02:39:10] [INFO ] Deduced a trap composed of 46 places in 267 ms of which 1 ms to minimize.
[2023-03-22 02:39:10] [INFO ] Deduced a trap composed of 38 places in 342 ms of which 1 ms to minimize.
[2023-03-22 02:39:11] [INFO ] Deduced a trap composed of 52 places in 229 ms of which 0 ms to minimize.
[2023-03-22 02:39:11] [INFO ] Deduced a trap composed of 56 places in 341 ms of which 1 ms to minimize.
[2023-03-22 02:39:11] [INFO ] Deduced a trap composed of 56 places in 250 ms of which 0 ms to minimize.
[2023-03-22 02:39:12] [INFO ] Deduced a trap composed of 48 places in 181 ms of which 0 ms to minimize.
[2023-03-22 02:39:12] [INFO ] Deduced a trap composed of 46 places in 156 ms of which 1 ms to minimize.
[2023-03-22 02:39:12] [INFO ] Deduced a trap composed of 36 places in 280 ms of which 0 ms to minimize.
[2023-03-22 02:39:12] [INFO ] Deduced a trap composed of 42 places in 250 ms of which 1 ms to minimize.
[2023-03-22 02:39:12] [INFO ] Trap strengthening (SAT) tested/added 56/55 trap constraints in 23279 ms
[2023-03-22 02:39:13] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 02:39:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 02:39:13] [INFO ] After 25074ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 69 ms.
Support contains 3 out of 1833 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1833/1833 places, 1683/1683 transitions.
Drop transitions removed 212 transitions
Trivial Post-agglo rules discarded 212 transitions
Performed 212 trivial Post agglomeration. Transition count delta: 212
Iterating post reduction 0 with 212 rules applied. Total rules applied 212 place count 1833 transition count 1471
Reduce places removed 212 places and 0 transitions.
Iterating post reduction 1 with 212 rules applied. Total rules applied 424 place count 1621 transition count 1471
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 424 place count 1621 transition count 1321
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 724 place count 1471 transition count 1321
Performed 537 Post agglomeration using F-continuation condition.Transition count delta: 537
Deduced a syphon composed of 537 places in 1 ms
Reduce places removed 537 places and 0 transitions.
Iterating global reduction 2 with 1074 rules applied. Total rules applied 1798 place count 934 transition count 784
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 266 times.
Drop transitions removed 266 transitions
Iterating global reduction 2 with 266 rules applied. Total rules applied 2064 place count 934 transition count 784
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2065 place count 933 transition count 783
Applied a total of 2065 rules in 266 ms. Remains 933 /1833 variables (removed 900) and now considering 783/1683 (removed 900) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 267 ms. Remains : 933/1833 places, 783/1683 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :0
Finished Best-First random walk after 1077 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=179 )
Knowledge obtained : [(AND p1 (NOT p2)), true]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p2)))), (F (NOT p1)), (F (AND (NOT p1) p2)), (F (AND p1 p2))]
Knowledge based reduction with 2 factoid took 260 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 356 ms :[(NOT p1), p2, (OR (NOT p1) p2), p2, p2, true, p2]
Stuttering acceptance computed with spot in 283 ms :[(NOT p1), p2, (OR (NOT p1) p2), p2, p2, true, p2]
Stuttering acceptance computed with spot in 302 ms :[(NOT p1), p2, (OR (NOT p1) p2), p2, p2, true, p2]
Product exploration explored 100000 steps with 25000 reset in 632 ms.
Product exploration explored 100000 steps with 25000 reset in 651 ms.
Applying partial POR strategy [true, true, true, false, false, true, false]
Stuttering acceptance computed with spot in 419 ms :[(NOT p1), p2, (OR (NOT p1) p2), p2, p2, true, p2]
Support contains 3 out of 1833 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1833/1833 places, 1683/1683 transitions.
Performed 211 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 211 rules applied. Total rules applied 211 place count 1833 transition count 1683
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 61 Pre rules applied. Total rules applied 211 place count 1833 transition count 1684
Deduced a syphon composed of 272 places in 4 ms
Iterating global reduction 1 with 61 rules applied. Total rules applied 272 place count 1833 transition count 1684
Performed 627 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 899 places in 2 ms
Iterating global reduction 1 with 627 rules applied. Total rules applied 899 place count 1833 transition count 1684
Renaming transitions due to excessive name length > 1024 char.
Discarding 211 places :
Symmetric choice reduction at 1 with 211 rule applications. Total rules 1110 place count 1622 transition count 1473
Deduced a syphon composed of 688 places in 2 ms
Iterating global reduction 1 with 211 rules applied. Total rules applied 1321 place count 1622 transition count 1473
Deduced a syphon composed of 688 places in 2 ms
Applied a total of 1321 rules in 748 ms. Remains 1622 /1833 variables (removed 211) and now considering 1473/1683 (removed 210) transitions.
[2023-03-22 02:39:17] [INFO ] Redundant transitions in 26 ms returned []
// Phase 1: matrix 1473 rows 1622 cols
[2023-03-22 02:39:17] [INFO ] Computed 331 place invariants in 13 ms
[2023-03-22 02:39:18] [INFO ] Dead Transitions using invariants and state equation in 1065 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1622/1833 places, 1473/1683 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1850 ms. Remains : 1622/1833 places, 1473/1683 transitions.
Support contains 3 out of 1833 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1833/1833 places, 1683/1683 transitions.
Applied a total of 0 rules in 86 ms. Remains 1833 /1833 variables (removed 0) and now considering 1683/1683 (removed 0) transitions.
// Phase 1: matrix 1683 rows 1833 cols
[2023-03-22 02:39:19] [INFO ] Computed 331 place invariants in 12 ms
[2023-03-22 02:39:19] [INFO ] Implicit Places using invariants in 917 ms returned []
[2023-03-22 02:39:19] [INFO ] Invariant cache hit.
[2023-03-22 02:39:22] [INFO ] Implicit Places using invariants and state equation in 2350 ms returned []
Implicit Place search using SMT with State Equation took 3269 ms to find 0 implicit places.
[2023-03-22 02:39:22] [INFO ] Invariant cache hit.
[2023-03-22 02:39:23] [INFO ] Dead Transitions using invariants and state equation in 1410 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4774 ms. Remains : 1833/1833 places, 1683/1683 transitions.
Treatment of property ShieldPPPs-PT-030B-LTLFireability-03 finished in 126740 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1841/1841 places, 1691/1691 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1832 transition count 1682
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1832 transition count 1682
Applied a total of 18 rules in 136 ms. Remains 1832 /1841 variables (removed 9) and now considering 1682/1691 (removed 9) transitions.
// Phase 1: matrix 1682 rows 1832 cols
[2023-03-22 02:39:24] [INFO ] Computed 331 place invariants in 5 ms
[2023-03-22 02:39:25] [INFO ] Implicit Places using invariants in 1267 ms returned []
[2023-03-22 02:39:25] [INFO ] Invariant cache hit.
[2023-03-22 02:39:28] [INFO ] Implicit Places using invariants and state equation in 3020 ms returned []
Implicit Place search using SMT with State Equation took 4289 ms to find 0 implicit places.
[2023-03-22 02:39:28] [INFO ] Invariant cache hit.
[2023-03-22 02:39:29] [INFO ] Dead Transitions using invariants and state equation in 1264 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1832/1841 places, 1682/1691 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5699 ms. Remains : 1832/1841 places, 1682/1691 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-030B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s115 0) (EQ s117 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 4535 steps with 0 reset in 53 ms.
FORMULA ShieldPPPs-PT-030B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-030B-LTLFireability-04 finished in 5927 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)||G((p1||F(p0)))))'
Support contains 3 out of 1841 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1841/1841 places, 1691/1691 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 1840 transition count 1480
Reduce places removed 210 places and 0 transitions.
Iterating post reduction 1 with 210 rules applied. Total rules applied 420 place count 1630 transition count 1480
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 420 place count 1630 transition count 1330
Deduced a syphon composed of 150 places in 4 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 720 place count 1480 transition count 1330
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 728 place count 1472 transition count 1322
Iterating global reduction 2 with 8 rules applied. Total rules applied 736 place count 1472 transition count 1322
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 736 place count 1472 transition count 1321
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 738 place count 1471 transition count 1321
Performed 535 Post agglomeration using F-continuation condition.Transition count delta: 535
Deduced a syphon composed of 535 places in 0 ms
Reduce places removed 535 places and 0 transitions.
Iterating global reduction 2 with 1070 rules applied. Total rules applied 1808 place count 936 transition count 786
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 1810 place count 934 transition count 784
Applied a total of 1810 rules in 341 ms. Remains 934 /1841 variables (removed 907) and now considering 784/1691 (removed 907) transitions.
// Phase 1: matrix 784 rows 934 cols
[2023-03-22 02:39:30] [INFO ] Computed 331 place invariants in 2 ms
[2023-03-22 02:39:30] [INFO ] Implicit Places using invariants in 531 ms returned []
[2023-03-22 02:39:30] [INFO ] Invariant cache hit.
[2023-03-22 02:39:31] [INFO ] Implicit Places using invariants and state equation in 1193 ms returned []
Implicit Place search using SMT with State Equation took 1725 ms to find 0 implicit places.
[2023-03-22 02:39:31] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-22 02:39:31] [INFO ] Invariant cache hit.
[2023-03-22 02:39:32] [INFO ] Dead Transitions using invariants and state equation in 569 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 934/1841 places, 784/1691 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2709 ms. Remains : 934/1841 places, 784/1691 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-030B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s8 1) (EQ s30 1)), p1:(EQ s842 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 55 reset in 787 ms.
Stuttering criterion allowed to conclude after 39067 steps with 20 reset in 372 ms.
FORMULA ShieldPPPs-PT-030B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-030B-LTLFireability-05 finished in 3975 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) U G((p1||G(p2)))))'
Support contains 5 out of 1841 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1841/1841 places, 1691/1691 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 212 transitions
Trivial Post-agglo rules discarded 212 transitions
Performed 212 trivial Post agglomeration. Transition count delta: 212
Iterating post reduction 0 with 212 rules applied. Total rules applied 212 place count 1840 transition count 1478
Reduce places removed 212 places and 0 transitions.
Iterating post reduction 1 with 212 rules applied. Total rules applied 424 place count 1628 transition count 1478
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 424 place count 1628 transition count 1328
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 724 place count 1478 transition count 1328
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 732 place count 1470 transition count 1320
Iterating global reduction 2 with 8 rules applied. Total rules applied 740 place count 1470 transition count 1320
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 740 place count 1470 transition count 1318
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 744 place count 1468 transition count 1318
Performed 533 Post agglomeration using F-continuation condition.Transition count delta: 533
Deduced a syphon composed of 533 places in 1 ms
Reduce places removed 533 places and 0 transitions.
Iterating global reduction 2 with 1066 rules applied. Total rules applied 1810 place count 935 transition count 785
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 1812 place count 933 transition count 783
Applied a total of 1812 rules in 279 ms. Remains 933 /1841 variables (removed 908) and now considering 783/1691 (removed 908) transitions.
// Phase 1: matrix 783 rows 933 cols
[2023-03-22 02:39:34] [INFO ] Computed 331 place invariants in 4 ms
[2023-03-22 02:39:34] [INFO ] Implicit Places using invariants in 510 ms returned []
[2023-03-22 02:39:34] [INFO ] Invariant cache hit.
[2023-03-22 02:39:35] [INFO ] Implicit Places using invariants and state equation in 1135 ms returned []
Implicit Place search using SMT with State Equation took 1653 ms to find 0 implicit places.
[2023-03-22 02:39:35] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-22 02:39:35] [INFO ] Invariant cache hit.
[2023-03-22 02:39:36] [INFO ] Dead Transitions using invariants and state equation in 581 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 933/1841 places, 783/1691 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2544 ms. Remains : 933/1841 places, 783/1691 transitions.
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldPPPs-PT-030B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR p1 p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={1} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=2 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s442 1) (EQ s459 1)), p2:(AND (EQ s348 1) (EQ s365 1)), p0:(NEQ s155 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 5965 steps with 2 reset in 89 ms.
FORMULA ShieldPPPs-PT-030B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-030B-LTLFireability-10 finished in 2883 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))&&F(p1)))'
Support contains 4 out of 1841 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1841/1841 places, 1691/1691 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1832 transition count 1682
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1832 transition count 1682
Applied a total of 18 rules in 159 ms. Remains 1832 /1841 variables (removed 9) and now considering 1682/1691 (removed 9) transitions.
// Phase 1: matrix 1682 rows 1832 cols
[2023-03-22 02:39:36] [INFO ] Computed 331 place invariants in 13 ms
[2023-03-22 02:39:37] [INFO ] Implicit Places using invariants in 684 ms returned []
[2023-03-22 02:39:37] [INFO ] Invariant cache hit.
[2023-03-22 02:39:39] [INFO ] Implicit Places using invariants and state equation in 1989 ms returned []
Implicit Place search using SMT with State Equation took 2674 ms to find 0 implicit places.
[2023-03-22 02:39:39] [INFO ] Invariant cache hit.
[2023-03-22 02:39:40] [INFO ] Dead Transitions using invariants and state equation in 1187 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1832/1841 places, 1682/1691 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4023 ms. Remains : 1832/1841 places, 1682/1691 transitions.
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : ShieldPPPs-PT-030B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s641 1) (EQ s686 1)), p0:(AND (EQ s487 1) (EQ s531 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-030B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-030B-LTLFireability-11 finished in 4300 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1841 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1841/1841 places, 1691/1691 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 211 transitions
Trivial Post-agglo rules discarded 211 transitions
Performed 211 trivial Post agglomeration. Transition count delta: 211
Iterating post reduction 0 with 211 rules applied. Total rules applied 211 place count 1840 transition count 1479
Reduce places removed 211 places and 0 transitions.
Iterating post reduction 1 with 211 rules applied. Total rules applied 422 place count 1629 transition count 1479
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 151 Pre rules applied. Total rules applied 422 place count 1629 transition count 1328
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 724 place count 1478 transition count 1328
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 733 place count 1469 transition count 1319
Iterating global reduction 2 with 9 rules applied. Total rules applied 742 place count 1469 transition count 1319
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 742 place count 1469 transition count 1317
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 746 place count 1467 transition count 1317
Performed 533 Post agglomeration using F-continuation condition.Transition count delta: 533
Deduced a syphon composed of 533 places in 1 ms
Reduce places removed 533 places and 0 transitions.
Iterating global reduction 2 with 1066 rules applied. Total rules applied 1812 place count 934 transition count 784
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 1814 place count 932 transition count 782
Applied a total of 1814 rules in 342 ms. Remains 932 /1841 variables (removed 909) and now considering 782/1691 (removed 909) transitions.
// Phase 1: matrix 782 rows 932 cols
[2023-03-22 02:39:41] [INFO ] Computed 331 place invariants in 3 ms
[2023-03-22 02:39:41] [INFO ] Implicit Places using invariants in 583 ms returned []
[2023-03-22 02:39:41] [INFO ] Invariant cache hit.
[2023-03-22 02:39:43] [INFO ] Implicit Places using invariants and state equation in 1170 ms returned []
Implicit Place search using SMT with State Equation took 1775 ms to find 0 implicit places.
[2023-03-22 02:39:43] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-22 02:39:43] [INFO ] Invariant cache hit.
[2023-03-22 02:39:43] [INFO ] Dead Transitions using invariants and state equation in 481 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 932/1841 places, 782/1691 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2628 ms. Remains : 932/1841 places, 782/1691 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-030B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s139 1) (EQ s182 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 73 reset in 745 ms.
Product exploration explored 100000 steps with 72 reset in 842 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1231 steps, including 0 resets, run visited all 1 properties in 13 ms. (steps per millisecond=94 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 201 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
[2023-03-22 02:39:45] [INFO ] Invariant cache hit.
[2023-03-22 02:39:46] [INFO ] [Real]Absence check using 331 positive place invariants in 344 ms returned sat
[2023-03-22 02:39:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:39:48] [INFO ] [Real]Absence check using state equation in 2126 ms returned sat
[2023-03-22 02:39:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:39:49] [INFO ] [Nat]Absence check using 331 positive place invariants in 193 ms returned sat
[2023-03-22 02:39:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:39:51] [INFO ] [Nat]Absence check using state equation in 1513 ms returned sat
[2023-03-22 02:39:51] [INFO ] Computed and/alt/rep : 779/1502/779 causal constraints (skipped 0 transitions) in 62 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-22 02:40:04] [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 932 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 932/932 places, 782/782 transitions.
Applied a total of 0 rules in 45 ms. Remains 932 /932 variables (removed 0) and now considering 782/782 (removed 0) transitions.
[2023-03-22 02:40:04] [INFO ] Invariant cache hit.
[2023-03-22 02:40:04] [INFO ] Implicit Places using invariants in 653 ms returned []
[2023-03-22 02:40:04] [INFO ] Invariant cache hit.
[2023-03-22 02:40:05] [INFO ] Implicit Places using invariants and state equation in 1163 ms returned []
Implicit Place search using SMT with State Equation took 1821 ms to find 0 implicit places.
[2023-03-22 02:40:05] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-22 02:40:05] [INFO ] Invariant cache hit.
[2023-03-22 02:40:06] [INFO ] Dead Transitions using invariants and state equation in 434 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2315 ms. Remains : 932/932 places, 782/782 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1307 steps, including 0 resets, run visited all 1 properties in 10 ms. (steps per millisecond=130 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 165 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0)]
[2023-03-22 02:40:06] [INFO ] Invariant cache hit.
[2023-03-22 02:40:07] [INFO ] [Real]Absence check using 331 positive place invariants in 175 ms returned sat
[2023-03-22 02:40:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:40:09] [INFO ] [Real]Absence check using state equation in 1902 ms returned sat
[2023-03-22 02:40:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:40:10] [INFO ] [Nat]Absence check using 331 positive place invariants in 160 ms returned sat
[2023-03-22 02:40:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:40:12] [INFO ] [Nat]Absence check using state equation in 1686 ms returned sat
[2023-03-22 02:40:12] [INFO ] Computed and/alt/rep : 779/1502/779 causal constraints (skipped 0 transitions) in 43 ms.
[2023-03-22 02:40:24] [INFO ] Added : 560 causal constraints over 112 iterations in 12466 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 72 reset in 915 ms.
Product exploration explored 100000 steps with 73 reset in 893 ms.
Support contains 2 out of 932 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 932/932 places, 782/782 transitions.
Applied a total of 0 rules in 19 ms. Remains 932 /932 variables (removed 0) and now considering 782/782 (removed 0) transitions.
[2023-03-22 02:40:26] [INFO ] Invariant cache hit.
[2023-03-22 02:40:27] [INFO ] Implicit Places using invariants in 545 ms returned []
[2023-03-22 02:40:27] [INFO ] Invariant cache hit.
[2023-03-22 02:40:28] [INFO ] Implicit Places using invariants and state equation in 1101 ms returned []
Implicit Place search using SMT with State Equation took 1679 ms to find 0 implicit places.
[2023-03-22 02:40:28] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-22 02:40:28] [INFO ] Invariant cache hit.
[2023-03-22 02:40:28] [INFO ] Dead Transitions using invariants and state equation in 440 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2150 ms. Remains : 932/932 places, 782/782 transitions.
Treatment of property ShieldPPPs-PT-030B-LTLFireability-12 finished in 48086 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 1841 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1841/1841 places, 1691/1691 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 212 transitions
Trivial Post-agglo rules discarded 212 transitions
Performed 212 trivial Post agglomeration. Transition count delta: 212
Iterating post reduction 0 with 212 rules applied. Total rules applied 212 place count 1840 transition count 1478
Reduce places removed 212 places and 0 transitions.
Iterating post reduction 1 with 212 rules applied. Total rules applied 424 place count 1628 transition count 1478
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 424 place count 1628 transition count 1328
Deduced a syphon composed of 150 places in 3 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 724 place count 1478 transition count 1328
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 732 place count 1470 transition count 1320
Iterating global reduction 2 with 8 rules applied. Total rules applied 740 place count 1470 transition count 1320
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 740 place count 1470 transition count 1319
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 742 place count 1469 transition count 1319
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 1814 place count 933 transition count 783
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 1816 place count 931 transition count 781
Applied a total of 1816 rules in 279 ms. Remains 931 /1841 variables (removed 910) and now considering 781/1691 (removed 910) transitions.
// Phase 1: matrix 781 rows 931 cols
[2023-03-22 02:40:29] [INFO ] Computed 331 place invariants in 4 ms
[2023-03-22 02:40:29] [INFO ] Implicit Places using invariants in 562 ms returned []
[2023-03-22 02:40:29] [INFO ] Invariant cache hit.
[2023-03-22 02:40:30] [INFO ] Implicit Places using invariants and state equation in 1085 ms returned []
Implicit Place search using SMT with State Equation took 1651 ms to find 0 implicit places.
[2023-03-22 02:40:30] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-22 02:40:30] [INFO ] Invariant cache hit.
[2023-03-22 02:40:31] [INFO ] Dead Transitions using invariants and state equation in 547 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 931/1841 places, 781/1691 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2514 ms. Remains : 931/1841 places, 781/1691 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-030B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s269 1) (EQ s401 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 107 reset in 636 ms.
Product exploration explored 100000 steps with 107 reset in 866 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 103 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 899 steps, including 0 resets, run visited all 1 properties in 13 ms. (steps per millisecond=69 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 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 59 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0)]
[2023-03-22 02:40:33] [INFO ] Invariant cache hit.
[2023-03-22 02:40:35] [INFO ] [Real]Absence check using 331 positive place invariants in 254 ms returned sat
[2023-03-22 02:40:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:40:37] [INFO ] [Real]Absence check using state equation in 2209 ms returned sat
[2023-03-22 02:40:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:40:38] [INFO ] [Nat]Absence check using 331 positive place invariants in 247 ms returned sat
[2023-03-22 02:40:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:40:40] [INFO ] [Nat]Absence check using state equation in 2404 ms returned sat
[2023-03-22 02:40:40] [INFO ] Computed and/alt/rep : 779/1494/779 causal constraints (skipped 0 transitions) in 69 ms.
[2023-03-22 02:40:52] [INFO ] Added : 555 causal constraints over 111 iterations in 11785 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 2 out of 931 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 931/931 places, 781/781 transitions.
Applied a total of 0 rules in 44 ms. Remains 931 /931 variables (removed 0) and now considering 781/781 (removed 0) transitions.
[2023-03-22 02:40:52] [INFO ] Invariant cache hit.
[2023-03-22 02:40:53] [INFO ] Implicit Places using invariants in 600 ms returned []
[2023-03-22 02:40:53] [INFO ] Invariant cache hit.
[2023-03-22 02:40:54] [INFO ] Implicit Places using invariants and state equation in 1102 ms returned []
Implicit Place search using SMT with State Equation took 1707 ms to find 0 implicit places.
[2023-03-22 02:40:54] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-22 02:40:54] [INFO ] Invariant cache hit.
[2023-03-22 02:40:54] [INFO ] Dead Transitions using invariants and state equation in 459 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2256 ms. Remains : 931/931 places, 781/781 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 140 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 33 ms :[(NOT p0)]
Finished random walk after 837 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=139 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 179 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 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
[2023-03-22 02:40:55] [INFO ] Invariant cache hit.
[2023-03-22 02:40:56] [INFO ] [Real]Absence check using 331 positive place invariants in 165 ms returned sat
[2023-03-22 02:40:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:40:57] [INFO ] [Real]Absence check using state equation in 1890 ms returned sat
[2023-03-22 02:40:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:40:58] [INFO ] [Nat]Absence check using 331 positive place invariants in 174 ms returned sat
[2023-03-22 02:40:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:41:00] [INFO ] [Nat]Absence check using state equation in 2047 ms returned sat
[2023-03-22 02:41:01] [INFO ] Computed and/alt/rep : 779/1494/779 causal constraints (skipped 0 transitions) in 98 ms.
[2023-03-22 02:41:13] [INFO ] Added : 580 causal constraints over 116 iterations in 12163 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Product exploration explored 100000 steps with 108 reset in 676 ms.
Product exploration explored 100000 steps with 107 reset in 800 ms.
Support contains 2 out of 931 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 931/931 places, 781/781 transitions.
Applied a total of 0 rules in 19 ms. Remains 931 /931 variables (removed 0) and now considering 781/781 (removed 0) transitions.
[2023-03-22 02:41:14] [INFO ] Invariant cache hit.
[2023-03-22 02:41:15] [INFO ] Implicit Places using invariants in 460 ms returned []
[2023-03-22 02:41:15] [INFO ] Invariant cache hit.
[2023-03-22 02:41:16] [INFO ] Implicit Places using invariants and state equation in 994 ms returned []
Implicit Place search using SMT with State Equation took 1463 ms to find 0 implicit places.
[2023-03-22 02:41:16] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-22 02:41:16] [INFO ] Invariant cache hit.
[2023-03-22 02:41:16] [INFO ] Dead Transitions using invariants and state equation in 433 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1941 ms. Remains : 931/931 places, 781/781 transitions.
Treatment of property ShieldPPPs-PT-030B-LTLFireability-13 finished in 47592 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(G(p1)))))'
Support contains 2 out of 1841 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1841/1841 places, 1691/1691 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 212 transitions
Trivial Post-agglo rules discarded 212 transitions
Performed 212 trivial Post agglomeration. Transition count delta: 212
Iterating post reduction 0 with 212 rules applied. Total rules applied 212 place count 1840 transition count 1478
Reduce places removed 212 places and 0 transitions.
Iterating post reduction 1 with 212 rules applied. Total rules applied 424 place count 1628 transition count 1478
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 424 place count 1628 transition count 1328
Deduced a syphon composed of 150 places in 3 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 724 place count 1478 transition count 1328
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 731 place count 1471 transition count 1321
Iterating global reduction 2 with 7 rules applied. Total rules applied 738 place count 1471 transition count 1321
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 738 place count 1471 transition count 1319
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 742 place count 1469 transition count 1319
Performed 535 Post agglomeration using F-continuation condition.Transition count delta: 535
Deduced a syphon composed of 535 places in 1 ms
Reduce places removed 535 places and 0 transitions.
Iterating global reduction 2 with 1070 rules applied. Total rules applied 1812 place count 934 transition count 784
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 1814 place count 932 transition count 782
Applied a total of 1814 rules in 266 ms. Remains 932 /1841 variables (removed 909) and now considering 782/1691 (removed 909) transitions.
// Phase 1: matrix 782 rows 932 cols
[2023-03-22 02:41:16] [INFO ] Computed 331 place invariants in 3 ms
[2023-03-22 02:41:17] [INFO ] Implicit Places using invariants in 580 ms returned []
[2023-03-22 02:41:17] [INFO ] Invariant cache hit.
[2023-03-22 02:41:18] [INFO ] Implicit Places using invariants and state equation in 1203 ms returned []
Implicit Place search using SMT with State Equation took 1785 ms to find 0 implicit places.
[2023-03-22 02:41:18] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-22 02:41:18] [INFO ] Invariant cache hit.
[2023-03-22 02:41:19] [INFO ] Dead Transitions using invariants and state equation in 802 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 932/1841 places, 782/1691 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2900 ms. Remains : 932/1841 places, 782/1691 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-030B-LTLFireability-14 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=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s866 1), p1:(EQ s125 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2050 steps with 1 reset in 14 ms.
FORMULA ShieldPPPs-PT-030B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-030B-LTLFireability-14 finished in 3148 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 1841 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1841/1841 places, 1691/1691 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 211 transitions
Trivial Post-agglo rules discarded 211 transitions
Performed 211 trivial Post agglomeration. Transition count delta: 211
Iterating post reduction 0 with 211 rules applied. Total rules applied 211 place count 1840 transition count 1479
Reduce places removed 211 places and 0 transitions.
Iterating post reduction 1 with 211 rules applied. Total rules applied 422 place count 1629 transition count 1479
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 151 Pre rules applied. Total rules applied 422 place count 1629 transition count 1328
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 724 place count 1478 transition count 1328
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 733 place count 1469 transition count 1319
Iterating global reduction 2 with 9 rules applied. Total rules applied 742 place count 1469 transition count 1319
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 742 place count 1469 transition count 1317
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 746 place count 1467 transition count 1317
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 1814 place count 933 transition count 783
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 1816 place count 931 transition count 781
Applied a total of 1816 rules in 258 ms. Remains 931 /1841 variables (removed 910) and now considering 781/1691 (removed 910) transitions.
// Phase 1: matrix 781 rows 931 cols
[2023-03-22 02:41:20] [INFO ] Computed 331 place invariants in 2 ms
[2023-03-22 02:41:20] [INFO ] Implicit Places using invariants in 505 ms returned []
[2023-03-22 02:41:20] [INFO ] Invariant cache hit.
[2023-03-22 02:41:21] [INFO ] Implicit Places using invariants and state equation in 1059 ms returned []
Implicit Place search using SMT with State Equation took 1609 ms to find 0 implicit places.
[2023-03-22 02:41:21] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-22 02:41:21] [INFO ] Invariant cache hit.
[2023-03-22 02:41:22] [INFO ] Dead Transitions using invariants and state equation in 502 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 931/1841 places, 781/1691 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2382 ms. Remains : 931/1841 places, 781/1691 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-030B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s718 1) (EQ s738 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 448 reset in 555 ms.
Product exploration explored 100000 steps with 447 reset in 741 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 117 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 48 ms :[(NOT p0)]
Finished random walk after 205 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=102 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 135 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 60 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
[2023-03-22 02:41:23] [INFO ] Invariant cache hit.
[2023-03-22 02:41:24] [INFO ] [Real]Absence check using 331 positive place invariants in 175 ms returned sat
[2023-03-22 02:41:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:41:27] [INFO ] [Real]Absence check using state equation in 2295 ms returned sat
[2023-03-22 02:41:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:41:27] [INFO ] [Nat]Absence check using 331 positive place invariants in 147 ms returned sat
[2023-03-22 02:41:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:41:29] [INFO ] [Nat]Absence check using state equation in 1604 ms returned sat
[2023-03-22 02:41:29] [INFO ] Computed and/alt/rep : 778/1497/778 causal constraints (skipped 0 transitions) in 64 ms.
[2023-03-22 02:41:42] [INFO ] Added : 585 causal constraints over 117 iterations in 12742 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 2 out of 931 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 931/931 places, 781/781 transitions.
Applied a total of 0 rules in 55 ms. Remains 931 /931 variables (removed 0) and now considering 781/781 (removed 0) transitions.
[2023-03-22 02:41:42] [INFO ] Invariant cache hit.
[2023-03-22 02:41:42] [INFO ] Implicit Places using invariants in 511 ms returned []
[2023-03-22 02:41:42] [INFO ] Invariant cache hit.
[2023-03-22 02:41:44] [INFO ] Implicit Places using invariants and state equation in 1236 ms returned []
Implicit Place search using SMT with State Equation took 1771 ms to find 0 implicit places.
[2023-03-22 02:41:44] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-22 02:41:44] [INFO ] Invariant cache hit.
[2023-03-22 02:41:44] [INFO ] Dead Transitions using invariants and state equation in 555 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2410 ms. Remains : 931/931 places, 781/781 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 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 32 ms :[(NOT p0)]
Finished random walk after 256 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=85 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 163 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
[2023-03-22 02:41:45] [INFO ] Invariant cache hit.
[2023-03-22 02:41:45] [INFO ] [Real]Absence check using 331 positive place invariants in 160 ms returned sat
[2023-03-22 02:41:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 02:41:47] [INFO ] [Real]Absence check using state equation in 1786 ms returned sat
[2023-03-22 02:41:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 02:41:48] [INFO ] [Nat]Absence check using 331 positive place invariants in 153 ms returned sat
[2023-03-22 02:41:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 02:41:50] [INFO ] [Nat]Absence check using state equation in 1755 ms returned sat
[2023-03-22 02:41:50] [INFO ] Computed and/alt/rep : 778/1497/778 causal constraints (skipped 0 transitions) in 62 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 02:42:02] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Product exploration explored 100000 steps with 445 reset in 560 ms.
Product exploration explored 100000 steps with 440 reset in 719 ms.
Support contains 2 out of 931 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 931/931 places, 781/781 transitions.
Applied a total of 0 rules in 19 ms. Remains 931 /931 variables (removed 0) and now considering 781/781 (removed 0) transitions.
[2023-03-22 02:42:04] [INFO ] Invariant cache hit.
[2023-03-22 02:42:04] [INFO ] Implicit Places using invariants in 492 ms returned []
[2023-03-22 02:42:04] [INFO ] Invariant cache hit.
[2023-03-22 02:42:05] [INFO ] Implicit Places using invariants and state equation in 948 ms returned []
Implicit Place search using SMT with State Equation took 1456 ms to find 0 implicit places.
[2023-03-22 02:42:05] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-22 02:42:05] [INFO ] Invariant cache hit.
[2023-03-22 02:42:06] [INFO ] Dead Transitions using invariants and state equation in 607 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2119 ms. Remains : 931/931 places, 781/781 transitions.
Treatment of property ShieldPPPs-PT-030B-LTLFireability-15 finished in 46478 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||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' '!(((G(p1)||p0) U X(X(X(!p2)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
[2023-03-22 02:42:06] [INFO ] Flatten gal took : 119 ms
[2023-03-22 02:42:06] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-22 02:42:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1841 places, 1691 transitions and 4822 arcs took 30 ms.
Total runtime 388401 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
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2747/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldPPPs-PT-030B-LTLFireability-01
Could not compute solution for formula : ShieldPPPs-PT-030B-LTLFireability-03
Could not compute solution for formula : ShieldPPPs-PT-030B-LTLFireability-12
Could not compute solution for formula : ShieldPPPs-PT-030B-LTLFireability-13
Could not compute solution for formula : ShieldPPPs-PT-030B-LTLFireability-15

BK_STOP 1679452930916

--------------------
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 ShieldPPPs-PT-030B-LTLFireability-01
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 1841 places, 1691 transitions and 4822 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.100 user 0.100 sys
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): LTL layer: formula: /tmp/2747/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2747/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x563b743893f4]
1: pnml2lts-mc(+0xa2496) [0x563b74389496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f77cc611140]
3: pnml2lts-mc(+0x405be5) [0x563b746ecbe5]
4: pnml2lts-mc(+0x16b3f9) [0x563b744523f9]
5: pnml2lts-mc(+0x164ac4) [0x563b7444bac4]
6: pnml2lts-mc(+0x272e0a) [0x563b74559e0a]
7: pnml2lts-mc(+0xb61f0) [0x563b7439d1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f77cc4644d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f77cc46467a]
10: pnml2lts-mc(+0xa1581) [0x563b74388581]
11: pnml2lts-mc(+0xa1910) [0x563b74388910]
12: pnml2lts-mc(+0xa32a2) [0x563b7438a2a2]
13: pnml2lts-mc(+0xa50f4) [0x563b7438c0f4]
14: pnml2lts-mc(+0xa516b) [0x563b7438c16b]
15: pnml2lts-mc(+0x3f34b3) [0x563b746da4b3]
16: pnml2lts-mc(+0x7c63d) [0x563b7436363d]
17: pnml2lts-mc(+0x67d86) [0x563b7434ed86]
18: pnml2lts-mc(+0x60a8a) [0x563b74347a8a]
19: pnml2lts-mc(+0x5eb15) [0x563b74345b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f77cc44cd0a]
21: pnml2lts-mc(+0x6075e) [0x563b7434775e]
ltl formula name ShieldPPPs-PT-030B-LTLFireability-03
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 1841 places, 1691 transitions and 4822 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.090 user 0.110 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2747/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2747/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2747/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2747/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 16 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name ShieldPPPs-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: =============================================================================
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1841 places, 1691 transitions and 4822 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.310 real 0.120 user 0.100 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2747/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2747/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2747/ltl_2_
pnml2lts-mc( 3/ 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 ShieldPPPs-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: =============================================================================
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): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1841 places, 1691 transitions and 4822 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.370 real 0.080 user 0.220 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2747/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2747/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2747/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2747/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 1 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 ShieldPPPs-PT-030B-LTLFireability-15
ltl formula formula --ltl=/tmp/2747/ltl_4_
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 1841 places, 1691 transitions and 4822 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2747/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2747/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2747/ltl_4_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.390 real 0.100 user 0.160 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2747/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 1 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)

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="ShieldPPPs-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 ShieldPPPs-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-167903717100476"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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