Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r222-tall-165286024700092.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldIIPs-PT-010B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286024700092
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 6.4K Apr 29 15:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 29 15:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 29 15:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 29 15:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 08:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 164K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652923386737

Running Version 202205111006
[2022-05-19 01:23:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 01:23:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 01:23:08] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2022-05-19 01:23:08] [INFO ] Transformed 603 places.
[2022-05-19 01:23:08] [INFO ] Transformed 593 transitions.
[2022-05-19 01:23:08] [INFO ] Found NUPN structural information;
[2022-05-19 01:23:08] [INFO ] Parsed PT model containing 603 places and 593 transitions in 216 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 2 formulas.
FORMULA ShieldIIPs-PT-010B-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-010B-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 603/603 places, 593/593 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 542 transition count 532
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 542 transition count 532
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 123 place count 541 transition count 531
Iterating global reduction 0 with 1 rules applied. Total rules applied 124 place count 541 transition count 531
Applied a total of 124 rules in 107 ms. Remains 541 /603 variables (removed 62) and now considering 531/593 (removed 62) transitions.
// Phase 1: matrix 531 rows 541 cols
[2022-05-19 01:23:08] [INFO ] Computed 91 place invariants in 23 ms
[2022-05-19 01:23:08] [INFO ] Implicit Places using invariants in 301 ms returned []
// Phase 1: matrix 531 rows 541 cols
[2022-05-19 01:23:08] [INFO ] Computed 91 place invariants in 4 ms
[2022-05-19 01:23:09] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 729 ms to find 0 implicit places.
// Phase 1: matrix 531 rows 541 cols
[2022-05-19 01:23:09] [INFO ] Computed 91 place invariants in 5 ms
[2022-05-19 01:23:09] [INFO ] Dead Transitions using invariants and state equation in 237 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 541/603 places, 531/593 transitions.
Finished structural reductions, in 1 iterations. Remains : 541/603 places, 531/593 transitions.
Support contains 42 out of 541 places after structural reductions.
[2022-05-19 01:23:09] [INFO ] Flatten gal took : 68 ms
[2022-05-19 01:23:09] [INFO ] Flatten gal took : 33 ms
[2022-05-19 01:23:09] [INFO ] Input system was already deterministic with 531 transitions.
Support contains 40 out of 541 places (down from 42) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 29) seen :27
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 531 rows 541 cols
[2022-05-19 01:23:09] [INFO ] Computed 91 place invariants in 2 ms
[2022-05-19 01:23:10] [INFO ] [Real]Absence check using 91 positive place invariants in 18 ms returned sat
[2022-05-19 01:23:10] [INFO ] After 330ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 01:23:10] [INFO ] [Nat]Absence check using 91 positive place invariants in 29 ms returned sat
[2022-05-19 01:23:10] [INFO ] After 192ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 01:23:10] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 4 ms to minimize.
[2022-05-19 01:23:10] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
[2022-05-19 01:23:11] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 0 ms to minimize.
[2022-05-19 01:23:11] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 0 ms to minimize.
[2022-05-19 01:23:11] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2022-05-19 01:23:11] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2022-05-19 01:23:11] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 0 ms to minimize.
[2022-05-19 01:23:11] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 0 ms to minimize.
[2022-05-19 01:23:11] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2022-05-19 01:23:11] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 0 ms to minimize.
[2022-05-19 01:23:11] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2022-05-19 01:23:11] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 0 ms to minimize.
[2022-05-19 01:23:11] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 0 ms to minimize.
[2022-05-19 01:23:11] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1116 ms
[2022-05-19 01:23:11] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2022-05-19 01:23:11] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 0 ms to minimize.
[2022-05-19 01:23:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 167 ms
[2022-05-19 01:23:11] [INFO ] After 1510ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 46 ms.
[2022-05-19 01:23:12] [INFO ] After 1704ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 21 ms.
Support contains 5 out of 541 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 541/541 places, 531/531 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 541 transition count 480
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 102 place count 490 transition count 480
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 102 place count 490 transition count 429
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 204 place count 439 transition count 429
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 213 place count 430 transition count 420
Iterating global reduction 2 with 9 rules applied. Total rules applied 222 place count 430 transition count 420
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 222 place count 430 transition count 414
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 234 place count 424 transition count 414
Performed 171 Post agglomeration using F-continuation condition.Transition count delta: 171
Deduced a syphon composed of 171 places in 1 ms
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 2 with 342 rules applied. Total rules applied 576 place count 253 transition count 243
Partial Free-agglomeration rule applied 65 times.
Drop transitions removed 65 transitions
Iterating global reduction 2 with 65 rules applied. Total rules applied 641 place count 253 transition count 243
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 642 place count 252 transition count 242
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 643 place count 251 transition count 242
Applied a total of 643 rules in 97 ms. Remains 251 /541 variables (removed 290) and now considering 242/531 (removed 289) transitions.
Finished structural reductions, in 1 iterations. Remains : 251/541 places, 242/531 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :1
Finished Best-First random walk after 1637 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=272 )
Computed a total of 125 stabilizing places and 125 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(X(p1)))&&p0)))'
Support contains 2 out of 541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 541/541 places, 531/531 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 532 transition count 522
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 532 transition count 522
Applied a total of 18 rules in 37 ms. Remains 532 /541 variables (removed 9) and now considering 522/531 (removed 9) transitions.
// Phase 1: matrix 522 rows 532 cols
[2022-05-19 01:23:12] [INFO ] Computed 91 place invariants in 2 ms
[2022-05-19 01:23:12] [INFO ] Implicit Places using invariants in 149 ms returned []
// Phase 1: matrix 522 rows 532 cols
[2022-05-19 01:23:12] [INFO ] Computed 91 place invariants in 3 ms
[2022-05-19 01:23:13] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
// Phase 1: matrix 522 rows 532 cols
[2022-05-19 01:23:13] [INFO ] Computed 91 place invariants in 2 ms
[2022-05-19 01:23:13] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 532/541 places, 522/531 transitions.
Finished structural reductions, in 1 iterations. Remains : 532/541 places, 522/531 transitions.
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s71 1) (EQ s312 1)), p1:(EQ s312 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-010B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010B-LTLFireability-00 finished in 1075 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 541/541 places, 531/531 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 540 transition count 480
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 100 place count 490 transition count 480
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 100 place count 490 transition count 429
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 202 place count 439 transition count 429
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 211 place count 430 transition count 420
Iterating global reduction 2 with 9 rules applied. Total rules applied 220 place count 430 transition count 420
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 220 place count 430 transition count 415
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 230 place count 425 transition count 415
Performed 170 Post agglomeration using F-continuation condition.Transition count delta: 170
Deduced a syphon composed of 170 places in 0 ms
Reduce places removed 170 places and 0 transitions.
Iterating global reduction 2 with 340 rules applied. Total rules applied 570 place count 255 transition count 245
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 572 place count 253 transition count 243
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 573 place count 252 transition count 243
Applied a total of 573 rules in 87 ms. Remains 252 /541 variables (removed 289) and now considering 243/531 (removed 288) transitions.
// Phase 1: matrix 243 rows 252 cols
[2022-05-19 01:23:13] [INFO ] Computed 90 place invariants in 1 ms
[2022-05-19 01:23:13] [INFO ] Implicit Places using invariants in 158 ms returned []
// Phase 1: matrix 243 rows 252 cols
[2022-05-19 01:23:13] [INFO ] Computed 90 place invariants in 1 ms
[2022-05-19 01:23:14] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
[2022-05-19 01:23:14] [INFO ] Redundant transitions in 57 ms returned [242]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 242 rows 252 cols
[2022-05-19 01:23:14] [INFO ] Computed 90 place invariants in 1 ms
[2022-05-19 01:23:14] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 252/541 places, 242/531 transitions.
Applied a total of 0 rules in 12 ms. Remains 252 /252 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 252/541 places, 242/531 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s5 0) (OR (EQ s11 0) (EQ s18 0) (EQ s29 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 183 reset in 630 ms.
Product exploration explored 100000 steps with 181 reset in 460 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 407 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=135 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Support contains 4 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 242/242 transitions.
Applied a total of 0 rules in 7 ms. Remains 252 /252 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 252 cols
[2022-05-19 01:23:15] [INFO ] Computed 90 place invariants in 1 ms
[2022-05-19 01:23:15] [INFO ] Implicit Places using invariants in 148 ms returned []
// Phase 1: matrix 242 rows 252 cols
[2022-05-19 01:23:15] [INFO ] Computed 90 place invariants in 1 ms
[2022-05-19 01:23:16] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
[2022-05-19 01:23:16] [INFO ] Redundant transitions in 42 ms returned []
// Phase 1: matrix 242 rows 252 cols
[2022-05-19 01:23:16] [INFO ] Computed 90 place invariants in 4 ms
[2022-05-19 01:23:16] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 252/252 places, 242/242 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Finished random walk after 347 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=86 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 183 reset in 357 ms.
Product exploration explored 100000 steps with 182 reset in 396 ms.
Built C files in :
/tmp/ltsmin3875037545505698221
[2022-05-19 01:23:17] [INFO ] Computing symmetric may disable matrix : 242 transitions.
[2022-05-19 01:23:17] [INFO ] Computation of Complete disable matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 01:23:17] [INFO ] Computing symmetric may enable matrix : 242 transitions.
[2022-05-19 01:23:17] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 01:23:17] [INFO ] Computing Do-Not-Accords matrix : 242 transitions.
[2022-05-19 01:23:17] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 01:23:17] [INFO ] Built C files in 86ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3875037545505698221
Running compilation step : cd /tmp/ltsmin3875037545505698221;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 582 ms.
Running link step : cd /tmp/ltsmin3875037545505698221;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin3875037545505698221;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13594864623797056470.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 242/242 transitions.
Applied a total of 0 rules in 13 ms. Remains 252 /252 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 252 cols
[2022-05-19 01:23:32] [INFO ] Computed 90 place invariants in 5 ms
[2022-05-19 01:23:32] [INFO ] Implicit Places using invariants in 121 ms returned []
// Phase 1: matrix 242 rows 252 cols
[2022-05-19 01:23:32] [INFO ] Computed 90 place invariants in 1 ms
[2022-05-19 01:23:32] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2022-05-19 01:23:32] [INFO ] Redundant transitions in 25 ms returned []
// Phase 1: matrix 242 rows 252 cols
[2022-05-19 01:23:32] [INFO ] Computed 90 place invariants in 0 ms
[2022-05-19 01:23:32] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 252/252 places, 242/242 transitions.
Built C files in :
/tmp/ltsmin2725494802558323668
[2022-05-19 01:23:32] [INFO ] Computing symmetric may disable matrix : 242 transitions.
[2022-05-19 01:23:32] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 01:23:32] [INFO ] Computing symmetric may enable matrix : 242 transitions.
[2022-05-19 01:23:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 01:23:32] [INFO ] Computing Do-Not-Accords matrix : 242 transitions.
[2022-05-19 01:23:32] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 01:23:32] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2725494802558323668
Running compilation step : cd /tmp/ltsmin2725494802558323668;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 453 ms.
Running link step : cd /tmp/ltsmin2725494802558323668;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin2725494802558323668;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4002512696209475066.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 01:23:48] [INFO ] Flatten gal took : 18 ms
[2022-05-19 01:23:48] [INFO ] Flatten gal took : 18 ms
[2022-05-19 01:23:48] [INFO ] Time to serialize gal into /tmp/LTL11902809996952898382.gal : 3 ms
[2022-05-19 01:23:48] [INFO ] Time to serialize properties into /tmp/LTL2149115100911795579.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11902809996952898382.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2149115100911795579.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1190280...267
Read 1 LTL properties
Checking formula 0 : !((F(G("((p26==0)&&(((p33==0)||(p44==0))||(p69==0)))"))))
Formula 0 simplified : !FG"((p26==0)&&(((p33==0)||(p44==0))||(p69==0)))"
Detected timeout of ITS tools.
[2022-05-19 01:24:03] [INFO ] Flatten gal took : 15 ms
[2022-05-19 01:24:03] [INFO ] Applying decomposition
[2022-05-19 01:24:03] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12691577255005253918.txt' '-o' '/tmp/graph12691577255005253918.bin' '-w' '/tmp/graph12691577255005253918.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12691577255005253918.bin' '-l' '-1' '-v' '-w' '/tmp/graph12691577255005253918.weights' '-q' '0' '-e' '0.001'
[2022-05-19 01:24:03] [INFO ] Decomposing Gal with order
[2022-05-19 01:24:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 01:24:03] [INFO ] Removed a total of 161 redundant transitions.
[2022-05-19 01:24:03] [INFO ] Flatten gal took : 56 ms
[2022-05-19 01:24:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 134 labels/synchronizations in 18 ms.
[2022-05-19 01:24:03] [INFO ] Time to serialize gal into /tmp/LTL15689633541816168977.gal : 10 ms
[2022-05-19 01:24:03] [INFO ] Time to serialize properties into /tmp/LTL10232381432178224991.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15689633541816168977.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10232381432178224991.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1568963...247
Read 1 LTL properties
Checking formula 0 : !((F(G("((i0.i1.u3.p26==0)&&(((i0.i2.u5.p33==0)||(i0.i2.u7.p44==0))||(i0.i3.u12.p69==0)))"))))
Formula 0 simplified : !FG"((i0.i1.u3.p26==0)&&(((i0.i2.u5.p33==0)||(i0.i2.u7.p44==0))||(i0.i3.u12.p69==0)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9577270347860161624
[2022-05-19 01:24:18] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9577270347860161624
Running compilation step : cd /tmp/ltsmin9577270347860161624;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 372 ms.
Running link step : cd /tmp/ltsmin9577270347860161624;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin9577270347860161624;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-010B-LTLFireability-01 finished in 79995 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(p1)||(G(X(p2))&&p1)||p0) U p3)))'
Support contains 5 out of 541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 541/541 places, 531/531 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 534 transition count 524
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 534 transition count 524
Applied a total of 14 rules in 16 ms. Remains 534 /541 variables (removed 7) and now considering 524/531 (removed 7) transitions.
// Phase 1: matrix 524 rows 534 cols
[2022-05-19 01:24:33] [INFO ] Computed 91 place invariants in 3 ms
[2022-05-19 01:24:33] [INFO ] Implicit Places using invariants in 160 ms returned []
// Phase 1: matrix 524 rows 534 cols
[2022-05-19 01:24:33] [INFO ] Computed 91 place invariants in 2 ms
[2022-05-19 01:24:34] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
// Phase 1: matrix 524 rows 534 cols
[2022-05-19 01:24:34] [INFO ] Computed 91 place invariants in 3 ms
[2022-05-19 01:24:34] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 534/541 places, 524/531 transitions.
Finished structural reductions, in 1 iterations. Remains : 534/541 places, 524/531 transitions.
Stuttering acceptance computed with spot in 205 ms :[(NOT p3), (NOT p3), (NOT p1), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p0) p1), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p3:(EQ s108 1), p0:(OR (EQ s70 1) (AND (EQ s27 1) (EQ s43 1))), p1:(EQ s310 1), p2:(AND (EQ s27 1) (EQ s43 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-010B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010B-LTLFireability-02 finished in 974 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(p0))))'
Support contains 2 out of 541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 541/541 places, 531/531 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 540 transition count 479
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 102 place count 489 transition count 479
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 102 place count 489 transition count 428
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 204 place count 438 transition count 428
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 212 place count 430 transition count 420
Iterating global reduction 2 with 8 rules applied. Total rules applied 220 place count 430 transition count 420
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 220 place count 430 transition count 414
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 232 place count 424 transition count 414
Performed 171 Post agglomeration using F-continuation condition.Transition count delta: 171
Deduced a syphon composed of 171 places in 0 ms
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 2 with 342 rules applied. Total rules applied 574 place count 253 transition count 243
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 576 place count 251 transition count 241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 577 place count 250 transition count 241
Applied a total of 577 rules in 49 ms. Remains 250 /541 variables (removed 291) and now considering 241/531 (removed 290) transitions.
// Phase 1: matrix 241 rows 250 cols
[2022-05-19 01:24:34] [INFO ] Computed 90 place invariants in 1 ms
[2022-05-19 01:24:34] [INFO ] Implicit Places using invariants in 111 ms returned []
// Phase 1: matrix 241 rows 250 cols
[2022-05-19 01:24:34] [INFO ] Computed 90 place invariants in 1 ms
[2022-05-19 01:24:34] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2022-05-19 01:24:35] [INFO ] Redundant transitions in 38 ms returned [240]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 240 rows 250 cols
[2022-05-19 01:24:35] [INFO ] Computed 90 place invariants in 0 ms
[2022-05-19 01:24:35] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 250/541 places, 240/531 transitions.
Applied a total of 0 rules in 6 ms. Remains 250 /250 variables (removed 0) and now considering 240/240 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 250/541 places, 240/531 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s239 0) (EQ s147 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 947 reset in 348 ms.
Product exploration explored 100000 steps with 953 reset in 432 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Finished random walk after 64 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=32 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 240/240 transitions.
Applied a total of 0 rules in 11 ms. Remains 250 /250 variables (removed 0) and now considering 240/240 (removed 0) transitions.
// Phase 1: matrix 240 rows 250 cols
[2022-05-19 01:24:36] [INFO ] Computed 90 place invariants in 1 ms
[2022-05-19 01:24:36] [INFO ] Implicit Places using invariants in 101 ms returned []
// Phase 1: matrix 240 rows 250 cols
[2022-05-19 01:24:36] [INFO ] Computed 90 place invariants in 1 ms
[2022-05-19 01:24:36] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
[2022-05-19 01:24:36] [INFO ] Redundant transitions in 28 ms returned []
// Phase 1: matrix 240 rows 250 cols
[2022-05-19 01:24:36] [INFO ] Computed 90 place invariants in 2 ms
[2022-05-19 01:24:36] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 240/240 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Finished random walk after 43 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=43 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 210 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 950 reset in 348 ms.
Product exploration explored 100000 steps with 931 reset in 389 ms.
Built C files in :
/tmp/ltsmin1540530901212211949
[2022-05-19 01:24:38] [INFO ] Computing symmetric may disable matrix : 240 transitions.
[2022-05-19 01:24:38] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 01:24:38] [INFO ] Computing symmetric may enable matrix : 240 transitions.
[2022-05-19 01:24:38] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 01:24:38] [INFO ] Computing Do-Not-Accords matrix : 240 transitions.
[2022-05-19 01:24:38] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 01:24:38] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1540530901212211949
Running compilation step : cd /tmp/ltsmin1540530901212211949;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 460 ms.
Running link step : cd /tmp/ltsmin1540530901212211949;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin1540530901212211949;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6388021881904606641.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 240/240 transitions.
Applied a total of 0 rules in 14 ms. Remains 250 /250 variables (removed 0) and now considering 240/240 (removed 0) transitions.
// Phase 1: matrix 240 rows 250 cols
[2022-05-19 01:24:53] [INFO ] Computed 90 place invariants in 2 ms
[2022-05-19 01:24:53] [INFO ] Implicit Places using invariants in 109 ms returned []
// Phase 1: matrix 240 rows 250 cols
[2022-05-19 01:24:53] [INFO ] Computed 90 place invariants in 3 ms
[2022-05-19 01:24:53] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2022-05-19 01:24:53] [INFO ] Redundant transitions in 38 ms returned []
// Phase 1: matrix 240 rows 250 cols
[2022-05-19 01:24:53] [INFO ] Computed 90 place invariants in 1 ms
[2022-05-19 01:24:53] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 240/240 transitions.
Built C files in :
/tmp/ltsmin2138916291775363985
[2022-05-19 01:24:53] [INFO ] Computing symmetric may disable matrix : 240 transitions.
[2022-05-19 01:24:53] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 01:24:53] [INFO ] Computing symmetric may enable matrix : 240 transitions.
[2022-05-19 01:24:53] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 01:24:53] [INFO ] Computing Do-Not-Accords matrix : 240 transitions.
[2022-05-19 01:24:53] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 01:24:53] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2138916291775363985
Running compilation step : cd /tmp/ltsmin2138916291775363985;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 458 ms.
Running link step : cd /tmp/ltsmin2138916291775363985;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin2138916291775363985;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1979743569965976857.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 01:25:08] [INFO ] Flatten gal took : 14 ms
[2022-05-19 01:25:08] [INFO ] Flatten gal took : 13 ms
[2022-05-19 01:25:08] [INFO ] Time to serialize gal into /tmp/LTL10376401223663134239.gal : 2 ms
[2022-05-19 01:25:08] [INFO ] Time to serialize properties into /tmp/LTL5005026026512458513.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10376401223663134239.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5005026026512458513.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1037640...267
Read 1 LTL properties
Checking formula 0 : !((G(F(X("((p574==0)&&(p351==0))")))))
Formula 0 simplified : !GFX"((p574==0)&&(p351==0))"
Detected timeout of ITS tools.
[2022-05-19 01:25:23] [INFO ] Flatten gal took : 12 ms
[2022-05-19 01:25:23] [INFO ] Applying decomposition
[2022-05-19 01:25:23] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6284918594930568891.txt' '-o' '/tmp/graph6284918594930568891.bin' '-w' '/tmp/graph6284918594930568891.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6284918594930568891.bin' '-l' '-1' '-v' '-w' '/tmp/graph6284918594930568891.weights' '-q' '0' '-e' '0.001'
[2022-05-19 01:25:23] [INFO ] Decomposing Gal with order
[2022-05-19 01:25:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 01:25:23] [INFO ] Removed a total of 155 redundant transitions.
[2022-05-19 01:25:23] [INFO ] Flatten gal took : 19 ms
[2022-05-19 01:25:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 144 labels/synchronizations in 5 ms.
[2022-05-19 01:25:23] [INFO ] Time to serialize gal into /tmp/LTL13891806094670635824.gal : 3 ms
[2022-05-19 01:25:23] [INFO ] Time to serialize properties into /tmp/LTL15659929406823306227.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13891806094670635824.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15659929406823306227.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1389180...247
Read 1 LTL properties
Checking formula 0 : !((G(F(X("((i9.i1.u86.p574==0)&&(i5.i0.u53.p351==0))")))))
Formula 0 simplified : !GFX"((i9.i1.u86.p574==0)&&(i5.i0.u53.p351==0))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15930926343770329746
[2022-05-19 01:25:39] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15930926343770329746
Running compilation step : cd /tmp/ltsmin15930926343770329746;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 374 ms.
Running link step : cd /tmp/ltsmin15930926343770329746;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin15930926343770329746;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(X((LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-010B-LTLFireability-03 finished in 79535 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||(X((G(p1)&&p2))&&F(p3)&&F(p2)))))'
Support contains 4 out of 541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 541/541 places, 531/531 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 534 transition count 524
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 534 transition count 524
Applied a total of 14 rules in 21 ms. Remains 534 /541 variables (removed 7) and now considering 524/531 (removed 7) transitions.
// Phase 1: matrix 524 rows 534 cols
[2022-05-19 01:25:54] [INFO ] Computed 91 place invariants in 3 ms
[2022-05-19 01:25:54] [INFO ] Implicit Places using invariants in 138 ms returned []
// Phase 1: matrix 524 rows 534 cols
[2022-05-19 01:25:54] [INFO ] Computed 91 place invariants in 4 ms
[2022-05-19 01:25:54] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 526 ms to find 0 implicit places.
// Phase 1: matrix 524 rows 534 cols
[2022-05-19 01:25:54] [INFO ] Computed 91 place invariants in 3 ms
[2022-05-19 01:25:54] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 534/541 places, 524/531 transitions.
Finished structural reductions, in 1 iterations. Remains : 534/541 places, 524/531 transitions.
Stuttering acceptance computed with spot in 240 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p3)), (NOT p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 1}, { cond=p3, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p3) (NOT p0) p2 p1), acceptance={} source=1 dest: 2}, { cond=(AND p3 (NOT p0) p2 p1), acceptance={} source=1 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p3) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p3 p1), acceptance={0} source=2 dest: 3}, { cond=(NOT p1), acceptance={0} source=2 dest: 5}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) p2 p1), acceptance={} source=4 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 0}]], initial=6, aps=[p3:(EQ s358 1), p0:(EQ s265 1), p2:(EQ s103 1), p1:(EQ s351 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 1 ms.
FORMULA ShieldIIPs-PT-010B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010B-LTLFireability-04 finished in 1052 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(G((G(p0)&&p1)))))'
Support contains 2 out of 541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 541/541 places, 531/531 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 533 transition count 523
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 533 transition count 523
Applied a total of 16 rules in 23 ms. Remains 533 /541 variables (removed 8) and now considering 523/531 (removed 8) transitions.
// Phase 1: matrix 523 rows 533 cols
[2022-05-19 01:25:55] [INFO ] Computed 91 place invariants in 4 ms
[2022-05-19 01:25:55] [INFO ] Implicit Places using invariants in 152 ms returned []
// Phase 1: matrix 523 rows 533 cols
[2022-05-19 01:25:55] [INFO ] Computed 91 place invariants in 2 ms
[2022-05-19 01:25:55] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
// Phase 1: matrix 523 rows 533 cols
[2022-05-19 01:25:55] [INFO ] Computed 91 place invariants in 1 ms
[2022-05-19 01:25:55] [INFO ] Dead Transitions using invariants and state equation in 223 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 533/541 places, 523/531 transitions.
Finished structural reductions, in 1 iterations. Remains : 533/541 places, 523/531 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s524 1), p1:(EQ s61 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 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-010B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010B-LTLFireability-05 finished in 851 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G(p1)))'
Support contains 4 out of 541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 541/541 places, 531/531 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 540 transition count 479
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 102 place count 489 transition count 479
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 102 place count 489 transition count 429
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 202 place count 439 transition count 429
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 211 place count 430 transition count 420
Iterating global reduction 2 with 9 rules applied. Total rules applied 220 place count 430 transition count 420
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 220 place count 430 transition count 415
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 230 place count 425 transition count 415
Performed 169 Post agglomeration using F-continuation condition.Transition count delta: 169
Deduced a syphon composed of 169 places in 0 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 2 with 338 rules applied. Total rules applied 568 place count 256 transition count 246
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 570 place count 254 transition count 244
Applied a total of 570 rules in 70 ms. Remains 254 /541 variables (removed 287) and now considering 244/531 (removed 287) transitions.
// Phase 1: matrix 244 rows 254 cols
[2022-05-19 01:25:56] [INFO ] Computed 91 place invariants in 1 ms
[2022-05-19 01:25:56] [INFO ] Implicit Places using invariants in 109 ms returned []
// Phase 1: matrix 244 rows 254 cols
[2022-05-19 01:25:56] [INFO ] Computed 91 place invariants in 0 ms
[2022-05-19 01:25:56] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2022-05-19 01:25:56] [INFO ] Redundant transitions in 26 ms returned []
// Phase 1: matrix 244 rows 254 cols
[2022-05-19 01:25:56] [INFO ] Computed 91 place invariants in 1 ms
[2022-05-19 01:25:56] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 254/541 places, 244/531 transitions.
Finished structural reductions, in 1 iterations. Remains : 254/541 places, 244/531 transitions.
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(NEQ s3 1), p0:(OR (NEQ s239 1) (NEQ s247 1) (NEQ s253 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 179 reset in 456 ms.
Product exploration explored 100000 steps with 178 reset in 460 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/254 stabilizing places and 2/244 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 207 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 118 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=39 )
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 216 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 244/244 transitions.
Applied a total of 0 rules in 4 ms. Remains 254 /254 variables (removed 0) and now considering 244/244 (removed 0) transitions.
// Phase 1: matrix 244 rows 254 cols
[2022-05-19 01:25:58] [INFO ] Computed 91 place invariants in 1 ms
[2022-05-19 01:25:58] [INFO ] Implicit Places using invariants in 101 ms returned []
// Phase 1: matrix 244 rows 254 cols
[2022-05-19 01:25:58] [INFO ] Computed 91 place invariants in 0 ms
[2022-05-19 01:25:58] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
[2022-05-19 01:25:58] [INFO ] Redundant transitions in 26 ms returned []
// Phase 1: matrix 244 rows 254 cols
[2022-05-19 01:25:58] [INFO ] Computed 91 place invariants in 2 ms
[2022-05-19 01:25:58] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 244/244 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/254 stabilizing places and 2/244 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 226 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 97 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=32 )
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 230 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 178 reset in 360 ms.
Product exploration explored 100000 steps with 177 reset in 404 ms.
Built C files in :
/tmp/ltsmin787092733566229513
[2022-05-19 01:26:00] [INFO ] Computing symmetric may disable matrix : 244 transitions.
[2022-05-19 01:26:00] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 01:26:00] [INFO ] Computing symmetric may enable matrix : 244 transitions.
[2022-05-19 01:26:00] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 01:26:00] [INFO ] Computing Do-Not-Accords matrix : 244 transitions.
[2022-05-19 01:26:00] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 01:26:00] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin787092733566229513
Running compilation step : cd /tmp/ltsmin787092733566229513;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 460 ms.
Running link step : cd /tmp/ltsmin787092733566229513;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin787092733566229513;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2726326928355461753.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 244/244 transitions.
Applied a total of 0 rules in 11 ms. Remains 254 /254 variables (removed 0) and now considering 244/244 (removed 0) transitions.
// Phase 1: matrix 244 rows 254 cols
[2022-05-19 01:26:15] [INFO ] Computed 91 place invariants in 2 ms
[2022-05-19 01:26:15] [INFO ] Implicit Places using invariants in 112 ms returned []
// Phase 1: matrix 244 rows 254 cols
[2022-05-19 01:26:15] [INFO ] Computed 91 place invariants in 1 ms
[2022-05-19 01:26:15] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
[2022-05-19 01:26:15] [INFO ] Redundant transitions in 27 ms returned []
// Phase 1: matrix 244 rows 254 cols
[2022-05-19 01:26:15] [INFO ] Computed 91 place invariants in 4 ms
[2022-05-19 01:26:15] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 244/244 transitions.
Built C files in :
/tmp/ltsmin3404121989974145335
[2022-05-19 01:26:15] [INFO ] Computing symmetric may disable matrix : 244 transitions.
[2022-05-19 01:26:15] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 01:26:15] [INFO ] Computing symmetric may enable matrix : 244 transitions.
[2022-05-19 01:26:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 01:26:15] [INFO ] Computing Do-Not-Accords matrix : 244 transitions.
[2022-05-19 01:26:15] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 01:26:15] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3404121989974145335
Running compilation step : cd /tmp/ltsmin3404121989974145335;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 458 ms.
Running link step : cd /tmp/ltsmin3404121989974145335;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin3404121989974145335;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16514403253031550950.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 01:26:30] [INFO ] Flatten gal took : 13 ms
[2022-05-19 01:26:30] [INFO ] Flatten gal took : 11 ms
[2022-05-19 01:26:30] [INFO ] Time to serialize gal into /tmp/LTL14135846199646979765.gal : 2 ms
[2022-05-19 01:26:30] [INFO ] Time to serialize properties into /tmp/LTL7168885639648186834.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14135846199646979765.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7168885639648186834.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1413584...267
Read 1 LTL properties
Checking formula 0 : !(((F(G("(((p567!=1)||(p586!=1))||(p600!=1))")))||(G("(p17!=1)"))))
Formula 0 simplified : !(FG"(((p567!=1)||(p586!=1))||(p600!=1))" | G"(p17!=1)")
Detected timeout of ITS tools.
[2022-05-19 01:26:45] [INFO ] Flatten gal took : 11 ms
[2022-05-19 01:26:45] [INFO ] Applying decomposition
[2022-05-19 01:26:45] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13239875903433504141.txt' '-o' '/tmp/graph13239875903433504141.bin' '-w' '/tmp/graph13239875903433504141.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13239875903433504141.bin' '-l' '-1' '-v' '-w' '/tmp/graph13239875903433504141.weights' '-q' '0' '-e' '0.001'
[2022-05-19 01:26:45] [INFO ] Decomposing Gal with order
[2022-05-19 01:26:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 01:26:45] [INFO ] Removed a total of 163 redundant transitions.
[2022-05-19 01:26:45] [INFO ] Flatten gal took : 18 ms
[2022-05-19 01:26:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 150 labels/synchronizations in 4 ms.
[2022-05-19 01:26:45] [INFO ] Time to serialize gal into /tmp/LTL17736474813690127039.gal : 4 ms
[2022-05-19 01:26:45] [INFO ] Time to serialize properties into /tmp/LTL14898477799416898461.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17736474813690127039.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14898477799416898461.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1773647...247
Read 1 LTL properties
Checking formula 0 : !(((F(G("(((i9.i2.u86.p567!=1)||(i9.i2.u89.p586!=1))||(i9.i2.u90.p600!=1))")))||(G("(i0.i0.u7.p17!=1)"))))
Formula 0 simplified : !(FG"(((i9.i2.u86.p567!=1)||(i9.i2.u89.p586!=1))||(i9.i2.u90.p600!=1))" | G"(i0.i0.u7.p17!=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14085367196534346867
[2022-05-19 01:27:01] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14085367196534346867
Running compilation step : cd /tmp/ltsmin14085367196534346867;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 379 ms.
Running link step : cd /tmp/ltsmin14085367196534346867;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin14085367196534346867;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>([]((LTLAPp0==true)))||[]((LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-010B-LTLFireability-06 finished in 80079 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p0)||X(p1)))||X(p1)))'
Support contains 2 out of 541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 541/541 places, 531/531 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 533 transition count 523
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 533 transition count 523
Applied a total of 16 rules in 22 ms. Remains 533 /541 variables (removed 8) and now considering 523/531 (removed 8) transitions.
// Phase 1: matrix 523 rows 533 cols
[2022-05-19 01:27:16] [INFO ] Computed 91 place invariants in 2 ms
[2022-05-19 01:27:16] [INFO ] Implicit Places using invariants in 156 ms returned []
// Phase 1: matrix 523 rows 533 cols
[2022-05-19 01:27:16] [INFO ] Computed 91 place invariants in 2 ms
[2022-05-19 01:27:16] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
// Phase 1: matrix 523 rows 533 cols
[2022-05-19 01:27:16] [INFO ] Computed 91 place invariants in 2 ms
[2022-05-19 01:27:16] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 533/541 places, 523/531 transitions.
Finished structural reductions, in 1 iterations. Remains : 533/541 places, 523/531 transitions.
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(EQ s275 1), p1:(EQ s518 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][false, false, false, false]]
Product exploration explored 100000 steps with 2067 reset in 210 ms.
Product exploration explored 100000 steps with 2007 reset in 211 ms.
Computed a total of 119 stabilizing places and 119 stable transitions
Computed a total of 119 stabilizing places and 119 stable transitions
Detected a total of 119/533 stabilizing places and 119/523 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 168 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Finished random walk after 44 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=44 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 289 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
// Phase 1: matrix 523 rows 533 cols
[2022-05-19 01:27:18] [INFO ] Computed 91 place invariants in 3 ms
[2022-05-19 01:27:18] [INFO ] [Real]Absence check using 91 positive place invariants in 34 ms returned sat
[2022-05-19 01:27:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 01:27:19] [INFO ] [Real]Absence check using state equation in 798 ms returned sat
[2022-05-19 01:27:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 01:27:19] [INFO ] [Nat]Absence check using 91 positive place invariants in 32 ms returned sat
[2022-05-19 01:27:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 01:27:20] [INFO ] [Nat]Absence check using state equation in 736 ms returned sat
[2022-05-19 01:27:20] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2022-05-19 01:27:20] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2022-05-19 01:27:20] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2022-05-19 01:27:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 277 ms
[2022-05-19 01:27:20] [INFO ] Computed and/alt/rep : 522/1173/522 causal constraints (skipped 0 transitions) in 29 ms.
[2022-05-19 01:27:26] [INFO ] Added : 440 causal constraints over 88 iterations in 6283 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 533 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 533/533 places, 523/523 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 532 transition count 472
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 100 place count 482 transition count 472
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 100 place count 482 transition count 420
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 204 place count 430 transition count 420
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Deduced a syphon composed of 175 places in 1 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 2 with 350 rules applied. Total rules applied 554 place count 255 transition count 245
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 556 place count 253 transition count 243
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 557 place count 252 transition count 243
Applied a total of 557 rules in 42 ms. Remains 252 /533 variables (removed 281) and now considering 243/523 (removed 280) transitions.
// Phase 1: matrix 243 rows 252 cols
[2022-05-19 01:27:26] [INFO ] Computed 90 place invariants in 1 ms
[2022-05-19 01:27:26] [INFO ] Implicit Places using invariants in 110 ms returned []
// Phase 1: matrix 243 rows 252 cols
[2022-05-19 01:27:26] [INFO ] Computed 90 place invariants in 4 ms
[2022-05-19 01:27:26] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2022-05-19 01:27:27] [INFO ] Redundant transitions in 31 ms returned []
// Phase 1: matrix 243 rows 252 cols
[2022-05-19 01:27:27] [INFO ] Computed 90 place invariants in 0 ms
[2022-05-19 01:27:27] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 252/533 places, 243/523 transitions.
Finished structural reductions, in 1 iterations. Remains : 252/533 places, 243/523 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/252 stabilizing places and 2/243 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 119 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Finished random walk after 22 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=11 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 133 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
// Phase 1: matrix 243 rows 252 cols
[2022-05-19 01:27:27] [INFO ] Computed 90 place invariants in 2 ms
[2022-05-19 01:27:27] [INFO ] [Real]Absence check using 90 positive place invariants in 18 ms returned sat
[2022-05-19 01:27:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 01:27:27] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2022-05-19 01:27:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 01:27:27] [INFO ] [Nat]Absence check using 90 positive place invariants in 18 ms returned sat
[2022-05-19 01:27:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 01:27:28] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2022-05-19 01:27:28] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2022-05-19 01:27:28] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2022-05-19 01:27:28] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2022-05-19 01:27:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 164 ms
[2022-05-19 01:27:28] [INFO ] Computed and/alt/rep : 239/610/239 causal constraints (skipped 2 transitions) in 15 ms.
[2022-05-19 01:27:29] [INFO ] Added : 197 causal constraints over 40 iterations in 1087 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 437 ms :[(NOT p0)]
Product exploration explored 100000 steps with 27119 reset in 308 ms.
Product exploration explored 100000 steps with 27188 reset in 385 ms.
Built C files in :
/tmp/ltsmin12658094398473377147
[2022-05-19 01:27:30] [INFO ] Computing symmetric may disable matrix : 243 transitions.
[2022-05-19 01:27:30] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 01:27:30] [INFO ] Computing symmetric may enable matrix : 243 transitions.
[2022-05-19 01:27:30] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 01:27:30] [INFO ] Computing Do-Not-Accords matrix : 243 transitions.
[2022-05-19 01:27:30] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 01:27:30] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12658094398473377147
Running compilation step : cd /tmp/ltsmin12658094398473377147;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 499 ms.
Running link step : cd /tmp/ltsmin12658094398473377147;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin12658094398473377147;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17266934338122512726.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 243/243 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 251 transition count 242
Applied a total of 2 rules in 13 ms. Remains 251 /252 variables (removed 1) and now considering 242/243 (removed 1) transitions.
// Phase 1: matrix 242 rows 251 cols
[2022-05-19 01:27:45] [INFO ] Computed 90 place invariants in 2 ms
[2022-05-19 01:27:45] [INFO ] Implicit Places using invariants in 108 ms returned []
// Phase 1: matrix 242 rows 251 cols
[2022-05-19 01:27:45] [INFO ] Computed 90 place invariants in 0 ms
[2022-05-19 01:27:45] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2022-05-19 01:27:45] [INFO ] Redundant transitions in 27 ms returned [241]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 241 rows 251 cols
[2022-05-19 01:27:45] [INFO ] Computed 90 place invariants in 2 ms
[2022-05-19 01:27:46] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 251/252 places, 241/243 transitions.
Applied a total of 0 rules in 5 ms. Remains 251 /251 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 251/252 places, 241/243 transitions.
Built C files in :
/tmp/ltsmin16404750857100011689
[2022-05-19 01:27:46] [INFO ] Computing symmetric may disable matrix : 241 transitions.
[2022-05-19 01:27:46] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 01:27:46] [INFO ] Computing symmetric may enable matrix : 241 transitions.
[2022-05-19 01:27:46] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 01:27:46] [INFO ] Computing Do-Not-Accords matrix : 241 transitions.
[2022-05-19 01:27:46] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 01:27:46] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16404750857100011689
Running compilation step : cd /tmp/ltsmin16404750857100011689;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 455 ms.
Running link step : cd /tmp/ltsmin16404750857100011689;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin16404750857100011689;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12312874620498700899.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 01:28:01] [INFO ] Flatten gal took : 10 ms
[2022-05-19 01:28:01] [INFO ] Flatten gal took : 10 ms
[2022-05-19 01:28:01] [INFO ] Time to serialize gal into /tmp/LTL4400255219975764773.gal : 2 ms
[2022-05-19 01:28:01] [INFO ] Time to serialize properties into /tmp/LTL880513155939937883.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4400255219975764773.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL880513155939937883.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4400255...265
Read 1 LTL properties
Checking formula 0 : !(((X((F("(p310==1)"))||(X("(p585==1)"))))||(X("(p585==1)"))))
Formula 0 simplified : !(X"(p585==1)" | X(F"(p310==1)" | X"(p585==1)"))
Detected timeout of ITS tools.
[2022-05-19 01:28:16] [INFO ] Flatten gal took : 14 ms
[2022-05-19 01:28:16] [INFO ] Applying decomposition
[2022-05-19 01:28:16] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15737396219415517415.txt' '-o' '/tmp/graph15737396219415517415.bin' '-w' '/tmp/graph15737396219415517415.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15737396219415517415.bin' '-l' '-1' '-v' '-w' '/tmp/graph15737396219415517415.weights' '-q' '0' '-e' '0.001'
[2022-05-19 01:28:16] [INFO ] Decomposing Gal with order
[2022-05-19 01:28:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 01:28:16] [INFO ] Removed a total of 157 redundant transitions.
[2022-05-19 01:28:16] [INFO ] Flatten gal took : 33 ms
[2022-05-19 01:28:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 160 labels/synchronizations in 4 ms.
[2022-05-19 01:28:16] [INFO ] Time to serialize gal into /tmp/LTL6215650879868315424.gal : 6 ms
[2022-05-19 01:28:16] [INFO ] Time to serialize properties into /tmp/LTL8915667011785242992.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6215650879868315424.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8915667011785242992.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6215650...245
Read 1 LTL properties
Checking formula 0 : !(((X((F("(i5.i0.u46.p310==1)"))||(X("(i9.i2.u89.p585==1)"))))||(X("(i9.i2.u89.p585==1)"))))
Formula 0 simplified : !(X"(i9.i2.u89.p585==1)" | X(F"(i5.i0.u46.p310==1)" | X"(i9.i2.u89.p585==1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10510368244006339938
[2022-05-19 01:28:31] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10510368244006339938
Running compilation step : cd /tmp/ltsmin10510368244006339938;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 384 ms.
Running link step : cd /tmp/ltsmin10510368244006339938;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin10510368244006339938;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X((<>((LTLAPp0==true))||X((LTLAPp1==true))))||X((LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-010B-LTLFireability-07 finished in 90284 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((F(p0)||G(p1)))))'
Support contains 4 out of 541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 541/541 places, 531/531 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 540 transition count 480
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 100 place count 490 transition count 480
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 100 place count 490 transition count 429
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 202 place count 439 transition count 429
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 211 place count 430 transition count 420
Iterating global reduction 2 with 9 rules applied. Total rules applied 220 place count 430 transition count 420
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 220 place count 430 transition count 414
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 232 place count 424 transition count 414
Performed 171 Post agglomeration using F-continuation condition.Transition count delta: 171
Deduced a syphon composed of 171 places in 1 ms
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 2 with 342 rules applied. Total rules applied 574 place count 253 transition count 243
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 576 place count 251 transition count 241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 577 place count 250 transition count 241
Applied a total of 577 rules in 42 ms. Remains 250 /541 variables (removed 291) and now considering 241/531 (removed 290) transitions.
// Phase 1: matrix 241 rows 250 cols
[2022-05-19 01:28:46] [INFO ] Computed 90 place invariants in 5 ms
[2022-05-19 01:28:46] [INFO ] Implicit Places using invariants in 112 ms returned []
// Phase 1: matrix 241 rows 250 cols
[2022-05-19 01:28:46] [INFO ] Computed 90 place invariants in 4 ms
[2022-05-19 01:28:46] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
[2022-05-19 01:28:46] [INFO ] Redundant transitions in 32 ms returned [240]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 240 rows 250 cols
[2022-05-19 01:28:46] [INFO ] Computed 90 place invariants in 0 ms
[2022-05-19 01:28:46] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 250/541 places, 240/531 transitions.
Applied a total of 0 rules in 4 ms. Remains 250 /250 variables (removed 0) and now considering 240/240 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 250/541 places, 240/531 transitions.
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s211 1) (EQ s216 1) (EQ s227 1)), p0:(EQ s105 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 484 reset in 341 ms.
Product exploration explored 100000 steps with 484 reset in 376 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 186 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 888 steps, including 1 resets, run visited all 2 properties in 12 ms. (steps per millisecond=74 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 194 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 240 rows 250 cols
[2022-05-19 01:28:48] [INFO ] Computed 90 place invariants in 2 ms
[2022-05-19 01:28:48] [INFO ] [Real]Absence check using 90 positive place invariants in 17 ms returned sat
[2022-05-19 01:28:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 01:28:48] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2022-05-19 01:28:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 01:28:48] [INFO ] [Nat]Absence check using 90 positive place invariants in 17 ms returned sat
[2022-05-19 01:28:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 01:28:48] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2022-05-19 01:28:48] [INFO ] Computed and/alt/rep : 239/588/239 causal constraints (skipped 0 transitions) in 20 ms.
[2022-05-19 01:28:53] [INFO ] Added : 239 causal constraints over 52 iterations in 4058 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 240/240 transitions.
Applied a total of 0 rules in 7 ms. Remains 250 /250 variables (removed 0) and now considering 240/240 (removed 0) transitions.
// Phase 1: matrix 240 rows 250 cols
[2022-05-19 01:28:53] [INFO ] Computed 90 place invariants in 1 ms
[2022-05-19 01:28:53] [INFO ] Implicit Places using invariants in 107 ms returned []
// Phase 1: matrix 240 rows 250 cols
[2022-05-19 01:28:53] [INFO ] Computed 90 place invariants in 5 ms
[2022-05-19 01:28:53] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2022-05-19 01:28:53] [INFO ] Redundant transitions in 26 ms returned []
// Phase 1: matrix 240 rows 250 cols
[2022-05-19 01:28:53] [INFO ] Computed 90 place invariants in 3 ms
[2022-05-19 01:28:53] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 240/240 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 195 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1094 steps, including 2 resets, run visited all 2 properties in 12 ms. (steps per millisecond=91 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 196 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 240 rows 250 cols
[2022-05-19 01:28:54] [INFO ] Computed 90 place invariants in 1 ms
[2022-05-19 01:28:54] [INFO ] [Real]Absence check using 90 positive place invariants in 18 ms returned sat
[2022-05-19 01:28:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 01:28:54] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2022-05-19 01:28:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 01:28:54] [INFO ] [Nat]Absence check using 90 positive place invariants in 18 ms returned sat
[2022-05-19 01:28:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 01:28:54] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2022-05-19 01:28:54] [INFO ] Computed and/alt/rep : 239/588/239 causal constraints (skipped 0 transitions) in 15 ms.
[2022-05-19 01:28:58] [INFO ] Added : 239 causal constraints over 52 iterations in 4109 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 488 reset in 339 ms.
Product exploration explored 100000 steps with 489 reset in 398 ms.
Built C files in :
/tmp/ltsmin9708354195768419878
[2022-05-19 01:28:59] [INFO ] Computing symmetric may disable matrix : 240 transitions.
[2022-05-19 01:28:59] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 01:28:59] [INFO ] Computing symmetric may enable matrix : 240 transitions.
[2022-05-19 01:28:59] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 01:28:59] [INFO ] Computing Do-Not-Accords matrix : 240 transitions.
[2022-05-19 01:28:59] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 01:28:59] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9708354195768419878
Running compilation step : cd /tmp/ltsmin9708354195768419878;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 460 ms.
Running link step : cd /tmp/ltsmin9708354195768419878;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin9708354195768419878;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12068069148555953997.hoa' '--buchi-type=spotba'
LTSmin run took 1243 ms.
FORMULA ShieldIIPs-PT-010B-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPs-PT-010B-LTLFireability-08 finished in 15028 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 541/541 places, 531/531 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 540 transition count 479
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 102 place count 489 transition count 479
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 102 place count 489 transition count 428
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 204 place count 438 transition count 428
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 213 place count 429 transition count 419
Iterating global reduction 2 with 9 rules applied. Total rules applied 222 place count 429 transition count 419
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 222 place count 429 transition count 413
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 234 place count 423 transition count 413
Performed 170 Post agglomeration using F-continuation condition.Transition count delta: 170
Deduced a syphon composed of 170 places in 1 ms
Reduce places removed 170 places and 0 transitions.
Iterating global reduction 2 with 340 rules applied. Total rules applied 574 place count 253 transition count 243
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 576 place count 251 transition count 241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 577 place count 250 transition count 241
Applied a total of 577 rules in 34 ms. Remains 250 /541 variables (removed 291) and now considering 241/531 (removed 290) transitions.
// Phase 1: matrix 241 rows 250 cols
[2022-05-19 01:29:01] [INFO ] Computed 90 place invariants in 1 ms
[2022-05-19 01:29:01] [INFO ] Implicit Places using invariants in 123 ms returned []
// Phase 1: matrix 241 rows 250 cols
[2022-05-19 01:29:01] [INFO ] Computed 90 place invariants in 1 ms
[2022-05-19 01:29:01] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2022-05-19 01:29:01] [INFO ] Redundant transitions in 26 ms returned [240]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 240 rows 250 cols
[2022-05-19 01:29:01] [INFO ] Computed 90 place invariants in 0 ms
[2022-05-19 01:29:01] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 250/541 places, 240/531 transitions.
Applied a total of 0 rules in 4 ms. Remains 250 /250 variables (removed 0) and now considering 240/240 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 250/541 places, 240/531 transitions.
Stuttering acceptance computed with spot in 775 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s8 1) (NEQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 183 reset in 368 ms.
Product exploration explored 100000 steps with 182 reset in 388 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Finished random walk after 988 steps, including 1 resets, run visited all 1 properties in 5 ms. (steps per millisecond=197 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 240/240 transitions.
Applied a total of 0 rules in 8 ms. Remains 250 /250 variables (removed 0) and now considering 240/240 (removed 0) transitions.
// Phase 1: matrix 240 rows 250 cols
[2022-05-19 01:29:03] [INFO ] Computed 90 place invariants in 1 ms
[2022-05-19 01:29:03] [INFO ] Implicit Places using invariants in 101 ms returned []
// Phase 1: matrix 240 rows 250 cols
[2022-05-19 01:29:03] [INFO ] Computed 90 place invariants in 0 ms
[2022-05-19 01:29:04] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
[2022-05-19 01:29:04] [INFO ] Redundant transitions in 23 ms returned []
// Phase 1: matrix 240 rows 250 cols
[2022-05-19 01:29:04] [INFO ] Computed 90 place invariants in 0 ms
[2022-05-19 01:29:04] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 240/240 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Finished random walk after 1080 steps, including 1 resets, run visited all 1 properties in 8 ms. (steps per millisecond=135 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 178 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Product exploration explored 100000 steps with 185 reset in 338 ms.
Product exploration explored 100000 steps with 183 reset in 408 ms.
Built C files in :
/tmp/ltsmin10646209023039123583
[2022-05-19 01:29:05] [INFO ] Computing symmetric may disable matrix : 240 transitions.
[2022-05-19 01:29:05] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 01:29:05] [INFO ] Computing symmetric may enable matrix : 240 transitions.
[2022-05-19 01:29:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 01:29:05] [INFO ] Computing Do-Not-Accords matrix : 240 transitions.
[2022-05-19 01:29:05] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 01:29:05] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10646209023039123583
Running compilation step : cd /tmp/ltsmin10646209023039123583;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 443 ms.
Running link step : cd /tmp/ltsmin10646209023039123583;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin10646209023039123583;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1649910145909266353.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 240/240 transitions.
Applied a total of 0 rules in 5 ms. Remains 250 /250 variables (removed 0) and now considering 240/240 (removed 0) transitions.
// Phase 1: matrix 240 rows 250 cols
[2022-05-19 01:29:20] [INFO ] Computed 90 place invariants in 1 ms
[2022-05-19 01:29:20] [INFO ] Implicit Places using invariants in 117 ms returned []
// Phase 1: matrix 240 rows 250 cols
[2022-05-19 01:29:20] [INFO ] Computed 90 place invariants in 1 ms
[2022-05-19 01:29:20] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2022-05-19 01:29:20] [INFO ] Redundant transitions in 29 ms returned []
// Phase 1: matrix 240 rows 250 cols
[2022-05-19 01:29:20] [INFO ] Computed 90 place invariants in 1 ms
[2022-05-19 01:29:20] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 240/240 transitions.
Built C files in :
/tmp/ltsmin11937936950219549799
[2022-05-19 01:29:20] [INFO ] Computing symmetric may disable matrix : 240 transitions.
[2022-05-19 01:29:20] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 01:29:20] [INFO ] Computing symmetric may enable matrix : 240 transitions.
[2022-05-19 01:29:20] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 01:29:20] [INFO ] Computing Do-Not-Accords matrix : 240 transitions.
[2022-05-19 01:29:20] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 01:29:20] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11937936950219549799
Running compilation step : cd /tmp/ltsmin11937936950219549799;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 475 ms.
Running link step : cd /tmp/ltsmin11937936950219549799;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin11937936950219549799;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14051845434191701345.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 01:29:36] [INFO ] Flatten gal took : 9 ms
[2022-05-19 01:29:36] [INFO ] Flatten gal took : 10 ms
[2022-05-19 01:29:36] [INFO ] Time to serialize gal into /tmp/LTL11462971114984834885.gal : 2 ms
[2022-05-19 01:29:36] [INFO ] Time to serialize properties into /tmp/LTL9515023363657133598.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11462971114984834885.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9515023363657133598.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1146297...267
Read 1 LTL properties
Checking formula 0 : !((F(G("((p29!=1)||(p57!=1))"))))
Formula 0 simplified : !FG"((p29!=1)||(p57!=1))"
Detected timeout of ITS tools.
[2022-05-19 01:29:51] [INFO ] Flatten gal took : 11 ms
[2022-05-19 01:29:51] [INFO ] Applying decomposition
[2022-05-19 01:29:51] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6760424225653081415.txt' '-o' '/tmp/graph6760424225653081415.bin' '-w' '/tmp/graph6760424225653081415.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6760424225653081415.bin' '-l' '-1' '-v' '-w' '/tmp/graph6760424225653081415.weights' '-q' '0' '-e' '0.001'
[2022-05-19 01:29:51] [INFO ] Decomposing Gal with order
[2022-05-19 01:29:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 01:29:51] [INFO ] Removed a total of 156 redundant transitions.
[2022-05-19 01:29:51] [INFO ] Flatten gal took : 16 ms
[2022-05-19 01:29:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 146 labels/synchronizations in 3 ms.
[2022-05-19 01:29:51] [INFO ] Time to serialize gal into /tmp/LTL1650040811433752133.gal : 2 ms
[2022-05-19 01:29:51] [INFO ] Time to serialize properties into /tmp/LTL16627588312112855347.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1650040811433752133.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16627588312112855347.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1650040...246
Read 1 LTL properties
Checking formula 0 : !((F(G("((i0.i1.u4.p29!=1)||(i0.i1.u9.p57!=1))"))))
Formula 0 simplified : !FG"((i0.i1.u4.p29!=1)||(i0.i1.u9.p57!=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10887441899997709021
[2022-05-19 01:30:06] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10887441899997709021
Running compilation step : cd /tmp/ltsmin10887441899997709021;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 410 ms.
Running link step : cd /tmp/ltsmin10887441899997709021;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin10887441899997709021;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-010B-LTLFireability-09 finished in 79947 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(F((F(G(X(X(p0))))||X(p0))))&&G(p1))))'
Support contains 3 out of 541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 541/541 places, 531/531 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 533 transition count 523
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 533 transition count 523
Applied a total of 16 rules in 23 ms. Remains 533 /541 variables (removed 8) and now considering 523/531 (removed 8) transitions.
// Phase 1: matrix 523 rows 533 cols
[2022-05-19 01:30:21] [INFO ] Computed 91 place invariants in 3 ms
[2022-05-19 01:30:21] [INFO ] Implicit Places using invariants in 132 ms returned []
// Phase 1: matrix 523 rows 533 cols
[2022-05-19 01:30:21] [INFO ] Computed 91 place invariants in 2 ms
[2022-05-19 01:30:21] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
// Phase 1: matrix 523 rows 533 cols
[2022-05-19 01:30:21] [INFO ] Computed 91 place invariants in 2 ms
[2022-05-19 01:30:22] [INFO ] Dead Transitions using invariants and state equation in 213 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 533/541 places, 523/531 transitions.
Finished structural reductions, in 1 iterations. Remains : 533/541 places, 523/531 transitions.
Stuttering acceptance computed with spot in 397 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(EQ s57 1), p0:(OR (EQ s340 0) (EQ s355 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-010B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010B-LTLFireability-11 finished in 1173 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((F((G(p1)&&p0)) U X(X(p2))))))'
Support contains 4 out of 541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 541/541 places, 531/531 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 533 transition count 523
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 533 transition count 523
Applied a total of 16 rules in 25 ms. Remains 533 /541 variables (removed 8) and now considering 523/531 (removed 8) transitions.
// Phase 1: matrix 523 rows 533 cols
[2022-05-19 01:30:22] [INFO ] Computed 91 place invariants in 2 ms
[2022-05-19 01:30:22] [INFO ] Implicit Places using invariants in 149 ms returned []
// Phase 1: matrix 523 rows 533 cols
[2022-05-19 01:30:22] [INFO ] Computed 91 place invariants in 1 ms
[2022-05-19 01:30:23] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
// Phase 1: matrix 523 rows 533 cols
[2022-05-19 01:30:23] [INFO ] Computed 91 place invariants in 2 ms
[2022-05-19 01:30:23] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 533/541 places, 523/531 transitions.
Finished structural reductions, in 1 iterations. Remains : 533/541 places, 523/531 transitions.
Stuttering acceptance computed with spot in 470 ms :[(NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 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={} source=2 dest: 5}, { cond=(AND p0 p1), acceptance={} source=2 dest: 6}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 7}, { cond=true, acceptance={} source=3 dest: 8}, { cond=(AND p0 p1), acceptance={} source=3 dest: 9}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}, { cond=p1, acceptance={} source=4 dest: 6}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=5 dest: 10}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=5 dest: 11}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 10}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 11}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=7 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=7 dest: 6}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=8 dest: 7}, { cond=(NOT p2), acceptance={0} source=8 dest: 8}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=9 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=9 dest: 6}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=10 dest: 10}, { cond=(AND p0 p1), acceptance={} source=10 dest: 11}], [{ cond=(NOT p1), acceptance={0} source=11 dest: 10}, { cond=p1, acceptance={} source=11 dest: 11}]], initial=0, aps=[p0:(AND (EQ s421 1) (EQ s16 1)), p1:(AND (EQ s288 1) (EQ s290 1)), p2:(NEQ s421 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22208 reset in 260 ms.
Product exploration explored 100000 steps with 22227 reset in 252 ms.
Computed a total of 120 stabilizing places and 120 stable transitions
Computed a total of 120 stabilizing places and 120 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), true, (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 380 ms. Reduced automaton from 12 states, 27 edges and 3 AP to 12 states, 27 edges and 3 AP.
Stuttering acceptance computed with spot in 458 ms :[(NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 523 rows 533 cols
[2022-05-19 01:30:25] [INFO ] Computed 91 place invariants in 2 ms
[2022-05-19 01:30:25] [INFO ] [Real]Absence check using 91 positive place invariants in 19 ms returned sat
[2022-05-19 01:30:25] [INFO ] After 196ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2022-05-19 01:30:25] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 0 ms to minimize.
[2022-05-19 01:30:25] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 0 ms to minimize.
[2022-05-19 01:30:25] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 0 ms to minimize.
[2022-05-19 01:30:26] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2022-05-19 01:30:26] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 0 ms to minimize.
[2022-05-19 01:30:26] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2022-05-19 01:30:26] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 0 ms to minimize.
[2022-05-19 01:30:26] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2022-05-19 01:30:26] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 0 ms to minimize.
[2022-05-19 01:30:26] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 780 ms
[2022-05-19 01:30:26] [INFO ] After 1071ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-19 01:30:26] [INFO ] After 1208ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-19 01:30:26] [INFO ] [Nat]Absence check using 91 positive place invariants in 18 ms returned sat
[2022-05-19 01:30:26] [INFO ] After 201ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-19 01:30:27] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 0 ms to minimize.
[2022-05-19 01:30:27] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 0 ms to minimize.
[2022-05-19 01:30:27] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 3 ms to minimize.
[2022-05-19 01:30:27] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 0 ms to minimize.
[2022-05-19 01:30:27] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 0 ms to minimize.
[2022-05-19 01:30:27] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 0 ms to minimize.
[2022-05-19 01:30:27] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 1 ms to minimize.
[2022-05-19 01:30:27] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 0 ms to minimize.
[2022-05-19 01:30:27] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 1 ms to minimize.
[2022-05-19 01:30:27] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 0 ms to minimize.
[2022-05-19 01:30:27] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 0 ms to minimize.
[2022-05-19 01:30:27] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2022-05-19 01:30:27] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1064 ms
[2022-05-19 01:30:28] [INFO ] After 1352ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 60 ms.
[2022-05-19 01:30:28] [INFO ] After 1528ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 45 ms.
Support contains 4 out of 533 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 533/533 places, 523/523 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 533 transition count 473
Reduce places removed 50 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 51 rules applied. Total rules applied 101 place count 483 transition count 472
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 102 place count 482 transition count 472
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 102 place count 482 transition count 421
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 204 place count 431 transition count 421
Performed 177 Post agglomeration using F-continuation condition.Transition count delta: 177
Deduced a syphon composed of 177 places in 1 ms
Reduce places removed 177 places and 0 transitions.
Iterating global reduction 3 with 354 rules applied. Total rules applied 558 place count 254 transition count 244
Partial Free-agglomeration rule applied 67 times.
Drop transitions removed 67 transitions
Iterating global reduction 3 with 67 rules applied. Total rules applied 625 place count 254 transition count 244
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 626 place count 253 transition count 243
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 627 place count 252 transition count 243
Applied a total of 627 rules in 31 ms. Remains 252 /533 variables (removed 281) and now considering 243/523 (removed 280) transitions.
Finished structural reductions, in 1 iterations. Remains : 252/533 places, 243/523 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 3) seen :0
Finished Best-First random walk after 586 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=293 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), true, (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (AND (NOT p2) p0 p1)), (F (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1)))), (F (AND (NOT p2) p1)), (F (AND (NOT p2) (NOT p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (AND p0 p1)), (F (NOT p2))]
Knowledge based reduction with 7 factoid took 853 ms. Reduced automaton from 12 states, 27 edges and 3 AP to 12 states, 27 edges and 3 AP.
Stuttering acceptance computed with spot in 473 ms :[(NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 411 ms :[(NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 4 out of 533 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 533/533 places, 523/523 transitions.
Applied a total of 0 rules in 14 ms. Remains 533 /533 variables (removed 0) and now considering 523/523 (removed 0) transitions.
// Phase 1: matrix 523 rows 533 cols
[2022-05-19 01:30:30] [INFO ] Computed 91 place invariants in 3 ms
[2022-05-19 01:30:30] [INFO ] Implicit Places using invariants in 132 ms returned []
// Phase 1: matrix 523 rows 533 cols
[2022-05-19 01:30:30] [INFO ] Computed 91 place invariants in 1 ms
[2022-05-19 01:30:30] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
// Phase 1: matrix 523 rows 533 cols
[2022-05-19 01:30:30] [INFO ] Computed 91 place invariants in 2 ms
[2022-05-19 01:30:30] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 533/533 places, 523/523 transitions.
Computed a total of 120 stabilizing places and 120 stable transitions
Computed a total of 120 stabilizing places and 120 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), true, (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 375 ms. Reduced automaton from 12 states, 27 edges and 3 AP to 12 states, 27 edges and 3 AP.
Stuttering acceptance computed with spot in 470 ms :[(NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 8 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 523 rows 533 cols
[2022-05-19 01:30:31] [INFO ] Computed 91 place invariants in 1 ms
[2022-05-19 01:30:32] [INFO ] [Real]Absence check using 91 positive place invariants in 17 ms returned sat
[2022-05-19 01:30:32] [INFO ] After 205ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2022-05-19 01:30:32] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2022-05-19 01:30:32] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 0 ms to minimize.
[2022-05-19 01:30:32] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2022-05-19 01:30:32] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 0 ms to minimize.
[2022-05-19 01:30:32] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 0 ms to minimize.
[2022-05-19 01:30:32] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 0 ms to minimize.
[2022-05-19 01:30:32] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2022-05-19 01:30:32] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2022-05-19 01:30:33] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 0 ms to minimize.
[2022-05-19 01:30:33] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 716 ms
[2022-05-19 01:30:33] [INFO ] After 1026ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-19 01:30:33] [INFO ] After 1143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-19 01:30:33] [INFO ] [Nat]Absence check using 91 positive place invariants in 20 ms returned sat
[2022-05-19 01:30:33] [INFO ] After 201ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-19 01:30:33] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 0 ms to minimize.
[2022-05-19 01:30:33] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 5 ms to minimize.
[2022-05-19 01:30:33] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2022-05-19 01:30:33] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2022-05-19 01:30:33] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2022-05-19 01:30:33] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 0 ms to minimize.
[2022-05-19 01:30:34] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 0 ms to minimize.
[2022-05-19 01:30:34] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 1 ms to minimize.
[2022-05-19 01:30:34] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 0 ms to minimize.
[2022-05-19 01:30:34] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2022-05-19 01:30:34] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2022-05-19 01:30:34] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 0 ms to minimize.
[2022-05-19 01:30:34] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1049 ms
[2022-05-19 01:30:34] [INFO ] After 1335ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 61 ms.
[2022-05-19 01:30:34] [INFO ] After 1521ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 24 ms.
Support contains 4 out of 533 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 533/533 places, 523/523 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 533 transition count 473
Reduce places removed 50 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 51 rules applied. Total rules applied 101 place count 483 transition count 472
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 102 place count 482 transition count 472
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 102 place count 482 transition count 421
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 204 place count 431 transition count 421
Performed 177 Post agglomeration using F-continuation condition.Transition count delta: 177
Deduced a syphon composed of 177 places in 1 ms
Reduce places removed 177 places and 0 transitions.
Iterating global reduction 3 with 354 rules applied. Total rules applied 558 place count 254 transition count 244
Partial Free-agglomeration rule applied 67 times.
Drop transitions removed 67 transitions
Iterating global reduction 3 with 67 rules applied. Total rules applied 625 place count 254 transition count 244
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 626 place count 253 transition count 243
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 627 place count 252 transition count 243
Applied a total of 627 rules in 29 ms. Remains 252 /533 variables (removed 281) and now considering 243/523 (removed 280) transitions.
Finished structural reductions, in 1 iterations. Remains : 252/533 places, 243/523 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 3) seen :0
Finished Best-First random walk after 654 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=130 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), true, (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (AND (NOT p2) p0 p1)), (F (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1)))), (F (AND (NOT p2) p1)), (F (AND (NOT p2) (NOT p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (AND p0 p1)), (F (NOT p2))]
Knowledge based reduction with 7 factoid took 623 ms. Reduced automaton from 12 states, 27 edges and 3 AP to 12 states, 27 edges and 3 AP.
Stuttering acceptance computed with spot in 424 ms :[(NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 805 ms :[(NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 413 ms :[(NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 22198 reset in 262 ms.
Product exploration explored 100000 steps with 22180 reset in 246 ms.
Applying partial POR strategy [false, false, false, false, false, true, true, false, false, true, true, true]
Stuttering acceptance computed with spot in 954 ms :[(NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 4 out of 533 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 533/533 places, 523/523 transitions.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 533 transition count 523
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 21 Pre rules applied. Total rules applied 50 place count 533 transition count 525
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 71 place count 533 transition count 525
Performed 208 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 279 places in 1 ms
Iterating global reduction 1 with 208 rules applied. Total rules applied 279 place count 533 transition count 525
Discarding 71 places :
Symmetric choice reduction at 1 with 71 rule applications. Total rules 350 place count 462 transition count 454
Deduced a syphon composed of 208 places in 1 ms
Iterating global reduction 1 with 71 rules applied. Total rules applied 421 place count 462 transition count 454
Deduced a syphon composed of 208 places in 0 ms
Applied a total of 421 rules in 142 ms. Remains 462 /533 variables (removed 71) and now considering 454/523 (removed 69) transitions.
[2022-05-19 01:30:38] [INFO ] Redundant transitions in 36 ms returned [453]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 453 rows 462 cols
[2022-05-19 01:30:38] [INFO ] Computed 91 place invariants in 2 ms
[2022-05-19 01:30:39] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 462/533 places, 453/523 transitions.
Deduced a syphon composed of 208 places in 1 ms
Applied a total of 0 rules in 9 ms. Remains 462 /462 variables (removed 0) and now considering 453/453 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 462/533 places, 453/523 transitions.
Product exploration explored 100000 steps with 22244 reset in 732 ms.
Product exploration explored 100000 steps with 22214 reset in 609 ms.
Built C files in :
/tmp/ltsmin3044914181454992562
[2022-05-19 01:30:40] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3044914181454992562
Running compilation step : cd /tmp/ltsmin3044914181454992562;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 771 ms.
Running link step : cd /tmp/ltsmin3044914181454992562;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin3044914181454992562;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6586720757547721642.hoa' '--buchi-type=spotba'
LTSmin run took 5677 ms.
FORMULA ShieldIIPs-PT-010B-LTLFireability-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPs-PT-010B-LTLFireability-13 finished in 24529 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(p0))))'
Support contains 1 out of 541 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 541/541 places, 531/531 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 540 transition count 479
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 102 place count 489 transition count 479
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 102 place count 489 transition count 428
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 204 place count 438 transition count 428
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 213 place count 429 transition count 419
Iterating global reduction 2 with 9 rules applied. Total rules applied 222 place count 429 transition count 419
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 222 place count 429 transition count 413
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 234 place count 423 transition count 413
Performed 171 Post agglomeration using F-continuation condition.Transition count delta: 171
Deduced a syphon composed of 171 places in 1 ms
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 2 with 342 rules applied. Total rules applied 576 place count 252 transition count 242
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 578 place count 250 transition count 240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 579 place count 249 transition count 240
Applied a total of 579 rules in 34 ms. Remains 249 /541 variables (removed 292) and now considering 240/531 (removed 291) transitions.
// Phase 1: matrix 240 rows 249 cols
[2022-05-19 01:30:47] [INFO ] Computed 90 place invariants in 2 ms
[2022-05-19 01:30:47] [INFO ] Implicit Places using invariants in 111 ms returned []
// Phase 1: matrix 240 rows 249 cols
[2022-05-19 01:30:47] [INFO ] Computed 90 place invariants in 1 ms
[2022-05-19 01:30:47] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2022-05-19 01:30:47] [INFO ] Redundant transitions in 24 ms returned [239]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 239 rows 249 cols
[2022-05-19 01:30:47] [INFO ] Computed 90 place invariants in 1 ms
[2022-05-19 01:30:47] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 249/541 places, 239/531 transitions.
Applied a total of 0 rules in 7 ms. Remains 249 /249 variables (removed 0) and now considering 239/239 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 249/541 places, 239/531 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s50 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 2934 steps with 6 reset in 16 ms.
FORMULA ShieldIIPs-PT-010B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010B-LTLFireability-14 finished in 556 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p1)||p0)))'
Support contains 3 out of 541 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 541/541 places, 531/531 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 533 transition count 523
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 533 transition count 523
Applied a total of 16 rules in 18 ms. Remains 533 /541 variables (removed 8) and now considering 523/531 (removed 8) transitions.
// Phase 1: matrix 523 rows 533 cols
[2022-05-19 01:30:47] [INFO ] Computed 91 place invariants in 4 ms
[2022-05-19 01:30:47] [INFO ] Implicit Places using invariants in 148 ms returned []
// Phase 1: matrix 523 rows 533 cols
[2022-05-19 01:30:47] [INFO ] Computed 91 place invariants in 1 ms
[2022-05-19 01:30:48] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
// Phase 1: matrix 523 rows 533 cols
[2022-05-19 01:30:48] [INFO ] Computed 91 place invariants in 2 ms
[2022-05-19 01:30:48] [INFO ] Dead Transitions using invariants and state equation in 235 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 533/541 places, 523/531 transitions.
Finished structural reductions, in 1 iterations. Remains : 533/541 places, 523/531 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(EQ s167 1), p0:(OR (EQ s487 0) (AND (EQ s167 1) (EQ s103 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 427 ms.
Product exploration explored 100000 steps with 50000 reset in 420 ms.
Computed a total of 119 stabilizing places and 119 stable transitions
Computed a total of 119 stabilizing places and 119 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 3 factoid took 220 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldIIPs-PT-010B-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-010B-LTLFireability-15 finished in 1922 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(p0))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G(p1)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p0)||X(p1)))||X(p1)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2022-05-19 01:30:49] [INFO ] Flatten gal took : 19 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2298112385792964789
[2022-05-19 01:30:49] [INFO ] Computing symmetric may disable matrix : 531 transitions.
[2022-05-19 01:30:49] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 01:30:49] [INFO ] Computing symmetric may enable matrix : 531 transitions.
[2022-05-19 01:30:49] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 01:30:49] [INFO ] Applying decomposition
[2022-05-19 01:30:50] [INFO ] Flatten gal took : 19 ms
[2022-05-19 01:30:50] [INFO ] Computing Do-Not-Accords matrix : 531 transitions.
[2022-05-19 01:30:50] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 01:30:50] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2298112385792964789
Running compilation step : cd /tmp/ltsmin2298112385792964789;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '144' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12007759645958756009.txt' '-o' '/tmp/graph12007759645958756009.bin' '-w' '/tmp/graph12007759645958756009.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12007759645958756009.bin' '-l' '-1' '-v' '-w' '/tmp/graph12007759645958756009.weights' '-q' '0' '-e' '0.001'
[2022-05-19 01:30:50] [INFO ] Decomposing Gal with order
[2022-05-19 01:30:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 01:30:50] [INFO ] Removed a total of 230 redundant transitions.
[2022-05-19 01:30:50] [INFO ] Flatten gal took : 56 ms
[2022-05-19 01:30:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-19 01:30:50] [INFO ] Time to serialize gal into /tmp/LTLFireability11081341882734580035.gal : 5 ms
[2022-05-19 01:30:50] [INFO ] Time to serialize properties into /tmp/LTLFireability3726195238389500612.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11081341882734580035.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3726195238389500612.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 5 LTL properties
Checking formula 0 : !((F(G("((i0.i3.u11.p26==0)&&(((i0.i4.u13.p33==0)||(i0.i4.u17.p44==0))||(i0.i7.u22.p69==0)))"))))
Formula 0 simplified : !FG"((i0.i3.u11.p26==0)&&(((i0.i4.u13.p33==0)||(i0.i4.u17.p44==0))||(i0.i7.u22.p69==0)))"
Compilation finished in 1194 ms.
Running link step : cd /tmp/ltsmin2298112385792964789;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin2298112385792964789;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>720 s) on command cd /tmp/ltsmin2298112385792964789;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin2298112385792964789;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(X((LTLAPp1==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-19 01:53:25] [INFO ] Applying decomposition
[2022-05-19 01:53:26] [INFO ] Flatten gal took : 158 ms
[2022-05-19 01:53:26] [INFO ] Decomposing Gal with order
[2022-05-19 01:53:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 01:53:26] [INFO ] Removed a total of 160 redundant transitions.
[2022-05-19 01:53:26] [INFO ] Flatten gal took : 151 ms
[2022-05-19 01:53:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 200 labels/synchronizations in 70 ms.
[2022-05-19 01:53:27] [INFO ] Time to serialize gal into /tmp/LTLFireability13581400628743852231.gal : 11 ms
[2022-05-19 01:53:27] [INFO ] Time to serialize properties into /tmp/LTLFireability12050760838712809095.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13581400628743852231.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12050760838712809095.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...269
Read 5 LTL properties
Checking formula 0 : !((F(G("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i1.u214.p26==0)&&(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.u22.p33==0)...260
Formula 0 simplified : !FG"((i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i1.u214.p26==0)&&(((i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.u22.p33==0)||...254
WARNING : LTSmin timed out (>720 s) on command cd /tmp/ltsmin2298112385792964789;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(X((LTLAPp1==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin2298112385792964789;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(<>([]((LTLAPp2==true)))||[]((LTLAPp3==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>720 s) on command cd /tmp/ltsmin2298112385792964789;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(<>([]((LTLAPp2==true)))||[]((LTLAPp3==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin2298112385792964789;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X((<>((LTLAPp4==true))||X((LTLAPp5==true))))||X((LTLAPp5==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-19 02:16:03] [INFO ] Flatten gal took : 363 ms
[2022-05-19 02:16:06] [INFO ] Input system was already deterministic with 531 transitions.
[2022-05-19 02:16:07] [INFO ] Transformed 541 places.
[2022-05-19 02:16:07] [INFO ] Transformed 531 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/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//..//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
[2022-05-19 02:16:07] [INFO ] Time to serialize gal into /tmp/LTLFireability3597021765674759006.gal : 17 ms
[2022-05-19 02:16:07] [INFO ] Time to serialize properties into /tmp/LTLFireability15795987589861584005.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3597021765674759006.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15795987589861584005.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 5 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G("((p26==0)&&(((p33==0)||(p44==0))||(p69==0)))"))))
Formula 0 simplified : !FG"((p26==0)&&(((p33==0)||(p44==0))||(p69==0)))"
WARNING : LTSmin timed out (>720 s) on command cd /tmp/ltsmin2298112385792964789;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X((<>((LTLAPp4==true))||X((LTLAPp5==true))))||X((LTLAPp5==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin2298112385792964789;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp6==true)))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-010B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is ShieldIIPs-PT-010B, 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 r222-tall-165286024700092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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