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-167903715500652.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 ShieldPPPt-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-167903715500652
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 8.5K Feb 25 20:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 20:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 20:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 20:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Feb 25 20:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 25 20:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 20:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 25 20:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:00 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 569K 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 ShieldPPPt-PT-030B-LTLFireability-00
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-01
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-02
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-03
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-04
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-05
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-06
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-07
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-08
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-09
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-10
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-11
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-12
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-13
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-14
FORMULA_NAME ShieldPPPt-PT-030B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679279642998

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=ShieldPPPt-PT-030B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 02:34:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 02:34:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 02:34:05] [INFO ] Load time of PNML (sax parser for PT used): 190 ms
[2023-03-20 02:34:05] [INFO ] Transformed 2343 places.
[2023-03-20 02:34:05] [INFO ] Transformed 2133 transitions.
[2023-03-20 02:34:05] [INFO ] Found NUPN structural information;
[2023-03-20 02:34:05] [INFO ] Parsed PT model containing 2343 places and 2133 transitions and 5346 arcs in 369 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 5 formulas.
FORMULA ShieldPPPt-PT-030B-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 2343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2343/2343 places, 2133/2133 transitions.
Discarding 321 places :
Symmetric choice reduction at 0 with 321 rule applications. Total rules 321 place count 2022 transition count 1812
Iterating global reduction 0 with 321 rules applied. Total rules applied 642 place count 2022 transition count 1812
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 643 place count 2021 transition count 1811
Iterating global reduction 0 with 1 rules applied. Total rules applied 644 place count 2021 transition count 1811
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 645 place count 2020 transition count 1810
Iterating global reduction 0 with 1 rules applied. Total rules applied 646 place count 2020 transition count 1810
Applied a total of 646 rules in 789 ms. Remains 2020 /2343 variables (removed 323) and now considering 1810/2133 (removed 323) transitions.
// Phase 1: matrix 1810 rows 2020 cols
[2023-03-20 02:34:06] [INFO ] Computed 331 place invariants in 22 ms
[2023-03-20 02:34:07] [INFO ] Implicit Places using invariants in 1115 ms returned []
[2023-03-20 02:34:07] [INFO ] Invariant cache hit.
[2023-03-20 02:34:09] [INFO ] Implicit Places using invariants and state equation in 2189 ms returned []
Implicit Place search using SMT with State Equation took 3347 ms to find 0 implicit places.
[2023-03-20 02:34:09] [INFO ] Invariant cache hit.
[2023-03-20 02:34:11] [INFO ] Dead Transitions using invariants and state equation in 1131 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2020/2343 places, 1810/2133 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5269 ms. Remains : 2020/2343 places, 1810/2133 transitions.
Support contains 29 out of 2020 places after structural reductions.
[2023-03-20 02:34:11] [INFO ] Flatten gal took : 141 ms
[2023-03-20 02:34:11] [INFO ] Flatten gal took : 78 ms
[2023-03-20 02:34:11] [INFO ] Input system was already deterministic with 1810 transitions.
Support contains 28 out of 2020 places (down from 29) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 549 ms. (steps per millisecond=18 ) properties (out of 21) seen :7
Incomplete Best-First random walk after 10001 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 45 ms. (steps per millisecond=222 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 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 25 ms. (steps per millisecond=400 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 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
Running SMT prover for 14 properties.
[2023-03-20 02:34:12] [INFO ] Invariant cache hit.
[2023-03-20 02:34:13] [INFO ] [Real]Absence check using 331 positive place invariants in 138 ms returned sat
[2023-03-20 02:34:13] [INFO ] After 1200ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-20 02:34:14] [INFO ] [Nat]Absence check using 331 positive place invariants in 156 ms returned sat
[2023-03-20 02:34:17] [INFO ] After 2029ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-20 02:34:18] [INFO ] Deduced a trap composed of 19 places in 476 ms of which 5 ms to minimize.
[2023-03-20 02:34:18] [INFO ] Deduced a trap composed of 18 places in 376 ms of which 2 ms to minimize.
[2023-03-20 02:34:19] [INFO ] Deduced a trap composed of 32 places in 414 ms of which 12 ms to minimize.
[2023-03-20 02:34:19] [INFO ] Deduced a trap composed of 18 places in 375 ms of which 1 ms to minimize.
[2023-03-20 02:34:20] [INFO ] Deduced a trap composed of 20 places in 411 ms of which 13 ms to minimize.
[2023-03-20 02:34:20] [INFO ] Deduced a trap composed of 17 places in 382 ms of which 1 ms to minimize.
[2023-03-20 02:34:20] [INFO ] Deduced a trap composed of 22 places in 361 ms of which 2 ms to minimize.
[2023-03-20 02:34:21] [INFO ] Deduced a trap composed of 20 places in 323 ms of which 0 ms to minimize.
[2023-03-20 02:34:21] [INFO ] Deduced a trap composed of 16 places in 339 ms of which 2 ms to minimize.
[2023-03-20 02:34:22] [INFO ] Deduced a trap composed of 16 places in 312 ms of which 10 ms to minimize.
[2023-03-20 02:34:22] [INFO ] Deduced a trap composed of 30 places in 302 ms of which 1 ms to minimize.
[2023-03-20 02:34:22] [INFO ] Deduced a trap composed of 25 places in 329 ms of which 1 ms to minimize.
[2023-03-20 02:34:23] [INFO ] Deduced a trap composed of 20 places in 273 ms of which 0 ms to minimize.
[2023-03-20 02:34:23] [INFO ] Deduced a trap composed of 28 places in 279 ms of which 1 ms to minimize.
[2023-03-20 02:34:23] [INFO ] Deduced a trap composed of 29 places in 371 ms of which 1 ms to minimize.
[2023-03-20 02:34:24] [INFO ] Deduced a trap composed of 25 places in 337 ms of which 1 ms to minimize.
[2023-03-20 02:34:24] [INFO ] Deduced a trap composed of 26 places in 307 ms of which 1 ms to minimize.
[2023-03-20 02:34:25] [INFO ] Deduced a trap composed of 24 places in 299 ms of which 1 ms to minimize.
[2023-03-20 02:34:25] [INFO ] Deduced a trap composed of 32 places in 246 ms of which 1 ms to minimize.
[2023-03-20 02:34:25] [INFO ] Deduced a trap composed of 27 places in 223 ms of which 0 ms to minimize.
[2023-03-20 02:34:25] [INFO ] Deduced a trap composed of 36 places in 257 ms of which 1 ms to minimize.
[2023-03-20 02:34:26] [INFO ] Deduced a trap composed of 28 places in 298 ms of which 0 ms to minimize.
[2023-03-20 02:34:26] [INFO ] Deduced a trap composed of 18 places in 239 ms of which 1 ms to minimize.
[2023-03-20 02:34:26] [INFO ] Deduced a trap composed of 30 places in 213 ms of which 1 ms to minimize.
[2023-03-20 02:34:27] [INFO ] Deduced a trap composed of 29 places in 241 ms of which 0 ms to minimize.
[2023-03-20 02:34:27] [INFO ] Deduced a trap composed of 32 places in 240 ms of which 0 ms to minimize.
[2023-03-20 02:34:27] [INFO ] Deduced a trap composed of 31 places in 226 ms of which 1 ms to minimize.
[2023-03-20 02:34:27] [INFO ] Deduced a trap composed of 31 places in 231 ms of which 2 ms to minimize.
[2023-03-20 02:34:28] [INFO ] Deduced a trap composed of 29 places in 221 ms of which 0 ms to minimize.
[2023-03-20 02:34:28] [INFO ] Deduced a trap composed of 34 places in 315 ms of which 1 ms to minimize.
[2023-03-20 02:34:28] [INFO ] Deduced a trap composed of 35 places in 188 ms of which 1 ms to minimize.
[2023-03-20 02:34:29] [INFO ] Deduced a trap composed of 36 places in 241 ms of which 1 ms to minimize.
[2023-03-20 02:34:29] [INFO ] Deduced a trap composed of 27 places in 294 ms of which 1 ms to minimize.
[2023-03-20 02:34:29] [INFO ] Deduced a trap composed of 33 places in 250 ms of which 13 ms to minimize.
[2023-03-20 02:34:30] [INFO ] Deduced a trap composed of 31 places in 194 ms of which 0 ms to minimize.
[2023-03-20 02:34:30] [INFO ] Deduced a trap composed of 33 places in 183 ms of which 0 ms to minimize.
[2023-03-20 02:34:30] [INFO ] Deduced a trap composed of 29 places in 279 ms of which 0 ms to minimize.
[2023-03-20 02:34:30] [INFO ] Deduced a trap composed of 44 places in 169 ms of which 0 ms to minimize.
[2023-03-20 02:34:31] [INFO ] Deduced a trap composed of 41 places in 197 ms of which 1 ms to minimize.
[2023-03-20 02:34:31] [INFO ] Deduced a trap composed of 47 places in 234 ms of which 13 ms to minimize.
[2023-03-20 02:34:31] [INFO ] Deduced a trap composed of 45 places in 213 ms of which 1 ms to minimize.
[2023-03-20 02:34:31] [INFO ] Deduced a trap composed of 42 places in 181 ms of which 0 ms to minimize.
[2023-03-20 02:34:32] [INFO ] Deduced a trap composed of 33 places in 179 ms of which 1 ms to minimize.
[2023-03-20 02:34:32] [INFO ] Deduced a trap composed of 29 places in 251 ms of which 0 ms to minimize.
[2023-03-20 02:34:32] [INFO ] Deduced a trap composed of 35 places in 124 ms of which 1 ms to minimize.
[2023-03-20 02:34:32] [INFO ] Deduced a trap composed of 40 places in 191 ms of which 1 ms to minimize.
[2023-03-20 02:34:33] [INFO ] Deduced a trap composed of 25 places in 186 ms of which 0 ms to minimize.
[2023-03-20 02:34:33] [INFO ] Deduced a trap composed of 45 places in 151 ms of which 1 ms to minimize.
[2023-03-20 02:34:33] [INFO ] Deduced a trap composed of 47 places in 200 ms of which 1 ms to minimize.
[2023-03-20 02:34:33] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 0 ms to minimize.
[2023-03-20 02:34:34] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 0 ms to minimize.
[2023-03-20 02:34:34] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 0 ms to minimize.
[2023-03-20 02:34:34] [INFO ] Deduced a trap composed of 46 places in 162 ms of which 0 ms to minimize.
[2023-03-20 02:34:34] [INFO ] Deduced a trap composed of 43 places in 124 ms of which 0 ms to minimize.
[2023-03-20 02:34:34] [INFO ] Deduced a trap composed of 41 places in 138 ms of which 0 ms to minimize.
[2023-03-20 02:34:35] [INFO ] Deduced a trap composed of 47 places in 262 ms of which 21 ms to minimize.
[2023-03-20 02:34:35] [INFO ] Trap strengthening (SAT) tested/added 57/56 trap constraints in 17645 ms
[2023-03-20 02:34:37] [INFO ] After 21761ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 1386 ms.
[2023-03-20 02:34:38] [INFO ] After 24949ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 14 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 451 ms.
Support contains 22 out of 2020 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2020/2020 places, 1810/1810 transitions.
Drop transitions removed 411 transitions
Trivial Post-agglo rules discarded 411 transitions
Performed 411 trivial Post agglomeration. Transition count delta: 411
Iterating post reduction 0 with 411 rules applied. Total rules applied 411 place count 2020 transition count 1399
Reduce places removed 411 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 412 rules applied. Total rules applied 823 place count 1609 transition count 1398
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 824 place count 1608 transition count 1398
Performed 231 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 231 Pre rules applied. Total rules applied 824 place count 1608 transition count 1167
Deduced a syphon composed of 231 places in 2 ms
Reduce places removed 231 places and 0 transitions.
Iterating global reduction 3 with 462 rules applied. Total rules applied 1286 place count 1377 transition count 1167
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1288 place count 1375 transition count 1165
Iterating global reduction 3 with 2 rules applied. Total rules applied 1290 place count 1375 transition count 1165
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1290 place count 1375 transition count 1164
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1292 place count 1374 transition count 1164
Performed 510 Post agglomeration using F-continuation condition.Transition count delta: 510
Deduced a syphon composed of 510 places in 1 ms
Reduce places removed 510 places and 0 transitions.
Iterating global reduction 3 with 1020 rules applied. Total rules applied 2312 place count 864 transition count 654
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2313 place count 864 transition count 653
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2315 place count 863 transition count 652
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 86 places in 1 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 4 with 172 rules applied. Total rules applied 2487 place count 777 transition count 652
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2489 place count 777 transition count 650
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2491 place count 775 transition count 650
Partial Free-agglomeration rule applied 84 times.
Drop transitions removed 84 transitions
Iterating global reduction 5 with 84 rules applied. Total rules applied 2575 place count 775 transition count 650
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2576 place count 774 transition count 649
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2577 place count 773 transition count 649
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 2577 place count 773 transition count 647
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 2581 place count 771 transition count 647
Applied a total of 2581 rules in 474 ms. Remains 771 /2020 variables (removed 1249) and now considering 647/1810 (removed 1163) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 474 ms. Remains : 771/2020 places, 647/1810 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 14) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 647 rows 771 cols
[2023-03-20 02:34:40] [INFO ] Computed 330 place invariants in 3 ms
[2023-03-20 02:34:40] [INFO ] [Real]Absence check using 330 positive place invariants in 77 ms returned sat
[2023-03-20 02:34:41] [INFO ] After 680ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-20 02:34:41] [INFO ] [Nat]Absence check using 330 positive place invariants in 71 ms returned sat
[2023-03-20 02:34:42] [INFO ] After 524ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-20 02:34:42] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 02:34:42] [INFO ] After 393ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-20 02:34:43] [INFO ] After 1085ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 412 ms.
[2023-03-20 02:34:43] [INFO ] After 2444ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 39 ms.
Support contains 16 out of 771 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 771/771 places, 647/647 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 771 transition count 644
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 768 transition count 644
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 768 transition count 642
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 10 place count 766 transition count 642
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 765 transition count 641
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 14 place count 764 transition count 641
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 764 transition count 640
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 763 transition count 640
Applied a total of 16 rules in 127 ms. Remains 763 /771 variables (removed 8) and now considering 640/647 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 763/771 places, 640/647 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 290 ms. (steps per millisecond=34 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 640 rows 763 cols
[2023-03-20 02:34:44] [INFO ] Computed 330 place invariants in 2 ms
[2023-03-20 02:34:45] [INFO ] [Real]Absence check using 330 positive place invariants in 41 ms returned sat
[2023-03-20 02:34:45] [INFO ] After 487ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 02:34:45] [INFO ] [Nat]Absence check using 330 positive place invariants in 55 ms returned sat
[2023-03-20 02:34:46] [INFO ] After 546ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-20 02:34:46] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 02:34:46] [INFO ] After 373ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-20 02:34:47] [INFO ] After 1016ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 391 ms.
[2023-03-20 02:34:47] [INFO ] After 2321ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 95 ms.
Support contains 15 out of 763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 763/763 places, 640/640 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 639
Applied a total of 2 rules in 49 ms. Remains 762 /763 variables (removed 1) and now considering 639/640 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 762/763 places, 639/640 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 354 ms. (steps per millisecond=28 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 92052 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 92052 steps, saw 75507 distinct states, run finished after 3003 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 639 rows 762 cols
[2023-03-20 02:34:51] [INFO ] Computed 330 place invariants in 1 ms
[2023-03-20 02:34:51] [INFO ] [Real]Absence check using 330 positive place invariants in 76 ms returned sat
[2023-03-20 02:34:52] [INFO ] After 755ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 02:34:52] [INFO ] [Nat]Absence check using 330 positive place invariants in 63 ms returned sat
[2023-03-20 02:34:53] [INFO ] After 719ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-20 02:34:53] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 02:34:54] [INFO ] After 431ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-20 02:34:55] [INFO ] Deduced a trap composed of 5 places in 1625 ms of which 1 ms to minimize.
[2023-03-20 02:34:55] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 0 ms to minimize.
[2023-03-20 02:34:56] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2023-03-20 02:34:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1954 ms
[2023-03-20 02:34:56] [INFO ] After 2727ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 394 ms.
[2023-03-20 02:34:56] [INFO ] After 4348ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 74 ms.
Support contains 15 out of 762 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 762/762 places, 639/639 transitions.
Applied a total of 0 rules in 25 ms. Remains 762 /762 variables (removed 0) and now considering 639/639 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 762/762 places, 639/639 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 762/762 places, 639/639 transitions.
Applied a total of 0 rules in 31 ms. Remains 762 /762 variables (removed 0) and now considering 639/639 (removed 0) transitions.
[2023-03-20 02:34:56] [INFO ] Invariant cache hit.
[2023-03-20 02:34:57] [INFO ] Implicit Places using invariants in 556 ms returned [745, 749]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 572 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 760/762 places, 639/639 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 758 transition count 637
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 758 transition count 637
Applied a total of 4 rules in 37 ms. Remains 758 /760 variables (removed 2) and now considering 637/639 (removed 2) transitions.
// Phase 1: matrix 637 rows 758 cols
[2023-03-20 02:34:57] [INFO ] Computed 328 place invariants in 2 ms
[2023-03-20 02:34:57] [INFO ] Implicit Places using invariants in 425 ms returned []
[2023-03-20 02:34:57] [INFO ] Invariant cache hit.
[2023-03-20 02:34:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 02:34:59] [INFO ] Implicit Places using invariants and state equation in 1335 ms returned []
Implicit Place search using SMT with State Equation took 1761 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 758/762 places, 637/639 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2401 ms. Remains : 758/762 places, 637/639 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 118764 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 118764 steps, saw 97015 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 8 properties.
[2023-03-20 02:35:02] [INFO ] Invariant cache hit.
[2023-03-20 02:35:03] [INFO ] [Real]Absence check using 328 positive place invariants in 41 ms returned sat
[2023-03-20 02:35:03] [INFO ] After 498ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 02:35:03] [INFO ] [Nat]Absence check using 328 positive place invariants in 76 ms returned sat
[2023-03-20 02:35:04] [INFO ] After 653ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-20 02:35:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 02:35:05] [INFO ] After 398ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-20 02:35:05] [INFO ] After 1082ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 402 ms.
[2023-03-20 02:35:06] [INFO ] After 2748ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 88 ms.
Support contains 15 out of 758 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 758/758 places, 637/637 transitions.
Applied a total of 0 rules in 17 ms. Remains 758 /758 variables (removed 0) and now considering 637/637 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 758/758 places, 637/637 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 758/758 places, 637/637 transitions.
Applied a total of 0 rules in 16 ms. Remains 758 /758 variables (removed 0) and now considering 637/637 (removed 0) transitions.
[2023-03-20 02:35:06] [INFO ] Invariant cache hit.
[2023-03-20 02:35:06] [INFO ] Implicit Places using invariants in 370 ms returned []
[2023-03-20 02:35:06] [INFO ] Invariant cache hit.
[2023-03-20 02:35:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 02:35:07] [INFO ] Implicit Places using invariants and state equation in 945 ms returned []
Implicit Place search using SMT with State Equation took 1334 ms to find 0 implicit places.
[2023-03-20 02:35:07] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-20 02:35:07] [INFO ] Invariant cache hit.
[2023-03-20 02:35:08] [INFO ] Dead Transitions using invariants and state equation in 492 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1900 ms. Remains : 758/758 places, 637/637 transitions.
Partial Free-agglomeration rule applied 169 times.
Drop transitions removed 169 transitions
Iterating global reduction 0 with 169 rules applied. Total rules applied 169 place count 758 transition count 637
Applied a total of 169 rules in 46 ms. Remains 758 /758 variables (removed 0) and now considering 637/637 (removed 0) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 637 rows 758 cols
[2023-03-20 02:35:08] [INFO ] Computed 328 place invariants in 2 ms
[2023-03-20 02:35:08] [INFO ] [Real]Absence check using 328 positive place invariants in 66 ms returned sat
[2023-03-20 02:35:08] [INFO ] After 583ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 02:35:09] [INFO ] [Nat]Absence check using 328 positive place invariants in 72 ms returned sat
[2023-03-20 02:35:10] [INFO ] After 1043ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-20 02:35:10] [INFO ] State equation strengthened by 156 read => feed constraints.
[2023-03-20 02:35:10] [INFO ] After 477ms SMT Verify possible using 156 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-20 02:35:10] [INFO ] Deduced a trap composed of 8 places in 227 ms of which 1 ms to minimize.
[2023-03-20 02:35:11] [INFO ] Deduced a trap composed of 6 places in 184 ms of which 20 ms to minimize.
[2023-03-20 02:35:11] [INFO ] Deduced a trap composed of 5 places in 491 ms of which 0 ms to minimize.
[2023-03-20 02:35:11] [INFO ] Deduced a trap composed of 9 places in 178 ms of which 1 ms to minimize.
[2023-03-20 02:35:12] [INFO ] Deduced a trap composed of 6 places in 146 ms of which 8 ms to minimize.
[2023-03-20 02:35:12] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 0 ms to minimize.
[2023-03-20 02:35:12] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 1 ms to minimize.
[2023-03-20 02:35:12] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 0 ms to minimize.
[2023-03-20 02:35:12] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1906 ms
[2023-03-20 02:35:12] [INFO ] Deduced a trap composed of 6 places in 240 ms of which 1 ms to minimize.
[2023-03-20 02:35:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 329 ms
[2023-03-20 02:35:13] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 1 ms to minimize.
[2023-03-20 02:35:13] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 0 ms to minimize.
[2023-03-20 02:35:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 413 ms
[2023-03-20 02:35:14] [INFO ] After 3772ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 413 ms.
[2023-03-20 02:35:14] [INFO ] After 5622ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Computed a total of 479 stabilizing places and 479 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(X(X(X(X(G(p0)))))))'
Support contains 2 out of 2020 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2020/2020 places, 1810/1810 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 2011 transition count 1801
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 2011 transition count 1801
Applied a total of 18 rules in 302 ms. Remains 2011 /2020 variables (removed 9) and now considering 1801/1810 (removed 9) transitions.
// Phase 1: matrix 1801 rows 2011 cols
[2023-03-20 02:35:15] [INFO ] Computed 331 place invariants in 13 ms
[2023-03-20 02:35:15] [INFO ] Implicit Places using invariants in 687 ms returned []
[2023-03-20 02:35:15] [INFO ] Invariant cache hit.
[2023-03-20 02:35:17] [INFO ] Implicit Places using invariants and state equation in 1935 ms returned []
Implicit Place search using SMT with State Equation took 2637 ms to find 0 implicit places.
[2023-03-20 02:35:17] [INFO ] Invariant cache hit.
[2023-03-20 02:35:18] [INFO ] Dead Transitions using invariants and state equation in 1019 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2011/2020 places, 1801/1810 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3971 ms. Remains : 2011/2020 places, 1801/1810 transitions.
Stuttering acceptance computed with spot in 541 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 4}]], initial=5, aps=[p0:(AND (EQ s1235 1) (EQ s1260 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 3 ms.
FORMULA ShieldPPPt-PT-030B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030B-LTLFireability-00 finished in 4611 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(p0)) U (G(p0)||X(F(p1))))))'
Support contains 3 out of 2020 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2020/2020 places, 1810/1810 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 422 transitions
Trivial Post-agglo rules discarded 422 transitions
Performed 422 trivial Post agglomeration. Transition count delta: 422
Iterating post reduction 0 with 422 rules applied. Total rules applied 422 place count 2019 transition count 1387
Reduce places removed 422 places and 0 transitions.
Iterating post reduction 1 with 422 rules applied. Total rules applied 844 place count 1597 transition count 1387
Performed 233 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 233 Pre rules applied. Total rules applied 844 place count 1597 transition count 1154
Deduced a syphon composed of 233 places in 2 ms
Reduce places removed 233 places and 0 transitions.
Iterating global reduction 2 with 466 rules applied. Total rules applied 1310 place count 1364 transition count 1154
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1315 place count 1359 transition count 1149
Iterating global reduction 2 with 5 rules applied. Total rules applied 1320 place count 1359 transition count 1149
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1320 place count 1359 transition count 1145
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1328 place count 1355 transition count 1145
Performed 510 Post agglomeration using F-continuation condition.Transition count delta: 510
Deduced a syphon composed of 510 places in 0 ms
Reduce places removed 510 places and 0 transitions.
Iterating global reduction 2 with 1020 rules applied. Total rules applied 2348 place count 845 transition count 635
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2349 place count 845 transition count 634
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2351 place count 844 transition count 633
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 2527 place count 756 transition count 633
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2529 place count 754 transition count 631
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2530 place count 753 transition count 631
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2530 place count 753 transition count 629
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2534 place count 751 transition count 629
Applied a total of 2534 rules in 333 ms. Remains 751 /2020 variables (removed 1269) and now considering 629/1810 (removed 1181) transitions.
// Phase 1: matrix 629 rows 751 cols
[2023-03-20 02:35:19] [INFO ] Computed 330 place invariants in 1 ms
[2023-03-20 02:35:20] [INFO ] Implicit Places using invariants in 491 ms returned [734, 738]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 492 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 749/2020 places, 629/1810 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 747 transition count 627
Applied a total of 4 rules in 40 ms. Remains 747 /749 variables (removed 2) and now considering 627/629 (removed 2) transitions.
// Phase 1: matrix 627 rows 747 cols
[2023-03-20 02:35:20] [INFO ] Computed 328 place invariants in 1 ms
[2023-03-20 02:35:20] [INFO ] Implicit Places using invariants in 478 ms returned []
[2023-03-20 02:35:20] [INFO ] Invariant cache hit.
[2023-03-20 02:35:21] [INFO ] Implicit Places using invariants and state equation in 696 ms returned []
Implicit Place search using SMT with State Equation took 1191 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 747/2020 places, 627/1810 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2056 ms. Remains : 747/2020 places, 627/1810 transitions.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s68 1) (EQ s76 1)), p1:(EQ s697 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 409 reset in 698 ms.
Stack based approach found an accepted trace after 133 steps with 2 reset with depth 16 and stack size 14 in 1 ms.
FORMULA ShieldPPPt-PT-030B-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030B-LTLFireability-01 finished in 2887 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p1)||p0)))'
Support contains 4 out of 2020 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2020/2020 places, 1810/1810 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 2012 transition count 1802
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 2012 transition count 1802
Applied a total of 16 rules in 285 ms. Remains 2012 /2020 variables (removed 8) and now considering 1802/1810 (removed 8) transitions.
// Phase 1: matrix 1802 rows 2012 cols
[2023-03-20 02:35:22] [INFO ] Computed 331 place invariants in 12 ms
[2023-03-20 02:35:23] [INFO ] Implicit Places using invariants in 751 ms returned []
[2023-03-20 02:35:23] [INFO ] Invariant cache hit.
[2023-03-20 02:35:25] [INFO ] Implicit Places using invariants and state equation in 2253 ms returned []
Implicit Place search using SMT with State Equation took 3027 ms to find 0 implicit places.
[2023-03-20 02:35:25] [INFO ] Invariant cache hit.
[2023-03-20 02:35:26] [INFO ] Dead Transitions using invariants and state equation in 1109 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2012/2020 places, 1802/1810 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4423 ms. Remains : 2012/2020 places, 1802/1810 transitions.
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s573 1) (EQ s1625 1)) (AND (EQ s1102 1) (EQ s941 1))), p1:(EQ s1625 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 564 reset in 360 ms.
Product exploration explored 100000 steps with 546 reset in 464 ms.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Detected a total of 478/2012 stabilizing places and 478/1802 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 (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 221 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 101 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=50 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 4 factoid took 248 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p1))]
[2023-03-20 02:35:28] [INFO ] Invariant cache hit.
[2023-03-20 02:35:29] [INFO ] [Real]Absence check using 331 positive place invariants in 448 ms returned sat
[2023-03-20 02:35:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 02:35:40] [INFO ] [Real]Absence check using state equation in 10822 ms returned sat
[2023-03-20 02:35:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 02:35:42] [INFO ] [Nat]Absence check using 331 positive place invariants in 394 ms returned sat
[2023-03-20 02:35:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 02:35:51] [INFO ] [Nat]Absence check using state equation in 9451 ms returned sat
[2023-03-20 02:35:51] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 0 ms to minimize.
[2023-03-20 02:35:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 279 ms
[2023-03-20 02:35:52] [INFO ] Computed and/alt/rep : 1801/2672/1801 causal constraints (skipped 0 transitions) in 98 ms.
[2023-03-20 02:35:56] [INFO ] Deduced a trap composed of 22 places in 1091 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.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 02:35:56] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p0) (NOT p1))
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 2012 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2012/2012 places, 1802/1802 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 417 transitions
Trivial Post-agglo rules discarded 417 transitions
Performed 417 trivial Post agglomeration. Transition count delta: 417
Iterating post reduction 0 with 417 rules applied. Total rules applied 417 place count 2011 transition count 1384
Reduce places removed 417 places and 0 transitions.
Iterating post reduction 1 with 417 rules applied. Total rules applied 834 place count 1594 transition count 1384
Performed 240 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 240 Pre rules applied. Total rules applied 834 place count 1594 transition count 1144
Deduced a syphon composed of 240 places in 3 ms
Reduce places removed 240 places and 0 transitions.
Iterating global reduction 2 with 480 rules applied. Total rules applied 1314 place count 1354 transition count 1144
Performed 507 Post agglomeration using F-continuation condition.Transition count delta: 507
Deduced a syphon composed of 507 places in 1 ms
Reduce places removed 507 places and 0 transitions.
Iterating global reduction 2 with 1014 rules applied. Total rules applied 2328 place count 847 transition count 637
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2329 place count 847 transition count 636
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2331 place count 846 transition count 635
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2509 place count 757 transition count 635
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2511 place count 755 transition count 633
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2512 place count 754 transition count 633
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2512 place count 754 transition count 631
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2516 place count 752 transition count 631
Applied a total of 2516 rules in 260 ms. Remains 752 /2012 variables (removed 1260) and now considering 631/1802 (removed 1171) transitions.
// Phase 1: matrix 631 rows 752 cols
[2023-03-20 02:35:57] [INFO ] Computed 330 place invariants in 4 ms
[2023-03-20 02:35:57] [INFO ] Implicit Places using invariants in 432 ms returned [735, 739]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 433 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 750/2012 places, 631/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 748 transition count 629
Applied a total of 4 rules in 32 ms. Remains 748 /750 variables (removed 2) and now considering 629/631 (removed 2) transitions.
// Phase 1: matrix 629 rows 748 cols
[2023-03-20 02:35:57] [INFO ] Computed 328 place invariants in 2 ms
[2023-03-20 02:35:58] [INFO ] Implicit Places using invariants in 424 ms returned []
[2023-03-20 02:35:58] [INFO ] Invariant cache hit.
[2023-03-20 02:35:59] [INFO ] Implicit Places using invariants and state equation in 1363 ms returned []
Implicit Place search using SMT with State Equation took 1789 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 748/2012 places, 629/1802 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2514 ms. Remains : 748/2012 places, 629/1802 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/748 stabilizing places and 2/629 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 268 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 314 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
[2023-03-20 02:36:00] [INFO ] Invariant cache hit.
[2023-03-20 02:36:00] [INFO ] [Real]Absence check using 328 positive place invariants in 148 ms returned sat
[2023-03-20 02:36:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 02:36:01] [INFO ] [Real]Absence check using state equation in 864 ms returned sat
[2023-03-20 02:36:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 02:36:02] [INFO ] [Nat]Absence check using 328 positive place invariants in 142 ms returned sat
[2023-03-20 02:36:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 02:36:03] [INFO ] [Nat]Absence check using state equation in 991 ms returned sat
[2023-03-20 02:36:03] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2023-03-20 02:36:03] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-20 02:36:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 155 ms
[2023-03-20 02:36:03] [INFO ] Computed and/alt/rep : 624/983/624 causal constraints (skipped 0 transitions) in 57 ms.
[2023-03-20 02:36:11] [INFO ] Added : 527 causal constraints over 106 iterations in 8150 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 19453 reset in 642 ms.
Stack based approach found an accepted trace after 40 steps with 8 reset with depth 3 and stack size 3 in 0 ms.
FORMULA ShieldPPPt-PT-030B-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030B-LTLFireability-02 finished in 50243 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 2020 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2020/2020 places, 1810/1810 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 422 transitions
Trivial Post-agglo rules discarded 422 transitions
Performed 422 trivial Post agglomeration. Transition count delta: 422
Iterating post reduction 0 with 422 rules applied. Total rules applied 422 place count 2019 transition count 1387
Reduce places removed 422 places and 0 transitions.
Iterating post reduction 1 with 422 rules applied. Total rules applied 844 place count 1597 transition count 1387
Performed 234 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 234 Pre rules applied. Total rules applied 844 place count 1597 transition count 1153
Deduced a syphon composed of 234 places in 1 ms
Reduce places removed 234 places and 0 transitions.
Iterating global reduction 2 with 468 rules applied. Total rules applied 1312 place count 1363 transition count 1153
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1317 place count 1358 transition count 1148
Iterating global reduction 2 with 5 rules applied. Total rules applied 1322 place count 1358 transition count 1148
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1322 place count 1358 transition count 1144
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1330 place count 1354 transition count 1144
Performed 511 Post agglomeration using F-continuation condition.Transition count delta: 511
Deduced a syphon composed of 511 places in 1 ms
Reduce places removed 511 places and 0 transitions.
Iterating global reduction 2 with 1022 rules applied. Total rules applied 2352 place count 843 transition count 633
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2353 place count 843 transition count 632
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2355 place count 842 transition count 631
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2533 place count 753 transition count 631
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2535 place count 751 transition count 629
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2536 place count 750 transition count 629
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2536 place count 750 transition count 627
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2540 place count 748 transition count 627
Applied a total of 2540 rules in 246 ms. Remains 748 /2020 variables (removed 1272) and now considering 627/1810 (removed 1183) transitions.
// Phase 1: matrix 627 rows 748 cols
[2023-03-20 02:36:12] [INFO ] Computed 330 place invariants in 4 ms
[2023-03-20 02:36:13] [INFO ] Implicit Places using invariants in 473 ms returned [731, 735]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 475 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 746/2020 places, 627/1810 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 744 transition count 625
Applied a total of 4 rules in 25 ms. Remains 744 /746 variables (removed 2) and now considering 625/627 (removed 2) transitions.
// Phase 1: matrix 625 rows 744 cols
[2023-03-20 02:36:13] [INFO ] Computed 328 place invariants in 2 ms
[2023-03-20 02:36:13] [INFO ] Implicit Places using invariants in 456 ms returned []
[2023-03-20 02:36:13] [INFO ] Invariant cache hit.
[2023-03-20 02:36:14] [INFO ] Implicit Places using invariants and state equation in 870 ms returned []
Implicit Place search using SMT with State Equation took 1330 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 744/2020 places, 625/1810 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2076 ms. Remains : 744/2020 places, 625/1810 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s480 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 21 reset in 540 ms.
Stack based approach found an accepted trace after 434 steps with 0 reset with depth 435 and stack size 435 in 2 ms.
FORMULA ShieldPPPt-PT-030B-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030B-LTLFireability-03 finished in 2710 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&&X((!p0 U (p1||G(!p0))))) U (!p1||F(p2))))))'
Support contains 4 out of 2020 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2020/2020 places, 1810/1810 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 2012 transition count 1802
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 2012 transition count 1802
Applied a total of 16 rules in 196 ms. Remains 2012 /2020 variables (removed 8) and now considering 1802/1810 (removed 8) transitions.
// Phase 1: matrix 1802 rows 2012 cols
[2023-03-20 02:36:15] [INFO ] Computed 331 place invariants in 11 ms
[2023-03-20 02:36:16] [INFO ] Implicit Places using invariants in 693 ms returned []
[2023-03-20 02:36:16] [INFO ] Invariant cache hit.
[2023-03-20 02:36:18] [INFO ] Implicit Places using invariants and state equation in 2095 ms returned []
Implicit Place search using SMT with State Equation took 2789 ms to find 0 implicit places.
[2023-03-20 02:36:18] [INFO ] Invariant cache hit.
[2023-03-20 02:36:19] [INFO ] Dead Transitions using invariants and state equation in 1052 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2012/2020 places, 1802/1810 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4038 ms. Remains : 2012/2020 places, 1802/1810 transitions.
Stuttering acceptance computed with spot in 303 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1) p0), (AND p1 (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 3}], [{ cond=(AND p1 (NOT p2) p0), acceptance={0} source=4 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(NEQ s1148 1), p2:(EQ s609 1), p0:(AND (EQ s775 1) (EQ s777 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 22245 reset in 726 ms.
Product exploration explored 100000 steps with 22240 reset in 680 ms.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Detected a total of 479/2012 stabilizing places and 479/1802 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (NOT (AND p1 (NOT p2) p0))), (X (AND p1 (NOT p2) (NOT p0))), true, (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 666 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 369 ms :[(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10000 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 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-20 02:36:22] [INFO ] Invariant cache hit.
[2023-03-20 02:36:22] [INFO ] [Real]Absence check using 331 positive place invariants in 191 ms returned sat
[2023-03-20 02:36:23] [INFO ] After 901ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-20 02:36:24] [INFO ] Deduced a trap composed of 21 places in 491 ms of which 1 ms to minimize.
[2023-03-20 02:36:24] [INFO ] Deduced a trap composed of 19 places in 428 ms of which 1 ms to minimize.
[2023-03-20 02:36:25] [INFO ] Deduced a trap composed of 23 places in 444 ms of which 1 ms to minimize.
[2023-03-20 02:36:25] [INFO ] Deduced a trap composed of 25 places in 491 ms of which 1 ms to minimize.
[2023-03-20 02:36:26] [INFO ] Deduced a trap composed of 23 places in 483 ms of which 1 ms to minimize.
[2023-03-20 02:36:27] [INFO ] Deduced a trap composed of 25 places in 509 ms of which 2 ms to minimize.
[2023-03-20 02:36:27] [INFO ] Deduced a trap composed of 26 places in 402 ms of which 1 ms to minimize.
[2023-03-20 02:36:27] [INFO ] Deduced a trap composed of 24 places in 439 ms of which 1 ms to minimize.
[2023-03-20 02:36:28] [INFO ] Deduced a trap composed of 25 places in 539 ms of which 2 ms to minimize.
[2023-03-20 02:36:29] [INFO ] Deduced a trap composed of 17 places in 418 ms of which 1 ms to minimize.
[2023-03-20 02:36:29] [INFO ] Deduced a trap composed of 23 places in 468 ms of which 1 ms to minimize.
[2023-03-20 02:36:30] [INFO ] Deduced a trap composed of 17 places in 414 ms of which 1 ms to minimize.
[2023-03-20 02:36:30] [INFO ] Deduced a trap composed of 25 places in 369 ms of which 1 ms to minimize.
[2023-03-20 02:36:31] [INFO ] Deduced a trap composed of 26 places in 462 ms of which 1 ms to minimize.
[2023-03-20 02:36:31] [INFO ] Deduced a trap composed of 17 places in 341 ms of which 1 ms to minimize.
[2023-03-20 02:36:31] [INFO ] Deduced a trap composed of 45 places in 371 ms of which 1 ms to minimize.
[2023-03-20 02:36:32] [INFO ] Deduced a trap composed of 37 places in 351 ms of which 0 ms to minimize.
[2023-03-20 02:36:32] [INFO ] Deduced a trap composed of 44 places in 382 ms of which 1 ms to minimize.
[2023-03-20 02:36:33] [INFO ] Deduced a trap composed of 29 places in 360 ms of which 0 ms to minimize.
[2023-03-20 02:36:33] [INFO ] Deduced a trap composed of 34 places in 417 ms of which 1 ms to minimize.
[2023-03-20 02:36:34] [INFO ] Deduced a trap composed of 30 places in 371 ms of which 1 ms to minimize.
[2023-03-20 02:36:34] [INFO ] Deduced a trap composed of 20 places in 381 ms of which 1 ms to minimize.
[2023-03-20 02:36:35] [INFO ] Deduced a trap composed of 29 places in 370 ms of which 1 ms to minimize.
[2023-03-20 02:36:35] [INFO ] Deduced a trap composed of 34 places in 317 ms of which 1 ms to minimize.
[2023-03-20 02:36:35] [INFO ] Deduced a trap composed of 27 places in 328 ms of which 1 ms to minimize.
[2023-03-20 02:36:36] [INFO ] Deduced a trap composed of 39 places in 341 ms of which 0 ms to minimize.
[2023-03-20 02:36:36] [INFO ] Deduced a trap composed of 40 places in 303 ms of which 1 ms to minimize.
[2023-03-20 02:36:36] [INFO ] Deduced a trap composed of 36 places in 339 ms of which 1 ms to minimize.
[2023-03-20 02:36:37] [INFO ] Deduced a trap composed of 46 places in 460 ms of which 0 ms to minimize.
[2023-03-20 02:36:37] [INFO ] Deduced a trap composed of 35 places in 369 ms of which 1 ms to minimize.
[2023-03-20 02:36:38] [INFO ] Deduced a trap composed of 23 places in 281 ms of which 1 ms to minimize.
[2023-03-20 02:36:38] [INFO ] Deduced a trap composed of 29 places in 259 ms of which 7 ms to minimize.
[2023-03-20 02:36:38] [INFO ] Deduced a trap composed of 33 places in 241 ms of which 0 ms to minimize.
[2023-03-20 02:36:39] [INFO ] Deduced a trap composed of 33 places in 318 ms of which 1 ms to minimize.
[2023-03-20 02:36:39] [INFO ] Deduced a trap composed of 29 places in 267 ms of which 0 ms to minimize.
[2023-03-20 02:36:39] [INFO ] Deduced a trap composed of 43 places in 266 ms of which 0 ms to minimize.
[2023-03-20 02:36:40] [INFO ] Deduced a trap composed of 33 places in 273 ms of which 1 ms to minimize.
[2023-03-20 02:36:40] [INFO ] Deduced a trap composed of 41 places in 307 ms of which 1 ms to minimize.
[2023-03-20 02:36:41] [INFO ] Deduced a trap composed of 32 places in 272 ms of which 1 ms to minimize.
[2023-03-20 02:36:41] [INFO ] Deduced a trap composed of 31 places in 278 ms of which 1 ms to minimize.
[2023-03-20 02:36:41] [INFO ] Deduced a trap composed of 44 places in 312 ms of which 1 ms to minimize.
[2023-03-20 02:36:42] [INFO ] Deduced a trap composed of 30 places in 327 ms of which 1 ms to minimize.
[2023-03-20 02:36:42] [INFO ] Deduced a trap composed of 41 places in 213 ms of which 1 ms to minimize.
[2023-03-20 02:36:42] [INFO ] Deduced a trap composed of 43 places in 261 ms of which 4 ms to minimize.
[2023-03-20 02:36:43] [INFO ] Deduced a trap composed of 37 places in 235 ms of which 0 ms to minimize.
[2023-03-20 02:36:43] [INFO ] Deduced a trap composed of 54 places in 246 ms of which 0 ms to minimize.
[2023-03-20 02:36:43] [INFO ] Deduced a trap composed of 41 places in 256 ms of which 0 ms to minimize.
[2023-03-20 02:36:43] [INFO ] Deduced a trap composed of 36 places in 223 ms of which 0 ms to minimize.
[2023-03-20 02:36:44] [INFO ] Deduced a trap composed of 42 places in 273 ms of which 0 ms to minimize.
[2023-03-20 02:36:44] [INFO ] Deduced a trap composed of 39 places in 244 ms of which 1 ms to minimize.
[2023-03-20 02:36:44] [INFO ] Deduced a trap composed of 39 places in 224 ms of which 0 ms to minimize.
[2023-03-20 02:36:45] [INFO ] Deduced a trap composed of 38 places in 254 ms of which 0 ms to minimize.
[2023-03-20 02:36:45] [INFO ] Deduced a trap composed of 46 places in 221 ms of which 1 ms to minimize.
[2023-03-20 02:36:45] [INFO ] Deduced a trap composed of 41 places in 243 ms of which 1 ms to minimize.
[2023-03-20 02:36:46] [INFO ] Deduced a trap composed of 45 places in 230 ms of which 1 ms to minimize.
[2023-03-20 02:36:46] [INFO ] Deduced a trap composed of 49 places in 443 ms of which 1 ms to minimize.
[2023-03-20 02:36:47] [INFO ] Deduced a trap composed of 44 places in 209 ms of which 0 ms to minimize.
[2023-03-20 02:36:47] [INFO ] Deduced a trap composed of 45 places in 203 ms of which 0 ms to minimize.
[2023-03-20 02:36:47] [INFO ] Trap strengthening (SAT) tested/added 58/58 trap constraints in 23512 ms
[2023-03-20 02:36:47] [INFO ] After 24448ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:36:47] [INFO ] After 25018ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 02:36:47] [INFO ] [Nat]Absence check using 331 positive place invariants in 108 ms returned sat
[2023-03-20 02:36:48] [INFO ] After 983ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 02:36:49] [INFO ] Deduced a trap composed of 18 places in 495 ms of which 1 ms to minimize.
[2023-03-20 02:36:49] [INFO ] Deduced a trap composed of 17 places in 442 ms of which 1 ms to minimize.
[2023-03-20 02:36:50] [INFO ] Deduced a trap composed of 25 places in 528 ms of which 2 ms to minimize.
[2023-03-20 02:36:50] [INFO ] Deduced a trap composed of 24 places in 447 ms of which 12 ms to minimize.
[2023-03-20 02:36:51] [INFO ] Deduced a trap composed of 20 places in 498 ms of which 2 ms to minimize.
[2023-03-20 02:36:52] [INFO ] Deduced a trap composed of 23 places in 438 ms of which 1 ms to minimize.
[2023-03-20 02:36:52] [INFO ] Deduced a trap composed of 26 places in 407 ms of which 1 ms to minimize.
[2023-03-20 02:36:52] [INFO ] Deduced a trap composed of 22 places in 412 ms of which 1 ms to minimize.
[2023-03-20 02:36:53] [INFO ] Deduced a trap composed of 38 places in 415 ms of which 1 ms to minimize.
[2023-03-20 02:36:54] [INFO ] Deduced a trap composed of 22 places in 488 ms of which 1 ms to minimize.
[2023-03-20 02:36:54] [INFO ] Deduced a trap composed of 21 places in 461 ms of which 6 ms to minimize.
[2023-03-20 02:36:55] [INFO ] Deduced a trap composed of 20 places in 441 ms of which 1 ms to minimize.
[2023-03-20 02:36:55] [INFO ] Deduced a trap composed of 23 places in 378 ms of which 1 ms to minimize.
[2023-03-20 02:36:56] [INFO ] Deduced a trap composed of 25 places in 440 ms of which 1 ms to minimize.
[2023-03-20 02:36:56] [INFO ] Deduced a trap composed of 29 places in 415 ms of which 1 ms to minimize.
[2023-03-20 02:36:56] [INFO ] Deduced a trap composed of 17 places in 344 ms of which 1 ms to minimize.
[2023-03-20 02:36:57] [INFO ] Deduced a trap composed of 25 places in 365 ms of which 1 ms to minimize.
[2023-03-20 02:36:57] [INFO ] Deduced a trap composed of 27 places in 334 ms of which 1 ms to minimize.
[2023-03-20 02:36:58] [INFO ] Deduced a trap composed of 26 places in 483 ms of which 1 ms to minimize.
[2023-03-20 02:36:58] [INFO ] Deduced a trap composed of 32 places in 504 ms of which 1 ms to minimize.
[2023-03-20 02:36:59] [INFO ] Deduced a trap composed of 43 places in 408 ms of which 1 ms to minimize.
[2023-03-20 02:36:59] [INFO ] Deduced a trap composed of 34 places in 338 ms of which 1 ms to minimize.
[2023-03-20 02:37:00] [INFO ] Deduced a trap composed of 27 places in 357 ms of which 1 ms to minimize.
[2023-03-20 02:37:00] [INFO ] Deduced a trap composed of 43 places in 330 ms of which 1 ms to minimize.
[2023-03-20 02:37:00] [INFO ] Deduced a trap composed of 40 places in 304 ms of which 1 ms to minimize.
[2023-03-20 02:37:01] [INFO ] Deduced a trap composed of 29 places in 272 ms of which 1 ms to minimize.
[2023-03-20 02:37:01] [INFO ] Deduced a trap composed of 44 places in 273 ms of which 1 ms to minimize.
[2023-03-20 02:37:01] [INFO ] Deduced a trap composed of 35 places in 296 ms of which 1 ms to minimize.
[2023-03-20 02:37:02] [INFO ] Deduced a trap composed of 36 places in 290 ms of which 1 ms to minimize.
[2023-03-20 02:37:02] [INFO ] Deduced a trap composed of 17 places in 332 ms of which 1 ms to minimize.
[2023-03-20 02:37:03] [INFO ] Deduced a trap composed of 25 places in 322 ms of which 1 ms to minimize.
[2023-03-20 02:37:03] [INFO ] Deduced a trap composed of 32 places in 268 ms of which 0 ms to minimize.
[2023-03-20 02:37:03] [INFO ] Deduced a trap composed of 34 places in 300 ms of which 1 ms to minimize.
[2023-03-20 02:37:04] [INFO ] Deduced a trap composed of 30 places in 369 ms of which 1 ms to minimize.
[2023-03-20 02:37:04] [INFO ] Deduced a trap composed of 33 places in 320 ms of which 1 ms to minimize.
[2023-03-20 02:37:04] [INFO ] Deduced a trap composed of 32 places in 261 ms of which 1 ms to minimize.
[2023-03-20 02:37:05] [INFO ] Deduced a trap composed of 40 places in 239 ms of which 0 ms to minimize.
[2023-03-20 02:37:05] [INFO ] Deduced a trap composed of 33 places in 270 ms of which 1 ms to minimize.
[2023-03-20 02:37:05] [INFO ] Deduced a trap composed of 34 places in 211 ms of which 1 ms to minimize.
[2023-03-20 02:37:06] [INFO ] Deduced a trap composed of 34 places in 200 ms of which 1 ms to minimize.
[2023-03-20 02:37:06] [INFO ] Deduced a trap composed of 41 places in 211 ms of which 1 ms to minimize.
[2023-03-20 02:37:06] [INFO ] Deduced a trap composed of 37 places in 223 ms of which 1 ms to minimize.
[2023-03-20 02:37:06] [INFO ] Deduced a trap composed of 30 places in 245 ms of which 1 ms to minimize.
[2023-03-20 02:37:07] [INFO ] Deduced a trap composed of 39 places in 193 ms of which 1 ms to minimize.
[2023-03-20 02:37:07] [INFO ] Deduced a trap composed of 51 places in 250 ms of which 0 ms to minimize.
[2023-03-20 02:37:07] [INFO ] Deduced a trap composed of 39 places in 193 ms of which 0 ms to minimize.
[2023-03-20 02:37:08] [INFO ] Deduced a trap composed of 37 places in 174 ms of which 1 ms to minimize.
[2023-03-20 02:37:08] [INFO ] Deduced a trap composed of 45 places in 189 ms of which 0 ms to minimize.
[2023-03-20 02:37:08] [INFO ] Deduced a trap composed of 39 places in 224 ms of which 1 ms to minimize.
[2023-03-20 02:37:08] [INFO ] Deduced a trap composed of 34 places in 242 ms of which 1 ms to minimize.
[2023-03-20 02:37:09] [INFO ] Deduced a trap composed of 33 places in 188 ms of which 1 ms to minimize.
[2023-03-20 02:37:09] [INFO ] Deduced a trap composed of 43 places in 237 ms of which 1 ms to minimize.
[2023-03-20 02:37:09] [INFO ] Deduced a trap composed of 46 places in 182 ms of which 0 ms to minimize.
[2023-03-20 02:37:09] [INFO ] Deduced a trap composed of 44 places in 184 ms of which 2 ms to minimize.
[2023-03-20 02:37:10] [INFO ] Deduced a trap composed of 38 places in 218 ms of which 0 ms to minimize.
[2023-03-20 02:37:10] [INFO ] Deduced a trap composed of 39 places in 178 ms of which 1 ms to minimize.
[2023-03-20 02:37:10] [INFO ] Deduced a trap composed of 41 places in 163 ms of which 1 ms to minimize.
[2023-03-20 02:37:10] [INFO ] Deduced a trap composed of 43 places in 196 ms of which 0 ms to minimize.
[2023-03-20 02:37:11] [INFO ] Deduced a trap composed of 41 places in 147 ms of which 1 ms to minimize.
[2023-03-20 02:37:11] [INFO ] Deduced a trap composed of 46 places in 156 ms of which 1 ms to minimize.
[2023-03-20 02:37:11] [INFO ] Deduced a trap composed of 34 places in 170 ms of which 1 ms to minimize.
[2023-03-20 02:37:11] [INFO ] Deduced a trap composed of 45 places in 167 ms of which 0 ms to minimize.
[2023-03-20 02:37:11] [INFO ] Deduced a trap composed of 46 places in 193 ms of which 1 ms to minimize.
[2023-03-20 02:37:12] [INFO ] Trap strengthening (SAT) tested/added 64/63 trap constraints in 23365 ms
[2023-03-20 02:37:12] [INFO ] After 24552ms 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 02:37:12] [INFO ] After 25032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 94 ms.
Support contains 4 out of 2012 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2012/2012 places, 1802/1802 transitions.
Drop transitions removed 417 transitions
Trivial Post-agglo rules discarded 417 transitions
Performed 417 trivial Post agglomeration. Transition count delta: 417
Iterating post reduction 0 with 417 rules applied. Total rules applied 417 place count 2012 transition count 1385
Reduce places removed 417 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 418 rules applied. Total rules applied 835 place count 1595 transition count 1384
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 836 place count 1594 transition count 1384
Performed 241 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 241 Pre rules applied. Total rules applied 836 place count 1594 transition count 1143
Deduced a syphon composed of 241 places in 2 ms
Reduce places removed 241 places and 0 transitions.
Iterating global reduction 3 with 482 rules applied. Total rules applied 1318 place count 1353 transition count 1143
Performed 508 Post agglomeration using F-continuation condition.Transition count delta: 508
Deduced a syphon composed of 508 places in 1 ms
Reduce places removed 508 places and 0 transitions.
Iterating global reduction 3 with 1016 rules applied. Total rules applied 2334 place count 845 transition count 635
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2335 place count 845 transition count 634
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2337 place count 844 transition count 633
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 178 rules applied. Total rules applied 2515 place count 755 transition count 633
Partial Free-agglomeration rule applied 88 times.
Drop transitions removed 88 transitions
Iterating global reduction 4 with 88 rules applied. Total rules applied 2603 place count 755 transition count 633
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2604 place count 754 transition count 632
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2605 place count 753 transition count 632
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 2605 place count 753 transition count 630
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 2609 place count 751 transition count 630
Applied a total of 2609 rules in 272 ms. Remains 751 /2012 variables (removed 1261) and now considering 630/1802 (removed 1172) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 272 ms. Remains : 751/2012 places, 630/1802 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) 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 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 224869 steps, run timeout after 3008 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 224869 steps, saw 186106 distinct states, run finished after 3008 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 630 rows 751 cols
[2023-03-20 02:37:15] [INFO ] Computed 330 place invariants in 2 ms
[2023-03-20 02:37:16] [INFO ] [Real]Absence check using 330 positive place invariants in 67 ms returned sat
[2023-03-20 02:37:16] [INFO ] After 189ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 02:37:16] [INFO ] [Nat]Absence check using 330 positive place invariants in 542 ms returned sat
[2023-03-20 02:37:17] [INFO ] After 371ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 02:37:17] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-20 02:37:17] [INFO ] After 97ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 02:37:17] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 0 ms to minimize.
[2023-03-20 02:37:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2023-03-20 02:37:17] [INFO ] After 416ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 56 ms.
[2023-03-20 02:37:17] [INFO ] After 1668ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 18 ms.
Support contains 4 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 630/630 transitions.
Applied a total of 0 rules in 17 ms. Remains 751 /751 variables (removed 0) and now considering 630/630 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 751/751 places, 630/630 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 630/630 transitions.
Applied a total of 0 rules in 15 ms. Remains 751 /751 variables (removed 0) and now considering 630/630 (removed 0) transitions.
[2023-03-20 02:37:17] [INFO ] Invariant cache hit.
[2023-03-20 02:37:18] [INFO ] Implicit Places using invariants in 475 ms returned [734, 738]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 475 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 749/751 places, 630/630 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 747 transition count 628
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 747 transition count 628
Applied a total of 4 rules in 26 ms. Remains 747 /749 variables (removed 2) and now considering 628/630 (removed 2) transitions.
// Phase 1: matrix 628 rows 747 cols
[2023-03-20 02:37:18] [INFO ] Computed 328 place invariants in 1 ms
[2023-03-20 02:37:18] [INFO ] Implicit Places using invariants in 422 ms returned []
[2023-03-20 02:37:18] [INFO ] Invariant cache hit.
[2023-03-20 02:37:19] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-20 02:37:19] [INFO ] Implicit Places using invariants and state equation in 1073 ms returned []
Implicit Place search using SMT with State Equation took 1516 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 747/751 places, 628/630 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2032 ms. Remains : 747/751 places, 628/630 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 207311 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :{}
Probabilistic random walk after 207311 steps, saw 172700 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-20 02:37:23] [INFO ] Invariant cache hit.
[2023-03-20 02:37:23] [INFO ] [Real]Absence check using 328 positive place invariants in 49 ms returned sat
[2023-03-20 02:37:23] [INFO ] After 298ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 02:37:23] [INFO ] [Nat]Absence check using 328 positive place invariants in 49 ms returned sat
[2023-03-20 02:37:24] [INFO ] After 379ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 02:37:24] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-20 02:37:24] [INFO ] After 89ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 02:37:24] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 0 ms to minimize.
[2023-03-20 02:37:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2023-03-20 02:37:24] [INFO ] After 369ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 102 ms.
[2023-03-20 02:37:24] [INFO ] After 1071ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 31 ms.
Support contains 4 out of 747 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 747/747 places, 628/628 transitions.
Applied a total of 0 rules in 12 ms. Remains 747 /747 variables (removed 0) and now considering 628/628 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 747/747 places, 628/628 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 747/747 places, 628/628 transitions.
Applied a total of 0 rules in 13 ms. Remains 747 /747 variables (removed 0) and now considering 628/628 (removed 0) transitions.
[2023-03-20 02:37:24] [INFO ] Invariant cache hit.
[2023-03-20 02:37:25] [INFO ] Implicit Places using invariants in 435 ms returned []
[2023-03-20 02:37:25] [INFO ] Invariant cache hit.
[2023-03-20 02:37:25] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-20 02:37:27] [INFO ] Implicit Places using invariants and state equation in 2095 ms returned []
Implicit Place search using SMT with State Equation took 2545 ms to find 0 implicit places.
[2023-03-20 02:37:27] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-20 02:37:27] [INFO ] Invariant cache hit.
[2023-03-20 02:37:27] [INFO ] Dead Transitions using invariants and state equation in 353 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2949 ms. Remains : 747/747 places, 628/628 transitions.
Partial Free-agglomeration rule applied 175 times.
Drop transitions removed 175 transitions
Iterating global reduction 0 with 175 rules applied. Total rules applied 175 place count 747 transition count 628
Applied a total of 175 rules in 28 ms. Remains 747 /747 variables (removed 0) and now considering 628/628 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 628 rows 747 cols
[2023-03-20 02:37:27] [INFO ] Computed 328 place invariants in 1 ms
[2023-03-20 02:37:27] [INFO ] [Real]Absence check using 328 positive place invariants in 69 ms returned sat
[2023-03-20 02:37:27] [INFO ] After 206ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 02:37:27] [INFO ] [Nat]Absence check using 328 positive place invariants in 49 ms returned sat
[2023-03-20 02:37:28] [INFO ] After 242ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 02:37:28] [INFO ] State equation strengthened by 173 read => feed constraints.
[2023-03-20 02:37:28] [INFO ] After 110ms SMT Verify possible using 173 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 02:37:28] [INFO ] Deduced a trap composed of 5 places in 182 ms of which 0 ms to minimize.
[2023-03-20 02:37:28] [INFO ] Deduced a trap composed of 5 places in 173 ms of which 1 ms to minimize.
[2023-03-20 02:37:28] [INFO ] Deduced a trap composed of 5 places in 166 ms of which 0 ms to minimize.
[2023-03-20 02:37:29] [INFO ] Deduced a trap composed of 6 places in 211 ms of which 1 ms to minimize.
[2023-03-20 02:37:29] [INFO ] Deduced a trap composed of 5 places in 176 ms of which 1 ms to minimize.
[2023-03-20 02:37:29] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 0 ms to minimize.
[2023-03-20 02:37:29] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1310 ms
[2023-03-20 02:37:29] [INFO ] Deduced a trap composed of 5 places in 185 ms of which 0 ms to minimize.
[2023-03-20 02:37:30] [INFO ] Deduced a trap composed of 5 places in 194 ms of which 0 ms to minimize.
[2023-03-20 02:37:30] [INFO ] Deduced a trap composed of 5 places in 233 ms of which 1 ms to minimize.
[2023-03-20 02:37:30] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 0 ms to minimize.
[2023-03-20 02:37:30] [INFO ] Deduced a trap composed of 5 places in 162 ms of which 1 ms to minimize.
[2023-03-20 02:37:30] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1209 ms
[2023-03-20 02:37:30] [INFO ] After 2727ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 82 ms.
[2023-03-20 02:37:31] [INFO ] After 3247ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (NOT (AND p1 (NOT p2) p0))), (X (AND p1 (NOT p2) (NOT p0))), true, (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2) (NOT p1))), (F p2), (F (NOT (AND (NOT p0) (NOT p2) p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 744 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 254 ms :[(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND p1 (NOT p2))]
// Phase 1: matrix 1802 rows 2012 cols
[2023-03-20 02:37:32] [INFO ] Computed 331 place invariants in 5 ms
[2023-03-20 02:37:33] [INFO ] [Real]Absence check using 331 positive place invariants in 401 ms returned sat
[2023-03-20 02:37:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 02:37:43] [INFO ] [Real]Absence check using state equation in 10248 ms returned sat
[2023-03-20 02:37:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 02:37:45] [INFO ] [Nat]Absence check using 331 positive place invariants in 402 ms returned sat
[2023-03-20 02:37:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 02:37:55] [INFO ] [Nat]Absence check using state equation in 9620 ms returned sat
[2023-03-20 02:37:55] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 1 ms to minimize.
[2023-03-20 02:37:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 273 ms
[2023-03-20 02:37:55] [INFO ] Computed and/alt/rep : 1801/2672/1801 causal constraints (skipped 0 transitions) in 192 ms.
[2023-03-20 02:38:00] [INFO ] Deduced a trap composed of 14 places in 954 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
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 02:38:00] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND p1 (NOT p2))
Could not prove EG (AND p1 (NOT p2))
Support contains 4 out of 2012 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2012/2012 places, 1802/1802 transitions.
Applied a total of 0 rules in 114 ms. Remains 2012 /2012 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
[2023-03-20 02:38:00] [INFO ] Invariant cache hit.
[2023-03-20 02:38:01] [INFO ] Implicit Places using invariants in 974 ms returned []
[2023-03-20 02:38:01] [INFO ] Invariant cache hit.
[2023-03-20 02:38:03] [INFO ] Implicit Places using invariants and state equation in 1932 ms returned []
Implicit Place search using SMT with State Equation took 2907 ms to find 0 implicit places.
[2023-03-20 02:38:03] [INFO ] Invariant cache hit.
[2023-03-20 02:38:04] [INFO ] Dead Transitions using invariants and state equation in 1129 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4151 ms. Remains : 2012/2012 places, 1802/1802 transitions.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Detected a total of 479/2012 stabilizing places and 479/1802 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), true, (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 863 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-20 02:38:05] [INFO ] Invariant cache hit.
[2023-03-20 02:38:05] [INFO ] [Real]Absence check using 331 positive place invariants in 91 ms returned sat
[2023-03-20 02:38:07] [INFO ] After 1002ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-20 02:38:07] [INFO ] Deduced a trap composed of 21 places in 543 ms of which 9 ms to minimize.
[2023-03-20 02:38:08] [INFO ] Deduced a trap composed of 19 places in 632 ms of which 1 ms to minimize.
[2023-03-20 02:38:08] [INFO ] Deduced a trap composed of 23 places in 436 ms of which 1 ms to minimize.
[2023-03-20 02:38:09] [INFO ] Deduced a trap composed of 25 places in 407 ms of which 1 ms to minimize.
[2023-03-20 02:38:09] [INFO ] Deduced a trap composed of 23 places in 549 ms of which 1 ms to minimize.
[2023-03-20 02:38:10] [INFO ] Deduced a trap composed of 25 places in 537 ms of which 1 ms to minimize.
[2023-03-20 02:38:11] [INFO ] Deduced a trap composed of 26 places in 560 ms of which 1 ms to minimize.
[2023-03-20 02:38:11] [INFO ] Deduced a trap composed of 24 places in 577 ms of which 1 ms to minimize.
[2023-03-20 02:38:12] [INFO ] Deduced a trap composed of 25 places in 399 ms of which 1 ms to minimize.
[2023-03-20 02:38:12] [INFO ] Deduced a trap composed of 17 places in 401 ms of which 1 ms to minimize.
[2023-03-20 02:38:13] [INFO ] Deduced a trap composed of 23 places in 552 ms of which 1 ms to minimize.
[2023-03-20 02:38:13] [INFO ] Deduced a trap composed of 17 places in 422 ms of which 2 ms to minimize.
[2023-03-20 02:38:14] [INFO ] Deduced a trap composed of 25 places in 415 ms of which 1 ms to minimize.
[2023-03-20 02:38:14] [INFO ] Deduced a trap composed of 26 places in 452 ms of which 1 ms to minimize.
[2023-03-20 02:38:15] [INFO ] Deduced a trap composed of 17 places in 426 ms of which 1 ms to minimize.
[2023-03-20 02:38:15] [INFO ] Deduced a trap composed of 45 places in 343 ms of which 1 ms to minimize.
[2023-03-20 02:38:16] [INFO ] Deduced a trap composed of 37 places in 371 ms of which 1 ms to minimize.
[2023-03-20 02:38:16] [INFO ] Deduced a trap composed of 44 places in 393 ms of which 1 ms to minimize.
[2023-03-20 02:38:17] [INFO ] Deduced a trap composed of 29 places in 391 ms of which 1 ms to minimize.
[2023-03-20 02:38:17] [INFO ] Deduced a trap composed of 34 places in 323 ms of which 1 ms to minimize.
[2023-03-20 02:38:18] [INFO ] Deduced a trap composed of 30 places in 656 ms of which 2 ms to minimize.
[2023-03-20 02:38:18] [INFO ] Deduced a trap composed of 20 places in 349 ms of which 1 ms to minimize.
[2023-03-20 02:38:19] [INFO ] Deduced a trap composed of 29 places in 303 ms of which 1 ms to minimize.
[2023-03-20 02:38:19] [INFO ] Deduced a trap composed of 34 places in 270 ms of which 1 ms to minimize.
[2023-03-20 02:38:19] [INFO ] Deduced a trap composed of 27 places in 334 ms of which 1 ms to minimize.
[2023-03-20 02:38:20] [INFO ] Deduced a trap composed of 39 places in 361 ms of which 1 ms to minimize.
[2023-03-20 02:38:20] [INFO ] Deduced a trap composed of 40 places in 324 ms of which 1 ms to minimize.
[2023-03-20 02:38:21] [INFO ] Deduced a trap composed of 36 places in 310 ms of which 1 ms to minimize.
[2023-03-20 02:38:21] [INFO ] Deduced a trap composed of 46 places in 349 ms of which 1 ms to minimize.
[2023-03-20 02:38:21] [INFO ] Deduced a trap composed of 35 places in 313 ms of which 1 ms to minimize.
[2023-03-20 02:38:22] [INFO ] Deduced a trap composed of 23 places in 289 ms of which 1 ms to minimize.
[2023-03-20 02:38:22] [INFO ] Deduced a trap composed of 29 places in 334 ms of which 1 ms to minimize.
[2023-03-20 02:38:22] [INFO ] Deduced a trap composed of 33 places in 275 ms of which 1 ms to minimize.
[2023-03-20 02:38:23] [INFO ] Deduced a trap composed of 33 places in 286 ms of which 1 ms to minimize.
[2023-03-20 02:38:23] [INFO ] Deduced a trap composed of 29 places in 289 ms of which 2 ms to minimize.
[2023-03-20 02:38:24] [INFO ] Deduced a trap composed of 43 places in 333 ms of which 14 ms to minimize.
[2023-03-20 02:38:24] [INFO ] Deduced a trap composed of 33 places in 336 ms of which 1 ms to minimize.
[2023-03-20 02:38:24] [INFO ] Deduced a trap composed of 41 places in 283 ms of which 1 ms to minimize.
[2023-03-20 02:38:25] [INFO ] Deduced a trap composed of 32 places in 233 ms of which 1 ms to minimize.
[2023-03-20 02:38:25] [INFO ] Deduced a trap composed of 31 places in 247 ms of which 0 ms to minimize.
[2023-03-20 02:38:25] [INFO ] Deduced a trap composed of 44 places in 278 ms of which 0 ms to minimize.
[2023-03-20 02:38:26] [INFO ] Deduced a trap composed of 30 places in 320 ms of which 4 ms to minimize.
[2023-03-20 02:38:26] [INFO ] Deduced a trap composed of 41 places in 345 ms of which 1 ms to minimize.
[2023-03-20 02:38:26] [INFO ] Deduced a trap composed of 43 places in 255 ms of which 1 ms to minimize.
[2023-03-20 02:38:27] [INFO ] Deduced a trap composed of 37 places in 260 ms of which 1 ms to minimize.
[2023-03-20 02:38:27] [INFO ] Deduced a trap composed of 54 places in 284 ms of which 0 ms to minimize.
[2023-03-20 02:38:27] [INFO ] Deduced a trap composed of 41 places in 237 ms of which 1 ms to minimize.
[2023-03-20 02:38:28] [INFO ] Deduced a trap composed of 36 places in 356 ms of which 0 ms to minimize.
[2023-03-20 02:38:28] [INFO ] Deduced a trap composed of 42 places in 261 ms of which 0 ms to minimize.
[2023-03-20 02:38:28] [INFO ] Deduced a trap composed of 39 places in 233 ms of which 0 ms to minimize.
[2023-03-20 02:38:29] [INFO ] Deduced a trap composed of 39 places in 223 ms of which 1 ms to minimize.
[2023-03-20 02:38:29] [INFO ] Deduced a trap composed of 38 places in 197 ms of which 0 ms to minimize.
[2023-03-20 02:38:30] [INFO ] Deduced a trap composed of 46 places in 443 ms of which 1 ms to minimize.
[2023-03-20 02:38:30] [INFO ] Deduced a trap composed of 41 places in 212 ms of which 1 ms to minimize.
[2023-03-20 02:38:30] [INFO ] Deduced a trap composed of 45 places in 200 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:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 02:38:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 02:38:30] [INFO ] After 25048ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 27 ms.
Support contains 4 out of 2012 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2012/2012 places, 1802/1802 transitions.
Drop transitions removed 417 transitions
Trivial Post-agglo rules discarded 417 transitions
Performed 417 trivial Post agglomeration. Transition count delta: 417
Iterating post reduction 0 with 417 rules applied. Total rules applied 417 place count 2012 transition count 1385
Reduce places removed 417 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 418 rules applied. Total rules applied 835 place count 1595 transition count 1384
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 836 place count 1594 transition count 1384
Performed 241 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 241 Pre rules applied. Total rules applied 836 place count 1594 transition count 1143
Deduced a syphon composed of 241 places in 1 ms
Reduce places removed 241 places and 0 transitions.
Iterating global reduction 3 with 482 rules applied. Total rules applied 1318 place count 1353 transition count 1143
Performed 508 Post agglomeration using F-continuation condition.Transition count delta: 508
Deduced a syphon composed of 508 places in 0 ms
Reduce places removed 508 places and 0 transitions.
Iterating global reduction 3 with 1016 rules applied. Total rules applied 2334 place count 845 transition count 635
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2335 place count 845 transition count 634
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2337 place count 844 transition count 633
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 178 rules applied. Total rules applied 2515 place count 755 transition count 633
Partial Free-agglomeration rule applied 88 times.
Drop transitions removed 88 transitions
Iterating global reduction 4 with 88 rules applied. Total rules applied 2603 place count 755 transition count 633
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2604 place count 754 transition count 632
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2605 place count 753 transition count 632
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 2605 place count 753 transition count 630
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 2609 place count 751 transition count 630
Applied a total of 2609 rules in 213 ms. Remains 751 /2012 variables (removed 1261) and now considering 630/1802 (removed 1172) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 213 ms. Remains : 751/2012 places, 630/1802 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 219199 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 219199 steps, saw 181408 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 630 rows 751 cols
[2023-03-20 02:38:34] [INFO ] Computed 330 place invariants in 1 ms
[2023-03-20 02:38:34] [INFO ] [Real]Absence check using 330 positive place invariants in 45 ms returned sat
[2023-03-20 02:38:34] [INFO ] After 230ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 02:38:34] [INFO ] [Nat]Absence check using 330 positive place invariants in 87 ms returned sat
[2023-03-20 02:38:35] [INFO ] After 497ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 02:38:35] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-20 02:38:35] [INFO ] After 106ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 02:38:35] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 0 ms to minimize.
[2023-03-20 02:38:35] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 1 ms to minimize.
[2023-03-20 02:38:35] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2023-03-20 02:38:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 375 ms
[2023-03-20 02:38:35] [INFO ] After 536ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 112 ms.
[2023-03-20 02:38:35] [INFO ] After 1401ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 16 ms.
Support contains 4 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 630/630 transitions.
Applied a total of 0 rules in 26 ms. Remains 751 /751 variables (removed 0) and now considering 630/630 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 751/751 places, 630/630 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 630/630 transitions.
Applied a total of 0 rules in 13 ms. Remains 751 /751 variables (removed 0) and now considering 630/630 (removed 0) transitions.
[2023-03-20 02:38:35] [INFO ] Invariant cache hit.
[2023-03-20 02:38:36] [INFO ] Implicit Places using invariants in 436 ms returned [734, 738]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 450 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 749/751 places, 630/630 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 747 transition count 628
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 747 transition count 628
Applied a total of 4 rules in 22 ms. Remains 747 /749 variables (removed 2) and now considering 628/630 (removed 2) transitions.
// Phase 1: matrix 628 rows 747 cols
[2023-03-20 02:38:36] [INFO ] Computed 328 place invariants in 1 ms
[2023-03-20 02:38:36] [INFO ] Implicit Places using invariants in 371 ms returned []
[2023-03-20 02:38:36] [INFO ] Invariant cache hit.
[2023-03-20 02:38:36] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-20 02:38:37] [INFO ] Implicit Places using invariants and state equation in 1203 ms returned []
Implicit Place search using SMT with State Equation took 1575 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 747/751 places, 628/630 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2060 ms. Remains : 747/751 places, 628/630 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) 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 2) seen :0
Interrupted probabilistic random walk after 209993 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :{}
Probabilistic random walk after 209993 steps, saw 174889 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-20 02:38:41] [INFO ] Invariant cache hit.
[2023-03-20 02:38:41] [INFO ] [Real]Absence check using 328 positive place invariants in 100 ms returned sat
[2023-03-20 02:38:41] [INFO ] After 367ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 02:38:41] [INFO ] [Nat]Absence check using 328 positive place invariants in 55 ms returned sat
[2023-03-20 02:38:41] [INFO ] After 369ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 02:38:41] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-20 02:38:42] [INFO ] After 72ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 02:38:42] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 0 ms to minimize.
[2023-03-20 02:38:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2023-03-20 02:38:42] [INFO ] After 337ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 86 ms.
[2023-03-20 02:38:42] [INFO ] After 1023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 34 ms.
Support contains 4 out of 747 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 747/747 places, 628/628 transitions.
Applied a total of 0 rules in 21 ms. Remains 747 /747 variables (removed 0) and now considering 628/628 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 747/747 places, 628/628 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 747/747 places, 628/628 transitions.
Applied a total of 0 rules in 16 ms. Remains 747 /747 variables (removed 0) and now considering 628/628 (removed 0) transitions.
[2023-03-20 02:38:42] [INFO ] Invariant cache hit.
[2023-03-20 02:38:42] [INFO ] Implicit Places using invariants in 473 ms returned []
[2023-03-20 02:38:42] [INFO ] Invariant cache hit.
[2023-03-20 02:38:43] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-20 02:38:44] [INFO ] Implicit Places using invariants and state equation in 1127 ms returned []
Implicit Place search using SMT with State Equation took 1631 ms to find 0 implicit places.
[2023-03-20 02:38:44] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-20 02:38:44] [INFO ] Invariant cache hit.
[2023-03-20 02:38:44] [INFO ] Dead Transitions using invariants and state equation in 382 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2048 ms. Remains : 747/747 places, 628/628 transitions.
Partial Free-agglomeration rule applied 175 times.
Drop transitions removed 175 transitions
Iterating global reduction 0 with 175 rules applied. Total rules applied 175 place count 747 transition count 628
Applied a total of 175 rules in 29 ms. Remains 747 /747 variables (removed 0) and now considering 628/628 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 628 rows 747 cols
[2023-03-20 02:38:44] [INFO ] Computed 328 place invariants in 3 ms
[2023-03-20 02:38:44] [INFO ] [Real]Absence check using 328 positive place invariants in 69 ms returned sat
[2023-03-20 02:38:44] [INFO ] After 276ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 02:38:45] [INFO ] [Nat]Absence check using 328 positive place invariants in 110 ms returned sat
[2023-03-20 02:38:45] [INFO ] After 289ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 02:38:45] [INFO ] State equation strengthened by 173 read => feed constraints.
[2023-03-20 02:38:45] [INFO ] After 125ms SMT Verify possible using 173 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 02:38:45] [INFO ] Deduced a trap composed of 5 places in 259 ms of which 1 ms to minimize.
[2023-03-20 02:38:46] [INFO ] Deduced a trap composed of 5 places in 292 ms of which 1 ms to minimize.
[2023-03-20 02:38:46] [INFO ] Deduced a trap composed of 5 places in 149 ms of which 0 ms to minimize.
[2023-03-20 02:38:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 810 ms
[2023-03-20 02:38:46] [INFO ] Deduced a trap composed of 6 places in 167 ms of which 0 ms to minimize.
[2023-03-20 02:38:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
[2023-03-20 02:38:46] [INFO ] After 1300ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 90 ms.
[2023-03-20 02:38:46] [INFO ] After 2078ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), true, (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) (NOT p2))), (F p2), (F (NOT (AND (NOT p0) p1 (NOT p2))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 991 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 258 ms :[(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 247 ms :[(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND p1 (NOT p2))]
// Phase 1: matrix 1802 rows 2012 cols
[2023-03-20 02:38:48] [INFO ] Computed 331 place invariants in 13 ms
[2023-03-20 02:38:49] [INFO ] [Real]Absence check using 331 positive place invariants in 386 ms returned sat
[2023-03-20 02:38:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 02:39:00] [INFO ] [Real]Absence check using state equation in 10213 ms returned sat
[2023-03-20 02:39:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 02:39:01] [INFO ] [Nat]Absence check using 331 positive place invariants in 405 ms returned sat
[2023-03-20 02:39:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 02:39:11] [INFO ] [Nat]Absence check using state equation in 10093 ms returned sat
[2023-03-20 02:39:11] [INFO ] Deduced a trap composed of 37 places in 138 ms of which 13 ms to minimize.
[2023-03-20 02:39:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 352 ms
[2023-03-20 02:39:12] [INFO ] Computed and/alt/rep : 1801/2672/1801 causal constraints (skipped 0 transitions) in 153 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:605)
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 02:39:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND p1 (NOT p2))
Could not prove EG (AND p1 (NOT p2))
Stuttering acceptance computed with spot in 287 ms :[(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 28463 reset in 892 ms.
Product exploration explored 100000 steps with 28442 reset in 782 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 398 ms :[(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND p1 (NOT p2))]
Support contains 4 out of 2012 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2012/2012 places, 1802/1802 transitions.
Performed 418 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 418 rules applied. Total rules applied 418 place count 2012 transition count 1802
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 151 Pre rules applied. Total rules applied 418 place count 2012 transition count 1922
Deduced a syphon composed of 569 places in 2 ms
Iterating global reduction 1 with 151 rules applied. Total rules applied 569 place count 2012 transition count 1922
Performed 569 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1138 places in 2 ms
Iterating global reduction 1 with 569 rules applied. Total rules applied 1138 place count 2012 transition count 1923
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1139 place count 2012 transition count 1922
Renaming transitions due to excessive name length > 1024 char.
Discarding 211 places :
Symmetric choice reduction at 2 with 211 rule applications. Total rules 1350 place count 1801 transition count 1710
Deduced a syphon composed of 927 places in 2 ms
Iterating global reduction 2 with 211 rules applied. Total rules applied 1561 place count 1801 transition count 1710
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 928 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1562 place count 1801 transition count 1710
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1564 place count 1799 transition count 1708
Deduced a syphon composed of 926 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1566 place count 1799 transition count 1708
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -430
Deduced a syphon composed of 1027 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1667 place count 1799 transition count 2138
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 1768 place count 1698 transition count 1936
Deduced a syphon composed of 926 places in 1 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1869 place count 1698 transition count 1936
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -73
Deduced a syphon composed of 943 places in 2 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 1886 place count 1698 transition count 2009
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1903 place count 1681 transition count 1975
Deduced a syphon composed of 926 places in 1 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 1920 place count 1681 transition count 1975
Deduced a syphon composed of 926 places in 1 ms
Applied a total of 1920 rules in 1294 ms. Remains 1681 /2012 variables (removed 331) and now considering 1975/1802 (removed -173) transitions.
[2023-03-20 02:39:19] [INFO ] Redundant transitions in 60 ms returned []
// Phase 1: matrix 1975 rows 1681 cols
[2023-03-20 02:39:19] [INFO ] Computed 331 place invariants in 14 ms
[2023-03-20 02:39:20] [INFO ] Dead Transitions using invariants and state equation in 1113 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1681/2012 places, 1975/1802 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2480 ms. Remains : 1681/2012 places, 1975/1802 transitions.
Support contains 4 out of 2012 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2012/2012 places, 1802/1802 transitions.
Applied a total of 0 rules in 112 ms. Remains 2012 /2012 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
// Phase 1: matrix 1802 rows 2012 cols
[2023-03-20 02:39:20] [INFO ] Computed 331 place invariants in 4 ms
[2023-03-20 02:39:20] [INFO ] Implicit Places using invariants in 552 ms returned []
[2023-03-20 02:39:20] [INFO ] Invariant cache hit.
[2023-03-20 02:39:22] [INFO ] Implicit Places using invariants and state equation in 1843 ms returned []
Implicit Place search using SMT with State Equation took 2422 ms to find 0 implicit places.
[2023-03-20 02:39:22] [INFO ] Invariant cache hit.
[2023-03-20 02:39:23] [INFO ] Dead Transitions using invariants and state equation in 999 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3533 ms. Remains : 2012/2012 places, 1802/1802 transitions.
Treatment of property ShieldPPPt-PT-030B-LTLFireability-04 finished in 188784 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 2020 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2020/2020 places, 1810/1810 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 423 transitions
Trivial Post-agglo rules discarded 423 transitions
Performed 423 trivial Post agglomeration. Transition count delta: 423
Iterating post reduction 0 with 423 rules applied. Total rules applied 423 place count 2019 transition count 1386
Reduce places removed 423 places and 0 transitions.
Iterating post reduction 1 with 423 rules applied. Total rules applied 846 place count 1596 transition count 1386
Performed 234 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 234 Pre rules applied. Total rules applied 846 place count 1596 transition count 1152
Deduced a syphon composed of 234 places in 2 ms
Reduce places removed 234 places and 0 transitions.
Iterating global reduction 2 with 468 rules applied. Total rules applied 1314 place count 1362 transition count 1152
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1319 place count 1357 transition count 1147
Iterating global reduction 2 with 5 rules applied. Total rules applied 1324 place count 1357 transition count 1147
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1324 place count 1357 transition count 1143
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1332 place count 1353 transition count 1143
Performed 509 Post agglomeration using F-continuation condition.Transition count delta: 509
Deduced a syphon composed of 509 places in 1 ms
Reduce places removed 509 places and 0 transitions.
Iterating global reduction 2 with 1018 rules applied. Total rules applied 2350 place count 844 transition count 634
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2351 place count 844 transition count 633
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2353 place count 843 transition count 632
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2531 place count 754 transition count 632
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2533 place count 752 transition count 630
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2534 place count 751 transition count 630
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2534 place count 751 transition count 628
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2538 place count 749 transition count 628
Applied a total of 2538 rules in 323 ms. Remains 749 /2020 variables (removed 1271) and now considering 628/1810 (removed 1182) transitions.
// Phase 1: matrix 628 rows 749 cols
[2023-03-20 02:39:24] [INFO ] Computed 330 place invariants in 2 ms
[2023-03-20 02:39:24] [INFO ] Implicit Places using invariants in 447 ms returned [732, 736]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 447 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 747/2020 places, 628/1810 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 745 transition count 626
Applied a total of 4 rules in 25 ms. Remains 745 /747 variables (removed 2) and now considering 626/628 (removed 2) transitions.
// Phase 1: matrix 626 rows 745 cols
[2023-03-20 02:39:24] [INFO ] Computed 328 place invariants in 2 ms
[2023-03-20 02:39:25] [INFO ] Implicit Places using invariants in 329 ms returned []
[2023-03-20 02:39:25] [INFO ] Invariant cache hit.
[2023-03-20 02:39:25] [INFO ] Implicit Places using invariants and state equation in 784 ms returned []
Implicit Place search using SMT with State Equation took 1116 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 745/2020 places, 626/1810 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1911 ms. Remains : 745/2020 places, 626/1810 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s703 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 514 ms.
Stack based approach found an accepted trace after 119 steps with 0 reset with depth 120 and stack size 120 in 1 ms.
FORMULA ShieldPPPt-PT-030B-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030B-LTLFireability-05 finished in 2519 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 2020 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2020/2020 places, 1810/1810 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 423 transitions
Trivial Post-agglo rules discarded 423 transitions
Performed 423 trivial Post agglomeration. Transition count delta: 423
Iterating post reduction 0 with 423 rules applied. Total rules applied 423 place count 2019 transition count 1386
Reduce places removed 423 places and 0 transitions.
Iterating post reduction 1 with 423 rules applied. Total rules applied 846 place count 1596 transition count 1386
Performed 234 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 234 Pre rules applied. Total rules applied 846 place count 1596 transition count 1152
Deduced a syphon composed of 234 places in 1 ms
Reduce places removed 234 places and 0 transitions.
Iterating global reduction 2 with 468 rules applied. Total rules applied 1314 place count 1362 transition count 1152
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1319 place count 1357 transition count 1147
Iterating global reduction 2 with 5 rules applied. Total rules applied 1324 place count 1357 transition count 1147
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1324 place count 1357 transition count 1143
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1332 place count 1353 transition count 1143
Performed 509 Post agglomeration using F-continuation condition.Transition count delta: 509
Deduced a syphon composed of 509 places in 1 ms
Reduce places removed 509 places and 0 transitions.
Iterating global reduction 2 with 1018 rules applied. Total rules applied 2350 place count 844 transition count 634
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2351 place count 844 transition count 633
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2353 place count 843 transition count 632
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2531 place count 754 transition count 632
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2533 place count 752 transition count 630
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2534 place count 751 transition count 630
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2534 place count 751 transition count 628
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2538 place count 749 transition count 628
Applied a total of 2538 rules in 301 ms. Remains 749 /2020 variables (removed 1271) and now considering 628/1810 (removed 1182) transitions.
// Phase 1: matrix 628 rows 749 cols
[2023-03-20 02:39:26] [INFO ] Computed 330 place invariants in 1 ms
[2023-03-20 02:39:27] [INFO ] Implicit Places using invariants in 483 ms returned [732, 736]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 498 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 747/2020 places, 628/1810 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 745 transition count 626
Applied a total of 4 rules in 27 ms. Remains 745 /747 variables (removed 2) and now considering 626/628 (removed 2) transitions.
// Phase 1: matrix 626 rows 745 cols
[2023-03-20 02:39:27] [INFO ] Computed 328 place invariants in 2 ms
[2023-03-20 02:39:27] [INFO ] Implicit Places using invariants in 461 ms returned []
[2023-03-20 02:39:27] [INFO ] Invariant cache hit.
[2023-03-20 02:39:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 02:39:28] [INFO ] Implicit Places using invariants and state equation in 855 ms returned []
Implicit Place search using SMT with State Equation took 1317 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 745/2020 places, 626/1810 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2143 ms. Remains : 745/2020 places, 626/1810 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s528 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 495 ms.
Product exploration explored 100000 steps with 0 reset in 744 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/745 stabilizing places and 2/626 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 323 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 283 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Support contains 1 out of 745 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 745/745 places, 626/626 transitions.
Applied a total of 0 rules in 37 ms. Remains 745 /745 variables (removed 0) and now considering 626/626 (removed 0) transitions.
[2023-03-20 02:39:30] [INFO ] Invariant cache hit.
[2023-03-20 02:39:31] [INFO ] Implicit Places using invariants in 483 ms returned []
[2023-03-20 02:39:31] [INFO ] Invariant cache hit.
[2023-03-20 02:39:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 02:39:32] [INFO ] Implicit Places using invariants and state equation in 810 ms returned []
Implicit Place search using SMT with State Equation took 1295 ms to find 0 implicit places.
[2023-03-20 02:39:32] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-20 02:39:32] [INFO ] Invariant cache hit.
[2023-03-20 02:39:32] [INFO ] Dead Transitions using invariants and state equation in 363 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1717 ms. Remains : 745/745 places, 626/626 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/745 stabilizing places and 2/626 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 185 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 229 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 653 ms.
Product exploration explored 100000 steps with 0 reset in 633 ms.
Support contains 1 out of 745 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 745/745 places, 626/626 transitions.
Applied a total of 0 rules in 13 ms. Remains 745 /745 variables (removed 0) and now considering 626/626 (removed 0) transitions.
[2023-03-20 02:39:34] [INFO ] Invariant cache hit.
[2023-03-20 02:39:35] [INFO ] Implicit Places using invariants in 571 ms returned []
[2023-03-20 02:39:35] [INFO ] Invariant cache hit.
[2023-03-20 02:39:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 02:39:35] [INFO ] Implicit Places using invariants and state equation in 771 ms returned []
Implicit Place search using SMT with State Equation took 1344 ms to find 0 implicit places.
[2023-03-20 02:39:35] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-20 02:39:35] [INFO ] Invariant cache hit.
[2023-03-20 02:39:36] [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 1821 ms. Remains : 745/745 places, 626/626 transitions.
Treatment of property ShieldPPPt-PT-030B-LTLFireability-09 finished in 9789 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1)&&F(G(p2)))))'
Support contains 3 out of 2020 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2020/2020 places, 1810/1810 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 421 transitions
Trivial Post-agglo rules discarded 421 transitions
Performed 421 trivial Post agglomeration. Transition count delta: 421
Iterating post reduction 0 with 421 rules applied. Total rules applied 421 place count 2019 transition count 1388
Reduce places removed 421 places and 0 transitions.
Iterating post reduction 1 with 421 rules applied. Total rules applied 842 place count 1598 transition count 1388
Performed 233 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 233 Pre rules applied. Total rules applied 842 place count 1598 transition count 1155
Deduced a syphon composed of 233 places in 1 ms
Reduce places removed 233 places and 0 transitions.
Iterating global reduction 2 with 466 rules applied. Total rules applied 1308 place count 1365 transition count 1155
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 1312 place count 1361 transition count 1151
Iterating global reduction 2 with 4 rules applied. Total rules applied 1316 place count 1361 transition count 1151
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 1316 place count 1361 transition count 1148
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 1322 place count 1358 transition count 1148
Performed 513 Post agglomeration using F-continuation condition.Transition count delta: 513
Deduced a syphon composed of 513 places in 1 ms
Reduce places removed 513 places and 0 transitions.
Iterating global reduction 2 with 1026 rules applied. Total rules applied 2348 place count 845 transition count 635
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2349 place count 845 transition count 634
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2351 place count 844 transition count 633
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 87 places in 1 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 2525 place count 757 transition count 633
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2527 place count 755 transition count 631
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2528 place count 754 transition count 631
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2528 place count 754 transition count 629
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2532 place count 752 transition count 629
Applied a total of 2532 rules in 262 ms. Remains 752 /2020 variables (removed 1268) and now considering 629/1810 (removed 1181) transitions.
// Phase 1: matrix 629 rows 752 cols
[2023-03-20 02:39:36] [INFO ] Computed 330 place invariants in 3 ms
[2023-03-20 02:39:36] [INFO ] Implicit Places using invariants in 368 ms returned [735, 739]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 369 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 750/2020 places, 629/1810 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 748 transition count 627
Applied a total of 4 rules in 24 ms. Remains 748 /750 variables (removed 2) and now considering 627/629 (removed 2) transitions.
// Phase 1: matrix 627 rows 748 cols
[2023-03-20 02:39:36] [INFO ] Computed 328 place invariants in 1 ms
[2023-03-20 02:39:37] [INFO ] Implicit Places using invariants in 422 ms returned []
[2023-03-20 02:39:37] [INFO ] Invariant cache hit.
[2023-03-20 02:39:38] [INFO ] Implicit Places using invariants and state equation in 704 ms returned []
Implicit Place search using SMT with State Equation took 1147 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 748/2020 places, 627/1810 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1802 ms. Remains : 748/2020 places, 627/1810 transitions.
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-10 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 p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s198 0), p1:(EQ s150 1), p2:(EQ s573 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 526 ms.
Stack based approach found an accepted trace after 1600 steps with 0 reset with depth 1601 and stack size 458 in 16 ms.
FORMULA ShieldPPPt-PT-030B-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030B-LTLFireability-10 finished in 2568 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0&&X(p1))))'
Support contains 2 out of 2020 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2020/2020 places, 1810/1810 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 2012 transition count 1802
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 2012 transition count 1802
Applied a total of 16 rules in 265 ms. Remains 2012 /2020 variables (removed 8) and now considering 1802/1810 (removed 8) transitions.
// Phase 1: matrix 1802 rows 2012 cols
[2023-03-20 02:39:39] [INFO ] Computed 331 place invariants in 10 ms
[2023-03-20 02:39:39] [INFO ] Implicit Places using invariants in 649 ms returned []
[2023-03-20 02:39:39] [INFO ] Invariant cache hit.
[2023-03-20 02:39:41] [INFO ] Implicit Places using invariants and state equation in 1787 ms returned []
Implicit Place search using SMT with State Equation took 2470 ms to find 0 implicit places.
[2023-03-20 02:39:41] [INFO ] Invariant cache hit.
[2023-03-20 02:39:42] [INFO ] Dead Transitions using invariants and state equation in 1035 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2012/2020 places, 1802/1810 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3772 ms. Remains : 2012/2020 places, 1802/1810 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s867 1), p1:(NEQ s1464 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 3984 steps with 0 reset in 45 ms.
FORMULA ShieldPPPt-PT-030B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030B-LTLFireability-12 finished in 3946 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(p1 U p2)))'
Support contains 3 out of 2020 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2020/2020 places, 1810/1810 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 422 transitions
Trivial Post-agglo rules discarded 422 transitions
Performed 422 trivial Post agglomeration. Transition count delta: 422
Iterating post reduction 0 with 422 rules applied. Total rules applied 422 place count 2019 transition count 1387
Reduce places removed 422 places and 0 transitions.
Iterating post reduction 1 with 422 rules applied. Total rules applied 844 place count 1597 transition count 1387
Performed 233 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 233 Pre rules applied. Total rules applied 844 place count 1597 transition count 1154
Deduced a syphon composed of 233 places in 1 ms
Reduce places removed 233 places and 0 transitions.
Iterating global reduction 2 with 466 rules applied. Total rules applied 1310 place count 1364 transition count 1154
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1313 place count 1361 transition count 1151
Iterating global reduction 2 with 3 rules applied. Total rules applied 1316 place count 1361 transition count 1151
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1316 place count 1361 transition count 1149
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 1320 place count 1359 transition count 1149
Performed 514 Post agglomeration using F-continuation condition.Transition count delta: 514
Deduced a syphon composed of 514 places in 0 ms
Reduce places removed 514 places and 0 transitions.
Iterating global reduction 2 with 1028 rules applied. Total rules applied 2348 place count 845 transition count 635
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2349 place count 845 transition count 634
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2351 place count 844 transition count 633
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 2527 place count 756 transition count 633
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2529 place count 754 transition count 631
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2530 place count 753 transition count 631
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2530 place count 753 transition count 629
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2534 place count 751 transition count 629
Applied a total of 2534 rules in 305 ms. Remains 751 /2020 variables (removed 1269) and now considering 629/1810 (removed 1181) transitions.
// Phase 1: matrix 629 rows 751 cols
[2023-03-20 02:39:43] [INFO ] Computed 330 place invariants in 3 ms
[2023-03-20 02:39:44] [INFO ] Implicit Places using invariants in 862 ms returned [734, 738]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 863 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 749/2020 places, 629/1810 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 747 transition count 627
Applied a total of 4 rules in 23 ms. Remains 747 /749 variables (removed 2) and now considering 627/629 (removed 2) transitions.
// Phase 1: matrix 627 rows 747 cols
[2023-03-20 02:39:44] [INFO ] Computed 328 place invariants in 1 ms
[2023-03-20 02:39:44] [INFO ] Implicit Places using invariants in 473 ms returned []
[2023-03-20 02:39:44] [INFO ] Invariant cache hit.
[2023-03-20 02:39:45] [INFO ] Implicit Places using invariants and state equation in 800 ms returned []
Implicit Place search using SMT with State Equation took 1273 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 747/2020 places, 627/1810 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2465 ms. Remains : 747/2020 places, 627/1810 transitions.
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p2:(EQ s373 1), p1:(EQ s402 1), p0:(EQ s705 0)], 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, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 15 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-030B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030B-LTLFireability-14 finished in 2655 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 2020 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2020/2020 places, 1810/1810 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 2019 transition count 1389
Reduce places removed 420 places and 0 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 840 place count 1599 transition count 1389
Performed 235 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 235 Pre rules applied. Total rules applied 840 place count 1599 transition count 1154
Deduced a syphon composed of 235 places in 2 ms
Reduce places removed 235 places and 0 transitions.
Iterating global reduction 2 with 470 rules applied. Total rules applied 1310 place count 1364 transition count 1154
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1315 place count 1359 transition count 1149
Iterating global reduction 2 with 5 rules applied. Total rules applied 1320 place count 1359 transition count 1149
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1320 place count 1359 transition count 1145
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1328 place count 1355 transition count 1145
Performed 509 Post agglomeration using F-continuation condition.Transition count delta: 509
Deduced a syphon composed of 509 places in 0 ms
Reduce places removed 509 places and 0 transitions.
Iterating global reduction 2 with 1018 rules applied. Total rules applied 2346 place count 846 transition count 636
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2347 place count 846 transition count 635
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2349 place count 845 transition count 634
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2527 place count 756 transition count 634
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2529 place count 754 transition count 632
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2530 place count 753 transition count 632
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 2530 place count 753 transition count 630
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2534 place count 751 transition count 630
Applied a total of 2534 rules in 350 ms. Remains 751 /2020 variables (removed 1269) and now considering 630/1810 (removed 1180) transitions.
// Phase 1: matrix 630 rows 751 cols
[2023-03-20 02:39:45] [INFO ] Computed 330 place invariants in 2 ms
[2023-03-20 02:39:46] [INFO ] Implicit Places using invariants in 488 ms returned [734, 738]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 503 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 749/2020 places, 630/1810 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 747 transition count 628
Applied a total of 4 rules in 27 ms. Remains 747 /749 variables (removed 2) and now considering 628/630 (removed 2) transitions.
// Phase 1: matrix 628 rows 747 cols
[2023-03-20 02:39:46] [INFO ] Computed 328 place invariants in 1 ms
[2023-03-20 02:39:46] [INFO ] Implicit Places using invariants in 351 ms returned []
[2023-03-20 02:39:46] [INFO ] Invariant cache hit.
[2023-03-20 02:39:47] [INFO ] Implicit Places using invariants and state equation in 750 ms returned []
Implicit Place search using SMT with State Equation took 1131 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 747/2020 places, 628/1810 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2012 ms. Remains : 747/2020 places, 628/1810 transitions.
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s508 1) (EQ s207 1)), p1:(AND (EQ s105 1) (EQ s123 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 529 ms.
Stack based approach found an accepted trace after 192 steps with 0 reset with depth 193 and stack size 193 in 1 ms.
FORMULA ShieldPPPt-PT-030B-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030B-LTLFireability-15 finished in 2609 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&&X((!p0 U (p1||G(!p0))))) U (!p1||F(p2))))))'
Found a Lengthening insensitive property : ShieldPPPt-PT-030B-LTLFireability-04
Stuttering acceptance computed with spot in 271 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1) p0), (AND p1 (NOT p2))]
Support contains 4 out of 2020 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2020/2020 places, 1810/1810 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 419 transitions
Trivial Post-agglo rules discarded 419 transitions
Performed 419 trivial Post agglomeration. Transition count delta: 419
Iterating post reduction 0 with 419 rules applied. Total rules applied 419 place count 2019 transition count 1390
Reduce places removed 419 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 420 rules applied. Total rules applied 839 place count 1600 transition count 1389
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 840 place count 1599 transition count 1389
Performed 235 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 235 Pre rules applied. Total rules applied 840 place count 1599 transition count 1154
Deduced a syphon composed of 235 places in 2 ms
Reduce places removed 235 places and 0 transitions.
Iterating global reduction 3 with 470 rules applied. Total rules applied 1310 place count 1364 transition count 1154
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1314 place count 1360 transition count 1150
Iterating global reduction 3 with 4 rules applied. Total rules applied 1318 place count 1360 transition count 1150
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 1318 place count 1360 transition count 1146
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 1326 place count 1356 transition count 1146
Performed 510 Post agglomeration using F-continuation condition.Transition count delta: 510
Deduced a syphon composed of 510 places in 1 ms
Reduce places removed 510 places and 0 transitions.
Iterating global reduction 3 with 1020 rules applied. Total rules applied 2346 place count 846 transition count 636
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2347 place count 846 transition count 635
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2349 place count 845 transition count 634
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 178 rules applied. Total rules applied 2527 place count 756 transition count 634
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2529 place count 754 transition count 632
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2530 place count 753 transition count 632
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 2530 place count 753 transition count 630
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 2534 place count 751 transition count 630
Applied a total of 2534 rules in 312 ms. Remains 751 /2020 variables (removed 1269) and now considering 630/1810 (removed 1180) transitions.
// Phase 1: matrix 630 rows 751 cols
[2023-03-20 02:39:48] [INFO ] Computed 330 place invariants in 2 ms
[2023-03-20 02:39:49] [INFO ] Implicit Places using invariants in 420 ms returned [734, 738]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 421 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 749/2020 places, 630/1810 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 747 transition count 628
Applied a total of 4 rules in 23 ms. Remains 747 /749 variables (removed 2) and now considering 628/630 (removed 2) transitions.
// Phase 1: matrix 628 rows 747 cols
[2023-03-20 02:39:49] [INFO ] Computed 328 place invariants in 1 ms
[2023-03-20 02:39:49] [INFO ] Implicit Places using invariants in 367 ms returned []
[2023-03-20 02:39:49] [INFO ] Invariant cache hit.
[2023-03-20 02:39:50] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-20 02:39:50] [INFO ] Implicit Places using invariants and state equation in 988 ms returned []
Implicit Place search using SMT with State Equation took 1359 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 747/2020 places, 628/1810 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2115 ms. Remains : 747/2020 places, 628/1810 transitions.
Running random walk in product with property : ShieldPPPt-PT-030B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 3}], [{ cond=(AND p1 (NOT p2) p0), acceptance={0} source=4 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(NEQ s428 1), p2:(EQ s224 1), p0:(AND (EQ s283 1) (EQ s285 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 13974 reset in 600 ms.
Stack based approach found an accepted trace after 220 steps with 32 reset with depth 5 and stack size 5 in 2 ms.
Treatment of property ShieldPPPt-PT-030B-LTLFireability-04 finished in 3128 ms.
FORMULA ShieldPPPt-PT-030B-LTLFireability-04 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-03-20 02:39:51] [INFO ] Flatten gal took : 94 ms
[2023-03-20 02:39:51] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-20 02:39:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2020 places, 1810 transitions and 4700 arcs took 15 ms.
Total runtime 346236 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldPPPt-PT-030B
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/377
LTLFireability

FORMULA ShieldPPPt-PT-030B-LTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679280007258

--------------------
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: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 4 (type EXCL) for 3 ShieldPPPt-PT-030B-LTLFireability-09
lola: time limit : 1799 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-030B-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
ShieldPPPt-PT-030B-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1799 13/32 ShieldPPPt-PT-030B-LTLFireability-09 743409 m, 148681 m/sec, 1024486 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-030B-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
ShieldPPPt-PT-030B-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1799 28/32 ShieldPPPt-PT-030B-LTLFireability-09 1545404 m, 160399 m/sec, 2166437 t fired, .

Time elapsed: 11 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for ShieldPPPt-PT-030B-LTLFireability-09 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldPPPt-PT-030B-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
ShieldPPPt-PT-030B-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 16 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 1 (type EXCL) for 0 ShieldPPPt-PT-030B-LTLFireability-04
lola: time limit : 3584 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for ShieldPPPt-PT-030B-LTLFireability-04
lola: result : false
lola: markings : 582
lola: fired transitions : 582
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 2

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-030B-LTLFireability-04: LTL false LTL model checker
ShieldPPPt-PT-030B-LTLFireability-09: LTL unknown AGGR


Time elapsed: 16 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="ShieldPPPt-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 ShieldPPPt-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-167903715500652"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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