Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r373-tall-171683788700178.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ShieldIIPt-PT-020B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683788700178
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 768K
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 12 20:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 12 20:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 12 20:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 338K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716952626397

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-020B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 03:17:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 03:17:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 03:17:08] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2024-05-29 03:17:08] [INFO ] Transformed 1403 places.
[2024-05-29 03:17:08] [INFO ] Transformed 1303 transitions.
[2024-05-29 03:17:08] [INFO ] Found NUPN structural information;
[2024-05-29 03:17:08] [INFO ] Parsed PT model containing 1403 places and 1303 transitions and 3246 arcs in 223 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldIIPt-PT-020B-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 1403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1303/1303 transitions.
Discarding 209 places :
Symmetric choice reduction at 0 with 209 rule applications. Total rules 209 place count 1194 transition count 1094
Iterating global reduction 0 with 209 rules applied. Total rules applied 418 place count 1194 transition count 1094
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 419 place count 1193 transition count 1093
Iterating global reduction 0 with 1 rules applied. Total rules applied 420 place count 1193 transition count 1093
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 421 place count 1192 transition count 1092
Iterating global reduction 0 with 1 rules applied. Total rules applied 422 place count 1192 transition count 1092
Applied a total of 422 rules in 480 ms. Remains 1192 /1403 variables (removed 211) and now considering 1092/1303 (removed 211) transitions.
// Phase 1: matrix 1092 rows 1192 cols
[2024-05-29 03:17:09] [INFO ] Computed 181 invariants in 24 ms
[2024-05-29 03:17:09] [INFO ] Implicit Places using invariants in 549 ms returned []
[2024-05-29 03:17:09] [INFO ] Invariant cache hit.
[2024-05-29 03:17:10] [INFO ] Implicit Places using invariants and state equation in 990 ms returned []
Implicit Place search using SMT with State Equation took 1570 ms to find 0 implicit places.
[2024-05-29 03:17:10] [INFO ] Invariant cache hit.
[2024-05-29 03:17:11] [INFO ] Dead Transitions using invariants and state equation in 568 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1192/1403 places, 1092/1303 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2624 ms. Remains : 1192/1403 places, 1092/1303 transitions.
Support contains 39 out of 1192 places after structural reductions.
[2024-05-29 03:17:11] [INFO ] Flatten gal took : 116 ms
[2024-05-29 03:17:11] [INFO ] Flatten gal took : 56 ms
[2024-05-29 03:17:11] [INFO ] Input system was already deterministic with 1092 transitions.
Support contains 34 out of 1192 places (down from 39) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 438 ms. (steps per millisecond=22 ) properties (out of 28) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2024-05-29 03:17:12] [INFO ] Invariant cache hit.
[2024-05-29 03:17:13] [INFO ] [Real]Absence check using 181 positive place invariants in 75 ms returned sat
[2024-05-29 03:17:13] [INFO ] After 621ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-29 03:17:13] [INFO ] [Nat]Absence check using 181 positive place invariants in 51 ms returned sat
[2024-05-29 03:17:14] [INFO ] After 878ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-05-29 03:17:14] [INFO ] Deduced a trap composed of 13 places in 236 ms of which 6 ms to minimize.
[2024-05-29 03:17:15] [INFO ] Deduced a trap composed of 17 places in 231 ms of which 1 ms to minimize.
[2024-05-29 03:17:15] [INFO ] Deduced a trap composed of 19 places in 231 ms of which 1 ms to minimize.
[2024-05-29 03:17:15] [INFO ] Deduced a trap composed of 31 places in 205 ms of which 7 ms to minimize.
[2024-05-29 03:17:15] [INFO ] Deduced a trap composed of 18 places in 203 ms of which 12 ms to minimize.
[2024-05-29 03:17:16] [INFO ] Deduced a trap composed of 19 places in 194 ms of which 1 ms to minimize.
[2024-05-29 03:17:16] [INFO ] Deduced a trap composed of 20 places in 196 ms of which 1 ms to minimize.
[2024-05-29 03:17:16] [INFO ] Deduced a trap composed of 24 places in 176 ms of which 1 ms to minimize.
[2024-05-29 03:17:16] [INFO ] Deduced a trap composed of 32 places in 192 ms of which 1 ms to minimize.
[2024-05-29 03:17:17] [INFO ] Deduced a trap composed of 19 places in 173 ms of which 0 ms to minimize.
[2024-05-29 03:17:17] [INFO ] Deduced a trap composed of 26 places in 170 ms of which 1 ms to minimize.
[2024-05-29 03:17:17] [INFO ] Deduced a trap composed of 25 places in 141 ms of which 1 ms to minimize.
[2024-05-29 03:17:17] [INFO ] Deduced a trap composed of 26 places in 144 ms of which 0 ms to minimize.
[2024-05-29 03:17:17] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 0 ms to minimize.
[2024-05-29 03:17:18] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 0 ms to minimize.
[2024-05-29 03:17:18] [INFO ] Deduced a trap composed of 27 places in 152 ms of which 0 ms to minimize.
[2024-05-29 03:17:18] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 1 ms to minimize.
[2024-05-29 03:17:18] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 1 ms to minimize.
[2024-05-29 03:17:18] [INFO ] Deduced a trap composed of 35 places in 133 ms of which 1 ms to minimize.
[2024-05-29 03:17:18] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 0 ms to minimize.
[2024-05-29 03:17:19] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 0 ms to minimize.
[2024-05-29 03:17:19] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 1 ms to minimize.
[2024-05-29 03:17:19] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 1 ms to minimize.
[2024-05-29 03:17:19] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 0 ms to minimize.
[2024-05-29 03:17:19] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 0 ms to minimize.
[2024-05-29 03:17:19] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 1 ms to minimize.
[2024-05-29 03:17:19] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 1 ms to minimize.
[2024-05-29 03:17:20] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 0 ms to minimize.
[2024-05-29 03:17:20] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 0 ms to minimize.
[2024-05-29 03:17:20] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 0 ms to minimize.
[2024-05-29 03:17:20] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 0 ms to minimize.
[2024-05-29 03:17:20] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 1 ms to minimize.
[2024-05-29 03:17:20] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 6060 ms
[2024-05-29 03:17:20] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2024-05-29 03:17:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2024-05-29 03:17:21] [INFO ] After 7738ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 404 ms.
[2024-05-29 03:17:21] [INFO ] After 8698ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 205 ms.
Support contains 14 out of 1192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1192/1192 places, 1092/1092 transitions.
Drop transitions removed 237 transitions
Trivial Post-agglo rules discarded 237 transitions
Performed 237 trivial Post agglomeration. Transition count delta: 237
Iterating post reduction 0 with 237 rules applied. Total rules applied 237 place count 1192 transition count 855
Reduce places removed 237 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 238 rules applied. Total rules applied 475 place count 955 transition count 854
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 476 place count 954 transition count 854
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 151 Pre rules applied. Total rules applied 476 place count 954 transition count 703
Deduced a syphon composed of 151 places in 2 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 3 with 302 rules applied. Total rules applied 778 place count 803 transition count 703
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 782 place count 799 transition count 699
Iterating global reduction 3 with 4 rules applied. Total rules applied 786 place count 799 transition count 699
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 786 place count 799 transition count 696
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 792 place count 796 transition count 696
Performed 339 Post agglomeration using F-continuation condition.Transition count delta: 339
Deduced a syphon composed of 339 places in 1 ms
Reduce places removed 339 places and 0 transitions.
Iterating global reduction 3 with 678 rules applied. Total rules applied 1470 place count 457 transition count 357
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1471 place count 457 transition count 356
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 1473 place count 456 transition count 355
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 4 with 110 rules applied. Total rules applied 1583 place count 401 transition count 388
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1584 place count 401 transition count 387
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 1587 place count 401 transition count 384
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1590 place count 398 transition count 384
Partial Free-agglomeration rule applied 19 times.
Drop transitions removed 19 transitions
Iterating global reduction 6 with 19 rules applied. Total rules applied 1609 place count 398 transition count 384
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1610 place count 397 transition count 383
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1612 place count 395 transition count 383
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1612 place count 395 transition count 382
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1614 place count 394 transition count 382
Applied a total of 1614 rules in 241 ms. Remains 394 /1192 variables (removed 798) and now considering 382/1092 (removed 710) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 241 ms. Remains : 394/1192 places, 382/1092 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 297 ms. (steps per millisecond=33 ) properties (out of 10) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 382 rows 394 cols
[2024-05-29 03:17:22] [INFO ] Computed 179 invariants in 6 ms
[2024-05-29 03:17:23] [INFO ] [Real]Absence check using 179 positive place invariants in 26 ms returned sat
[2024-05-29 03:17:23] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 03:17:23] [INFO ] [Nat]Absence check using 179 positive place invariants in 25 ms returned sat
[2024-05-29 03:17:23] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 03:17:23] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 03:17:23] [INFO ] After 67ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-29 03:17:23] [INFO ] After 182ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 66 ms.
[2024-05-29 03:17:23] [INFO ] After 562ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 57 ms.
Support contains 9 out of 394 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 394/394 places, 382/382 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 394 transition count 380
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 392 transition count 380
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 392 transition count 379
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 6 place count 391 transition count 379
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 388 transition count 376
Applied a total of 12 rules in 37 ms. Remains 388 /394 variables (removed 6) and now considering 376/382 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 388/394 places, 376/382 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 5) 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 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) 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 5) 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 5) seen :0
Interrupted probabilistic random walk after 209514 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :{}
Probabilistic random walk after 209514 steps, saw 135791 distinct states, run finished after 3007 ms. (steps per millisecond=69 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 376 rows 388 cols
[2024-05-29 03:17:27] [INFO ] Computed 179 invariants in 13 ms
[2024-05-29 03:17:27] [INFO ] [Real]Absence check using 179 positive place invariants in 27 ms returned sat
[2024-05-29 03:17:27] [INFO ] After 353ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 03:17:27] [INFO ] [Nat]Absence check using 179 positive place invariants in 23 ms returned sat
[2024-05-29 03:17:27] [INFO ] After 178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 03:17:27] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 03:17:27] [INFO ] After 76ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-29 03:17:28] [INFO ] After 199ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 65 ms.
[2024-05-29 03:17:28] [INFO ] After 571ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 37 ms.
Support contains 9 out of 388 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 388/388 places, 376/376 transitions.
Applied a total of 0 rules in 9 ms. Remains 388 /388 variables (removed 0) and now considering 376/376 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 388/388 places, 376/376 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 388/388 places, 376/376 transitions.
Applied a total of 0 rules in 10 ms. Remains 388 /388 variables (removed 0) and now considering 376/376 (removed 0) transitions.
[2024-05-29 03:17:28] [INFO ] Invariant cache hit.
[2024-05-29 03:17:28] [INFO ] Implicit Places using invariants in 215 ms returned [377]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 217 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 387/388 places, 376/376 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 386 transition count 375
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 386 transition count 375
Applied a total of 2 rules in 15 ms. Remains 386 /387 variables (removed 1) and now considering 375/376 (removed 1) transitions.
// Phase 1: matrix 375 rows 386 cols
[2024-05-29 03:17:28] [INFO ] Computed 178 invariants in 2 ms
[2024-05-29 03:17:28] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-05-29 03:17:28] [INFO ] Invariant cache hit.
[2024-05-29 03:17:28] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 03:17:28] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 591 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 386/388 places, 375/376 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 833 ms. Remains : 386/388 places, 375/376 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) 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 5) seen :0
Interrupted probabilistic random walk after 231873 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :{}
Probabilistic random walk after 231873 steps, saw 149511 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-29 03:17:32] [INFO ] Invariant cache hit.
[2024-05-29 03:17:32] [INFO ] [Real]Absence check using 178 positive place invariants in 33 ms returned sat
[2024-05-29 03:17:32] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 03:17:32] [INFO ] [Nat]Absence check using 178 positive place invariants in 25 ms returned sat
[2024-05-29 03:17:32] [INFO ] After 183ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 03:17:32] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 03:17:32] [INFO ] After 77ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-29 03:17:33] [INFO ] After 196ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 68 ms.
[2024-05-29 03:17:33] [INFO ] After 589ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 42 ms.
Support contains 9 out of 386 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 386/386 places, 375/375 transitions.
Applied a total of 0 rules in 10 ms. Remains 386 /386 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 386/386 places, 375/375 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 386/386 places, 375/375 transitions.
Applied a total of 0 rules in 9 ms. Remains 386 /386 variables (removed 0) and now considering 375/375 (removed 0) transitions.
[2024-05-29 03:17:33] [INFO ] Invariant cache hit.
[2024-05-29 03:17:33] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-05-29 03:17:33] [INFO ] Invariant cache hit.
[2024-05-29 03:17:33] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 03:17:33] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 609 ms to find 0 implicit places.
[2024-05-29 03:17:33] [INFO ] Redundant transitions in 25 ms returned []
[2024-05-29 03:17:33] [INFO ] Invariant cache hit.
[2024-05-29 03:17:34] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 872 ms. Remains : 386/386 places, 375/375 transitions.
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 0 with 39 rules applied. Total rules applied 39 place count 386 transition count 375
Applied a total of 39 rules in 20 ms. Remains 386 /386 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 375 rows 386 cols
[2024-05-29 03:17:34] [INFO ] Computed 178 invariants in 4 ms
[2024-05-29 03:17:34] [INFO ] [Real]Absence check using 178 positive place invariants in 34 ms returned sat
[2024-05-29 03:17:34] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 03:17:34] [INFO ] [Nat]Absence check using 178 positive place invariants in 24 ms returned sat
[2024-05-29 03:17:34] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 03:17:34] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-29 03:17:34] [INFO ] After 100ms SMT Verify possible using 35 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-29 03:17:34] [INFO ] After 227ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 86 ms.
[2024-05-29 03:17:34] [INFO ] After 643ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Computed a total of 322 stabilizing places and 322 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X((p0 U p1)))))'
Support contains 2 out of 1192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1192/1192 places, 1092/1092 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1182 transition count 1082
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1182 transition count 1082
Applied a total of 20 rules in 74 ms. Remains 1182 /1192 variables (removed 10) and now considering 1082/1092 (removed 10) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2024-05-29 03:17:35] [INFO ] Computed 181 invariants in 10 ms
[2024-05-29 03:17:35] [INFO ] Implicit Places using invariants in 351 ms returned []
[2024-05-29 03:17:35] [INFO ] Invariant cache hit.
[2024-05-29 03:17:36] [INFO ] Implicit Places using invariants and state equation in 988 ms returned []
Implicit Place search using SMT with State Equation took 1341 ms to find 0 implicit places.
[2024-05-29 03:17:36] [INFO ] Invariant cache hit.
[2024-05-29 03:17:37] [INFO ] Dead Transitions using invariants and state equation in 594 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1182/1192 places, 1082/1092 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2011 ms. Remains : 1182/1192 places, 1082/1092 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 415 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 5}, { cond=p0, acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 2}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}]], initial=4, aps=[p0:(EQ s714 1), p1:(EQ s466 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA ShieldIIPt-PT-020B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-LTLFireability-01 finished in 2498 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((X(p0) U !p1)&&G(F(p2)))))'
Support contains 4 out of 1192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1192/1192 places, 1092/1092 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1181 transition count 1081
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1181 transition count 1081
Applied a total of 22 rules in 69 ms. Remains 1181 /1192 variables (removed 11) and now considering 1081/1092 (removed 11) transitions.
// Phase 1: matrix 1081 rows 1181 cols
[2024-05-29 03:17:37] [INFO ] Computed 181 invariants in 10 ms
[2024-05-29 03:17:38] [INFO ] Implicit Places using invariants in 337 ms returned []
[2024-05-29 03:17:38] [INFO ] Invariant cache hit.
[2024-05-29 03:17:39] [INFO ] Implicit Places using invariants and state equation in 948 ms returned []
Implicit Place search using SMT with State Equation took 1292 ms to find 0 implicit places.
[2024-05-29 03:17:39] [INFO ] Invariant cache hit.
[2024-05-29 03:17:39] [INFO ] Dead Transitions using invariants and state equation in 627 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1181/1192 places, 1081/1092 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1990 ms. Remains : 1181/1192 places, 1081/1092 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p2) p1), (NOT p2), (OR (NOT p0) p1), true]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s324 1) (EQ s348 1)), p1:(OR (EQ s751 1) (AND (EQ s324 1) (EQ s348 1))), p0:(EQ s1096 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][false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 547 ms.
Stack based approach found an accepted trace after 509 steps with 0 reset with depth 510 and stack size 510 in 4 ms.
FORMULA ShieldIIPt-PT-020B-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-020B-LTLFireability-02 finished in 2713 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 1192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1192/1192 places, 1092/1092 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1181 transition count 1081
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1181 transition count 1081
Applied a total of 22 rules in 60 ms. Remains 1181 /1192 variables (removed 11) and now considering 1081/1092 (removed 11) transitions.
[2024-05-29 03:17:40] [INFO ] Invariant cache hit.
[2024-05-29 03:17:40] [INFO ] Implicit Places using invariants in 330 ms returned []
[2024-05-29 03:17:40] [INFO ] Invariant cache hit.
[2024-05-29 03:17:41] [INFO ] Implicit Places using invariants and state equation in 861 ms returned []
Implicit Place search using SMT with State Equation took 1193 ms to find 0 implicit places.
[2024-05-29 03:17:41] [INFO ] Invariant cache hit.
[2024-05-29 03:17:42] [INFO ] Dead Transitions using invariants and state equation in 616 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1181/1192 places, 1081/1092 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1872 ms. Remains : 1181/1192 places, 1081/1092 transitions.
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s1076 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 486 steps with 0 reset in 5 ms.
FORMULA ShieldIIPt-PT-020B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-LTLFireability-04 finished in 1969 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(p0)) U ((X(X(p0))&&G(p1))||X(X(G(p0)))))))'
Support contains 2 out of 1192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1192/1192 places, 1092/1092 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1182 transition count 1082
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1182 transition count 1082
Applied a total of 20 rules in 79 ms. Remains 1182 /1192 variables (removed 10) and now considering 1082/1092 (removed 10) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2024-05-29 03:17:42] [INFO ] Computed 181 invariants in 9 ms
[2024-05-29 03:17:42] [INFO ] Implicit Places using invariants in 358 ms returned []
[2024-05-29 03:17:42] [INFO ] Invariant cache hit.
[2024-05-29 03:17:43] [INFO ] Implicit Places using invariants and state equation in 908 ms returned []
Implicit Place search using SMT with State Equation took 1268 ms to find 0 implicit places.
[2024-05-29 03:17:43] [INFO ] Invariant cache hit.
[2024-05-29 03:17:44] [INFO ] Dead Transitions using invariants and state equation in 590 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1182/1192 places, 1082/1092 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1939 ms. Remains : 1182/1192 places, 1082/1092 transitions.
Stuttering acceptance computed with spot in 293 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={1} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={1} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0, 1} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p1) p0), acceptance={} source=8 dest: 6}, { cond=(AND p1 p0), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(NEQ s481 1), p0:(NEQ s304 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20017 reset in 455 ms.
Product exploration explored 100000 steps with 19997 reset in 426 ms.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Detected a total of 318/1182 stabilizing places and 318/1082 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), true, (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 151 ms. Reduced automaton from 9 states, 21 edges and 2 AP (stutter sensitive) to 9 states, 21 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 328 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-29 03:17:46] [INFO ] Invariant cache hit.
[2024-05-29 03:17:46] [INFO ] [Real]Absence check using 181 positive place invariants in 55 ms returned sat
[2024-05-29 03:17:46] [INFO ] After 486ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2024-05-29 03:17:47] [INFO ] Deduced a trap composed of 22 places in 215 ms of which 1 ms to minimize.
[2024-05-29 03:17:47] [INFO ] Deduced a trap composed of 25 places in 209 ms of which 1 ms to minimize.
[2024-05-29 03:17:47] [INFO ] Deduced a trap composed of 17 places in 202 ms of which 0 ms to minimize.
[2024-05-29 03:17:47] [INFO ] Deduced a trap composed of 24 places in 201 ms of which 2 ms to minimize.
[2024-05-29 03:17:48] [INFO ] Deduced a trap composed of 21 places in 192 ms of which 0 ms to minimize.
[2024-05-29 03:17:48] [INFO ] Deduced a trap composed of 28 places in 189 ms of which 1 ms to minimize.
[2024-05-29 03:17:48] [INFO ] Deduced a trap composed of 27 places in 181 ms of which 1 ms to minimize.
[2024-05-29 03:17:48] [INFO ] Deduced a trap composed of 23 places in 173 ms of which 1 ms to minimize.
[2024-05-29 03:17:49] [INFO ] Deduced a trap composed of 22 places in 176 ms of which 1 ms to minimize.
[2024-05-29 03:17:49] [INFO ] Deduced a trap composed of 27 places in 169 ms of which 0 ms to minimize.
[2024-05-29 03:17:49] [INFO ] Deduced a trap composed of 35 places in 167 ms of which 1 ms to minimize.
[2024-05-29 03:17:49] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 1 ms to minimize.
[2024-05-29 03:17:49] [INFO ] Deduced a trap composed of 20 places in 147 ms of which 1 ms to minimize.
[2024-05-29 03:17:50] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 0 ms to minimize.
[2024-05-29 03:17:50] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 2 ms to minimize.
[2024-05-29 03:17:50] [INFO ] Deduced a trap composed of 20 places in 148 ms of which 1 ms to minimize.
[2024-05-29 03:17:50] [INFO ] Deduced a trap composed of 34 places in 138 ms of which 0 ms to minimize.
[2024-05-29 03:17:50] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 7 ms to minimize.
[2024-05-29 03:17:50] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 0 ms to minimize.
[2024-05-29 03:17:51] [INFO ] Deduced a trap composed of 33 places in 128 ms of which 0 ms to minimize.
[2024-05-29 03:17:51] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 0 ms to minimize.
[2024-05-29 03:17:51] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 0 ms to minimize.
[2024-05-29 03:17:51] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 1 ms to minimize.
[2024-05-29 03:17:51] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 1 ms to minimize.
[2024-05-29 03:17:51] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 0 ms to minimize.
[2024-05-29 03:17:52] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 1 ms to minimize.
[2024-05-29 03:17:52] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 1 ms to minimize.
[2024-05-29 03:17:52] [INFO ] Deduced a trap composed of 35 places in 95 ms of which 2 ms to minimize.
[2024-05-29 03:17:52] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 0 ms to minimize.
[2024-05-29 03:17:52] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 1 ms to minimize.
[2024-05-29 03:17:52] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 5 ms to minimize.
[2024-05-29 03:17:52] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 5873 ms
[2024-05-29 03:17:52] [INFO ] After 6479ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 03:17:52] [INFO ] After 6769ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 03:17:53] [INFO ] [Nat]Absence check using 181 positive place invariants in 47 ms returned sat
[2024-05-29 03:17:53] [INFO ] After 523ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 03:17:54] [INFO ] Deduced a trap composed of 17 places in 228 ms of which 1 ms to minimize.
[2024-05-29 03:17:54] [INFO ] Deduced a trap composed of 21 places in 218 ms of which 1 ms to minimize.
[2024-05-29 03:17:54] [INFO ] Deduced a trap composed of 17 places in 205 ms of which 1 ms to minimize.
[2024-05-29 03:17:54] [INFO ] Deduced a trap composed of 22 places in 205 ms of which 1 ms to minimize.
[2024-05-29 03:17:54] [INFO ] Deduced a trap composed of 27 places in 200 ms of which 1 ms to minimize.
[2024-05-29 03:17:55] [INFO ] Deduced a trap composed of 28 places in 203 ms of which 1 ms to minimize.
[2024-05-29 03:17:55] [INFO ] Deduced a trap composed of 23 places in 191 ms of which 0 ms to minimize.
[2024-05-29 03:17:55] [INFO ] Deduced a trap composed of 31 places in 189 ms of which 1 ms to minimize.
[2024-05-29 03:17:55] [INFO ] Deduced a trap composed of 20 places in 193 ms of which 1 ms to minimize.
[2024-05-29 03:17:56] [INFO ] Deduced a trap composed of 17 places in 190 ms of which 0 ms to minimize.
[2024-05-29 03:17:56] [INFO ] Deduced a trap composed of 28 places in 175 ms of which 0 ms to minimize.
[2024-05-29 03:17:56] [INFO ] Deduced a trap composed of 36 places in 166 ms of which 1 ms to minimize.
[2024-05-29 03:17:56] [INFO ] Deduced a trap composed of 21 places in 154 ms of which 0 ms to minimize.
[2024-05-29 03:17:56] [INFO ] Deduced a trap composed of 30 places in 157 ms of which 0 ms to minimize.
[2024-05-29 03:17:57] [INFO ] Deduced a trap composed of 26 places in 145 ms of which 1 ms to minimize.
[2024-05-29 03:17:57] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 1 ms to minimize.
[2024-05-29 03:17:57] [INFO ] Deduced a trap composed of 22 places in 142 ms of which 0 ms to minimize.
[2024-05-29 03:17:57] [INFO ] Deduced a trap composed of 35 places in 126 ms of which 1 ms to minimize.
[2024-05-29 03:17:57] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 0 ms to minimize.
[2024-05-29 03:17:57] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 0 ms to minimize.
[2024-05-29 03:17:58] [INFO ] Deduced a trap composed of 34 places in 131 ms of which 1 ms to minimize.
[2024-05-29 03:17:58] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 0 ms to minimize.
[2024-05-29 03:17:58] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 0 ms to minimize.
[2024-05-29 03:17:58] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 1 ms to minimize.
[2024-05-29 03:17:58] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 0 ms to minimize.
[2024-05-29 03:17:58] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 1 ms to minimize.
[2024-05-29 03:17:59] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 1 ms to minimize.
[2024-05-29 03:17:59] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 0 ms to minimize.
[2024-05-29 03:17:59] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 1 ms to minimize.
[2024-05-29 03:17:59] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 1 ms to minimize.
[2024-05-29 03:17:59] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 0 ms to minimize.
[2024-05-29 03:17:59] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 1 ms to minimize.
[2024-05-29 03:17:59] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 1 ms to minimize.
[2024-05-29 03:17:59] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 0 ms to minimize.
[2024-05-29 03:18:00] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 0 ms to minimize.
[2024-05-29 03:18:00] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 6399 ms
[2024-05-29 03:18:00] [INFO ] After 7096ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 115 ms.
[2024-05-29 03:18:00] [INFO ] After 7496ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 64 ms.
Support contains 2 out of 1182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1182/1182 places, 1082/1082 transitions.
Drop transitions removed 238 transitions
Trivial Post-agglo rules discarded 238 transitions
Performed 238 trivial Post agglomeration. Transition count delta: 238
Iterating post reduction 0 with 238 rules applied. Total rules applied 238 place count 1182 transition count 844
Reduce places removed 238 places and 0 transitions.
Iterating post reduction 1 with 238 rules applied. Total rules applied 476 place count 944 transition count 844
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 160 Pre rules applied. Total rules applied 476 place count 944 transition count 684
Deduced a syphon composed of 160 places in 1 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 2 with 320 rules applied. Total rules applied 796 place count 784 transition count 684
Performed 340 Post agglomeration using F-continuation condition.Transition count delta: 340
Deduced a syphon composed of 340 places in 0 ms
Reduce places removed 340 places and 0 transitions.
Iterating global reduction 2 with 680 rules applied. Total rules applied 1476 place count 444 transition count 344
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1477 place count 444 transition count 343
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 1479 place count 443 transition count 342
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 1595 place count 385 transition count 379
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1596 place count 385 transition count 378
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1597 place count 385 transition count 377
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1598 place count 384 transition count 377
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 1618 place count 384 transition count 377
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1619 place count 383 transition count 376
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1621 place count 381 transition count 376
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1621 place count 381 transition count 375
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1623 place count 380 transition count 375
Applied a total of 1623 rules in 93 ms. Remains 380 /1182 variables (removed 802) and now considering 375/1082 (removed 707) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 380/1182 places, 375/1082 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 289525 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 289525 steps, saw 184758 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 375 rows 380 cols
[2024-05-29 03:18:03] [INFO ] Computed 179 invariants in 8 ms
[2024-05-29 03:18:03] [INFO ] [Real]Absence check using 179 positive place invariants in 27 ms returned sat
[2024-05-29 03:18:04] [INFO ] After 159ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2024-05-29 03:18:04] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 03:18:04] [INFO ] After 29ms SMT Verify possible using 4 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 03:18:04] [INFO ] After 310ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 03:18:04] [INFO ] [Nat]Absence check using 179 positive place invariants in 26 ms returned sat
[2024-05-29 03:18:04] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 03:18:04] [INFO ] After 38ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-29 03:18:04] [INFO ] After 109ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 40 ms.
[2024-05-29 03:18:04] [INFO ] After 440ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 15 ms.
Support contains 2 out of 380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 375/375 transitions.
Applied a total of 0 rules in 6 ms. Remains 380 /380 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 380/380 places, 375/375 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 375/375 transitions.
Applied a total of 0 rules in 6 ms. Remains 380 /380 variables (removed 0) and now considering 375/375 (removed 0) transitions.
[2024-05-29 03:18:04] [INFO ] Invariant cache hit.
[2024-05-29 03:18:04] [INFO ] Implicit Places using invariants in 210 ms returned [369]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 211 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 379/380 places, 375/375 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 378 transition count 374
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 378 transition count 374
Applied a total of 2 rules in 11 ms. Remains 378 /379 variables (removed 1) and now considering 374/375 (removed 1) transitions.
// Phase 1: matrix 374 rows 378 cols
[2024-05-29 03:18:04] [INFO ] Computed 178 invariants in 3 ms
[2024-05-29 03:18:05] [INFO ] Implicit Places using invariants in 232 ms returned []
[2024-05-29 03:18:05] [INFO ] Invariant cache hit.
[2024-05-29 03:18:05] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 03:18:05] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 647 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 378/380 places, 374/375 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 877 ms. Remains : 378/380 places, 374/375 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 03:18:05] [INFO ] Invariant cache hit.
[2024-05-29 03:18:05] [INFO ] [Real]Absence check using 178 positive place invariants in 24 ms returned sat
[2024-05-29 03:18:05] [INFO ] After 218ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 03:18:05] [INFO ] [Nat]Absence check using 178 positive place invariants in 24 ms returned sat
[2024-05-29 03:18:06] [INFO ] After 131ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 03:18:06] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 03:18:06] [INFO ] After 16ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 03:18:06] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-05-29 03:18:06] [INFO ] After 273ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 378 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 374/374 transitions.
Applied a total of 0 rules in 7 ms. Remains 378 /378 variables (removed 0) and now considering 374/374 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 378/378 places, 374/374 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 468866 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :{}
Probabilistic random walk after 468866 steps, saw 302881 distinct states, run finished after 3001 ms. (steps per millisecond=156 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 03:18:09] [INFO ] Invariant cache hit.
[2024-05-29 03:18:09] [INFO ] [Real]Absence check using 178 positive place invariants in 26 ms returned sat
[2024-05-29 03:18:09] [INFO ] After 228ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 03:18:09] [INFO ] [Nat]Absence check using 178 positive place invariants in 23 ms returned sat
[2024-05-29 03:18:09] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 03:18:09] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 03:18:09] [INFO ] After 16ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 03:18:09] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-05-29 03:18:09] [INFO ] After 271ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 378 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 374/374 transitions.
Applied a total of 0 rules in 13 ms. Remains 378 /378 variables (removed 0) and now considering 374/374 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 378/378 places, 374/374 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 374/374 transitions.
Applied a total of 0 rules in 9 ms. Remains 378 /378 variables (removed 0) and now considering 374/374 (removed 0) transitions.
[2024-05-29 03:18:09] [INFO ] Invariant cache hit.
[2024-05-29 03:18:09] [INFO ] Implicit Places using invariants in 226 ms returned []
[2024-05-29 03:18:09] [INFO ] Invariant cache hit.
[2024-05-29 03:18:10] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 03:18:10] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 617 ms to find 0 implicit places.
[2024-05-29 03:18:10] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-29 03:18:10] [INFO ] Invariant cache hit.
[2024-05-29 03:18:10] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 858 ms. Remains : 378/378 places, 374/374 transitions.
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 378 transition count 374
Applied a total of 40 rules in 11 ms. Remains 378 /378 variables (removed 0) and now considering 374/374 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 374 rows 378 cols
[2024-05-29 03:18:10] [INFO ] Computed 178 invariants in 1 ms
[2024-05-29 03:18:10] [INFO ] [Real]Absence check using 178 positive place invariants in 24 ms returned sat
[2024-05-29 03:18:10] [INFO ] After 246ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 03:18:10] [INFO ] [Nat]Absence check using 178 positive place invariants in 26 ms returned sat
[2024-05-29 03:18:11] [INFO ] After 147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 03:18:11] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-29 03:18:11] [INFO ] After 45ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 03:18:11] [INFO ] After 70ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2024-05-29 03:18:11] [INFO ] After 332ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p0)), true, (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) p1)), (F (NOT p0)), (F (AND p0 (NOT p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 12 factoid took 353 ms. Reduced automaton from 9 states, 21 edges and 2 AP (stutter sensitive) to 9 states, 21 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 334 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 355 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1)), (AND p0 (NOT p1))]
Support contains 2 out of 1182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1182/1182 places, 1082/1082 transitions.
Applied a total of 0 rules in 35 ms. Remains 1182 /1182 variables (removed 0) and now considering 1082/1082 (removed 0) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2024-05-29 03:18:12] [INFO ] Computed 181 invariants in 7 ms
[2024-05-29 03:18:12] [INFO ] Implicit Places using invariants in 366 ms returned []
[2024-05-29 03:18:12] [INFO ] Invariant cache hit.
[2024-05-29 03:18:13] [INFO ] Implicit Places using invariants and state equation in 895 ms returned []
Implicit Place search using SMT with State Equation took 1263 ms to find 0 implicit places.
[2024-05-29 03:18:13] [INFO ] Invariant cache hit.
[2024-05-29 03:18:14] [INFO ] Dead Transitions using invariants and state equation in 565 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1863 ms. Remains : 1182/1182 places, 1082/1082 transitions.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Detected a total of 318/1182 stabilizing places and 318/1082 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), true, (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 151 ms. Reduced automaton from 9 states, 21 edges and 2 AP (stutter sensitive) to 9 states, 21 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 319 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-29 03:18:14] [INFO ] Invariant cache hit.
[2024-05-29 03:18:15] [INFO ] [Real]Absence check using 181 positive place invariants in 45 ms returned sat
[2024-05-29 03:18:15] [INFO ] After 502ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2024-05-29 03:18:15] [INFO ] Deduced a trap composed of 22 places in 228 ms of which 0 ms to minimize.
[2024-05-29 03:18:16] [INFO ] Deduced a trap composed of 25 places in 217 ms of which 1 ms to minimize.
[2024-05-29 03:18:16] [INFO ] Deduced a trap composed of 17 places in 226 ms of which 1 ms to minimize.
[2024-05-29 03:18:16] [INFO ] Deduced a trap composed of 24 places in 227 ms of which 1 ms to minimize.
[2024-05-29 03:18:16] [INFO ] Deduced a trap composed of 21 places in 201 ms of which 1 ms to minimize.
[2024-05-29 03:18:17] [INFO ] Deduced a trap composed of 28 places in 200 ms of which 0 ms to minimize.
[2024-05-29 03:18:17] [INFO ] Deduced a trap composed of 27 places in 189 ms of which 1 ms to minimize.
[2024-05-29 03:18:17] [INFO ] Deduced a trap composed of 23 places in 187 ms of which 0 ms to minimize.
[2024-05-29 03:18:17] [INFO ] Deduced a trap composed of 22 places in 180 ms of which 1 ms to minimize.
[2024-05-29 03:18:18] [INFO ] Deduced a trap composed of 27 places in 178 ms of which 1 ms to minimize.
[2024-05-29 03:18:18] [INFO ] Deduced a trap composed of 35 places in 160 ms of which 1 ms to minimize.
[2024-05-29 03:18:18] [INFO ] Deduced a trap composed of 25 places in 155 ms of which 1 ms to minimize.
[2024-05-29 03:18:18] [INFO ] Deduced a trap composed of 20 places in 155 ms of which 0 ms to minimize.
[2024-05-29 03:18:18] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 1 ms to minimize.
[2024-05-29 03:18:19] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 0 ms to minimize.
[2024-05-29 03:18:19] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 1 ms to minimize.
[2024-05-29 03:18:19] [INFO ] Deduced a trap composed of 34 places in 150 ms of which 1 ms to minimize.
[2024-05-29 03:18:19] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 0 ms to minimize.
[2024-05-29 03:18:19] [INFO ] Deduced a trap composed of 39 places in 146 ms of which 1 ms to minimize.
[2024-05-29 03:18:20] [INFO ] Deduced a trap composed of 33 places in 143 ms of which 0 ms to minimize.
[2024-05-29 03:18:20] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 1 ms to minimize.
[2024-05-29 03:18:20] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 1 ms to minimize.
[2024-05-29 03:18:20] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 0 ms to minimize.
[2024-05-29 03:18:20] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 0 ms to minimize.
[2024-05-29 03:18:20] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 0 ms to minimize.
[2024-05-29 03:18:21] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 1 ms to minimize.
[2024-05-29 03:18:21] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 0 ms to minimize.
[2024-05-29 03:18:21] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 1 ms to minimize.
[2024-05-29 03:18:21] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 0 ms to minimize.
[2024-05-29 03:18:21] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 0 ms to minimize.
[2024-05-29 03:18:21] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 1 ms to minimize.
[2024-05-29 03:18:21] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 6136 ms
[2024-05-29 03:18:21] [INFO ] After 6768ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 03:18:21] [INFO ] After 7066ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 03:18:22] [INFO ] [Nat]Absence check using 181 positive place invariants in 51 ms returned sat
[2024-05-29 03:18:22] [INFO ] After 553ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 03:18:23] [INFO ] Deduced a trap composed of 17 places in 227 ms of which 1 ms to minimize.
[2024-05-29 03:18:23] [INFO ] Deduced a trap composed of 21 places in 219 ms of which 0 ms to minimize.
[2024-05-29 03:18:23] [INFO ] Deduced a trap composed of 17 places in 222 ms of which 1 ms to minimize.
[2024-05-29 03:18:23] [INFO ] Deduced a trap composed of 22 places in 204 ms of which 1 ms to minimize.
[2024-05-29 03:18:24] [INFO ] Deduced a trap composed of 27 places in 206 ms of which 1 ms to minimize.
[2024-05-29 03:18:24] [INFO ] Deduced a trap composed of 28 places in 226 ms of which 0 ms to minimize.
[2024-05-29 03:18:24] [INFO ] Deduced a trap composed of 23 places in 202 ms of which 1 ms to minimize.
[2024-05-29 03:18:24] [INFO ] Deduced a trap composed of 31 places in 190 ms of which 0 ms to minimize.
[2024-05-29 03:18:24] [INFO ] Deduced a trap composed of 20 places in 197 ms of which 0 ms to minimize.
[2024-05-29 03:18:25] [INFO ] Deduced a trap composed of 17 places in 188 ms of which 1 ms to minimize.
[2024-05-29 03:18:25] [INFO ] Deduced a trap composed of 28 places in 183 ms of which 1 ms to minimize.
[2024-05-29 03:18:25] [INFO ] Deduced a trap composed of 36 places in 165 ms of which 0 ms to minimize.
[2024-05-29 03:18:25] [INFO ] Deduced a trap composed of 21 places in 170 ms of which 0 ms to minimize.
[2024-05-29 03:18:26] [INFO ] Deduced a trap composed of 30 places in 153 ms of which 1 ms to minimize.
[2024-05-29 03:18:26] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 0 ms to minimize.
[2024-05-29 03:18:26] [INFO ] Deduced a trap composed of 31 places in 140 ms of which 1 ms to minimize.
[2024-05-29 03:18:26] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 0 ms to minimize.
[2024-05-29 03:18:26] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 1 ms to minimize.
[2024-05-29 03:18:26] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 1 ms to minimize.
[2024-05-29 03:18:27] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 1 ms to minimize.
[2024-05-29 03:18:27] [INFO ] Deduced a trap composed of 34 places in 132 ms of which 0 ms to minimize.
[2024-05-29 03:18:27] [INFO ] Deduced a trap composed of 35 places in 129 ms of which 1 ms to minimize.
[2024-05-29 03:18:27] [INFO ] Deduced a trap composed of 33 places in 137 ms of which 1 ms to minimize.
[2024-05-29 03:18:27] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 0 ms to minimize.
[2024-05-29 03:18:27] [INFO ] Deduced a trap composed of 33 places in 132 ms of which 1 ms to minimize.
[2024-05-29 03:18:28] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 1 ms to minimize.
[2024-05-29 03:18:28] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 0 ms to minimize.
[2024-05-29 03:18:28] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 0 ms to minimize.
[2024-05-29 03:18:28] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 0 ms to minimize.
[2024-05-29 03:18:28] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 1 ms to minimize.
[2024-05-29 03:18:28] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 0 ms to minimize.
[2024-05-29 03:18:29] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 0 ms to minimize.
[2024-05-29 03:18:29] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 0 ms to minimize.
[2024-05-29 03:18:29] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 1 ms to minimize.
[2024-05-29 03:18:29] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 1 ms to minimize.
[2024-05-29 03:18:29] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 6695 ms
[2024-05-29 03:18:29] [INFO ] After 7427ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 114 ms.
[2024-05-29 03:18:29] [INFO ] After 7832ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 50 ms.
Support contains 2 out of 1182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1182/1182 places, 1082/1082 transitions.
Drop transitions removed 238 transitions
Trivial Post-agglo rules discarded 238 transitions
Performed 238 trivial Post agglomeration. Transition count delta: 238
Iterating post reduction 0 with 238 rules applied. Total rules applied 238 place count 1182 transition count 844
Reduce places removed 238 places and 0 transitions.
Iterating post reduction 1 with 238 rules applied. Total rules applied 476 place count 944 transition count 844
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 160 Pre rules applied. Total rules applied 476 place count 944 transition count 684
Deduced a syphon composed of 160 places in 1 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 2 with 320 rules applied. Total rules applied 796 place count 784 transition count 684
Performed 340 Post agglomeration using F-continuation condition.Transition count delta: 340
Deduced a syphon composed of 340 places in 0 ms
Reduce places removed 340 places and 0 transitions.
Iterating global reduction 2 with 680 rules applied. Total rules applied 1476 place count 444 transition count 344
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1477 place count 444 transition count 343
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 1479 place count 443 transition count 342
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 1595 place count 385 transition count 379
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1596 place count 385 transition count 378
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1597 place count 385 transition count 377
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1598 place count 384 transition count 377
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 1618 place count 384 transition count 377
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1619 place count 383 transition count 376
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1621 place count 381 transition count 376
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1621 place count 381 transition count 375
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1623 place count 380 transition count 375
Applied a total of 1623 rules in 92 ms. Remains 380 /1182 variables (removed 802) and now considering 375/1082 (removed 707) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 380/1182 places, 375/1082 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 375 rows 380 cols
[2024-05-29 03:18:29] [INFO ] Computed 179 invariants in 3 ms
[2024-05-29 03:18:30] [INFO ] [Real]Absence check using 179 positive place invariants in 20 ms returned sat
[2024-05-29 03:18:30] [INFO ] After 118ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-29 03:18:30] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 03:18:30] [INFO ] After 14ms SMT Verify possible using 4 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 03:18:30] [INFO ] After 221ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 03:18:30] [INFO ] [Nat]Absence check using 179 positive place invariants in 20 ms returned sat
[2024-05-29 03:18:30] [INFO ] After 121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 03:18:30] [INFO ] After 14ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 03:18:30] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-05-29 03:18:30] [INFO ] After 260ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 375/375 transitions.
Applied a total of 0 rules in 5 ms. Remains 380 /380 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 380/380 places, 375/375 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 469516 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :{}
Probabilistic random walk after 469516 steps, saw 301706 distinct states, run finished after 3001 ms. (steps per millisecond=156 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 03:18:33] [INFO ] Invariant cache hit.
[2024-05-29 03:18:33] [INFO ] [Real]Absence check using 179 positive place invariants in 26 ms returned sat
[2024-05-29 03:18:33] [INFO ] After 242ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 03:18:33] [INFO ] [Nat]Absence check using 179 positive place invariants in 26 ms returned sat
[2024-05-29 03:18:34] [INFO ] After 134ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 03:18:34] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 03:18:34] [INFO ] After 15ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 03:18:34] [INFO ] After 34ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2024-05-29 03:18:34] [INFO ] After 285ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 375/375 transitions.
Applied a total of 0 rules in 13 ms. Remains 380 /380 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 380/380 places, 375/375 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 375/375 transitions.
Applied a total of 0 rules in 7 ms. Remains 380 /380 variables (removed 0) and now considering 375/375 (removed 0) transitions.
[2024-05-29 03:18:34] [INFO ] Invariant cache hit.
[2024-05-29 03:18:34] [INFO ] Implicit Places using invariants in 245 ms returned [369]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 246 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 379/380 places, 375/375 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 378 transition count 374
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 378 transition count 374
Applied a total of 2 rules in 9 ms. Remains 378 /379 variables (removed 1) and now considering 374/375 (removed 1) transitions.
// Phase 1: matrix 374 rows 378 cols
[2024-05-29 03:18:34] [INFO ] Computed 178 invariants in 2 ms
[2024-05-29 03:18:34] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-05-29 03:18:34] [INFO ] Invariant cache hit.
[2024-05-29 03:18:34] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 03:18:34] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 608 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 378/380 places, 374/375 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 870 ms. Remains : 378/380 places, 374/375 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 480485 steps, run timeout after 3001 ms. (steps per millisecond=160 ) properties seen :{}
Probabilistic random walk after 480485 steps, saw 310352 distinct states, run finished after 3002 ms. (steps per millisecond=160 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 03:18:38] [INFO ] Invariant cache hit.
[2024-05-29 03:18:38] [INFO ] [Real]Absence check using 178 positive place invariants in 25 ms returned sat
[2024-05-29 03:18:38] [INFO ] After 229ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 03:18:38] [INFO ] [Nat]Absence check using 178 positive place invariants in 25 ms returned sat
[2024-05-29 03:18:38] [INFO ] After 132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 03:18:38] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 03:18:38] [INFO ] After 14ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 03:18:38] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-29 03:18:38] [INFO ] After 276ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 378 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 374/374 transitions.
Applied a total of 0 rules in 5 ms. Remains 378 /378 variables (removed 0) and now considering 374/374 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 378/378 places, 374/374 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 374/374 transitions.
Applied a total of 0 rules in 5 ms. Remains 378 /378 variables (removed 0) and now considering 374/374 (removed 0) transitions.
[2024-05-29 03:18:38] [INFO ] Invariant cache hit.
[2024-05-29 03:18:38] [INFO ] Implicit Places using invariants in 229 ms returned []
[2024-05-29 03:18:38] [INFO ] Invariant cache hit.
[2024-05-29 03:18:39] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 03:18:39] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 607 ms to find 0 implicit places.
[2024-05-29 03:18:39] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-29 03:18:39] [INFO ] Invariant cache hit.
[2024-05-29 03:18:39] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 832 ms. Remains : 378/378 places, 374/374 transitions.
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 378 transition count 374
Applied a total of 40 rules in 10 ms. Remains 378 /378 variables (removed 0) and now considering 374/374 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 374 rows 378 cols
[2024-05-29 03:18:39] [INFO ] Computed 178 invariants in 2 ms
[2024-05-29 03:18:39] [INFO ] [Real]Absence check using 178 positive place invariants in 23 ms returned sat
[2024-05-29 03:18:39] [INFO ] After 231ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 03:18:39] [INFO ] [Nat]Absence check using 178 positive place invariants in 26 ms returned sat
[2024-05-29 03:18:39] [INFO ] After 145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 03:18:39] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-29 03:18:39] [INFO ] After 51ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 03:18:40] [INFO ] After 77ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2024-05-29 03:18:40] [INFO ] After 340ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), true, (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) p1)), (F (NOT p0)), (F (AND p0 (NOT p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 12 factoid took 359 ms. Reduced automaton from 9 states, 21 edges and 2 AP (stutter sensitive) to 9 states, 21 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 384 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 360 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 338 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 20005 reset in 423 ms.
Product exploration explored 100000 steps with 19961 reset in 394 ms.
Applying partial POR strategy [false, false, false, false, true, true, true, true, true]
Stuttering acceptance computed with spot in 335 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1)), (AND p0 (NOT p1))]
Support contains 2 out of 1182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1182/1182 places, 1082/1082 transitions.
Performed 238 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 238 rules applied. Total rules applied 238 place count 1182 transition count 1082
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 81 Pre rules applied. Total rules applied 238 place count 1182 transition count 1143
Deduced a syphon composed of 319 places in 0 ms
Iterating global reduction 1 with 81 rules applied. Total rules applied 319 place count 1182 transition count 1143
Performed 399 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 718 places in 0 ms
Iterating global reduction 1 with 399 rules applied. Total rules applied 718 place count 1182 transition count 1143
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 719 place count 1182 transition count 1142
Renaming transitions due to excessive name length > 1024 char.
Discarding 159 places :
Symmetric choice reduction at 2 with 159 rule applications. Total rules 878 place count 1023 transition count 983
Deduced a syphon composed of 559 places in 1 ms
Iterating global reduction 2 with 159 rules applied. Total rules applied 1037 place count 1023 transition count 983
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 560 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1038 place count 1023 transition count 983
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1040 place count 1021 transition count 981
Deduced a syphon composed of 558 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1042 place count 1021 transition count 981
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: -410
Deduced a syphon composed of 636 places in 1 ms
Iterating global reduction 2 with 78 rules applied. Total rules applied 1120 place count 1021 transition count 1391
Discarding 78 places :
Symmetric choice reduction at 2 with 78 rule applications. Total rules 1198 place count 943 transition count 1235
Deduced a syphon composed of 558 places in 0 ms
Iterating global reduction 2 with 78 rules applied. Total rules applied 1276 place count 943 transition count 1235
Deduced a syphon composed of 558 places in 1 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 1285 place count 943 transition count 1226
Deduced a syphon composed of 558 places in 1 ms
Applied a total of 1285 rules in 482 ms. Remains 943 /1182 variables (removed 239) and now considering 1226/1082 (removed -144) transitions.
[2024-05-29 03:18:43] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 1226 rows 943 cols
[2024-05-29 03:18:43] [INFO ] Computed 181 invariants in 10 ms
[2024-05-29 03:18:43] [INFO ] Dead Transitions using invariants and state equation in 590 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 943/1182 places, 1226/1082 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1107 ms. Remains : 943/1182 places, 1226/1082 transitions.
Built C files in :
/tmp/ltsmin9952295959341732992
[2024-05-29 03:18:43] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9952295959341732992
Running compilation step : cd /tmp/ltsmin9952295959341732992;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1833 ms.
Running link step : cd /tmp/ltsmin9952295959341732992;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin9952295959341732992;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16341889206552408531.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 1182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1182/1182 places, 1082/1082 transitions.
Applied a total of 0 rules in 46 ms. Remains 1182 /1182 variables (removed 0) and now considering 1082/1082 (removed 0) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2024-05-29 03:18:59] [INFO ] Computed 181 invariants in 3 ms
[2024-05-29 03:18:59] [INFO ] Implicit Places using invariants in 344 ms returned []
[2024-05-29 03:18:59] [INFO ] Invariant cache hit.
[2024-05-29 03:19:00] [INFO ] Implicit Places using invariants and state equation in 866 ms returned []
Implicit Place search using SMT with State Equation took 1211 ms to find 0 implicit places.
[2024-05-29 03:19:00] [INFO ] Invariant cache hit.
[2024-05-29 03:19:00] [INFO ] Dead Transitions using invariants and state equation in 545 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1806 ms. Remains : 1182/1182 places, 1082/1082 transitions.
Built C files in :
/tmp/ltsmin8387619517364509130
[2024-05-29 03:19:01] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8387619517364509130
Running compilation step : cd /tmp/ltsmin8387619517364509130;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1708 ms.
Running link step : cd /tmp/ltsmin8387619517364509130;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin8387619517364509130;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1750114415692510659.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 03:19:16] [INFO ] Flatten gal took : 40 ms
[2024-05-29 03:19:16] [INFO ] Flatten gal took : 39 ms
[2024-05-29 03:19:16] [INFO ] Time to serialize gal into /tmp/LTL1351197224978574427.gal : 8 ms
[2024-05-29 03:19:16] [INFO ] Time to serialize properties into /tmp/LTL6460665993288353583.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1351197224978574427.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1217810311755788794.hoa' '-atoms' '/tmp/LTL6460665993288353583.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL6460665993288353583.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1217810311755788794.hoa
Detected timeout of ITS tools.
[2024-05-29 03:19:31] [INFO ] Flatten gal took : 32 ms
[2024-05-29 03:19:31] [INFO ] Flatten gal took : 31 ms
[2024-05-29 03:19:31] [INFO ] Time to serialize gal into /tmp/LTL7162096192301845133.gal : 8 ms
[2024-05-29 03:19:31] [INFO ] Time to serialize properties into /tmp/LTL15680726715778317126.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7162096192301845133.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15680726715778317126.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((X(X("(p356!=1)")))U((X(X(G("(p356!=1)"))))||((X(X("(p356!=1)")))&&(G("(p566!=1)")))))))
Formula 0 simplified : X(XX!"(p356!=1)" R (XXF!"(p356!=1)" & (XX!"(p356!=1)" | F!"(p566!=1)")))
Detected timeout of ITS tools.
[2024-05-29 03:19:46] [INFO ] Flatten gal took : 31 ms
[2024-05-29 03:19:46] [INFO ] Applying decomposition
[2024-05-29 03:19:46] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph9297880955254357756.txt' '-o' '/tmp/graph9297880955254357756.bin' '-w' '/tmp/graph9297880955254357756.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9297880955254357756.bin' '-l' '-1' '-v' '-w' '/tmp/graph9297880955254357756.weights' '-q' '0' '-e' '0.001'
[2024-05-29 03:19:46] [INFO ] Decomposing Gal with order
[2024-05-29 03:19:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:19:46] [INFO ] Removed a total of 201 redundant transitions.
[2024-05-29 03:19:46] [INFO ] Flatten gal took : 91 ms
[2024-05-29 03:19:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2024-05-29 03:19:46] [INFO ] Time to serialize gal into /tmp/LTL17113798749767969919.gal : 13 ms
[2024-05-29 03:19:46] [INFO ] Time to serialize properties into /tmp/LTL18086200369084228108.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17113798749767969919.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18086200369084228108.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X((X(X("(i4.i0.i3.u114.p356!=1)")))U((X(X(G("(i4.i0.i3.u114.p356!=1)"))))||((X(X("(i4.i0.i3.u114.p356!=1)")))&&(G("(i7.u182.p566!=1...164
Formula 0 simplified : X(XX!"(i4.i0.i3.u114.p356!=1)" R (XXF!"(i4.i0.i3.u114.p356!=1)" & (XX!"(i4.i0.i3.u114.p356!=1)" | F!"(i7.u182.p566!=1)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4201238814408615746
[2024-05-29 03:20:01] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4201238814408615746
Running compilation step : cd /tmp/ltsmin4201238814408615746;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1688 ms.
Running link step : cd /tmp/ltsmin4201238814408615746;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin4201238814408615746;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X(X((LTLAPp0==true))) U (X(X([]((LTLAPp0==true))))||(X(X((LTLAPp0==true)))&&[]((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPt-PT-020B-LTLFireability-05 finished in 154726 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0 U (p1||G(p0))))))'
Support contains 2 out of 1192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1192/1192 places, 1092/1092 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1182 transition count 1082
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1182 transition count 1082
Applied a total of 20 rules in 84 ms. Remains 1182 /1192 variables (removed 10) and now considering 1082/1092 (removed 10) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2024-05-29 03:20:17] [INFO ] Computed 181 invariants in 6 ms
[2024-05-29 03:20:17] [INFO ] Implicit Places using invariants in 360 ms returned []
[2024-05-29 03:20:17] [INFO ] Invariant cache hit.
[2024-05-29 03:20:18] [INFO ] Implicit Places using invariants and state equation in 890 ms returned []
Implicit Place search using SMT with State Equation took 1252 ms to find 0 implicit places.
[2024-05-29 03:20:18] [INFO ] Invariant cache hit.
[2024-05-29 03:20:18] [INFO ] Dead Transitions using invariants and state equation in 564 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1182/1192 places, 1082/1092 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1901 ms. Remains : 1182/1192 places, 1082/1092 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s77 1) (NEQ s536 1)), p0:(NEQ s536 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 390 ms.
Product exploration explored 100000 steps with 1 reset in 550 ms.
Computed a total of 319 stabilizing places and 319 stable transitions
Computed a total of 319 stabilizing places and 319 stable transitions
Detected a total of 319/1182 stabilizing places and 319/1082 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 03:20:20] [INFO ] Invariant cache hit.
[2024-05-29 03:20:20] [INFO ] [Real]Absence check using 181 positive place invariants in 52 ms returned sat
[2024-05-29 03:20:20] [INFO ] After 240ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-29 03:20:20] [INFO ] [Nat]Absence check using 181 positive place invariants in 50 ms returned sat
[2024-05-29 03:20:21] [INFO ] After 472ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-29 03:20:21] [INFO ] Deduced a trap composed of 24 places in 199 ms of which 0 ms to minimize.
[2024-05-29 03:20:21] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 1 ms to minimize.
[2024-05-29 03:20:22] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 0 ms to minimize.
[2024-05-29 03:20:22] [INFO ] Deduced a trap composed of 22 places in 170 ms of which 0 ms to minimize.
[2024-05-29 03:20:22] [INFO ] Deduced a trap composed of 29 places in 176 ms of which 0 ms to minimize.
[2024-05-29 03:20:22] [INFO ] Deduced a trap composed of 25 places in 173 ms of which 0 ms to minimize.
[2024-05-29 03:20:22] [INFO ] Deduced a trap composed of 26 places in 161 ms of which 0 ms to minimize.
[2024-05-29 03:20:23] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 0 ms to minimize.
[2024-05-29 03:20:23] [INFO ] Deduced a trap composed of 21 places in 154 ms of which 1 ms to minimize.
[2024-05-29 03:20:23] [INFO ] Deduced a trap composed of 29 places in 151 ms of which 0 ms to minimize.
[2024-05-29 03:20:23] [INFO ] Deduced a trap composed of 27 places in 152 ms of which 1 ms to minimize.
[2024-05-29 03:20:23] [INFO ] Deduced a trap composed of 26 places in 157 ms of which 1 ms to minimize.
[2024-05-29 03:20:24] [INFO ] Deduced a trap composed of 29 places in 145 ms of which 0 ms to minimize.
[2024-05-29 03:20:24] [INFO ] Deduced a trap composed of 29 places in 142 ms of which 0 ms to minimize.
[2024-05-29 03:20:24] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 1 ms to minimize.
[2024-05-29 03:20:24] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 0 ms to minimize.
[2024-05-29 03:20:24] [INFO ] Deduced a trap composed of 42 places in 128 ms of which 0 ms to minimize.
[2024-05-29 03:20:24] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 1 ms to minimize.
[2024-05-29 03:20:25] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 0 ms to minimize.
[2024-05-29 03:20:25] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 0 ms to minimize.
[2024-05-29 03:20:25] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 1 ms to minimize.
[2024-05-29 03:20:25] [INFO ] Deduced a trap composed of 33 places in 111 ms of which 0 ms to minimize.
[2024-05-29 03:20:25] [INFO ] Deduced a trap composed of 35 places in 108 ms of which 1 ms to minimize.
[2024-05-29 03:20:25] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 1 ms to minimize.
[2024-05-29 03:20:25] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 1 ms to minimize.
[2024-05-29 03:20:26] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 0 ms to minimize.
[2024-05-29 03:20:26] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 0 ms to minimize.
[2024-05-29 03:20:26] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 0 ms to minimize.
[2024-05-29 03:20:26] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 4968 ms
[2024-05-29 03:20:26] [INFO ] After 5474ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2024-05-29 03:20:26] [INFO ] After 5761ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 1182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1182/1182 places, 1082/1082 transitions.
Drop transitions removed 237 transitions
Trivial Post-agglo rules discarded 237 transitions
Performed 237 trivial Post agglomeration. Transition count delta: 237
Iterating post reduction 0 with 237 rules applied. Total rules applied 237 place count 1182 transition count 845
Reduce places removed 237 places and 0 transitions.
Iterating post reduction 1 with 237 rules applied. Total rules applied 474 place count 945 transition count 845
Performed 161 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 161 Pre rules applied. Total rules applied 474 place count 945 transition count 684
Deduced a syphon composed of 161 places in 1 ms
Reduce places removed 161 places and 0 transitions.
Iterating global reduction 2 with 322 rules applied. Total rules applied 796 place count 784 transition count 684
Performed 340 Post agglomeration using F-continuation condition.Transition count delta: 340
Deduced a syphon composed of 340 places in 0 ms
Reduce places removed 340 places and 0 transitions.
Iterating global reduction 2 with 680 rules applied. Total rules applied 1476 place count 444 transition count 344
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1477 place count 444 transition count 343
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 1479 place count 443 transition count 342
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 1595 place count 385 transition count 379
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1596 place count 385 transition count 378
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 4 with 20 rules applied. Total rules applied 1616 place count 385 transition count 378
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1617 place count 384 transition count 377
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1619 place count 382 transition count 377
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1619 place count 382 transition count 376
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1621 place count 381 transition count 376
Applied a total of 1621 rules in 92 ms. Remains 381 /1182 variables (removed 801) and now considering 376/1082 (removed 706) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 381/1182 places, 376/1082 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 501126 steps, run timeout after 3001 ms. (steps per millisecond=166 ) properties seen :{}
Probabilistic random walk after 501126 steps, saw 322815 distinct states, run finished after 3001 ms. (steps per millisecond=166 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 376 rows 381 cols
[2024-05-29 03:20:29] [INFO ] Computed 179 invariants in 4 ms
[2024-05-29 03:20:29] [INFO ] [Real]Absence check using 179 positive place invariants in 22 ms returned sat
[2024-05-29 03:20:29] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 03:20:29] [INFO ] [Nat]Absence check using 179 positive place invariants in 23 ms returned sat
[2024-05-29 03:20:29] [INFO ] After 125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 03:20:29] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 03:20:29] [INFO ] After 12ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 03:20:29] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2024-05-29 03:20:30] [INFO ] After 282ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 381 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 381/381 places, 376/376 transitions.
Applied a total of 0 rules in 5 ms. Remains 381 /381 variables (removed 0) and now considering 376/376 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 381/381 places, 376/376 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 381/381 places, 376/376 transitions.
Applied a total of 0 rules in 6 ms. Remains 381 /381 variables (removed 0) and now considering 376/376 (removed 0) transitions.
[2024-05-29 03:20:30] [INFO ] Invariant cache hit.
[2024-05-29 03:20:30] [INFO ] Implicit Places using invariants in 227 ms returned [370]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 228 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 380/381 places, 376/376 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 379 transition count 375
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 379 transition count 375
Applied a total of 2 rules in 9 ms. Remains 379 /380 variables (removed 1) and now considering 375/376 (removed 1) transitions.
// Phase 1: matrix 375 rows 379 cols
[2024-05-29 03:20:30] [INFO ] Computed 178 invariants in 2 ms
[2024-05-29 03:20:30] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-05-29 03:20:30] [INFO ] Invariant cache hit.
[2024-05-29 03:20:30] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 03:20:30] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 379/381 places, 375/376 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 831 ms. Remains : 379/381 places, 375/376 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 508968 steps, run timeout after 3001 ms. (steps per millisecond=169 ) properties seen :{}
Probabilistic random walk after 508968 steps, saw 328566 distinct states, run finished after 3001 ms. (steps per millisecond=169 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 03:20:33] [INFO ] Invariant cache hit.
[2024-05-29 03:20:34] [INFO ] [Real]Absence check using 178 positive place invariants in 22 ms returned sat
[2024-05-29 03:20:34] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 03:20:34] [INFO ] [Nat]Absence check using 178 positive place invariants in 22 ms returned sat
[2024-05-29 03:20:34] [INFO ] After 121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 03:20:34] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 03:20:34] [INFO ] After 13ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 03:20:34] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-05-29 03:20:34] [INFO ] After 275ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 379 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 379/379 places, 375/375 transitions.
Applied a total of 0 rules in 5 ms. Remains 379 /379 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 379/379 places, 375/375 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 379/379 places, 375/375 transitions.
Applied a total of 0 rules in 5 ms. Remains 379 /379 variables (removed 0) and now considering 375/375 (removed 0) transitions.
[2024-05-29 03:20:34] [INFO ] Invariant cache hit.
[2024-05-29 03:20:34] [INFO ] Implicit Places using invariants in 254 ms returned []
[2024-05-29 03:20:34] [INFO ] Invariant cache hit.
[2024-05-29 03:20:34] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 03:20:34] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 637 ms to find 0 implicit places.
[2024-05-29 03:20:34] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-29 03:20:34] [INFO ] Invariant cache hit.
[2024-05-29 03:20:35] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 835 ms. Remains : 379/379 places, 375/375 transitions.
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 379 transition count 375
Applied a total of 40 rules in 10 ms. Remains 379 /379 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 375 rows 379 cols
[2024-05-29 03:20:35] [INFO ] Computed 178 invariants in 1 ms
[2024-05-29 03:20:35] [INFO ] [Real]Absence check using 178 positive place invariants in 23 ms returned sat
[2024-05-29 03:20:35] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 03:20:35] [INFO ] [Nat]Absence check using 178 positive place invariants in 22 ms returned sat
[2024-05-29 03:20:35] [INFO ] After 128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 03:20:35] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-29 03:20:35] [INFO ] After 45ms SMT Verify possible using 38 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 03:20:35] [INFO ] After 73ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2024-05-29 03:20:35] [INFO ] After 300ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 188 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), false]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), false]
Support contains 2 out of 1182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1182/1182 places, 1082/1082 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 237 transitions
Trivial Post-agglo rules discarded 237 transitions
Performed 237 trivial Post agglomeration. Transition count delta: 237
Iterating post reduction 0 with 237 rules applied. Total rules applied 237 place count 1181 transition count 844
Reduce places removed 237 places and 0 transitions.
Iterating post reduction 1 with 237 rules applied. Total rules applied 474 place count 944 transition count 844
Performed 161 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 161 Pre rules applied. Total rules applied 474 place count 944 transition count 683
Deduced a syphon composed of 161 places in 0 ms
Reduce places removed 161 places and 0 transitions.
Iterating global reduction 2 with 322 rules applied. Total rules applied 796 place count 783 transition count 683
Performed 338 Post agglomeration using F-continuation condition.Transition count delta: 338
Deduced a syphon composed of 338 places in 0 ms
Reduce places removed 338 places and 0 transitions.
Iterating global reduction 2 with 676 rules applied. Total rules applied 1472 place count 445 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1473 place count 445 transition count 344
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 1475 place count 444 transition count 343
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 1591 place count 386 transition count 380
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1593 place count 384 transition count 378
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1595 place count 382 transition count 378
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1595 place count 382 transition count 377
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 1597 place count 381 transition count 377
Applied a total of 1597 rules in 91 ms. Remains 381 /1182 variables (removed 801) and now considering 377/1082 (removed 705) transitions.
// Phase 1: matrix 377 rows 381 cols
[2024-05-29 03:20:36] [INFO ] Computed 179 invariants in 2 ms
[2024-05-29 03:20:36] [INFO ] Implicit Places using invariants in 395 ms returned [370]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 396 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 380/1182 places, 377/1082 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 379 transition count 376
Applied a total of 2 rules in 11 ms. Remains 379 /380 variables (removed 1) and now considering 376/377 (removed 1) transitions.
// Phase 1: matrix 376 rows 379 cols
[2024-05-29 03:20:36] [INFO ] Computed 178 invariants in 2 ms
[2024-05-29 03:20:36] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-05-29 03:20:36] [INFO ] Invariant cache hit.
[2024-05-29 03:20:36] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 03:20:37] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 575 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 379/1182 places, 376/1082 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1075 ms. Remains : 379/1182 places, 376/1082 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/379 stabilizing places and 2/376 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 4 factoid took 285 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 03:20:37] [INFO ] Invariant cache hit.
[2024-05-29 03:20:37] [INFO ] [Real]Absence check using 178 positive place invariants in 22 ms returned sat
[2024-05-29 03:20:37] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 03:20:37] [INFO ] [Nat]Absence check using 178 positive place invariants in 23 ms returned sat
[2024-05-29 03:20:37] [INFO ] After 121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 03:20:37] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 03:20:37] [INFO ] After 13ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 03:20:37] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-29 03:20:37] [INFO ] After 266ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 379 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 379/379 places, 376/376 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 379 transition count 375
Applied a total of 1 rules in 5 ms. Remains 379 /379 variables (removed 0) and now considering 375/376 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 379/379 places, 375/376 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 550709 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :{}
Probabilistic random walk after 550709 steps, saw 348214 distinct states, run finished after 3002 ms. (steps per millisecond=183 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 375 rows 379 cols
[2024-05-29 03:20:41] [INFO ] Computed 178 invariants in 4 ms
[2024-05-29 03:20:41] [INFO ] [Real]Absence check using 178 positive place invariants in 23 ms returned sat
[2024-05-29 03:20:41] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 03:20:41] [INFO ] [Nat]Absence check using 178 positive place invariants in 23 ms returned sat
[2024-05-29 03:20:41] [INFO ] After 139ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 03:20:41] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 03:20:41] [INFO ] After 13ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 03:20:41] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-05-29 03:20:41] [INFO ] After 278ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 379 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 379/379 places, 375/375 transitions.
Applied a total of 0 rules in 4 ms. Remains 379 /379 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 379/379 places, 375/375 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 379/379 places, 375/375 transitions.
Applied a total of 0 rules in 4 ms. Remains 379 /379 variables (removed 0) and now considering 375/375 (removed 0) transitions.
[2024-05-29 03:20:41] [INFO ] Invariant cache hit.
[2024-05-29 03:20:41] [INFO ] Implicit Places using invariants in 204 ms returned []
[2024-05-29 03:20:41] [INFO ] Invariant cache hit.
[2024-05-29 03:20:41] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 03:20:42] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 568 ms to find 0 implicit places.
[2024-05-29 03:20:42] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-29 03:20:42] [INFO ] Invariant cache hit.
[2024-05-29 03:20:42] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 761 ms. Remains : 379/379 places, 375/375 transitions.
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 379 transition count 375
Applied a total of 40 rules in 10 ms. Remains 379 /379 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 375 rows 379 cols
[2024-05-29 03:20:42] [INFO ] Computed 178 invariants in 1 ms
[2024-05-29 03:20:42] [INFO ] [Real]Absence check using 178 positive place invariants in 23 ms returned sat
[2024-05-29 03:20:42] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 03:20:42] [INFO ] [Nat]Absence check using 178 positive place invariants in 26 ms returned sat
[2024-05-29 03:20:42] [INFO ] After 138ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 03:20:42] [INFO ] After 161ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-05-29 03:20:42] [INFO ] After 271ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 4 factoid took 290 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), false]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), false]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0), false]
Stuttering criterion allowed to conclude after 81954 steps with 2 reset in 384 ms.
FORMULA ShieldIIPt-PT-020B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-LTLFireability-06 finished in 26519 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (p1||G(p0)))))'
Support contains 2 out of 1192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1192/1192 places, 1092/1092 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1182 transition count 1082
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1182 transition count 1082
Applied a total of 20 rules in 59 ms. Remains 1182 /1192 variables (removed 10) and now considering 1082/1092 (removed 10) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2024-05-29 03:20:43] [INFO ] Computed 181 invariants in 9 ms
[2024-05-29 03:20:44] [INFO ] Implicit Places using invariants in 363 ms returned []
[2024-05-29 03:20:44] [INFO ] Invariant cache hit.
[2024-05-29 03:20:44] [INFO ] Implicit Places using invariants and state equation in 880 ms returned []
Implicit Place search using SMT with State Equation took 1244 ms to find 0 implicit places.
[2024-05-29 03:20:44] [INFO ] Invariant cache hit.
[2024-05-29 03:20:45] [INFO ] Dead Transitions using invariants and state equation in 572 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1182/1192 places, 1082/1092 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1876 ms. Remains : 1182/1192 places, 1082/1092 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (NEQ s797 1) (NEQ s304 1)), p0:(NEQ s304 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 730 ms.
Product exploration explored 100000 steps with 50000 reset in 736 ms.
Computed a total of 319 stabilizing places and 319 stable transitions
Computed a total of 319 stabilizing places and 319 stable transitions
Detected a total of 319/1182 stabilizing places and 319/1082 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 104 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-020B-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-020B-LTLFireability-07 finished in 3555 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 2 out of 1192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1192/1192 places, 1092/1092 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 244 transitions
Trivial Post-agglo rules discarded 244 transitions
Performed 244 trivial Post agglomeration. Transition count delta: 244
Iterating post reduction 0 with 244 rules applied. Total rules applied 244 place count 1191 transition count 847
Reduce places removed 244 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 246 rules applied. Total rules applied 490 place count 947 transition count 845
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 492 place count 945 transition count 845
Performed 152 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 152 Pre rules applied. Total rules applied 492 place count 945 transition count 693
Deduced a syphon composed of 152 places in 0 ms
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 3 with 304 rules applied. Total rules applied 796 place count 793 transition count 693
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 803 place count 786 transition count 686
Iterating global reduction 3 with 7 rules applied. Total rules applied 810 place count 786 transition count 686
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 810 place count 786 transition count 681
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 820 place count 781 transition count 681
Performed 336 Post agglomeration using F-continuation condition.Transition count delta: 336
Deduced a syphon composed of 336 places in 0 ms
Reduce places removed 336 places and 0 transitions.
Iterating global reduction 3 with 672 rules applied. Total rules applied 1492 place count 445 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1493 place count 445 transition count 344
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 1495 place count 444 transition count 343
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1611 place count 386 transition count 381
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1613 place count 384 transition count 379
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1615 place count 382 transition count 379
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1615 place count 382 transition count 378
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1617 place count 381 transition count 378
Applied a total of 1617 rules in 92 ms. Remains 381 /1192 variables (removed 811) and now considering 378/1092 (removed 714) transitions.
// Phase 1: matrix 378 rows 381 cols
[2024-05-29 03:20:47] [INFO ] Computed 179 invariants in 2 ms
[2024-05-29 03:20:47] [INFO ] Implicit Places using invariants in 212 ms returned [370]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 216 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 380/1192 places, 378/1092 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 379 transition count 377
Applied a total of 2 rules in 8 ms. Remains 379 /380 variables (removed 1) and now considering 377/378 (removed 1) transitions.
// Phase 1: matrix 377 rows 379 cols
[2024-05-29 03:20:47] [INFO ] Computed 178 invariants in 1 ms
[2024-05-29 03:20:47] [INFO ] Implicit Places using invariants in 217 ms returned []
[2024-05-29 03:20:47] [INFO ] Invariant cache hit.
[2024-05-29 03:20:47] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 03:20:48] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 575 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 379/1192 places, 377/1092 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 892 ms. Remains : 379/1192 places, 377/1092 transitions.
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), 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:(EQ s37 1), p1:(EQ s265 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-020B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-LTLFireability-08 finished in 1064 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((G(p0)&&X(p1)))))))'
Support contains 3 out of 1192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1192/1192 places, 1092/1092 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1182 transition count 1082
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1182 transition count 1082
Applied a total of 20 rules in 64 ms. Remains 1182 /1192 variables (removed 10) and now considering 1082/1092 (removed 10) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2024-05-29 03:20:48] [INFO ] Computed 181 invariants in 9 ms
[2024-05-29 03:20:48] [INFO ] Implicit Places using invariants in 328 ms returned []
[2024-05-29 03:20:48] [INFO ] Invariant cache hit.
[2024-05-29 03:20:49] [INFO ] Implicit Places using invariants and state equation in 950 ms returned []
Implicit Place search using SMT with State Equation took 1281 ms to find 0 implicit places.
[2024-05-29 03:20:49] [INFO ] Invariant cache hit.
[2024-05-29 03:20:50] [INFO ] Dead Transitions using invariants and state equation in 590 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1182/1192 places, 1082/1092 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1937 ms. Remains : 1182/1192 places, 1082/1092 transitions.
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}, { cond=p0, acceptance={0} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s1137 0) (EQ s1159 0)), p1:(EQ s704 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 285 reset in 368 ms.
Stack based approach found an accepted trace after 6696 steps with 14 reset with depth 624 and stack size 611 in 30 ms.
FORMULA ShieldIIPt-PT-020B-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-020B-LTLFireability-09 finished in 2575 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0||G(p1)||X(F(p2))) U p3))'
Support contains 4 out of 1192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1192/1192 places, 1092/1092 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 244 transitions
Trivial Post-agglo rules discarded 244 transitions
Performed 244 trivial Post agglomeration. Transition count delta: 244
Iterating post reduction 0 with 244 rules applied. Total rules applied 244 place count 1191 transition count 847
Reduce places removed 244 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 245 rules applied. Total rules applied 489 place count 947 transition count 846
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 490 place count 946 transition count 846
Performed 152 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 152 Pre rules applied. Total rules applied 490 place count 946 transition count 694
Deduced a syphon composed of 152 places in 0 ms
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 3 with 304 rules applied. Total rules applied 794 place count 794 transition count 694
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 799 place count 789 transition count 689
Iterating global reduction 3 with 5 rules applied. Total rules applied 804 place count 789 transition count 689
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 804 place count 789 transition count 685
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 812 place count 785 transition count 685
Performed 336 Post agglomeration using F-continuation condition.Transition count delta: 336
Deduced a syphon composed of 336 places in 1 ms
Reduce places removed 336 places and 0 transitions.
Iterating global reduction 3 with 672 rules applied. Total rules applied 1484 place count 449 transition count 349
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1485 place count 449 transition count 348
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 1487 place count 448 transition count 347
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 4 with 118 rules applied. Total rules applied 1605 place count 389 transition count 386
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1607 place count 387 transition count 384
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1609 place count 385 transition count 384
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1609 place count 385 transition count 383
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1611 place count 384 transition count 383
Applied a total of 1611 rules in 89 ms. Remains 384 /1192 variables (removed 808) and now considering 383/1092 (removed 709) transitions.
// Phase 1: matrix 383 rows 384 cols
[2024-05-29 03:20:50] [INFO ] Computed 179 invariants in 2 ms
[2024-05-29 03:20:51] [INFO ] Implicit Places using invariants in 211 ms returned [373]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 212 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 383/1192 places, 383/1092 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 382 transition count 382
Applied a total of 2 rules in 7 ms. Remains 382 /383 variables (removed 1) and now considering 382/383 (removed 1) transitions.
// Phase 1: matrix 382 rows 382 cols
[2024-05-29 03:20:51] [INFO ] Computed 178 invariants in 1 ms
[2024-05-29 03:20:51] [INFO ] Implicit Places using invariants in 205 ms returned []
[2024-05-29 03:20:51] [INFO ] Invariant cache hit.
[2024-05-29 03:20:51] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-29 03:20:51] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 382/1192 places, 382/1092 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 945 ms. Remains : 382/1192 places, 382/1092 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p3), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p3) p0 p1), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p3:(EQ s211 1), p0:(AND (EQ s111 1) (NEQ s350 1)), p1:(NEQ s350 1), p2:(EQ s131 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-020B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-LTLFireability-11 finished in 1078 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U X((p1&&(G(p0) U p2)))))'
Support contains 4 out of 1192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1192/1192 places, 1092/1092 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1181 transition count 1081
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1181 transition count 1081
Applied a total of 22 rules in 66 ms. Remains 1181 /1192 variables (removed 11) and now considering 1081/1092 (removed 11) transitions.
// Phase 1: matrix 1081 rows 1181 cols
[2024-05-29 03:20:51] [INFO ] Computed 181 invariants in 9 ms
[2024-05-29 03:20:52] [INFO ] Implicit Places using invariants in 363 ms returned []
[2024-05-29 03:20:52] [INFO ] Invariant cache hit.
[2024-05-29 03:20:53] [INFO ] Implicit Places using invariants and state equation in 862 ms returned []
Implicit Place search using SMT with State Equation took 1227 ms to find 0 implicit places.
[2024-05-29 03:20:53] [INFO ] Invariant cache hit.
[2024-05-29 03:20:53] [INFO ] Dead Transitions using invariants and state equation in 570 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1181/1192 places, 1081/1092 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1864 ms. Remains : 1181/1192 places, 1081/1092 transitions.
Stuttering acceptance computed with spot in 275 ms :[(NOT p0), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p0) (NOT p2)), true, (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p2), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}, { cond=p0, acceptance={} source=4 dest: 6}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={0} source=5 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 6}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p2)) (NOT p1)), acceptance={} source=6 dest: 3}]], initial=4, aps=[p0:(AND (EQ s33 1) (EQ s62 1)), p1:(NEQ s578 1), p2:(EQ s487 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 126 reset in 433 ms.
Stack based approach found an accepted trace after 8628 steps with 46 reset with depth 2331 and stack size 2331 in 33 ms.
FORMULA ShieldIIPt-PT-020B-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-020B-LTLFireability-12 finished in 2626 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 1192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1192/1192 places, 1092/1092 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 246 transitions
Trivial Post-agglo rules discarded 246 transitions
Performed 246 trivial Post agglomeration. Transition count delta: 246
Iterating post reduction 0 with 246 rules applied. Total rules applied 246 place count 1191 transition count 845
Reduce places removed 246 places and 0 transitions.
Iterating post reduction 1 with 246 rules applied. Total rules applied 492 place count 945 transition count 845
Performed 152 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 152 Pre rules applied. Total rules applied 492 place count 945 transition count 693
Deduced a syphon composed of 152 places in 0 ms
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 2 with 304 rules applied. Total rules applied 796 place count 793 transition count 693
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 803 place count 786 transition count 686
Iterating global reduction 2 with 7 rules applied. Total rules applied 810 place count 786 transition count 686
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 810 place count 786 transition count 681
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 820 place count 781 transition count 681
Performed 336 Post agglomeration using F-continuation condition.Transition count delta: 336
Deduced a syphon composed of 336 places in 0 ms
Reduce places removed 336 places and 0 transitions.
Iterating global reduction 2 with 672 rules applied. Total rules applied 1492 place count 445 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1493 place count 445 transition count 344
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 1495 place count 444 transition count 343
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1613 place count 385 transition count 382
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1615 place count 383 transition count 380
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1617 place count 381 transition count 380
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1617 place count 381 transition count 379
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 1619 place count 380 transition count 379
Applied a total of 1619 rules in 99 ms. Remains 380 /1192 variables (removed 812) and now considering 379/1092 (removed 713) transitions.
// Phase 1: matrix 379 rows 380 cols
[2024-05-29 03:20:54] [INFO ] Computed 179 invariants in 1 ms
[2024-05-29 03:20:54] [INFO ] Implicit Places using invariants in 222 ms returned [369]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 224 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 379/1192 places, 379/1092 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 378 transition count 378
Applied a total of 2 rules in 8 ms. Remains 378 /379 variables (removed 1) and now considering 378/379 (removed 1) transitions.
// Phase 1: matrix 378 rows 378 cols
[2024-05-29 03:20:54] [INFO ] Computed 178 invariants in 1 ms
[2024-05-29 03:20:55] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-05-29 03:20:55] [INFO ] Invariant cache hit.
[2024-05-29 03:20:55] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 579 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 378/1192 places, 378/1092 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 911 ms. Remains : 378/1192 places, 378/1092 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s12 1) (EQ s39 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-020B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-LTLFireability-13 finished in 961 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((p0&&G(p1)))&&X(X(F(p2))))))'
Support contains 5 out of 1192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1192/1192 places, 1092/1092 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1182 transition count 1082
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1182 transition count 1082
Applied a total of 20 rules in 69 ms. Remains 1182 /1192 variables (removed 10) and now considering 1082/1092 (removed 10) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2024-05-29 03:20:55] [INFO ] Computed 181 invariants in 7 ms
[2024-05-29 03:20:55] [INFO ] Implicit Places using invariants in 359 ms returned []
[2024-05-29 03:20:55] [INFO ] Invariant cache hit.
[2024-05-29 03:20:56] [INFO ] Implicit Places using invariants and state equation in 904 ms returned []
Implicit Place search using SMT with State Equation took 1265 ms to find 0 implicit places.
[2024-05-29 03:20:56] [INFO ] Invariant cache hit.
[2024-05-29 03:20:57] [INFO ] Dead Transitions using invariants and state equation in 543 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1182/1192 places, 1082/1092 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1877 ms. Remains : 1182/1192 places, 1082/1092 transitions.
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s972 0) (EQ s983 0) (EQ s1009 0)), p1:(EQ s298 0), p2:(EQ s1179 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 382 ms.
Stack based approach found an accepted trace after 95394 steps with 1 reset with depth 95322 and stack size 34372 in 602 ms.
FORMULA ShieldIIPt-PT-020B-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-020B-LTLFireability-14 finished in 3137 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1192/1192 places, 1092/1092 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 245 transitions
Trivial Post-agglo rules discarded 245 transitions
Performed 245 trivial Post agglomeration. Transition count delta: 245
Iterating post reduction 0 with 245 rules applied. Total rules applied 245 place count 1191 transition count 846
Reduce places removed 245 places and 0 transitions.
Iterating post reduction 1 with 245 rules applied. Total rules applied 490 place count 946 transition count 846
Performed 153 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 153 Pre rules applied. Total rules applied 490 place count 946 transition count 693
Deduced a syphon composed of 153 places in 1 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 2 with 306 rules applied. Total rules applied 796 place count 793 transition count 693
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 802 place count 787 transition count 687
Iterating global reduction 2 with 6 rules applied. Total rules applied 808 place count 787 transition count 687
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 808 place count 787 transition count 683
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 816 place count 783 transition count 683
Performed 339 Post agglomeration using F-continuation condition.Transition count delta: 339
Deduced a syphon composed of 339 places in 1 ms
Reduce places removed 339 places and 0 transitions.
Iterating global reduction 2 with 678 rules applied. Total rules applied 1494 place count 444 transition count 344
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1495 place count 444 transition count 343
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 1497 place count 443 transition count 342
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1615 place count 384 transition count 381
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1617 place count 382 transition count 379
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1619 place count 380 transition count 379
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1619 place count 380 transition count 378
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 1621 place count 379 transition count 378
Applied a total of 1621 rules in 93 ms. Remains 379 /1192 variables (removed 813) and now considering 378/1092 (removed 714) transitions.
// Phase 1: matrix 378 rows 379 cols
[2024-05-29 03:20:58] [INFO ] Computed 179 invariants in 2 ms
[2024-05-29 03:20:58] [INFO ] Implicit Places using invariants in 218 ms returned [368]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 220 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 378/1192 places, 378/1092 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 377 transition count 377
Applied a total of 2 rules in 9 ms. Remains 377 /378 variables (removed 1) and now considering 377/378 (removed 1) transitions.
// Phase 1: matrix 377 rows 377 cols
[2024-05-29 03:20:58] [INFO ] Computed 178 invariants in 1 ms
[2024-05-29 03:20:59] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-05-29 03:20:59] [INFO ] Invariant cache hit.
[2024-05-29 03:20:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 03:20:59] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 578 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 377/1192 places, 377/1092 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 902 ms. Remains : 377/1192 places, 377/1092 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s324 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-020B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-LTLFireability-15 finished in 1001 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(p0)) U ((X(X(p0))&&G(p1))||X(X(G(p0)))))))'
[2024-05-29 03:20:59] [INFO ] Flatten gal took : 23 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5167212372217064700
[2024-05-29 03:20:59] [INFO ] Applying decomposition
[2024-05-29 03:20:59] [INFO ] Computing symmetric may disable matrix : 1092 transitions.
[2024-05-29 03:20:59] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:20:59] [INFO ] Computing symmetric may enable matrix : 1092 transitions.
[2024-05-29 03:20:59] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:20:59] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13617000198404399923.txt' '-o' '/tmp/graph13617000198404399923.bin' '-w' '/tmp/graph13617000198404399923.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13617000198404399923.bin' '-l' '-1' '-v' '-w' '/tmp/graph13617000198404399923.weights' '-q' '0' '-e' '0.001'
[2024-05-29 03:20:59] [INFO ] Decomposing Gal with order
[2024-05-29 03:20:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:20:59] [INFO ] Removed a total of 200 redundant transitions.
[2024-05-29 03:20:59] [INFO ] Flatten gal took : 49 ms
[2024-05-29 03:20:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-29 03:20:59] [INFO ] Computing Do-Not-Accords matrix : 1092 transitions.
[2024-05-29 03:20:59] [INFO ] Time to serialize gal into /tmp/LTLFireability3342465279694059466.gal : 8 ms
[2024-05-29 03:20:59] [INFO ] Time to serialize properties into /tmp/LTLFireability9895086248915353214.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3342465279694059466.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9895086248915353214.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
[2024-05-29 03:21:00] [INFO ] Computation of Completed DNA matrix. took 33 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:21:00] [INFO ] Built C files in 287ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5167212372217064700
Running compilation step : cd /tmp/ltsmin5167212372217064700;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Checking formula 0 : !((X((X(X("(i5.u118.p356!=1)")))U(((X(X("(i5.u118.p356!=1)")))&&(G("(i8.u187.p566!=1)")))||(X(X(G("(i5.u118.p356!=1)"))))))))
Formula 0 simplified : X(XX!"(i5.u118.p356!=1)" R (XXF!"(i5.u118.p356!=1)" & (XX!"(i5.u118.p356!=1)" | F!"(i8.u187.p566!=1)")))
Compilation finished in 3048 ms.
Running link step : cd /tmp/ltsmin5167212372217064700;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin5167212372217064700;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X(X((LTLAPp0==true))) U ((X(X((LTLAPp0==true)))&&[]((LTLAPp1==true)))||X(X([]((LTLAPp0==true)))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.112: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.112: LTL layer: formula: X((X(X((LTLAPp0==true))) U ((X(X((LTLAPp0==true)))&&[]((LTLAPp1==true)))||X(X([]((LTLAPp0==true)))))))
pins2lts-mc-linux64( 3/ 8), 0.112: "X((X(X((LTLAPp0==true))) U ((X(X((LTLAPp0==true)))&&[]((LTLAPp1==true)))||X(X([]((LTLAPp0==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.112: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.142: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.155: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.155: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.160: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.161: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.171: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.174: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.186: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.538: DFS-FIFO for weak LTL, using special progress label 1095
pins2lts-mc-linux64( 0/ 8), 0.538: There are 1096 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.538: State length is 1193, there are 1115 groups
pins2lts-mc-linux64( 0/ 8), 0.538: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.538: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.538: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.538: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.583: ~1 levels ~960 states ~4672 transitions
pins2lts-mc-linux64( 5/ 8), 0.626: ~1 levels ~1920 states ~10768 transitions
pins2lts-mc-linux64( 5/ 8), 0.760: ~1 levels ~3840 states ~24256 transitions
pins2lts-mc-linux64( 5/ 8), 1.067: ~1 levels ~7680 states ~54544 transitions
pins2lts-mc-linux64( 5/ 8), 1.713: ~1 levels ~15360 states ~116408 transitions
pins2lts-mc-linux64( 5/ 8), 2.808: ~1 levels ~30720 states ~249064 transitions
pins2lts-mc-linux64( 5/ 8), 5.032: ~1 levels ~61440 states ~527992 transitions
pins2lts-mc-linux64( 5/ 8), 9.267: ~1 levels ~122880 states ~1111296 transitions
pins2lts-mc-linux64( 5/ 8), 17.464: ~1 levels ~245760 states ~2449992 transitions
pins2lts-mc-linux64( 7/ 8), 33.678: ~1 levels ~491520 states ~5078872 transitions
pins2lts-mc-linux64( 5/ 8), 65.629: ~1 levels ~983040 states ~10617096 transitions
pins2lts-mc-linux64( 3/ 8), 130.176: ~1 levels ~1966080 states ~21309568 transitions
pins2lts-mc-linux64( 3/ 8), 260.280: ~1 levels ~3932160 states ~44323480 transitions
pins2lts-mc-linux64( 3/ 8), 526.725: ~1 levels ~7864320 states ~92368632 transitions
pins2lts-mc-linux64( 6/ 8), 938.547: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 938.606:
pins2lts-mc-linux64( 0/ 8), 938.606: mean standard work distribution: 0.9% (states) 2.7% (transitions)
pins2lts-mc-linux64( 0/ 8), 938.606:
pins2lts-mc-linux64( 0/ 8), 938.606: Explored 13548137 states 176104569 transitions, fanout: 12.998
pins2lts-mc-linux64( 0/ 8), 938.606: Total exploration time 938.040 sec (938.000 sec minimum, 938.020 sec on average)
pins2lts-mc-linux64( 0/ 8), 938.606: States per second: 14443, Transitions per second: 187737
pins2lts-mc-linux64( 0/ 8), 938.606:
pins2lts-mc-linux64( 0/ 8), 938.606: Progress states detected: 33677074
pins2lts-mc-linux64( 0/ 8), 938.606: Redundant explorations: -59.7705
pins2lts-mc-linux64( 0/ 8), 938.606:
pins2lts-mc-linux64( 0/ 8), 938.606: Queue width: 8B, total height: 33214205, memory: 253.40MB
pins2lts-mc-linux64( 0/ 8), 938.606: Tree memory: 512.9MB, 16.0 B/state, compr.: 0.3%
pins2lts-mc-linux64( 0/ 8), 938.606: Tree fill ratio (roots/leafs): 25.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 938.606: Stored 1120 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 938.637: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 938.638: Est. total memory use: 766.3MB (~1277.4MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5167212372217064700;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X(X((LTLAPp0==true))) U ((X(X((LTLAPp0==true)))&&[]((LTLAPp1==true)))||X(X([]((LTLAPp0==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5167212372217064700;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X(X((LTLAPp0==true))) U ((X(X((LTLAPp0==true)))&&[]((LTLAPp1==true)))||X(X([]((LTLAPp0==true)))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-29 03:42:18] [INFO ] Applying decomposition
[2024-05-29 03:42:19] [INFO ] Flatten gal took : 593 ms
[2024-05-29 03:42:19] [INFO ] Decomposing Gal with order
[2024-05-29 03:42:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 03:42:20] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-29 03:42:20] [INFO ] Flatten gal took : 376 ms
[2024-05-29 03:42:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 52 ms.
[2024-05-29 03:42:26] [INFO ] Time to serialize gal into /tmp/LTLFireability3788203249186423068.gal : 83 ms
[2024-05-29 03:42:26] [INFO ] Time to serialize properties into /tmp/LTLFireability18403124645888993305.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3788203249186423068.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18403124645888993305.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((X(X("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u104.p356!=1)")))U(((X(X("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0...326
Formula 0 simplified : X(XX!"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u104.p356!=1)" R (XXF!"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0...307
Detected timeout of ITS tools.
[2024-05-29 04:03:48] [INFO ] Flatten gal took : 717 ms
[2024-05-29 04:03:51] [INFO ] Input system was already deterministic with 1092 transitions.
[2024-05-29 04:03:51] [INFO ] Transformed 1192 places.
[2024-05-29 04:03:52] [INFO ] Transformed 1092 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-29 04:03:52] [INFO ] Time to serialize gal into /tmp/LTLFireability6536212740879288802.gal : 94 ms
[2024-05-29 04:03:52] [INFO ] Time to serialize properties into /tmp/LTLFireability14405142784854838825.ltl : 13 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6536212740879288802.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14405142784854838825.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((X(X("(p356!=1)")))U(((X(X("(p356!=1)")))&&(G("(p566!=1)")))||(X(X(G("(p356!=1)"))))))))
Formula 0 simplified : X(XX!"(p356!=1)" R (XXF!"(p356!=1)" & (XX!"(p356!=1)" | F!"(p566!=1)")))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 148280 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16275416 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-020B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is ShieldIIPt-PT-020B, 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 r373-tall-171683788700178"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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