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.r391-oct2-167903715300476.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 lolaxred
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 r391-oct2-167903715300476
=====================================================================

--------------------
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 1679275962517

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-030B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 01:32:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 01:32:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 01:32:46] [INFO ] Load time of PNML (sax parser for PT used): 240 ms
[2023-03-20 01:32:46] [INFO ] Transformed 2043 places.
[2023-03-20 01:32:46] [INFO ] Transformed 1893 transitions.
[2023-03-20 01:32:46] [INFO ] Found NUPN structural information;
[2023-03-20 01:32:46] [INFO ] Parsed PT model containing 2043 places and 1893 transitions and 5226 arcs in 484 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 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 945 ms. Remains 1841 /2043 variables (removed 202) and now considering 1691/1893 (removed 202) transitions.
// Phase 1: matrix 1691 rows 1841 cols
[2023-03-20 01:32:47] [INFO ] Computed 331 place invariants in 45 ms
[2023-03-20 01:32:49] [INFO ] Implicit Places using invariants in 1537 ms returned []
[2023-03-20 01:32:49] [INFO ] Invariant cache hit.
[2023-03-20 01:32:51] [INFO ] Implicit Places using invariants and state equation in 2514 ms returned []
Implicit Place search using SMT with State Equation took 4472 ms to find 0 implicit places.
[2023-03-20 01:32:51] [INFO ] Invariant cache hit.
[2023-03-20 01:32:53] [INFO ] Dead Transitions using invariants and state equation in 1235 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 6656 ms. Remains : 1841/2043 places, 1691/1893 transitions.
Support contains 53 out of 1841 places after structural reductions.
[2023-03-20 01:32:53] [INFO ] Flatten gal took : 166 ms
[2023-03-20 01:32:53] [INFO ] Flatten gal took : 103 ms
[2023-03-20 01:32:53] [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 551 ms. (steps per millisecond=18 ) properties (out of 26) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2023-03-20 01:32:54] [INFO ] Invariant cache hit.
[2023-03-20 01:32:55] [INFO ] [Real]Absence check using 331 positive place invariants in 235 ms returned sat
[2023-03-20 01:32:57] [INFO ] After 1311ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:12
[2023-03-20 01:32:57] [INFO ] Deduced a trap composed of 20 places in 536 ms of which 4 ms to minimize.
[2023-03-20 01:32:58] [INFO ] Deduced a trap composed of 20 places in 491 ms of which 16 ms to minimize.
[2023-03-20 01:32:59] [INFO ] Deduced a trap composed of 24 places in 653 ms of which 4 ms to minimize.
[2023-03-20 01:32:59] [INFO ] Deduced a trap composed of 19 places in 720 ms of which 2 ms to minimize.
[2023-03-20 01:33:00] [INFO ] Deduced a trap composed of 18 places in 444 ms of which 1 ms to minimize.
[2023-03-20 01:33:01] [INFO ] Deduced a trap composed of 18 places in 439 ms of which 1 ms to minimize.
[2023-03-20 01:33:01] [INFO ] Deduced a trap composed of 19 places in 541 ms of which 2 ms to minimize.
[2023-03-20 01:33:02] [INFO ] Deduced a trap composed of 24 places in 401 ms of which 1 ms to minimize.
[2023-03-20 01:33:02] [INFO ] Deduced a trap composed of 25 places in 525 ms of which 1 ms to minimize.
[2023-03-20 01:33:03] [INFO ] Deduced a trap composed of 23 places in 410 ms of which 1 ms to minimize.
[2023-03-20 01:33:04] [INFO ] Deduced a trap composed of 33 places in 840 ms of which 2 ms to minimize.
[2023-03-20 01:33:04] [INFO ] Deduced a trap composed of 33 places in 378 ms of which 1 ms to minimize.
[2023-03-20 01:33:04] [INFO ] Deduced a trap composed of 22 places in 348 ms of which 1 ms to minimize.
[2023-03-20 01:33:05] [INFO ] Deduced a trap composed of 36 places in 399 ms of which 1 ms to minimize.
[2023-03-20 01:33:05] [INFO ] Deduced a trap composed of 33 places in 427 ms of which 0 ms to minimize.
[2023-03-20 01:33:06] [INFO ] Deduced a trap composed of 34 places in 445 ms of which 1 ms to minimize.
[2023-03-20 01:33:06] [INFO ] Deduced a trap composed of 29 places in 411 ms of which 1 ms to minimize.
[2023-03-20 01:33:07] [INFO ] Deduced a trap composed of 37 places in 374 ms of which 1 ms to minimize.
[2023-03-20 01:33:07] [INFO ] Deduced a trap composed of 35 places in 361 ms of which 1 ms to minimize.
[2023-03-20 01:33:08] [INFO ] Deduced a trap composed of 32 places in 374 ms of which 2 ms to minimize.
[2023-03-20 01:33:08] [INFO ] Deduced a trap composed of 28 places in 403 ms of which 1 ms to minimize.
[2023-03-20 01:33:09] [INFO ] Deduced a trap composed of 32 places in 531 ms of which 12 ms to minimize.
[2023-03-20 01:33:09] [INFO ] Deduced a trap composed of 39 places in 362 ms of which 1 ms to minimize.
[2023-03-20 01:33:10] [INFO ] Deduced a trap composed of 31 places in 316 ms of which 1 ms to minimize.
[2023-03-20 01:33:10] [INFO ] Deduced a trap composed of 31 places in 362 ms of which 0 ms to minimize.
[2023-03-20 01:33:11] [INFO ] Deduced a trap composed of 33 places in 389 ms of which 0 ms to minimize.
[2023-03-20 01:33:11] [INFO ] Deduced a trap composed of 27 places in 334 ms of which 1 ms to minimize.
[2023-03-20 01:33:11] [INFO ] Deduced a trap composed of 25 places in 342 ms of which 1 ms to minimize.
[2023-03-20 01:33:12] [INFO ] Deduced a trap composed of 27 places in 420 ms of which 1 ms to minimize.
[2023-03-20 01:33:12] [INFO ] Deduced a trap composed of 33 places in 410 ms of which 1 ms to minimize.
[2023-03-20 01:33:13] [INFO ] Deduced a trap composed of 39 places in 303 ms of which 1 ms to minimize.
[2023-03-20 01:33:13] [INFO ] Deduced a trap composed of 40 places in 313 ms of which 1 ms to minimize.
[2023-03-20 01:33:14] [INFO ] Deduced a trap composed of 38 places in 875 ms of which 1 ms to minimize.
[2023-03-20 01:33:15] [INFO ] Deduced a trap composed of 45 places in 409 ms of which 12 ms to minimize.
[2023-03-20 01:33:15] [INFO ] Deduced a trap composed of 31 places in 332 ms of which 1 ms to minimize.
[2023-03-20 01:33:15] [INFO ] Deduced a trap composed of 45 places in 250 ms of which 1 ms to minimize.
[2023-03-20 01:33:16] [INFO ] Deduced a trap composed of 41 places in 250 ms of which 0 ms to minimize.
[2023-03-20 01:33:16] [INFO ] Deduced a trap composed of 46 places in 245 ms of which 0 ms to minimize.
[2023-03-20 01:33:16] [INFO ] Deduced a trap composed of 43 places in 245 ms of which 1 ms to minimize.
[2023-03-20 01:33:16] [INFO ] Deduced a trap composed of 36 places in 214 ms of which 6 ms to minimize.
[2023-03-20 01:33:17] [INFO ] Deduced a trap composed of 37 places in 168 ms of which 0 ms to minimize.
[2023-03-20 01:33:17] [INFO ] Deduced a trap composed of 46 places in 146 ms of which 0 ms to minimize.
[2023-03-20 01:33:17] [INFO ] Deduced a trap composed of 32 places in 174 ms of which 1 ms to minimize.
[2023-03-20 01:33:18] [INFO ] Deduced a trap composed of 65 places in 245 ms of which 0 ms to minimize.
[2023-03-20 01:33:18] [INFO ] Deduced a trap composed of 49 places in 204 ms of which 0 ms to minimize.
[2023-03-20 01:33:18] [INFO ] Deduced a trap composed of 45 places in 160 ms of which 1 ms to minimize.
[2023-03-20 01:33:18] [INFO ] Deduced a trap composed of 47 places in 165 ms of which 0 ms to minimize.
[2023-03-20 01:33:19] [INFO ] Deduced a trap composed of 59 places in 213 ms of which 0 ms to minimize.
[2023-03-20 01:33:19] [INFO ] Trap strengthening (SAT) tested/added 49/48 trap constraints in 22003 ms
[2023-03-20 01:33:19] [INFO ] After 23539ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-20 01:33:19] [INFO ] After 24678ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-20 01:33:20] [INFO ] [Nat]Absence check using 331 positive place invariants in 190 ms returned sat
[2023-03-20 01:33:22] [INFO ] After 1939ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :13
[2023-03-20 01:33:23] [INFO ] Deduced a trap composed of 25 places in 407 ms of which 1 ms to minimize.
[2023-03-20 01:33:23] [INFO ] Deduced a trap composed of 36 places in 470 ms of which 1 ms to minimize.
[2023-03-20 01:33:24] [INFO ] Deduced a trap composed of 27 places in 436 ms of which 16 ms to minimize.
[2023-03-20 01:33:25] [INFO ] Deduced a trap composed of 18 places in 745 ms of which 1 ms to minimize.
[2023-03-20 01:33:25] [INFO ] Deduced a trap composed of 17 places in 626 ms of which 1 ms to minimize.
[2023-03-20 01:33:26] [INFO ] Deduced a trap composed of 23 places in 468 ms of which 1 ms to minimize.
[2023-03-20 01:33:27] [INFO ] Deduced a trap composed of 29 places in 418 ms of which 1 ms to minimize.
[2023-03-20 01:33:27] [INFO ] Deduced a trap composed of 28 places in 587 ms of which 1 ms to minimize.
[2023-03-20 01:33:28] [INFO ] Deduced a trap composed of 11 places in 376 ms of which 1 ms to minimize.
[2023-03-20 01:33:29] [INFO ] Deduced a trap composed of 33 places in 855 ms of which 3 ms to minimize.
[2023-03-20 01:33:29] [INFO ] Deduced a trap composed of 27 places in 618 ms of which 1 ms to minimize.
[2023-03-20 01:33:30] [INFO ] Deduced a trap composed of 28 places in 435 ms of which 1 ms to minimize.
[2023-03-20 01:33:30] [INFO ] Deduced a trap composed of 31 places in 413 ms of which 1 ms to minimize.
[2023-03-20 01:33:31] [INFO ] Deduced a trap composed of 29 places in 307 ms of which 1 ms to minimize.
[2023-03-20 01:33:31] [INFO ] Deduced a trap composed of 29 places in 392 ms of which 1 ms to minimize.
[2023-03-20 01:33:32] [INFO ] Deduced a trap composed of 16 places in 344 ms of which 1 ms to minimize.
[2023-03-20 01:33:32] [INFO ] Deduced a trap composed of 18 places in 319 ms of which 2 ms to minimize.
[2023-03-20 01:33:32] [INFO ] Deduced a trap composed of 18 places in 350 ms of which 1 ms to minimize.
[2023-03-20 01:33:33] [INFO ] Deduced a trap composed of 30 places in 413 ms of which 1 ms to minimize.
[2023-03-20 01:33:33] [INFO ] Deduced a trap composed of 24 places in 398 ms of which 2 ms to minimize.
[2023-03-20 01:33:34] [INFO ] Deduced a trap composed of 37 places in 388 ms of which 15 ms to minimize.
[2023-03-20 01:33:34] [INFO ] Deduced a trap composed of 42 places in 359 ms of which 1 ms to minimize.
[2023-03-20 01:33:35] [INFO ] Deduced a trap composed of 42 places in 328 ms of which 1 ms to minimize.
[2023-03-20 01:33:35] [INFO ] Deduced a trap composed of 44 places in 299 ms of which 1 ms to minimize.
[2023-03-20 01:33:35] [INFO ] Deduced a trap composed of 31 places in 261 ms of which 1 ms to minimize.
[2023-03-20 01:33:36] [INFO ] Deduced a trap composed of 55 places in 277 ms of which 1 ms to minimize.
[2023-03-20 01:33:36] [INFO ] Deduced a trap composed of 22 places in 358 ms of which 0 ms to minimize.
[2023-03-20 01:33:36] [INFO ] Deduced a trap composed of 39 places in 277 ms of which 0 ms to minimize.
[2023-03-20 01:33:37] [INFO ] Deduced a trap composed of 33 places in 451 ms of which 0 ms to minimize.
[2023-03-20 01:33:37] [INFO ] Deduced a trap composed of 32 places in 266 ms of which 0 ms to minimize.
[2023-03-20 01:33:37] [INFO ] Deduced a trap composed of 38 places in 243 ms of which 1 ms to minimize.
[2023-03-20 01:33:38] [INFO ] Deduced a trap composed of 38 places in 269 ms of which 0 ms to minimize.
[2023-03-20 01:33:38] [INFO ] Deduced a trap composed of 48 places in 284 ms of which 1 ms to minimize.
[2023-03-20 01:33:39] [INFO ] Deduced a trap composed of 64 places in 292 ms of which 0 ms to minimize.
[2023-03-20 01:33:39] [INFO ] Deduced a trap composed of 47 places in 249 ms of which 0 ms to minimize.
[2023-03-20 01:33:39] [INFO ] Deduced a trap composed of 55 places in 272 ms of which 0 ms to minimize.
[2023-03-20 01:33:40] [INFO ] Deduced a trap composed of 48 places in 314 ms of which 1 ms to minimize.
[2023-03-20 01:33:40] [INFO ] Deduced a trap composed of 66 places in 297 ms of which 0 ms to minimize.
[2023-03-20 01:33:40] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 17656 ms
[2023-03-20 01:33:40] [INFO ] Deduced a trap composed of 41 places in 279 ms of which 1 ms to minimize.
[2023-03-20 01:33:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 402 ms
[2023-03-20 01:33:41] [INFO ] Deduced a trap composed of 51 places in 297 ms of which 0 ms to minimize.
[2023-03-20 01:33:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 470 ms
[2023-03-20 01:33:42] [INFO ] Deduced a trap composed of 62 places in 226 ms of which 0 ms to minimize.
[2023-03-20 01:33:42] [INFO ] Deduced a trap composed of 63 places in 273 ms of which 1 ms to minimize.
[2023-03-20 01:33:42] [INFO ] Deduced a trap composed of 40 places in 261 ms of which 0 ms to minimize.
[2023-03-20 01:33:43] [INFO ] Deduced a trap composed of 48 places in 278 ms of which 1 ms to minimize.
[2023-03-20 01:33:43] [INFO ] Deduced a trap composed of 47 places in 283 ms of which 0 ms to minimize.
[2023-03-20 01:33:43] [INFO ] Deduced a trap composed of 40 places in 254 ms of which 0 ms to minimize.
[2023-03-20 01:33:44] [INFO ] Deduced a trap composed of 37 places in 257 ms of which 1 ms to minimize.
[2023-03-20 01:33:44] [INFO ] Deduced a trap composed of 48 places in 213 ms of which 1 ms to minimize.
[2023-03-20 01:33:44] [INFO ] Deduced a trap composed of 50 places in 287 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 01:33:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 01:33:44] [INFO ] After 25217ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:14
Fused 14 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 1002 ms.
Support contains 26 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 8 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 526 Post agglomeration using F-continuation condition.Transition count delta: 526
Deduced a syphon composed of 526 places in 2 ms
Reduce places removed 526 places and 0 transitions.
Iterating global reduction 3 with 1052 rules applied. Total rules applied 1786 place count 948 transition count 798
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 258 times.
Drop transitions removed 258 transitions
Iterating global reduction 3 with 258 rules applied. Total rules applied 2044 place count 948 transition count 798
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2045 place count 947 transition count 797
Applied a total of 2045 rules in 590 ms. Remains 947 /1841 variables (removed 894) and now considering 797/1691 (removed 894) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 591 ms. Remains : 947/1841 places, 797/1691 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 13) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) 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 3) seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 797 rows 947 cols
[2023-03-20 01:33:46] [INFO ] Computed 331 place invariants in 25 ms
[2023-03-20 01:33:46] [INFO ] [Real]Absence check using 311 positive place invariants in 48 ms returned sat
[2023-03-20 01:33:46] [INFO ] [Real]Absence check using 311 positive and 20 generalized place invariants in 3 ms returned sat
[2023-03-20 01:33:47] [INFO ] After 787ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 01:33:47] [INFO ] [Nat]Absence check using 311 positive place invariants in 70 ms returned sat
[2023-03-20 01:33:47] [INFO ] [Nat]Absence check using 311 positive and 20 generalized place invariants in 8 ms returned sat
[2023-03-20 01:33:48] [INFO ] After 555ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 01:33:48] [INFO ] Deduced a trap composed of 6 places in 208 ms of which 1 ms to minimize.
[2023-03-20 01:33:48] [INFO ] Deduced a trap composed of 4 places in 204 ms of which 1 ms to minimize.
[2023-03-20 01:33:49] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 3 ms to minimize.
[2023-03-20 01:33:49] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 0 ms to minimize.
[2023-03-20 01:33:49] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 0 ms to minimize.
[2023-03-20 01:33:49] [INFO ] Deduced a trap composed of 6 places in 197 ms of which 1 ms to minimize.
[2023-03-20 01:33:49] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2023-03-20 01:33:49] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 1 ms to minimize.
[2023-03-20 01:33:50] [INFO ] Deduced a trap composed of 6 places in 162 ms of which 1 ms to minimize.
[2023-03-20 01:33:50] [INFO ] Deduced a trap composed of 4 places in 213 ms of which 0 ms to minimize.
[2023-03-20 01:33:50] [INFO ] Deduced a trap composed of 4 places in 236 ms of which 1 ms to minimize.
[2023-03-20 01:33:50] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2023-03-20 01:33:50] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 1 ms to minimize.
[2023-03-20 01:33:51] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 0 ms to minimize.
[2023-03-20 01:33:51] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 1 ms to minimize.
[2023-03-20 01:33:51] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 0 ms to minimize.
[2023-03-20 01:33:52] [INFO ] Deduced a trap composed of 12 places in 565 ms of which 1 ms to minimize.
[2023-03-20 01:33:52] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 0 ms to minimize.
[2023-03-20 01:33:52] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 0 ms to minimize.
[2023-03-20 01:33:52] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 0 ms to minimize.
[2023-03-20 01:33:52] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 0 ms to minimize.
[2023-03-20 01:33:52] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 0 ms to minimize.
[2023-03-20 01:33:52] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 4300 ms
[2023-03-20 01:33:52] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 1 ms to minimize.
[2023-03-20 01:33:53] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 1 ms to minimize.
[2023-03-20 01:33:53] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 0 ms to minimize.
[2023-03-20 01:33:53] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 2 ms to minimize.
[2023-03-20 01:33:53] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 1 ms to minimize.
[2023-03-20 01:33:53] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 0 ms to minimize.
[2023-03-20 01:33:53] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1017 ms
[2023-03-20 01:33:53] [INFO ] After 6036ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 104 ms.
[2023-03-20 01:33:53] [INFO ] After 6463ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 25 ms.
Support contains 6 out of 947 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 947/947 places, 797/797 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 947 transition count 796
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 946 transition count 796
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 946 transition count 794
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 944 transition count 794
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 936 transition count 786
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 936 transition count 786
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 934 transition count 784
Applied a total of 27 rules in 141 ms. Remains 934 /947 variables (removed 13) and now considering 784/797 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 934/947 places, 784/797 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 784 rows 934 cols
[2023-03-20 01:33:54] [INFO ] Computed 331 place invariants in 17 ms
[2023-03-20 01:33:54] [INFO ] [Real]Absence check using 315 positive place invariants in 36 ms returned sat
[2023-03-20 01:33:54] [INFO ] [Real]Absence check using 315 positive and 16 generalized place invariants in 3 ms returned sat
[2023-03-20 01:33:55] [INFO ] After 850ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:33:55] [INFO ] [Nat]Absence check using 315 positive place invariants in 72 ms returned sat
[2023-03-20 01:33:55] [INFO ] [Nat]Absence check using 315 positive and 16 generalized place invariants in 3 ms returned sat
[2023-03-20 01:33:56] [INFO ] After 720ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:33:56] [INFO ] Deduced a trap composed of 11 places in 435 ms of which 1 ms to minimize.
[2023-03-20 01:33:56] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 0 ms to minimize.
[2023-03-20 01:33:56] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 0 ms to minimize.
[2023-03-20 01:33:57] [INFO ] Deduced a trap composed of 8 places in 316 ms of which 1 ms to minimize.
[2023-03-20 01:33:57] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 0 ms to minimize.
[2023-03-20 01:33:57] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 0 ms to minimize.
[2023-03-20 01:33:57] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 0 ms to minimize.
[2023-03-20 01:33:57] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 0 ms to minimize.
[2023-03-20 01:33:57] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 0 ms to minimize.
[2023-03-20 01:33:57] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 0 ms to minimize.
[2023-03-20 01:33:57] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1830 ms
[2023-03-20 01:33:57] [INFO ] After 2572ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-20 01:33:57] [INFO ] After 2845ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 4 out of 934 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 934/934 places, 784/784 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 932 transition count 782
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 931 transition count 781
Applied a total of 5 rules in 95 ms. Remains 931 /934 variables (removed 3) and now considering 781/784 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 931/934 places, 781/784 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Finished probabilistic random walk after 57552 steps, run visited all 1 properties in 659 ms. (steps per millisecond=87 )
Probabilistic random walk after 57552 steps, saw 51770 distinct states, run finished after 659 ms. (steps per millisecond=87 ) 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 131 ms. Remains 1832 /1841 variables (removed 9) and now considering 1682/1691 (removed 9) transitions.
// Phase 1: matrix 1682 rows 1832 cols
[2023-03-20 01:33:59] [INFO ] Computed 331 place invariants in 14 ms
[2023-03-20 01:34:00] [INFO ] Implicit Places using invariants in 861 ms returned []
[2023-03-20 01:34:00] [INFO ] Invariant cache hit.
[2023-03-20 01:34:02] [INFO ] Implicit Places using invariants and state equation in 1991 ms returned []
Implicit Place search using SMT with State Equation took 2869 ms to find 0 implicit places.
[2023-03-20 01:34:02] [INFO ] Invariant cache hit.
[2023-03-20 01:34:03] [INFO ] Dead Transitions using invariants and state equation in 1484 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 4487 ms. Remains : 1832/1841 places, 1682/1691 transitions.
Stuttering acceptance computed with spot in 507 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 4279 steps with 0 reset in 72 ms.
FORMULA ShieldPPPs-PT-030B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-030B-LTLFireability-00 finished in 5141 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 3 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 306 ms. Remains 934 /1841 variables (removed 907) and now considering 784/1691 (removed 907) transitions.
// Phase 1: matrix 784 rows 934 cols
[2023-03-20 01:34:04] [INFO ] Computed 331 place invariants in 4 ms
[2023-03-20 01:34:05] [INFO ] Implicit Places using invariants in 558 ms returned []
[2023-03-20 01:34:05] [INFO ] Invariant cache hit.
[2023-03-20 01:34:06] [INFO ] Implicit Places using invariants and state equation in 1162 ms returned []
Implicit Place search using SMT with State Equation took 1721 ms to find 0 implicit places.
[2023-03-20 01:34:06] [INFO ] Redundant transitions in 49 ms returned []
[2023-03-20 01:34:06] [INFO ] Invariant cache hit.
[2023-03-20 01:34:07] [INFO ] Dead Transitions using invariants and state equation in 565 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 2660 ms. Remains : 934/1841 places, 784/1691 transitions.
Stuttering acceptance computed with spot in 92 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 800 ms.
Product exploration explored 100000 steps with 49 reset in 887 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 225 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 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1699 steps, including 0 resets, run visited all 2 properties in 17 ms. (steps per millisecond=99 )
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 264 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 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 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 38 ms. Remains 934 /934 variables (removed 0) and now considering 784/784 (removed 0) transitions.
[2023-03-20 01:34:09] [INFO ] Invariant cache hit.
[2023-03-20 01:34:10] [INFO ] Implicit Places using invariants in 608 ms returned []
[2023-03-20 01:34:10] [INFO ] Invariant cache hit.
[2023-03-20 01:34:11] [INFO ] Implicit Places using invariants and state equation in 1009 ms returned []
Implicit Place search using SMT with State Equation took 1619 ms to find 0 implicit places.
[2023-03-20 01:34:11] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-20 01:34:11] [INFO ] Invariant cache hit.
[2023-03-20 01:34:11] [INFO ] Dead Transitions using invariants and state equation in 588 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2282 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 189 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 55 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1778 steps, including 0 resets, run visited all 2 properties in 22 ms. (steps per millisecond=80 )
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 249 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 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 48 reset in 704 ms.
Product exploration explored 100000 steps with 48 reset in 884 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 28 ms. Remains 934 /934 variables (removed 0) and now considering 784/784 (removed 0) transitions.
[2023-03-20 01:34:14] [INFO ] Invariant cache hit.
[2023-03-20 01:34:14] [INFO ] Implicit Places using invariants in 543 ms returned []
[2023-03-20 01:34:14] [INFO ] Invariant cache hit.
[2023-03-20 01:34:15] [INFO ] Implicit Places using invariants and state equation in 908 ms returned []
Implicit Place search using SMT with State Equation took 1466 ms to find 0 implicit places.
[2023-03-20 01:34:15] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-20 01:34:15] [INFO ] Invariant cache hit.
[2023-03-20 01:34:16] [INFO ] Dead Transitions using invariants and state equation in 389 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1919 ms. Remains : 934/934 places, 784/784 transitions.
Treatment of property ShieldPPPs-PT-030B-LTLFireability-01 finished in 11919 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 152 ms. Remains 1833 /1841 variables (removed 8) and now considering 1683/1691 (removed 8) transitions.
// Phase 1: matrix 1683 rows 1833 cols
[2023-03-20 01:34:16] [INFO ] Computed 331 place invariants in 5 ms
[2023-03-20 01:34:17] [INFO ] Implicit Places using invariants in 620 ms returned []
[2023-03-20 01:34:17] [INFO ] Invariant cache hit.
[2023-03-20 01:34:19] [INFO ] Implicit Places using invariants and state equation in 2072 ms returned []
Implicit Place search using SMT with State Equation took 2715 ms to find 0 implicit places.
[2023-03-20 01:34:19] [INFO ] Invariant cache hit.
[2023-03-20 01:34:20] [INFO ] Dead Transitions using invariants and state equation in 1136 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 4006 ms. Remains : 1833/1841 places, 1683/1691 transitions.
Stuttering acceptance computed with spot in 123 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 29822 steps with 6 reset in 343 ms.
FORMULA ShieldPPPs-PT-030B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-030B-LTLFireability-02 finished in 4497 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 166 ms. Remains 1833 /1841 variables (removed 8) and now considering 1683/1691 (removed 8) transitions.
// Phase 1: matrix 1683 rows 1833 cols
[2023-03-20 01:34:21] [INFO ] Computed 331 place invariants in 5 ms
[2023-03-20 01:34:21] [INFO ] Implicit Places using invariants in 829 ms returned []
[2023-03-20 01:34:21] [INFO ] Invariant cache hit.
[2023-03-20 01:34:23] [INFO ] Implicit Places using invariants and state equation in 1848 ms returned []
Implicit Place search using SMT with State Equation took 2697 ms to find 0 implicit places.
[2023-03-20 01:34:23] [INFO ] Invariant cache hit.
[2023-03-20 01:34:24] [INFO ] Dead Transitions using invariants and state equation in 938 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 3817 ms. Remains : 1833/1841 places, 1683/1691 transitions.
Stuttering acceptance computed with spot in 654 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 585 ms.
Product exploration explored 100000 steps with 25000 reset in 678 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 588 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 269 ms :[(NOT p1), p2, (OR (NOT p1) p2), p2, p2, true, p2]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 238 ms. (steps per millisecond=42 ) 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 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-20 01:34:27] [INFO ] Invariant cache hit.
[2023-03-20 01:34:28] [INFO ] [Real]Absence check using 331 positive place invariants in 90 ms returned sat
[2023-03-20 01:34:28] [INFO ] After 824ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-20 01:34:29] [INFO ] Deduced a trap composed of 24 places in 414 ms of which 2 ms to minimize.
[2023-03-20 01:34:29] [INFO ] Deduced a trap composed of 20 places in 385 ms of which 1 ms to minimize.
[2023-03-20 01:34:30] [INFO ] Deduced a trap composed of 33 places in 433 ms of which 1 ms to minimize.
[2023-03-20 01:34:30] [INFO ] Deduced a trap composed of 21 places in 478 ms of which 2 ms to minimize.
[2023-03-20 01:34:31] [INFO ] Deduced a trap composed of 32 places in 417 ms of which 1 ms to minimize.
[2023-03-20 01:34:31] [INFO ] Deduced a trap composed of 26 places in 355 ms of which 2 ms to minimize.
[2023-03-20 01:34:32] [INFO ] Deduced a trap composed of 35 places in 336 ms of which 0 ms to minimize.
[2023-03-20 01:34:32] [INFO ] Deduced a trap composed of 28 places in 354 ms of which 5 ms to minimize.
[2023-03-20 01:34:33] [INFO ] Deduced a trap composed of 35 places in 387 ms of which 0 ms to minimize.
[2023-03-20 01:34:33] [INFO ] Deduced a trap composed of 36 places in 367 ms of which 0 ms to minimize.
[2023-03-20 01:34:33] [INFO ] Deduced a trap composed of 16 places in 363 ms of which 1 ms to minimize.
[2023-03-20 01:34:34] [INFO ] Deduced a trap composed of 27 places in 384 ms of which 1 ms to minimize.
[2023-03-20 01:34:34] [INFO ] Deduced a trap composed of 23 places in 379 ms of which 1 ms to minimize.
[2023-03-20 01:34:35] [INFO ] Deduced a trap composed of 24 places in 361 ms of which 1 ms to minimize.
[2023-03-20 01:34:35] [INFO ] Deduced a trap composed of 18 places in 282 ms of which 1 ms to minimize.
[2023-03-20 01:34:35] [INFO ] Deduced a trap composed of 41 places in 293 ms of which 1 ms to minimize.
[2023-03-20 01:34:36] [INFO ] Deduced a trap composed of 27 places in 298 ms of which 0 ms to minimize.
[2023-03-20 01:34:36] [INFO ] Deduced a trap composed of 30 places in 289 ms of which 1 ms to minimize.
[2023-03-20 01:34:36] [INFO ] Deduced a trap composed of 33 places in 281 ms of which 0 ms to minimize.
[2023-03-20 01:34:37] [INFO ] Deduced a trap composed of 33 places in 263 ms of which 0 ms to minimize.
[2023-03-20 01:34:37] [INFO ] Deduced a trap composed of 36 places in 259 ms of which 0 ms to minimize.
[2023-03-20 01:34:37] [INFO ] Deduced a trap composed of 27 places in 301 ms of which 0 ms to minimize.
[2023-03-20 01:34:38] [INFO ] Deduced a trap composed of 26 places in 288 ms of which 1 ms to minimize.
[2023-03-20 01:34:38] [INFO ] Deduced a trap composed of 30 places in 326 ms of which 1 ms to minimize.
[2023-03-20 01:34:39] [INFO ] Deduced a trap composed of 33 places in 307 ms of which 1 ms to minimize.
[2023-03-20 01:34:39] [INFO ] Deduced a trap composed of 37 places in 291 ms of which 1 ms to minimize.
[2023-03-20 01:34:39] [INFO ] Deduced a trap composed of 38 places in 381 ms of which 1 ms to minimize.
[2023-03-20 01:34:40] [INFO ] Deduced a trap composed of 30 places in 318 ms of which 1 ms to minimize.
[2023-03-20 01:34:40] [INFO ] Deduced a trap composed of 38 places in 343 ms of which 1 ms to minimize.
[2023-03-20 01:34:41] [INFO ] Deduced a trap composed of 19 places in 266 ms of which 0 ms to minimize.
[2023-03-20 01:34:41] [INFO ] Deduced a trap composed of 32 places in 277 ms of which 0 ms to minimize.
[2023-03-20 01:34:41] [INFO ] Deduced a trap composed of 21 places in 335 ms of which 1 ms to minimize.
[2023-03-20 01:34:42] [INFO ] Deduced a trap composed of 43 places in 243 ms of which 0 ms to minimize.
[2023-03-20 01:34:42] [INFO ] Deduced a trap composed of 43 places in 311 ms of which 1 ms to minimize.
[2023-03-20 01:34:42] [INFO ] Deduced a trap composed of 41 places in 262 ms of which 0 ms to minimize.
[2023-03-20 01:34:43] [INFO ] Deduced a trap composed of 36 places in 272 ms of which 1 ms to minimize.
[2023-03-20 01:34:43] [INFO ] Deduced a trap composed of 42 places in 252 ms of which 1 ms to minimize.
[2023-03-20 01:34:43] [INFO ] Deduced a trap composed of 38 places in 192 ms of which 1 ms to minimize.
[2023-03-20 01:34:44] [INFO ] Deduced a trap composed of 65 places in 289 ms of which 0 ms to minimize.
[2023-03-20 01:34:44] [INFO ] Deduced a trap composed of 50 places in 286 ms of which 2 ms to minimize.
[2023-03-20 01:34:44] [INFO ] Deduced a trap composed of 52 places in 192 ms of which 0 ms to minimize.
[2023-03-20 01:34:45] [INFO ] Deduced a trap composed of 52 places in 362 ms of which 0 ms to minimize.
[2023-03-20 01:34:45] [INFO ] Trap strengthening (SAT) tested/added 43/42 trap constraints in 16347 ms
[2023-03-20 01:34:45] [INFO ] After 17247ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 01:34:45] [INFO ] After 17630ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 01:34:45] [INFO ] [Nat]Absence check using 331 positive place invariants in 110 ms returned sat
[2023-03-20 01:34:46] [INFO ] After 948ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 01:34:47] [INFO ] Deduced a trap composed of 24 places in 526 ms of which 1 ms to minimize.
[2023-03-20 01:34:48] [INFO ] Deduced a trap composed of 20 places in 338 ms of which 1 ms to minimize.
[2023-03-20 01:34:48] [INFO ] Deduced a trap composed of 33 places in 404 ms of which 1 ms to minimize.
[2023-03-20 01:34:48] [INFO ] Deduced a trap composed of 21 places in 359 ms of which 1 ms to minimize.
[2023-03-20 01:34:49] [INFO ] Deduced a trap composed of 32 places in 510 ms of which 1 ms to minimize.
[2023-03-20 01:34:49] [INFO ] Deduced a trap composed of 26 places in 366 ms of which 1 ms to minimize.
[2023-03-20 01:34:50] [INFO ] Deduced a trap composed of 35 places in 424 ms of which 1 ms to minimize.
[2023-03-20 01:34:50] [INFO ] Deduced a trap composed of 29 places in 457 ms of which 1 ms to minimize.
[2023-03-20 01:34:51] [INFO ] Deduced a trap composed of 20 places in 327 ms of which 1 ms to minimize.
[2023-03-20 01:34:51] [INFO ] Deduced a trap composed of 22 places in 411 ms of which 1 ms to minimize.
[2023-03-20 01:34:52] [INFO ] Deduced a trap composed of 16 places in 351 ms of which 1 ms to minimize.
[2023-03-20 01:34:52] [INFO ] Deduced a trap composed of 26 places in 300 ms of which 1 ms to minimize.
[2023-03-20 01:34:52] [INFO ] Deduced a trap composed of 18 places in 353 ms of which 1 ms to minimize.
[2023-03-20 01:34:53] [INFO ] Deduced a trap composed of 28 places in 428 ms of which 1 ms to minimize.
[2023-03-20 01:34:53] [INFO ] Deduced a trap composed of 19 places in 355 ms of which 1 ms to minimize.
[2023-03-20 01:34:54] [INFO ] Deduced a trap composed of 24 places in 410 ms of which 1 ms to minimize.
[2023-03-20 01:34:54] [INFO ] Deduced a trap composed of 23 places in 319 ms of which 0 ms to minimize.
[2023-03-20 01:34:55] [INFO ] Deduced a trap composed of 24 places in 312 ms of which 1 ms to minimize.
[2023-03-20 01:34:55] [INFO ] Deduced a trap composed of 19 places in 379 ms of which 1 ms to minimize.
[2023-03-20 01:34:56] [INFO ] Deduced a trap composed of 25 places in 588 ms of which 2 ms to minimize.
[2023-03-20 01:34:56] [INFO ] Deduced a trap composed of 23 places in 333 ms of which 1 ms to minimize.
[2023-03-20 01:34:56] [INFO ] Deduced a trap composed of 30 places in 301 ms of which 1 ms to minimize.
[2023-03-20 01:34:57] [INFO ] Deduced a trap composed of 21 places in 263 ms of which 1 ms to minimize.
[2023-03-20 01:34:57] [INFO ] Deduced a trap composed of 27 places in 323 ms of which 1 ms to minimize.
[2023-03-20 01:34:58] [INFO ] Deduced a trap composed of 29 places in 536 ms of which 2 ms to minimize.
[2023-03-20 01:34:58] [INFO ] Deduced a trap composed of 32 places in 267 ms of which 0 ms to minimize.
[2023-03-20 01:34:58] [INFO ] Deduced a trap composed of 39 places in 304 ms of which 1 ms to minimize.
[2023-03-20 01:34:59] [INFO ] Deduced a trap composed of 35 places in 385 ms of which 1 ms to minimize.
[2023-03-20 01:34:59] [INFO ] Deduced a trap composed of 31 places in 440 ms of which 1 ms to minimize.
[2023-03-20 01:35:00] [INFO ] Deduced a trap composed of 39 places in 306 ms of which 0 ms to minimize.
[2023-03-20 01:35:00] [INFO ] Deduced a trap composed of 36 places in 308 ms of which 1 ms to minimize.
[2023-03-20 01:35:00] [INFO ] Deduced a trap composed of 36 places in 262 ms of which 0 ms to minimize.
[2023-03-20 01:35:01] [INFO ] Deduced a trap composed of 32 places in 304 ms of which 1 ms to minimize.
[2023-03-20 01:35:01] [INFO ] Deduced a trap composed of 40 places in 390 ms of which 1 ms to minimize.
[2023-03-20 01:35:02] [INFO ] Deduced a trap composed of 39 places in 287 ms of which 1 ms to minimize.
[2023-03-20 01:35:02] [INFO ] Deduced a trap composed of 37 places in 313 ms of which 1 ms to minimize.
[2023-03-20 01:35:02] [INFO ] Deduced a trap composed of 24 places in 334 ms of which 1 ms to minimize.
[2023-03-20 01:35:03] [INFO ] Deduced a trap composed of 38 places in 256 ms of which 1 ms to minimize.
[2023-03-20 01:35:03] [INFO ] Deduced a trap composed of 59 places in 278 ms of which 1 ms to minimize.
[2023-03-20 01:35:03] [INFO ] Deduced a trap composed of 41 places in 224 ms of which 0 ms to minimize.
[2023-03-20 01:35:04] [INFO ] Deduced a trap composed of 38 places in 266 ms of which 1 ms to minimize.
[2023-03-20 01:35:04] [INFO ] Deduced a trap composed of 38 places in 307 ms of which 1 ms to minimize.
[2023-03-20 01:35:04] [INFO ] Deduced a trap composed of 38 places in 279 ms of which 1 ms to minimize.
[2023-03-20 01:35:05] [INFO ] Deduced a trap composed of 36 places in 292 ms of which 1 ms to minimize.
[2023-03-20 01:35:05] [INFO ] Deduced a trap composed of 50 places in 304 ms of which 0 ms to minimize.
[2023-03-20 01:35:05] [INFO ] Deduced a trap composed of 43 places in 232 ms of which 1 ms to minimize.
[2023-03-20 01:35:06] [INFO ] Deduced a trap composed of 52 places in 260 ms of which 1 ms to minimize.
[2023-03-20 01:35:06] [INFO ] Deduced a trap composed of 37 places in 493 ms of which 1 ms to minimize.
[2023-03-20 01:35:07] [INFO ] Deduced a trap composed of 53 places in 467 ms of which 1 ms to minimize.
[2023-03-20 01:35:07] [INFO ] Deduced a trap composed of 46 places in 458 ms of which 1 ms to minimize.
[2023-03-20 01:35:08] [INFO ] Deduced a trap composed of 65 places in 580 ms of which 1 ms to minimize.
[2023-03-20 01:35:08] [INFO ] Deduced a trap composed of 51 places in 346 ms of which 0 ms to minimize.
[2023-03-20 01:35:09] [INFO ] Deduced a trap composed of 47 places in 222 ms of which 1 ms to minimize.
[2023-03-20 01:35:09] [INFO ] Deduced a trap composed of 78 places in 249 ms of which 0 ms to minimize.
[2023-03-20 01:35:10] [INFO ] Deduced a trap composed of 70 places in 421 ms of which 1 ms to minimize.
[2023-03-20 01:35:10] [INFO ] Deduced a trap composed of 58 places in 375 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 01:35:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 01:35:10] [INFO ] After 25116ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 64 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 243 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 243 ms. Remains : 933/1833 places, 783/1683 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :1
Finished Best-First random walk after 732 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=183 )
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 686 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 476 ms :[(NOT p1), p2, (OR (NOT p1) p2), p2, p2, true, p2]
Stuttering acceptance computed with spot in 243 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 107 ms. Remains 1833 /1833 variables (removed 0) and now considering 1683/1683 (removed 0) transitions.
[2023-03-20 01:35:12] [INFO ] Invariant cache hit.
[2023-03-20 01:35:13] [INFO ] Implicit Places using invariants in 705 ms returned []
[2023-03-20 01:35:13] [INFO ] Invariant cache hit.
[2023-03-20 01:35:15] [INFO ] Implicit Places using invariants and state equation in 1742 ms returned []
Implicit Place search using SMT with State Equation took 2472 ms to find 0 implicit places.
[2023-03-20 01:35:15] [INFO ] Invariant cache hit.
[2023-03-20 01:35:15] [INFO ] Dead Transitions using invariants and state equation in 918 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3498 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 80 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 375 ms :[(NOT p1), p2, (OR (NOT p1) p2), p2, p2, true, p2]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 4) seen :2
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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-20 01:35:16] [INFO ] Invariant cache hit.
[2023-03-20 01:35:17] [INFO ] [Real]Absence check using 331 positive place invariants in 89 ms returned sat
[2023-03-20 01:35:18] [INFO ] After 987ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-20 01:35:18] [INFO ] Deduced a trap composed of 24 places in 433 ms of which 1 ms to minimize.
[2023-03-20 01:35:19] [INFO ] Deduced a trap composed of 20 places in 414 ms of which 1 ms to minimize.
[2023-03-20 01:35:19] [INFO ] Deduced a trap composed of 33 places in 432 ms of which 1 ms to minimize.
[2023-03-20 01:35:20] [INFO ] Deduced a trap composed of 21 places in 371 ms of which 1 ms to minimize.
[2023-03-20 01:35:20] [INFO ] Deduced a trap composed of 32 places in 558 ms of which 1 ms to minimize.
[2023-03-20 01:35:21] [INFO ] Deduced a trap composed of 26 places in 442 ms of which 1 ms to minimize.
[2023-03-20 01:35:21] [INFO ] Deduced a trap composed of 35 places in 408 ms of which 1 ms to minimize.
[2023-03-20 01:35:22] [INFO ] Deduced a trap composed of 28 places in 426 ms of which 1 ms to minimize.
[2023-03-20 01:35:22] [INFO ] Deduced a trap composed of 35 places in 382 ms of which 1 ms to minimize.
[2023-03-20 01:35:22] [INFO ] Deduced a trap composed of 36 places in 324 ms of which 1 ms to minimize.
[2023-03-20 01:35:23] [INFO ] Deduced a trap composed of 16 places in 374 ms of which 1 ms to minimize.
[2023-03-20 01:35:23] [INFO ] Deduced a trap composed of 27 places in 366 ms of which 1 ms to minimize.
[2023-03-20 01:35:24] [INFO ] Deduced a trap composed of 23 places in 400 ms of which 1 ms to minimize.
[2023-03-20 01:35:24] [INFO ] Deduced a trap composed of 24 places in 442 ms of which 8 ms to minimize.
[2023-03-20 01:35:25] [INFO ] Deduced a trap composed of 18 places in 426 ms of which 1 ms to minimize.
[2023-03-20 01:35:25] [INFO ] Deduced a trap composed of 41 places in 311 ms of which 0 ms to minimize.
[2023-03-20 01:35:26] [INFO ] Deduced a trap composed of 27 places in 361 ms of which 1 ms to minimize.
[2023-03-20 01:35:26] [INFO ] Deduced a trap composed of 30 places in 280 ms of which 1 ms to minimize.
[2023-03-20 01:35:26] [INFO ] Deduced a trap composed of 33 places in 301 ms of which 1 ms to minimize.
[2023-03-20 01:35:27] [INFO ] Deduced a trap composed of 33 places in 349 ms of which 15 ms to minimize.
[2023-03-20 01:35:27] [INFO ] Deduced a trap composed of 36 places in 372 ms of which 2 ms to minimize.
[2023-03-20 01:35:28] [INFO ] Deduced a trap composed of 27 places in 366 ms of which 1 ms to minimize.
[2023-03-20 01:35:28] [INFO ] Deduced a trap composed of 26 places in 273 ms of which 1 ms to minimize.
[2023-03-20 01:35:28] [INFO ] Deduced a trap composed of 30 places in 319 ms of which 1 ms to minimize.
[2023-03-20 01:35:29] [INFO ] Deduced a trap composed of 33 places in 316 ms of which 1 ms to minimize.
[2023-03-20 01:35:29] [INFO ] Deduced a trap composed of 37 places in 304 ms of which 1 ms to minimize.
[2023-03-20 01:35:30] [INFO ] Deduced a trap composed of 38 places in 260 ms of which 0 ms to minimize.
[2023-03-20 01:35:30] [INFO ] Deduced a trap composed of 30 places in 273 ms of which 0 ms to minimize.
[2023-03-20 01:35:30] [INFO ] Deduced a trap composed of 38 places in 294 ms of which 1 ms to minimize.
[2023-03-20 01:35:31] [INFO ] Deduced a trap composed of 19 places in 273 ms of which 1 ms to minimize.
[2023-03-20 01:35:31] [INFO ] Deduced a trap composed of 32 places in 348 ms of which 1 ms to minimize.
[2023-03-20 01:35:31] [INFO ] Deduced a trap composed of 21 places in 360 ms of which 1 ms to minimize.
[2023-03-20 01:35:32] [INFO ] Deduced a trap composed of 43 places in 296 ms of which 1 ms to minimize.
[2023-03-20 01:35:32] [INFO ] Deduced a trap composed of 43 places in 313 ms of which 1 ms to minimize.
[2023-03-20 01:35:33] [INFO ] Deduced a trap composed of 41 places in 227 ms of which 0 ms to minimize.
[2023-03-20 01:35:33] [INFO ] Deduced a trap composed of 36 places in 187 ms of which 0 ms to minimize.
[2023-03-20 01:35:33] [INFO ] Deduced a trap composed of 42 places in 404 ms of which 0 ms to minimize.
[2023-03-20 01:35:34] [INFO ] Deduced a trap composed of 38 places in 347 ms of which 1 ms to minimize.
[2023-03-20 01:35:34] [INFO ] Deduced a trap composed of 65 places in 281 ms of which 0 ms to minimize.
[2023-03-20 01:35:34] [INFO ] Deduced a trap composed of 50 places in 249 ms of which 0 ms to minimize.
[2023-03-20 01:35:35] [INFO ] Deduced a trap composed of 52 places in 178 ms of which 0 ms to minimize.
[2023-03-20 01:35:35] [INFO ] Deduced a trap composed of 52 places in 549 ms of which 1 ms to minimize.
[2023-03-20 01:35:35] [INFO ] Trap strengthening (SAT) tested/added 43/42 trap constraints in 17737 ms
[2023-03-20 01:35:35] [INFO ] After 18821ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 01:35:35] [INFO ] After 19220ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 01:35:36] [INFO ] [Nat]Absence check using 331 positive place invariants in 374 ms returned sat
[2023-03-20 01:35:37] [INFO ] After 1020ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 01:35:38] [INFO ] Deduced a trap composed of 24 places in 537 ms of which 1 ms to minimize.
[2023-03-20 01:35:38] [INFO ] Deduced a trap composed of 20 places in 371 ms of which 1 ms to minimize.
[2023-03-20 01:35:39] [INFO ] Deduced a trap composed of 33 places in 376 ms of which 1 ms to minimize.
[2023-03-20 01:35:39] [INFO ] Deduced a trap composed of 21 places in 350 ms of which 1 ms to minimize.
[2023-03-20 01:35:39] [INFO ] Deduced a trap composed of 32 places in 351 ms of which 1 ms to minimize.
[2023-03-20 01:35:40] [INFO ] Deduced a trap composed of 16 places in 374 ms of which 0 ms to minimize.
[2023-03-20 01:35:40] [INFO ] Deduced a trap composed of 30 places in 327 ms of which 1 ms to minimize.
[2023-03-20 01:35:41] [INFO ] Deduced a trap composed of 23 places in 425 ms of which 1 ms to minimize.
[2023-03-20 01:35:41] [INFO ] Deduced a trap composed of 33 places in 365 ms of which 1 ms to minimize.
[2023-03-20 01:35:42] [INFO ] Deduced a trap composed of 16 places in 404 ms of which 1 ms to minimize.
[2023-03-20 01:35:42] [INFO ] Deduced a trap composed of 30 places in 415 ms of which 1 ms to minimize.
[2023-03-20 01:35:43] [INFO ] Deduced a trap composed of 16 places in 367 ms of which 1 ms to minimize.
[2023-03-20 01:35:43] [INFO ] Deduced a trap composed of 35 places in 376 ms of which 1 ms to minimize.
[2023-03-20 01:35:43] [INFO ] Deduced a trap composed of 30 places in 321 ms of which 1 ms to minimize.
[2023-03-20 01:35:44] [INFO ] Deduced a trap composed of 19 places in 307 ms of which 1 ms to minimize.
[2023-03-20 01:35:44] [INFO ] Deduced a trap composed of 37 places in 349 ms of which 1 ms to minimize.
[2023-03-20 01:35:45] [INFO ] Deduced a trap composed of 40 places in 332 ms of which 1 ms to minimize.
[2023-03-20 01:35:45] [INFO ] Deduced a trap composed of 29 places in 330 ms of which 0 ms to minimize.
[2023-03-20 01:35:45] [INFO ] Deduced a trap composed of 27 places in 278 ms of which 6 ms to minimize.
[2023-03-20 01:35:46] [INFO ] Deduced a trap composed of 28 places in 327 ms of which 1 ms to minimize.
[2023-03-20 01:35:46] [INFO ] Deduced a trap composed of 31 places in 254 ms of which 1 ms to minimize.
[2023-03-20 01:35:46] [INFO ] Deduced a trap composed of 26 places in 380 ms of which 1 ms to minimize.
[2023-03-20 01:35:47] [INFO ] Deduced a trap composed of 27 places in 329 ms of which 1 ms to minimize.
[2023-03-20 01:35:47] [INFO ] Deduced a trap composed of 35 places in 279 ms of which 0 ms to minimize.
[2023-03-20 01:35:47] [INFO ] Deduced a trap composed of 37 places in 268 ms of which 1 ms to minimize.
[2023-03-20 01:35:48] [INFO ] Deduced a trap composed of 24 places in 276 ms of which 1 ms to minimize.
[2023-03-20 01:35:48] [INFO ] Deduced a trap composed of 38 places in 316 ms of which 1 ms to minimize.
[2023-03-20 01:35:48] [INFO ] Deduced a trap composed of 38 places in 276 ms of which 1 ms to minimize.
[2023-03-20 01:35:49] [INFO ] Deduced a trap composed of 32 places in 295 ms of which 1 ms to minimize.
[2023-03-20 01:35:49] [INFO ] Deduced a trap composed of 36 places in 272 ms of which 1 ms to minimize.
[2023-03-20 01:35:49] [INFO ] Deduced a trap composed of 47 places in 245 ms of which 0 ms to minimize.
[2023-03-20 01:35:50] [INFO ] Deduced a trap composed of 47 places in 279 ms of which 0 ms to minimize.
[2023-03-20 01:35:50] [INFO ] Deduced a trap composed of 26 places in 257 ms of which 1 ms to minimize.
[2023-03-20 01:35:50] [INFO ] Deduced a trap composed of 38 places in 250 ms of which 0 ms to minimize.
[2023-03-20 01:35:51] [INFO ] Deduced a trap composed of 46 places in 268 ms of which 1 ms to minimize.
[2023-03-20 01:35:51] [INFO ] Deduced a trap composed of 36 places in 277 ms of which 1 ms to minimize.
[2023-03-20 01:35:51] [INFO ] Deduced a trap composed of 29 places in 243 ms of which 0 ms to minimize.
[2023-03-20 01:35:52] [INFO ] Deduced a trap composed of 21 places in 250 ms of which 1 ms to minimize.
[2023-03-20 01:35:52] [INFO ] Deduced a trap composed of 40 places in 299 ms of which 0 ms to minimize.
[2023-03-20 01:35:52] [INFO ] Deduced a trap composed of 26 places in 229 ms of which 0 ms to minimize.
[2023-03-20 01:35:53] [INFO ] Deduced a trap composed of 42 places in 220 ms of which 1 ms to minimize.
[2023-03-20 01:35:53] [INFO ] Deduced a trap composed of 46 places in 315 ms of which 0 ms to minimize.
[2023-03-20 01:35:53] [INFO ] Deduced a trap composed of 38 places in 266 ms of which 0 ms to minimize.
[2023-03-20 01:35:54] [INFO ] Deduced a trap composed of 54 places in 201 ms of which 0 ms to minimize.
[2023-03-20 01:35:54] [INFO ] Deduced a trap composed of 65 places in 229 ms of which 0 ms to minimize.
[2023-03-20 01:35:54] [INFO ] Deduced a trap composed of 39 places in 419 ms of which 1 ms to minimize.
[2023-03-20 01:35:55] [INFO ] Deduced a trap composed of 46 places in 200 ms of which 0 ms to minimize.
[2023-03-20 01:35:55] [INFO ] Deduced a trap composed of 38 places in 239 ms of which 1 ms to minimize.
[2023-03-20 01:35:55] [INFO ] Deduced a trap composed of 52 places in 172 ms of which 0 ms to minimize.
[2023-03-20 01:35:55] [INFO ] Deduced a trap composed of 56 places in 248 ms of which 0 ms to minimize.
[2023-03-20 01:35:56] [INFO ] Deduced a trap composed of 56 places in 279 ms of which 1 ms to minimize.
[2023-03-20 01:35:56] [INFO ] Deduced a trap composed of 48 places in 179 ms of which 0 ms to minimize.
[2023-03-20 01:35:56] [INFO ] Deduced a trap composed of 46 places in 171 ms of which 1 ms to minimize.
[2023-03-20 01:35:57] [INFO ] Deduced a trap composed of 36 places in 162 ms of which 0 ms to minimize.
[2023-03-20 01:35:57] [INFO ] Deduced a trap composed of 42 places in 164 ms of which 1 ms to minimize.
[2023-03-20 01:35:57] [INFO ] Trap strengthening (SAT) tested/added 56/55 trap constraints in 19672 ms
[2023-03-20 01:35:57] [INFO ] Deduced a trap composed of 27 places in 206 ms of which 1 ms to minimize.
[2023-03-20 01:35:58] [INFO ] Deduced a trap composed of 21 places in 207 ms of which 1 ms to minimize.
[2023-03-20 01:35:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 648 ms
[2023-03-20 01:35:58] [INFO ] After 21506ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 237 ms.
[2023-03-20 01:35:58] [INFO ] After 22527ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 109 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 252 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 252 ms. Remains : 933/1833 places, 783/1683 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 2) seen :0
Finished probabilistic random walk after 35617 steps, run visited all 2 properties in 406 ms. (steps per millisecond=87 )
Probabilistic random walk after 35617 steps, saw 32601 distinct states, run finished after 407 ms. (steps per millisecond=87 ) properties seen :2
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 304 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 408 ms :[(NOT p1), p2, (OR (NOT p1) p2), p2, p2, true, p2]
Stuttering acceptance computed with spot in 439 ms :[(NOT p1), p2, (OR (NOT p1) p2), p2, p2, true, p2]
Stuttering acceptance computed with spot in 359 ms :[(NOT p1), p2, (OR (NOT p1) p2), p2, p2, true, p2]
Product exploration explored 100000 steps with 25000 reset in 589 ms.
Product exploration explored 100000 steps with 25000 reset in 605 ms.
Applying partial POR strategy [true, true, true, false, false, true, false]
Stuttering acceptance computed with spot in 257 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 15 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 1 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 633 ms. Remains 1622 /1833 variables (removed 211) and now considering 1473/1683 (removed 210) transitions.
[2023-03-20 01:36:03] [INFO ] Redundant transitions in 35 ms returned []
// Phase 1: matrix 1473 rows 1622 cols
[2023-03-20 01:36:03] [INFO ] Computed 331 place invariants in 13 ms
[2023-03-20 01:36:04] [INFO ] Dead Transitions using invariants and state equation in 999 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 1680 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 100 ms. Remains 1833 /1833 variables (removed 0) and now considering 1683/1683 (removed 0) transitions.
// Phase 1: matrix 1683 rows 1833 cols
[2023-03-20 01:36:04] [INFO ] Computed 331 place invariants in 16 ms
[2023-03-20 01:36:05] [INFO ] Implicit Places using invariants in 722 ms returned []
[2023-03-20 01:36:05] [INFO ] Invariant cache hit.
[2023-03-20 01:36:08] [INFO ] Implicit Places using invariants and state equation in 3452 ms returned []
Implicit Place search using SMT with State Equation took 4188 ms to find 0 implicit places.
[2023-03-20 01:36:08] [INFO ] Invariant cache hit.
[2023-03-20 01:36:10] [INFO ] Dead Transitions using invariants and state equation in 1474 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5776 ms. Remains : 1833/1833 places, 1683/1683 transitions.
Treatment of property ShieldPPPs-PT-030B-LTLFireability-03 finished in 109476 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 177 ms. Remains 1832 /1841 variables (removed 9) and now considering 1682/1691 (removed 9) transitions.
// Phase 1: matrix 1682 rows 1832 cols
[2023-03-20 01:36:10] [INFO ] Computed 331 place invariants in 5 ms
[2023-03-20 01:36:11] [INFO ] Implicit Places using invariants in 787 ms returned []
[2023-03-20 01:36:11] [INFO ] Invariant cache hit.
[2023-03-20 01:36:14] [INFO ] Implicit Places using invariants and state equation in 2859 ms returned []
Implicit Place search using SMT with State Equation took 3668 ms to find 0 implicit places.
[2023-03-20 01:36:14] [INFO ] Invariant cache hit.
[2023-03-20 01:36:15] [INFO ] Dead Transitions using invariants and state equation in 1081 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 4940 ms. Remains : 1832/1841 places, 1682/1691 transitions.
Stuttering acceptance computed with spot in 112 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 4317 steps with 0 reset in 46 ms.
FORMULA ShieldPPPs-PT-030B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-030B-LTLFireability-04 finished in 5141 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 3 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 2 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 1 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 367 ms. Remains 934 /1841 variables (removed 907) and now considering 784/1691 (removed 907) transitions.
// Phase 1: matrix 784 rows 934 cols
[2023-03-20 01:36:15] [INFO ] Computed 331 place invariants in 1 ms
[2023-03-20 01:36:16] [INFO ] Implicit Places using invariants in 431 ms returned []
[2023-03-20 01:36:16] [INFO ] Invariant cache hit.
[2023-03-20 01:36:17] [INFO ] Implicit Places using invariants and state equation in 1022 ms returned []
Implicit Place search using SMT with State Equation took 1469 ms to find 0 implicit places.
[2023-03-20 01:36:17] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-20 01:36:17] [INFO ] Invariant cache hit.
[2023-03-20 01:36:17] [INFO ] Dead Transitions using invariants and state equation in 440 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 2303 ms. Remains : 934/1841 places, 784/1691 transitions.
Stuttering acceptance computed with spot in 49 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 54 reset in 665 ms.
Product exploration explored 100000 steps with 55 reset in 877 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/934 stabilizing places and 2/784 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 4 factoid took 346 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1814 steps, including 0 resets, run visited all 1 properties in 34 ms. (steps per millisecond=53 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p0)]
Knowledge based reduction with 4 factoid took 432 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2023-03-20 01:36:20] [INFO ] Invariant cache hit.
[2023-03-20 01:36:21] [INFO ] [Real]Absence check using 331 positive place invariants in 211 ms returned sat
[2023-03-20 01:36:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 01:36:23] [INFO ] [Real]Absence check using state equation in 1741 ms returned sat
[2023-03-20 01:36:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 01:36:23] [INFO ] [Nat]Absence check using 331 positive place invariants in 182 ms returned sat
[2023-03-20 01:36:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 01:36:25] [INFO ] [Nat]Absence check using state equation in 1643 ms returned sat
[2023-03-20 01:36:25] [INFO ] Computed and/alt/rep : 780/1501/780 causal constraints (skipped 0 transitions) in 37 ms.
[2023-03-20 01:36:38] [INFO ] Added : 565 causal constraints over 113 iterations in 12599 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 2 out of 934 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 934/934 places, 784/784 transitions.
Applied a total of 0 rules in 55 ms. Remains 934 /934 variables (removed 0) and now considering 784/784 (removed 0) transitions.
[2023-03-20 01:36:38] [INFO ] Invariant cache hit.
[2023-03-20 01:36:38] [INFO ] Implicit Places using invariants in 508 ms returned []
[2023-03-20 01:36:38] [INFO ] Invariant cache hit.
[2023-03-20 01:36:39] [INFO ] Implicit Places using invariants and state equation in 1229 ms returned []
Implicit Place search using SMT with State Equation took 1739 ms to find 0 implicit places.
[2023-03-20 01:36:39] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-20 01:36:39] [INFO ] Invariant cache hit.
[2023-03-20 01:36:40] [INFO ] Dead Transitions using invariants and state equation in 487 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2312 ms. Remains : 934/934 places, 784/784 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 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 1912 steps, including 0 resets, run visited all 1 properties in 36 ms. (steps per millisecond=53 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 181 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 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0)]
[2023-03-20 01:36:40] [INFO ] Invariant cache hit.
[2023-03-20 01:36:41] [INFO ] [Real]Absence check using 331 positive place invariants in 155 ms returned sat
[2023-03-20 01:36:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 01:36:43] [INFO ] [Real]Absence check using state equation in 1659 ms returned sat
[2023-03-20 01:36:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 01:36:44] [INFO ] [Nat]Absence check using 331 positive place invariants in 152 ms returned sat
[2023-03-20 01:36:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 01:36:45] [INFO ] [Nat]Absence check using state equation in 1725 ms returned sat
[2023-03-20 01:36:45] [INFO ] Computed and/alt/rep : 780/1501/780 causal constraints (skipped 0 transitions) in 60 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-20 01:36:58] [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 59 ms :[(NOT p0)]
Product exploration explored 100000 steps with 55 reset in 788 ms.
Product exploration explored 100000 steps with 54 reset in 873 ms.
Support contains 2 out of 934 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 934/934 places, 784/784 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 932 transition count 782
Applied a total of 1 rules in 50 ms. Remains 932 /934 variables (removed 2) and now considering 782/784 (removed 2) transitions.
// Phase 1: matrix 782 rows 932 cols
[2023-03-20 01:37:00] [INFO ] Computed 331 place invariants in 4 ms
[2023-03-20 01:37:00] [INFO ] Implicit Places using invariants in 542 ms returned []
[2023-03-20 01:37:00] [INFO ] Invariant cache hit.
[2023-03-20 01:37:01] [INFO ] Implicit Places using invariants and state equation in 1184 ms returned []
Implicit Place search using SMT with State Equation took 1729 ms to find 0 implicit places.
[2023-03-20 01:37:02] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-20 01:37:02] [INFO ] Invariant cache hit.
[2023-03-20 01:37:02] [INFO ] Dead Transitions using invariants and state equation in 454 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 932/934 places, 782/784 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2249 ms. Remains : 932/934 places, 782/784 transitions.
Treatment of property ShieldPPPs-PT-030B-LTLFireability-05 finished in 47111 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 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 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 304 ms. Remains 933 /1841 variables (removed 908) and now considering 783/1691 (removed 908) transitions.
// Phase 1: matrix 783 rows 933 cols
[2023-03-20 01:37:02] [INFO ] Computed 331 place invariants in 1 ms
[2023-03-20 01:37:03] [INFO ] Implicit Places using invariants in 502 ms returned []
[2023-03-20 01:37:03] [INFO ] Invariant cache hit.
[2023-03-20 01:37:04] [INFO ] Implicit Places using invariants and state equation in 1016 ms returned []
Implicit Place search using SMT with State Equation took 1533 ms to find 0 implicit places.
[2023-03-20 01:37:04] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-20 01:37:04] [INFO ] Invariant cache hit.
[2023-03-20 01:37:04] [INFO ] Dead Transitions using invariants and state equation in 420 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 2290 ms. Remains : 933/1841 places, 783/1691 transitions.
Stuttering acceptance computed with spot in 233 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 1978 steps with 0 reset in 37 ms.
FORMULA ShieldPPPs-PT-030B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-030B-LTLFireability-10 finished in 2582 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 173 ms. Remains 1832 /1841 variables (removed 9) and now considering 1682/1691 (removed 9) transitions.
// Phase 1: matrix 1682 rows 1832 cols
[2023-03-20 01:37:05] [INFO ] Computed 331 place invariants in 13 ms
[2023-03-20 01:37:05] [INFO ] Implicit Places using invariants in 703 ms returned []
[2023-03-20 01:37:05] [INFO ] Invariant cache hit.
[2023-03-20 01:37:07] [INFO ] Implicit Places using invariants and state equation in 1897 ms returned []
Implicit Place search using SMT with State Equation took 2602 ms to find 0 implicit places.
[2023-03-20 01:37:07] [INFO ] Invariant cache hit.
[2023-03-20 01:37:08] [INFO ] Dead Transitions using invariants and state equation in 910 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 3687 ms. Remains : 1832/1841 places, 1682/1691 transitions.
Stuttering acceptance computed with spot in 191 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 7393 steps with 3 reset in 73 ms.
FORMULA ShieldPPPs-PT-030B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-030B-LTLFireability-11 finished in 3976 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 315 ms. Remains 932 /1841 variables (removed 909) and now considering 782/1691 (removed 909) transitions.
// Phase 1: matrix 782 rows 932 cols
[2023-03-20 01:37:09] [INFO ] Computed 331 place invariants in 4 ms
[2023-03-20 01:37:09] [INFO ] Implicit Places using invariants in 482 ms returned []
[2023-03-20 01:37:09] [INFO ] Invariant cache hit.
[2023-03-20 01:37:10] [INFO ] Implicit Places using invariants and state equation in 1059 ms returned []
Implicit Place search using SMT with State Equation took 1560 ms to find 0 implicit places.
[2023-03-20 01:37:10] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-20 01:37:10] [INFO ] Invariant cache hit.
[2023-03-20 01:37:11] [INFO ] Dead Transitions using invariants and state equation in 540 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 2451 ms. Remains : 932/1841 places, 782/1691 transitions.
Stuttering acceptance computed with spot in 86 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 738 ms.
Product exploration explored 100000 steps with 73 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 98 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 86 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1455 steps, including 0 resets, run visited all 1 properties in 28 ms. (steps per millisecond=51 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 188 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 90 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0)]
[2023-03-20 01:37:13] [INFO ] Invariant cache hit.
[2023-03-20 01:37:14] [INFO ] [Real]Absence check using 331 positive place invariants in 156 ms returned sat
[2023-03-20 01:37:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 01:37:16] [INFO ] [Real]Absence check using state equation in 1643 ms returned sat
[2023-03-20 01:37:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 01:37:16] [INFO ] [Nat]Absence check using 331 positive place invariants in 158 ms returned sat
[2023-03-20 01:37:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 01:37:18] [INFO ] [Nat]Absence check using state equation in 1458 ms returned sat
[2023-03-20 01:37:18] [INFO ] Computed and/alt/rep : 779/1502/779 causal constraints (skipped 0 transitions) in 64 ms.
[2023-03-20 01:37:31] [INFO ] Added : 570 causal constraints over 114 iterations in 12827 ms. Result :unknown
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 53 ms. Remains 932 /932 variables (removed 0) and now considering 782/782 (removed 0) transitions.
[2023-03-20 01:37:31] [INFO ] Invariant cache hit.
[2023-03-20 01:37:31] [INFO ] Implicit Places using invariants in 434 ms returned []
[2023-03-20 01:37:31] [INFO ] Invariant cache hit.
[2023-03-20 01:37:32] [INFO ] Implicit Places using invariants and state equation in 942 ms returned []
Implicit Place search using SMT with State Equation took 1391 ms to find 0 implicit places.
[2023-03-20 01:37:32] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-20 01:37:32] [INFO ] Invariant cache hit.
[2023-03-20 01:37:33] [INFO ] Dead Transitions using invariants and state equation in 432 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1911 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 184 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 51 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1321 steps, including 0 resets, run visited all 1 properties in 19 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 209 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 220 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
[2023-03-20 01:37:34] [INFO ] Invariant cache hit.
[2023-03-20 01:37:34] [INFO ] [Real]Absence check using 331 positive place invariants in 158 ms returned sat
[2023-03-20 01:37:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 01:37:36] [INFO ] [Real]Absence check using state equation in 1757 ms returned sat
[2023-03-20 01:37:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 01:37:37] [INFO ] [Nat]Absence check using 331 positive place invariants in 172 ms returned sat
[2023-03-20 01:37:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 01:37:39] [INFO ] [Nat]Absence check using state equation in 1723 ms returned sat
[2023-03-20 01:37:39] [INFO ] Computed and/alt/rep : 779/1502/779 causal constraints (skipped 0 transitions) in 124 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
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-20 01:37:51] [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: Broken pipe ... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 72 reset in 697 ms.
Product exploration explored 100000 steps with 73 reset in 923 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 22 ms. Remains 932 /932 variables (removed 0) and now considering 782/782 (removed 0) transitions.
[2023-03-20 01:37:53] [INFO ] Invariant cache hit.
[2023-03-20 01:37:53] [INFO ] Implicit Places using invariants in 597 ms returned []
[2023-03-20 01:37:53] [INFO ] Invariant cache hit.
[2023-03-20 01:37:55] [INFO ] Implicit Places using invariants and state equation in 1148 ms returned []
Implicit Place search using SMT with State Equation took 1765 ms to find 0 implicit places.
[2023-03-20 01:37:55] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-20 01:37:55] [INFO ] Invariant cache hit.
[2023-03-20 01:37:55] [INFO ] Dead Transitions using invariants and state equation in 357 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2156 ms. Remains : 932/932 places, 782/782 transitions.
Treatment of property ShieldPPPs-PT-030B-LTLFireability-12 finished in 46400 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 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 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 1 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 302 ms. Remains 931 /1841 variables (removed 910) and now considering 781/1691 (removed 910) transitions.
// Phase 1: matrix 781 rows 931 cols
[2023-03-20 01:37:55] [INFO ] Computed 331 place invariants in 2 ms
[2023-03-20 01:37:56] [INFO ] Implicit Places using invariants in 452 ms returned []
[2023-03-20 01:37:56] [INFO ] Invariant cache hit.
[2023-03-20 01:37:57] [INFO ] Implicit Places using invariants and state equation in 1115 ms returned []
Implicit Place search using SMT with State Equation took 1597 ms to find 0 implicit places.
[2023-03-20 01:37:57] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-20 01:37:57] [INFO ] Invariant cache hit.
[2023-03-20 01:37:57] [INFO ] Dead Transitions using invariants and state equation in 364 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 2301 ms. Remains : 931/1841 places, 781/1691 transitions.
Stuttering acceptance computed with spot in 46 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 108 reset in 602 ms.
Product exploration explored 100000 steps with 107 reset in 765 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 118 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 941 steps, including 0 resets, run visited all 1 properties in 10 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 220 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
[2023-03-20 01:37:59] [INFO ] Invariant cache hit.
[2023-03-20 01:38:01] [INFO ] [Real]Absence check using 331 positive place invariants in 171 ms returned sat
[2023-03-20 01:38:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 01:38:03] [INFO ] [Real]Absence check using state equation in 1764 ms returned sat
[2023-03-20 01:38:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 01:38:03] [INFO ] [Nat]Absence check using 331 positive place invariants in 149 ms returned sat
[2023-03-20 01:38:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 01:38:05] [INFO ] [Nat]Absence check using state equation in 1947 ms returned sat
[2023-03-20 01:38:05] [INFO ] Computed and/alt/rep : 779/1494/779 causal constraints (skipped 0 transitions) in 54 ms.
[2023-03-20 01:38:18] [INFO ] Deduced a trap composed of 2 places in 337 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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 01:38:18] [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 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 21 ms. Remains 931 /931 variables (removed 0) and now considering 781/781 (removed 0) transitions.
[2023-03-20 01:38:18] [INFO ] Invariant cache hit.
[2023-03-20 01:38:18] [INFO ] Implicit Places using invariants in 484 ms returned []
[2023-03-20 01:38:18] [INFO ] Invariant cache hit.
[2023-03-20 01:38:20] [INFO ] Implicit Places using invariants and state equation in 1182 ms returned []
Implicit Place search using SMT with State Equation took 1667 ms to find 0 implicit places.
[2023-03-20 01:38:20] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-20 01:38:20] [INFO ] Invariant cache hit.
[2023-03-20 01:38:20] [INFO ] Dead Transitions using invariants and state equation in 485 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2197 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 207 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 70 ms :[(NOT p0)]
Finished random walk after 904 steps, including 0 resets, run visited all 1 properties in 16 ms. (steps per millisecond=56 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 177 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
[2023-03-20 01:38:21] [INFO ] Invariant cache hit.
[2023-03-20 01:38:21] [INFO ] [Real]Absence check using 331 positive place invariants in 158 ms returned sat
[2023-03-20 01:38:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 01:38:23] [INFO ] [Real]Absence check using state equation in 1688 ms returned sat
[2023-03-20 01:38:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 01:38:24] [INFO ] [Nat]Absence check using 331 positive place invariants in 161 ms returned sat
[2023-03-20 01:38:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 01:38:26] [INFO ] [Nat]Absence check using state equation in 1952 ms returned sat
[2023-03-20 01:38:26] [INFO ] Computed and/alt/rep : 779/1494/779 causal constraints (skipped 0 transitions) in 67 ms.
[2023-03-20 01:38:39] [INFO ] Deduced a trap composed of 2 places in 440 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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java: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-20 01:38:39] [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 49 ms :[(NOT p0)]
Product exploration explored 100000 steps with 108 reset in 679 ms.
Product exploration explored 100000 steps with 109 reset in 832 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 22 ms. Remains 931 /931 variables (removed 0) and now considering 781/781 (removed 0) transitions.
[2023-03-20 01:38:40] [INFO ] Invariant cache hit.
[2023-03-20 01:38:41] [INFO ] Implicit Places using invariants in 453 ms returned []
[2023-03-20 01:38:41] [INFO ] Invariant cache hit.
[2023-03-20 01:38:42] [INFO ] Implicit Places using invariants and state equation in 925 ms returned []
Implicit Place search using SMT with State Equation took 1392 ms to find 0 implicit places.
[2023-03-20 01:38:42] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-20 01:38:42] [INFO ] Invariant cache hit.
[2023-03-20 01:38:42] [INFO ] Dead Transitions using invariants and state equation in 438 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1876 ms. Remains : 931/931 places, 781/781 transitions.
Treatment of property ShieldPPPs-PT-030B-LTLFireability-13 finished in 47127 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 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 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 2 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 293 ms. Remains 932 /1841 variables (removed 909) and now considering 782/1691 (removed 909) transitions.
// Phase 1: matrix 782 rows 932 cols
[2023-03-20 01:38:42] [INFO ] Computed 331 place invariants in 1 ms
[2023-03-20 01:38:43] [INFO ] Implicit Places using invariants in 441 ms returned []
[2023-03-20 01:38:43] [INFO ] Invariant cache hit.
[2023-03-20 01:38:44] [INFO ] Implicit Places using invariants and state equation in 829 ms returned []
Implicit Place search using SMT with State Equation took 1298 ms to find 0 implicit places.
[2023-03-20 01:38:44] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-20 01:38:44] [INFO ] Invariant cache hit.
[2023-03-20 01:38:44] [INFO ] Dead Transitions using invariants and state equation in 449 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 2065 ms. Remains : 932/1841 places, 782/1691 transitions.
Stuttering acceptance computed with spot in 122 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 3182 steps with 2 reset in 21 ms.
FORMULA ShieldPPPs-PT-030B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-030B-LTLFireability-14 finished in 2224 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 1 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 266 ms. Remains 931 /1841 variables (removed 910) and now considering 781/1691 (removed 910) transitions.
// Phase 1: matrix 781 rows 931 cols
[2023-03-20 01:38:45] [INFO ] Computed 331 place invariants in 16 ms
[2023-03-20 01:38:45] [INFO ] Implicit Places using invariants in 563 ms returned []
[2023-03-20 01:38:45] [INFO ] Invariant cache hit.
[2023-03-20 01:38:46] [INFO ] Implicit Places using invariants and state equation in 962 ms returned []
Implicit Place search using SMT with State Equation took 1528 ms to find 0 implicit places.
[2023-03-20 01:38:46] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-20 01:38:46] [INFO ] Invariant cache hit.
[2023-03-20 01:38:47] [INFO ] Dead Transitions using invariants and state equation in 513 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 2333 ms. Remains : 931/1841 places, 781/1691 transitions.
Stuttering acceptance computed with spot in 46 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 450 reset in 569 ms.
Product exploration explored 100000 steps with 444 reset in 700 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 219 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 256 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=51 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 196 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 78 ms :[(NOT p0)]
[2023-03-20 01:38:49] [INFO ] Invariant cache hit.
[2023-03-20 01:38:49] [INFO ] [Real]Absence check using 331 positive place invariants in 161 ms returned sat
[2023-03-20 01:38:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 01:38:51] [INFO ] [Real]Absence check using state equation in 1824 ms returned sat
[2023-03-20 01:38:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 01:38:52] [INFO ] [Nat]Absence check using 331 positive place invariants in 156 ms returned sat
[2023-03-20 01:38:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 01:38:54] [INFO ] [Nat]Absence check using state equation in 1669 ms returned sat
[2023-03-20 01:38:54] [INFO ] Computed and/alt/rep : 778/1497/778 causal constraints (skipped 0 transitions) in 55 ms.
[2023-03-20 01:39:06] [INFO ] Added : 585 causal constraints over 117 iterations in 12617 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 50 ms. Remains 931 /931 variables (removed 0) and now considering 781/781 (removed 0) transitions.
[2023-03-20 01:39:06] [INFO ] Invariant cache hit.
[2023-03-20 01:39:07] [INFO ] Implicit Places using invariants in 509 ms returned []
[2023-03-20 01:39:07] [INFO ] Invariant cache hit.
[2023-03-20 01:39:08] [INFO ] Implicit Places using invariants and state equation in 1185 ms returned []
Implicit Place search using SMT with State Equation took 1697 ms to find 0 implicit places.
[2023-03-20 01:39:08] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-20 01:39:08] [INFO ] Invariant cache hit.
[2023-03-20 01:39:08] [INFO ] Dead Transitions using invariants and state equation in 473 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2245 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 93 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 138 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=46 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 171 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 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0)]
[2023-03-20 01:39:09] [INFO ] Invariant cache hit.
[2023-03-20 01:39:10] [INFO ] [Real]Absence check using 331 positive place invariants in 590 ms returned sat
[2023-03-20 01:39:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 01:39:12] [INFO ] [Real]Absence check using state equation in 2131 ms returned sat
[2023-03-20 01:39:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 01:39:13] [INFO ] [Nat]Absence check using 331 positive place invariants in 168 ms returned sat
[2023-03-20 01:39:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 01:39:15] [INFO ] [Nat]Absence check using state equation in 1610 ms returned sat
[2023-03-20 01:39:15] [INFO ] Computed and/alt/rep : 778/1497/778 causal constraints (skipped 0 transitions) in 55 ms.
[2023-03-20 01:39:27] [INFO ] Added : 585 causal constraints over 117 iterations in 12619 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 78 ms :[(NOT p0)]
Product exploration explored 100000 steps with 449 reset in 696 ms.
Product exploration explored 100000 steps with 442 reset in 723 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 23 ms. Remains 931 /931 variables (removed 0) and now considering 781/781 (removed 0) transitions.
[2023-03-20 01:39:29] [INFO ] Invariant cache hit.
[2023-03-20 01:39:29] [INFO ] Implicit Places using invariants in 480 ms returned []
[2023-03-20 01:39:29] [INFO ] Invariant cache hit.
[2023-03-20 01:39:31] [INFO ] Implicit Places using invariants and state equation in 1207 ms returned []
Implicit Place search using SMT with State Equation took 1688 ms to find 0 implicit places.
[2023-03-20 01:39:31] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-20 01:39:31] [INFO ] Invariant cache hit.
[2023-03-20 01:39:31] [INFO ] Dead Transitions using invariants and state equation in 430 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2172 ms. Remains : 931/931 places, 781/781 transitions.
Treatment of property ShieldPPPs-PT-030B-LTLFireability-15 finished in 46803 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' '!((F(p0)||G((p1||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' '!(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-20 01:39:32] [INFO ] Flatten gal took : 56 ms
[2023-03-20 01:39:32] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-20 01:39:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1841 places, 1691 transitions and 4822 arcs took 21 ms.
Total runtime 406590 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldPPPs-PT-030B
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/377
LTLFireability

FORMULA ShieldPPPs-PT-030B-LTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-030B-LTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679276498561

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/377/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/377/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/377/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 ShieldPPPs-PT-030B-LTLFireability-01
lola: time limit : 599 sec
lola: memory limit: 32 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-030B-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-13: F 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-15: F 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/599 3/32 ShieldPPPs-PT-030B-LTLFireability-01 330544 m, 66108 m/sec, 1030565 t fired, .

Time elapsed: 6 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-030B-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-13: F 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-15: F 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/599 6/32 ShieldPPPs-PT-030B-LTLFireability-01 698675 m, 73626 m/sec, 2155213 t fired, .

Time elapsed: 11 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-030B-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-13: F 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-15: F 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/599 8/32 ShieldPPPs-PT-030B-LTLFireability-01 1040115 m, 68288 m/sec, 3265806 t fired, .

Time elapsed: 16 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-030B-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-13: F 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-15: F 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/599 11/32 ShieldPPPs-PT-030B-LTLFireability-01 1397902 m, 71557 m/sec, 4376668 t fired, .

Time elapsed: 21 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-030B-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-13: F 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-15: F 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/599 13/32 ShieldPPPs-PT-030B-LTLFireability-01 1772878 m, 74995 m/sec, 5488421 t fired, .

Time elapsed: 26 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-030B-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-13: F 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-15: F 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/599 16/32 ShieldPPPs-PT-030B-LTLFireability-01 2122108 m, 69846 m/sec, 6589314 t fired, .

Time elapsed: 31 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-030B-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-13: F 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-15: F 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/599 18/32 ShieldPPPs-PT-030B-LTLFireability-01 2451072 m, 65792 m/sec, 7680613 t fired, .

Time elapsed: 36 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-030B-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-13: F 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-15: F 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/599 21/32 ShieldPPPs-PT-030B-LTLFireability-01 2790600 m, 67905 m/sec, 8776867 t fired, .

Time elapsed: 41 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-030B-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-13: F 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-15: F 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/599 23/32 ShieldPPPs-PT-030B-LTLFireability-01 3145596 m, 70999 m/sec, 9891954 t fired, .

Time elapsed: 46 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-030B-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-13: F 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-15: F 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/599 25/32 ShieldPPPs-PT-030B-LTLFireability-01 3463859 m, 63652 m/sec, 10990059 t fired, .

Time elapsed: 51 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-030B-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-13: F 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-15: F 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/599 28/32 ShieldPPPs-PT-030B-LTLFireability-01 3827046 m, 72637 m/sec, 12135441 t fired, .

Time elapsed: 56 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-030B-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-13: F 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-15: F 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/599 31/32 ShieldPPPs-PT-030B-LTLFireability-01 4214471 m, 77485 m/sec, 13290124 t fired, .

Time elapsed: 61 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 6
lola: CANCELED task # 1 (type EXCL) for ShieldPPPs-PT-030B-LTLFireability-01 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-030B-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-030B-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-13: F 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-15: F 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 66 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: LAUNCH task # 4 (type EXCL) for 3 ShieldPPPs-PT-030B-LTLFireability-03
lola: time limit : 706 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for ShieldPPPs-PT-030B-LTLFireability-03
lola: result : true
lola: markings : 25
lola: fired transitions : 28
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 19 (type EXCL) for 15 ShieldPPPs-PT-030B-LTLFireability-15
lola: time limit : 883 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-030B-LTLFireability-03: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-030B-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-030B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-13: F 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-15: F 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
19 EG EXCL 5/883 12/32 ShieldPPPs-PT-030B-LTLFireability-15 765511 m, 153102 m/sec, 1203900 t fired, .

Time elapsed: 71 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-030B-LTLFireability-03: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-030B-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-030B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-13: F 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-15: F 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
19 EG EXCL 10/883 24/32 ShieldPPPs-PT-030B-LTLFireability-15 1555811 m, 158060 m/sec, 2396033 t fired, .

Time elapsed: 76 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: CANCELED task # 19 (type EXCL) for ShieldPPPs-PT-030B-LTLFireability-15 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-030B-LTLFireability-03: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-030B-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-030B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-13: F 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-15: F 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 81 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: LAUNCH task # 18 (type EXCL) for 12 ShieldPPPs-PT-030B-LTLFireability-13
lola: time limit : 1173 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-030B-LTLFireability-03: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-030B-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-030B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-13: F 0 0 1 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-15: F 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
18 EG EXCL 5/1173 7/32 ShieldPPPs-PT-030B-LTLFireability-13 833712 m, 166742 m/sec, 1145197 t fired, .

Time elapsed: 86 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-030B-LTLFireability-03: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-030B-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-030B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-13: F 0 0 1 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-15: F 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
18 EG EXCL 10/1173 14/32 ShieldPPPs-PT-030B-LTLFireability-13 1702288 m, 173715 m/sec, 2337799 t fired, .

Time elapsed: 91 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-030B-LTLFireability-03: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-030B-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-030B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-13: F 0 0 1 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-15: F 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
18 EG EXCL 15/1173 21/32 ShieldPPPs-PT-030B-LTLFireability-13 2532642 m, 166070 m/sec, 3496215 t fired, .

Time elapsed: 96 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-030B-LTLFireability-03: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-030B-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-030B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-13: F 0 0 1 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-15: F 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
18 EG EXCL 20/1173 28/32 ShieldPPPs-PT-030B-LTLFireability-13 3394099 m, 172291 m/sec, 4674742 t fired, .

Time elapsed: 101 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: CANCELED task # 18 (type EXCL) for ShieldPPPs-PT-030B-LTLFireability-13 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-030B-LTLFireability-03: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-030B-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-030B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-13: F 0 0 0 0 1 0 1 0
ShieldPPPs-PT-030B-LTLFireability-15: F 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 106 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: LAUNCH task # 10 (type EXCL) for 9 ShieldPPPs-PT-030B-LTLFireability-12
lola: time limit : 1747 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-030B-LTLFireability-03: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-030B-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-030B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-13: F 0 0 0 0 1 0 1 0
ShieldPPPs-PT-030B-LTLFireability-15: F 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 5/1747 9/32 ShieldPPPs-PT-030B-LTLFireability-12 638116 m, 127623 m/sec, 1133008 t fired, .

Time elapsed: 111 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-030B-LTLFireability-03: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-030B-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-030B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-13: F 0 0 0 0 1 0 1 0
ShieldPPPs-PT-030B-LTLFireability-15: F 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 10/1747 17/32 ShieldPPPs-PT-030B-LTLFireability-12 1273449 m, 127066 m/sec, 2276439 t fired, .

Time elapsed: 116 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-030B-LTLFireability-03: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-030B-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-030B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-13: F 0 0 0 0 1 0 1 0
ShieldPPPs-PT-030B-LTLFireability-15: F 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 15/1747 25/32 ShieldPPPs-PT-030B-LTLFireability-12 1914203 m, 128150 m/sec, 3433121 t fired, .

Time elapsed: 121 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: CANCELED task # 10 (type EXCL) for ShieldPPPs-PT-030B-LTLFireability-12 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-030B-LTLFireability-03: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPs-PT-030B-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-030B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldPPPs-PT-030B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
ShieldPPPs-PT-030B-LTLFireability-13: F 0 0 0 0 1 0 1 0
ShieldPPPs-PT-030B-LTLFireability-15: F 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 126 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: LAUNCH task # 7 (type EXCL) for 6 ShieldPPPs-PT-030B-LTLFireability-05
lola: time limit : 3474 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for ShieldPPPs-PT-030B-LTLFireability-05
lola: result : false
lola: markings : 2798
lola: fired transitions : 2798
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 6

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-030B-LTLFireability-01: LTL unknown AGGR
ShieldPPPs-PT-030B-LTLFireability-03: LTL true LTL model checker
ShieldPPPs-PT-030B-LTLFireability-05: LTL false LTL model checker
ShieldPPPs-PT-030B-LTLFireability-12: LTL unknown AGGR
ShieldPPPs-PT-030B-LTLFireability-13: F unknown AGGR
ShieldPPPs-PT-030B-LTLFireability-15: F unknown AGGR


Time elapsed: 126 secs. Pages in use: 32

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="lolaxred"
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 lolaxred"
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 r391-oct2-167903715300476"
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 ;