Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r393-oct2-167903716600092.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldIIPs-PT-010B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903716600092
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 8.8K Feb 25 16:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 16:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 16:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 16:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 25 16:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 16:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 16:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 164K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME 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 1679420735344

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-010B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 17:45:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 17:45:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 17:45:38] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2023-03-21 17:45:38] [INFO ] Transformed 603 places.
[2023-03-21 17:45:38] [INFO ] Transformed 593 transitions.
[2023-03-21 17:45:38] [INFO ] Found NUPN structural information;
[2023-03-21 17:45:38] [INFO ] Parsed PT model containing 603 places and 593 transitions and 1786 arcs in 216 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldIIPs-PT-010B-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-010B-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-010B-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-010B-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 603/603 places, 593/593 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 539 transition count 529
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 539 transition count 529
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 129 place count 538 transition count 528
Iterating global reduction 0 with 1 rules applied. Total rules applied 130 place count 538 transition count 528
Applied a total of 130 rules in 124 ms. Remains 538 /603 variables (removed 65) and now considering 528/593 (removed 65) transitions.
// Phase 1: matrix 528 rows 538 cols
[2023-03-21 17:45:38] [INFO ] Computed 91 place invariants in 13 ms
[2023-03-21 17:45:39] [INFO ] Implicit Places using invariants in 587 ms returned []
[2023-03-21 17:45:39] [INFO ] Invariant cache hit.
[2023-03-21 17:45:39] [INFO ] Implicit Places using invariants and state equation in 590 ms returned []
Implicit Place search using SMT with State Equation took 1211 ms to find 0 implicit places.
[2023-03-21 17:45:39] [INFO ] Invariant cache hit.
[2023-03-21 17:45:40] [INFO ] Dead Transitions using invariants and state equation in 648 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 538/603 places, 528/593 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1999 ms. Remains : 538/603 places, 528/593 transitions.
Support contains 43 out of 538 places after structural reductions.
[2023-03-21 17:45:40] [INFO ] Flatten gal took : 93 ms
[2023-03-21 17:45:40] [INFO ] Flatten gal took : 34 ms
[2023-03-21 17:45:40] [INFO ] Input system was already deterministic with 528 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 26) seen :25
Finished Best-First random walk after 5116 steps, including 1 resets, run visited all 1 properties in 9 ms. (steps per millisecond=568 )
Computed a total of 122 stabilizing places and 122 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (G(p0)||(p0&&G(!p1))))))'
Support contains 3 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 528/528 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 532 transition count 522
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 532 transition count 522
Applied a total of 12 rules in 48 ms. Remains 532 /538 variables (removed 6) and now considering 522/528 (removed 6) transitions.
// Phase 1: matrix 522 rows 532 cols
[2023-03-21 17:45:41] [INFO ] Computed 91 place invariants in 9 ms
[2023-03-21 17:45:42] [INFO ] Implicit Places using invariants in 313 ms returned []
[2023-03-21 17:45:42] [INFO ] Invariant cache hit.
[2023-03-21 17:45:42] [INFO ] Implicit Places using invariants and state equation in 612 ms returned []
Implicit Place search using SMT with State Equation took 931 ms to find 0 implicit places.
[2023-03-21 17:45:42] [INFO ] Invariant cache hit.
[2023-03-21 17:45:42] [INFO ] Dead Transitions using invariants and state equation in 280 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 532/538 places, 522/528 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1261 ms. Remains : 532/538 places, 522/528 transitions.
Stuttering acceptance computed with spot in 443 ms :[true, (NOT p0), (NOT p0), (AND (NOT p0) p1), p1]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(EQ s222 1), p1:(AND (EQ s180 1) (EQ s202 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, 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 2 ms.
FORMULA ShieldIIPs-PT-010B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010B-LTLFireability-01 finished in 1828 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G((p1||X(p2))))))'
Support contains 5 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 528/528 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 533 transition count 523
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 533 transition count 523
Applied a total of 10 rules in 25 ms. Remains 533 /538 variables (removed 5) and now considering 523/528 (removed 5) transitions.
// Phase 1: matrix 523 rows 533 cols
[2023-03-21 17:45:43] [INFO ] Computed 91 place invariants in 5 ms
[2023-03-21 17:45:43] [INFO ] Implicit Places using invariants in 242 ms returned []
[2023-03-21 17:45:43] [INFO ] Invariant cache hit.
[2023-03-21 17:45:44] [INFO ] Implicit Places using invariants and state equation in 854 ms returned []
Implicit Place search using SMT with State Equation took 1103 ms to find 0 implicit places.
[2023-03-21 17:45:44] [INFO ] Invariant cache hit.
[2023-03-21 17:45:45] [INFO ] Dead Transitions using invariants and state equation in 547 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 533/538 places, 523/528 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1676 ms. Remains : 533/538 places, 523/528 transitions.
Stuttering acceptance computed with spot in 286 ms :[true, (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=3, aps=[p0:(EQ s57 1), p1:(AND (EQ s342 1) (EQ s366 1)), p2:(AND (EQ s399 1) (EQ s467 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-010B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010B-LTLFireability-03 finished in 1986 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 538/538 places, 528/528 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 537 transition count 476
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 102 place count 486 transition count 476
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 486 transition count 425
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 435 transition count 425
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 210 place count 429 transition count 419
Iterating global reduction 2 with 6 rules applied. Total rules applied 216 place count 429 transition count 419
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 216 place count 429 transition count 416
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 222 place count 426 transition count 416
Performed 172 Post agglomeration using F-continuation condition.Transition count delta: 172
Deduced a syphon composed of 172 places in 0 ms
Reduce places removed 172 places and 0 transitions.
Iterating global reduction 2 with 344 rules applied. Total rules applied 566 place count 254 transition count 244
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 568 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 569 place count 251 transition count 242
Applied a total of 569 rules in 181 ms. Remains 251 /538 variables (removed 287) and now considering 242/528 (removed 286) transitions.
// Phase 1: matrix 242 rows 251 cols
[2023-03-21 17:45:45] [INFO ] Computed 90 place invariants in 2 ms
[2023-03-21 17:45:45] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-21 17:45:45] [INFO ] Invariant cache hit.
[2023-03-21 17:45:46] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
[2023-03-21 17:45:46] [INFO ] Redundant transitions in 139 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
[2023-03-21 17:45:46] [INFO ] Computed 90 place invariants in 1 ms
[2023-03-21 17:45:46] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 251/538 places, 241/528 transitions.
Applied a total of 0 rules in 19 ms. Remains 251 /251 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1061 ms. Remains : 251/538 places, 241/528 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s164 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 27111 reset in 491 ms.
Product exploration explored 100000 steps with 27073 reset in 450 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/251 stabilizing places and 2/241 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 265 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
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 270 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0)]
[2023-03-21 17:45:48] [INFO ] Invariant cache hit.
[2023-03-21 17:45:48] [INFO ] [Real]Absence check using 90 positive place invariants in 18 ms returned sat
[2023-03-21 17:45:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 17:45:48] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2023-03-21 17:45:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 17:45:48] [INFO ] [Nat]Absence check using 90 positive place invariants in 63 ms returned sat
[2023-03-21 17:45:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 17:45:49] [INFO ] [Nat]Absence check using state equation in 240 ms returned sat
[2023-03-21 17:45:49] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 3 ms to minimize.
[2023-03-21 17:45:49] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 0 ms to minimize.
[2023-03-21 17:45:49] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 2 ms to minimize.
[2023-03-21 17:45:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 242 ms
[2023-03-21 17:45:49] [INFO ] Computed and/alt/rep : 237/588/237 causal constraints (skipped 2 transitions) in 16 ms.
[2023-03-21 17:45:50] [INFO ] Added : 162 causal constraints over 33 iterations in 1267 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 251/251 places, 241/241 transitions.
Applied a total of 0 rules in 13 ms. Remains 251 /251 variables (removed 0) and now considering 241/241 (removed 0) transitions.
[2023-03-21 17:45:50] [INFO ] Invariant cache hit.
[2023-03-21 17:45:50] [INFO ] Implicit Places using invariants in 162 ms returned []
[2023-03-21 17:45:50] [INFO ] Invariant cache hit.
[2023-03-21 17:45:51] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
[2023-03-21 17:45:51] [INFO ] Redundant transitions in 98 ms returned []
[2023-03-21 17:45:51] [INFO ] Invariant cache hit.
[2023-03-21 17:45:52] [INFO ] Dead Transitions using invariants and state equation in 664 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1279 ms. Remains : 251/251 places, 241/241 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/251 stabilizing places and 2/241 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 168 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
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 276 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
[2023-03-21 17:45:52] [INFO ] Invariant cache hit.
[2023-03-21 17:45:52] [INFO ] [Real]Absence check using 90 positive place invariants in 17 ms returned sat
[2023-03-21 17:45:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 17:45:52] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2023-03-21 17:45:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 17:45:53] [INFO ] [Nat]Absence check using 90 positive place invariants in 17 ms returned sat
[2023-03-21 17:45:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 17:45:53] [INFO ] [Nat]Absence check using state equation in 276 ms returned sat
[2023-03-21 17:45:53] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 0 ms to minimize.
[2023-03-21 17:45:53] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 1 ms to minimize.
[2023-03-21 17:45:53] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 17:45:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 248 ms
[2023-03-21 17:45:53] [INFO ] Computed and/alt/rep : 237/588/237 causal constraints (skipped 2 transitions) in 19 ms.
[2023-03-21 17:45:54] [INFO ] Added : 162 causal constraints over 33 iterations in 1079 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 27344 reset in 331 ms.
Product exploration explored 100000 steps with 27306 reset in 401 ms.
Support contains 1 out of 251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 251/251 places, 241/241 transitions.
Applied a total of 0 rules in 20 ms. Remains 251 /251 variables (removed 0) and now considering 241/241 (removed 0) transitions.
[2023-03-21 17:45:55] [INFO ] Invariant cache hit.
[2023-03-21 17:45:55] [INFO ] Implicit Places using invariants in 366 ms returned []
[2023-03-21 17:45:55] [INFO ] Invariant cache hit.
[2023-03-21 17:45:56] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 758 ms to find 0 implicit places.
[2023-03-21 17:45:56] [INFO ] Redundant transitions in 39 ms returned []
[2023-03-21 17:45:56] [INFO ] Invariant cache hit.
[2023-03-21 17:45:56] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 982 ms. Remains : 251/251 places, 241/241 transitions.
Treatment of property ShieldIIPs-PT-010B-LTLFireability-04 finished in 11195 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((p1&&X(p2))))))'
Support contains 4 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 528/528 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 533 transition count 523
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 533 transition count 523
Applied a total of 10 rules in 33 ms. Remains 533 /538 variables (removed 5) and now considering 523/528 (removed 5) transitions.
// Phase 1: matrix 523 rows 533 cols
[2023-03-21 17:45:56] [INFO ] Computed 91 place invariants in 2 ms
[2023-03-21 17:45:56] [INFO ] Implicit Places using invariants in 139 ms returned []
[2023-03-21 17:45:56] [INFO ] Invariant cache hit.
[2023-03-21 17:45:57] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 551 ms to find 0 implicit places.
[2023-03-21 17:45:57] [INFO ] Invariant cache hit.
[2023-03-21 17:45:57] [INFO ] Dead Transitions using invariants and state equation in 534 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 533/538 places, 523/528 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1119 ms. Remains : 533/538 places, 523/528 transitions.
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s260 1), p1:(OR (EQ s478 1) (AND (EQ s497 1) (EQ s499 1))), p2:(AND (EQ s497 1) (EQ s499 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 55341 steps with 137 reset in 193 ms.
FORMULA ShieldIIPs-PT-010B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010B-LTLFireability-05 finished in 1556 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(F(p1))))'
Support contains 3 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 528/528 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 532 transition count 522
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 532 transition count 522
Applied a total of 12 rules in 37 ms. Remains 532 /538 variables (removed 6) and now considering 522/528 (removed 6) transitions.
// Phase 1: matrix 522 rows 532 cols
[2023-03-21 17:45:58] [INFO ] Computed 91 place invariants in 3 ms
[2023-03-21 17:45:58] [INFO ] Implicit Places using invariants in 225 ms returned []
[2023-03-21 17:45:58] [INFO ] Invariant cache hit.
[2023-03-21 17:45:58] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 701 ms to find 0 implicit places.
[2023-03-21 17:45:58] [INFO ] Invariant cache hit.
[2023-03-21 17:45:59] [INFO ] Dead Transitions using invariants and state equation in 263 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 532/538 places, 522/528 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1028 ms. Remains : 532/538 places, 522/528 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s227 1), p1:(OR (EQ s468 1) (EQ s531 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 3295 reset in 188 ms.
Product exploration explored 100000 steps with 3295 reset in 339 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/532 stabilizing places and 119/522 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 318 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p1) (NOT p0))]
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 4 factoid took 283 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) (NOT p0))]
[2023-03-21 17:46:00] [INFO ] Invariant cache hit.
[2023-03-21 17:46:01] [INFO ] [Real]Absence check using 91 positive place invariants in 73 ms returned sat
[2023-03-21 17:46:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 17:46:02] [INFO ] [Real]Absence check using state equation in 1099 ms returned sat
[2023-03-21 17:46:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 17:46:02] [INFO ] [Nat]Absence check using 91 positive place invariants in 76 ms returned sat
[2023-03-21 17:46:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 17:46:03] [INFO ] [Nat]Absence check using state equation in 785 ms returned sat
[2023-03-21 17:46:03] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 0 ms to minimize.
[2023-03-21 17:46:03] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 30 ms to minimize.
[2023-03-21 17:46:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 267 ms
[2023-03-21 17:46:03] [INFO ] Computed and/alt/rep : 521/1172/521 causal constraints (skipped 0 transitions) in 74 ms.
[2023-03-21 17:46:11] [INFO ] Added : 445 causal constraints over 89 iterations in 7612 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 3 out of 532 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 532/532 places, 522/522 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 531 transition count 471
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 100 place count 481 transition count 471
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 100 place count 481 transition count 421
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 200 place count 431 transition count 421
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 550 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 552 place count 254 transition count 244
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 553 place count 253 transition count 244
Applied a total of 553 rules in 66 ms. Remains 253 /532 variables (removed 279) and now considering 244/522 (removed 278) transitions.
// Phase 1: matrix 244 rows 253 cols
[2023-03-21 17:46:11] [INFO ] Computed 90 place invariants in 1 ms
[2023-03-21 17:46:11] [INFO ] Implicit Places using invariants in 178 ms returned []
[2023-03-21 17:46:11] [INFO ] Invariant cache hit.
[2023-03-21 17:46:11] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
[2023-03-21 17:46:11] [INFO ] Redundant transitions in 54 ms returned [243]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 243 rows 253 cols
[2023-03-21 17:46:11] [INFO ] Computed 90 place invariants in 12 ms
[2023-03-21 17:46:12] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 253/532 places, 243/522 transitions.
Applied a total of 0 rules in 16 ms. Remains 253 /253 variables (removed 0) and now considering 243/243 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 830 ms. Remains : 253/532 places, 243/522 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/253 stabilizing places and 2/243 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 3 factoid took 226 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-010B-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-010B-LTLFireability-06 finished in 14088 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(p1))||p0))))'
Support contains 5 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 528/528 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 533 transition count 523
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 533 transition count 523
Applied a total of 10 rules in 11 ms. Remains 533 /538 variables (removed 5) and now considering 523/528 (removed 5) transitions.
// Phase 1: matrix 523 rows 533 cols
[2023-03-21 17:46:12] [INFO ] Computed 91 place invariants in 2 ms
[2023-03-21 17:46:12] [INFO ] Implicit Places using invariants in 227 ms returned []
[2023-03-21 17:46:12] [INFO ] Invariant cache hit.
[2023-03-21 17:46:12] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 674 ms to find 0 implicit places.
[2023-03-21 17:46:12] [INFO ] Invariant cache hit.
[2023-03-21 17:46:13] [INFO ] Dead Transitions using invariants and state equation in 322 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 533/538 places, 523/528 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1026 ms. Remains : 533/538 places, 523/528 transitions.
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s60 0) (AND (EQ s453 1) (EQ s471 1) (EQ s478 1))), p1:(EQ s524 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 456 ms.
Product exploration explored 100000 steps with 50000 reset in 493 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 p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 6 factoid took 245 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-010B-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-010B-LTLFireability-08 finished in 2400 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(F(p0)))))))'
Support contains 1 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 528/528 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 532 transition count 522
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 532 transition count 522
Applied a total of 12 rules in 19 ms. Remains 532 /538 variables (removed 6) and now considering 522/528 (removed 6) transitions.
// Phase 1: matrix 522 rows 532 cols
[2023-03-21 17:46:14] [INFO ] Computed 91 place invariants in 2 ms
[2023-03-21 17:46:14] [INFO ] Implicit Places using invariants in 187 ms returned []
[2023-03-21 17:46:14] [INFO ] Invariant cache hit.
[2023-03-21 17:46:15] [INFO ] Implicit Places using invariants and state equation in 556 ms returned []
Implicit Place search using SMT with State Equation took 773 ms to find 0 implicit places.
[2023-03-21 17:46:15] [INFO ] Invariant cache hit.
[2023-03-21 17:46:15] [INFO ] Dead Transitions using invariants and state equation in 277 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 532/538 places, 522/528 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1079 ms. Remains : 532/538 places, 522/528 transitions.
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=4, aps=[p0:(EQ s483 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][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1373 steps with 7 reset in 4 ms.
FORMULA ShieldIIPs-PT-010B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010B-LTLFireability-09 finished in 1300 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X(G(!p0)))))'
Support contains 2 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 528/528 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 532 transition count 522
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 532 transition count 522
Applied a total of 12 rules in 15 ms. Remains 532 /538 variables (removed 6) and now considering 522/528 (removed 6) transitions.
[2023-03-21 17:46:16] [INFO ] Invariant cache hit.
[2023-03-21 17:46:16] [INFO ] Implicit Places using invariants in 153 ms returned []
[2023-03-21 17:46:16] [INFO ] Invariant cache hit.
[2023-03-21 17:46:16] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 646 ms to find 0 implicit places.
[2023-03-21 17:46:16] [INFO ] Invariant cache hit.
[2023-03-21 17:46:16] [INFO ] Dead Transitions using invariants and state equation in 253 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 532/538 places, 522/528 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 921 ms. Remains : 532/538 places, 522/528 transitions.
Stuttering acceptance computed with spot in 153 ms :[true, p0, p0, p0]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (EQ s81 1) (EQ s106 1))], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 566 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-010B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010B-LTLFireability-10 finished in 1113 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p0&&X(!p1)&&F(!p2))||(p0&&X(G(!p1)))))))'
Support contains 7 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 528/528 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 532 transition count 522
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 532 transition count 522
Applied a total of 12 rules in 11 ms. Remains 532 /538 variables (removed 6) and now considering 522/528 (removed 6) transitions.
[2023-03-21 17:46:17] [INFO ] Invariant cache hit.
[2023-03-21 17:46:17] [INFO ] Implicit Places using invariants in 194 ms returned []
[2023-03-21 17:46:17] [INFO ] Invariant cache hit.
[2023-03-21 17:46:17] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 619 ms to find 0 implicit places.
[2023-03-21 17:46:17] [INFO ] Invariant cache hit.
[2023-03-21 17:46:18] [INFO ] Dead Transitions using invariants and state equation in 276 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 532/538 places, 522/528 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 920 ms. Remains : 532/538 places, 522/528 transitions.
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND p0 p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}, { cond=(AND p0 p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p2 p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p2 p1), acceptance={0} source=3 dest: 4}], [{ cond=(AND p0 p2), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s36 0) (EQ s52 0) (EQ s63 0)), p2:(AND (EQ s39 1) (EQ s83 1)), p1:(AND (EQ s237 1) (EQ s262 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33281 reset in 362 ms.
Product exploration explored 100000 steps with 33317 reset in 376 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 p0 (NOT p2) (NOT p1)), (X (NOT (AND p0 p2 p1))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p2))), (X (NOT (AND p2 (NOT p1)))), (X p0), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 1111 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 345 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 186 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 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-21 17:46:20] [INFO ] Invariant cache hit.
[2023-03-21 17:46:20] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 17:46:20] [INFO ] [Nat]Absence check using 91 positive place invariants in 45 ms returned sat
[2023-03-21 17:46:21] [INFO ] After 336ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 17:46:21] [INFO ] Deduced a trap composed of 20 places in 206 ms of which 1 ms to minimize.
[2023-03-21 17:46:21] [INFO ] Deduced a trap composed of 23 places in 191 ms of which 1 ms to minimize.
[2023-03-21 17:46:22] [INFO ] Deduced a trap composed of 17 places in 197 ms of which 0 ms to minimize.
[2023-03-21 17:46:22] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 1 ms to minimize.
[2023-03-21 17:46:22] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 1 ms to minimize.
[2023-03-21 17:46:22] [INFO ] Deduced a trap composed of 15 places in 487 ms of which 0 ms to minimize.
[2023-03-21 17:46:23] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 0 ms to minimize.
[2023-03-21 17:46:23] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 1 ms to minimize.
[2023-03-21 17:46:23] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 0 ms to minimize.
[2023-03-21 17:46:23] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 1 ms to minimize.
[2023-03-21 17:46:23] [INFO ] Deduced a trap composed of 41 places in 161 ms of which 1 ms to minimize.
[2023-03-21 17:46:23] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 0 ms to minimize.
[2023-03-21 17:46:23] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 0 ms to minimize.
[2023-03-21 17:46:23] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 13 ms to minimize.
[2023-03-21 17:46:23] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2446 ms
[2023-03-21 17:46:23] [INFO ] After 2905ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 106 ms.
[2023-03-21 17:46:24] [INFO ] After 3226ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 65 ms.
Support contains 7 out of 532 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 522/522 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 532 transition count 473
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 483 transition count 473
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 98 place count 483 transition count 422
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 200 place count 432 transition count 422
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 550 place count 257 transition count 247
Partial Free-agglomeration rule applied 65 times.
Drop transitions removed 65 transitions
Iterating global reduction 2 with 65 rules applied. Total rules applied 615 place count 257 transition count 247
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 616 place count 256 transition count 246
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 617 place count 255 transition count 246
Applied a total of 617 rules in 44 ms. Remains 255 /532 variables (removed 277) and now considering 246/522 (removed 276) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 255/532 places, 246/522 transitions.
Incomplete random walk after 10000 steps, including 10 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 246 rows 255 cols
[2023-03-21 17:46:24] [INFO ] Computed 90 place invariants in 8 ms
[2023-03-21 17:46:24] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 17:46:24] [INFO ] [Nat]Absence check using 88 positive place invariants in 11 ms returned sat
[2023-03-21 17:46:24] [INFO ] [Nat]Absence check using 88 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-21 17:46:24] [INFO ] After 145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 17:46:24] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 1 ms to minimize.
[2023-03-21 17:46:24] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 0 ms to minimize.
[2023-03-21 17:46:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 241 ms
[2023-03-21 17:46:25] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2023-03-21 17:46:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2023-03-21 17:46:25] [INFO ] After 530ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-21 17:46:25] [INFO ] After 673ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 7 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 246/246 transitions.
Applied a total of 0 rules in 9 ms. Remains 255 /255 variables (removed 0) and now considering 246/246 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 255/255 places, 246/246 transitions.
Incomplete random walk after 10000 steps, including 10 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-21 17:46:25] [INFO ] Invariant cache hit.
[2023-03-21 17:46:25] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 17:46:25] [INFO ] [Nat]Absence check using 88 positive place invariants in 31 ms returned sat
[2023-03-21 17:46:25] [INFO ] [Nat]Absence check using 88 positive and 2 generalized place invariants in 27 ms returned sat
[2023-03-21 17:46:25] [INFO ] After 172ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 17:46:25] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2023-03-21 17:46:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2023-03-21 17:46:25] [INFO ] After 278ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-21 17:46:25] [INFO ] After 435ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 7 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 246/246 transitions.
Applied a total of 0 rules in 20 ms. Remains 255 /255 variables (removed 0) and now considering 246/246 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 255/255 places, 246/246 transitions.
Finished random walk after 4807 steps, including 5 resets, run visited all 1 properties in 19 ms. (steps per millisecond=253 )
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND p0 p2 p1))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p2))), (X (NOT (AND p2 (NOT p1)))), (X p0), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(F (AND p1 p0 p2)), (F (AND p1 p0)), (F (AND p1 (NOT p0) p2)), (F (AND (NOT p1) p2)), (F (NOT p0)), (F (AND p1 (NOT p0))), (F (AND p0 p2)), (F (AND (NOT p0) p2))]
Knowledge based reduction with 16 factoid took 1509 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 356 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Stuttering acceptance computed with spot in 379 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Support contains 7 out of 532 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 532/532 places, 522/522 transitions.
Applied a total of 0 rules in 7 ms. Remains 532 /532 variables (removed 0) and now considering 522/522 (removed 0) transitions.
// Phase 1: matrix 522 rows 532 cols
[2023-03-21 17:46:28] [INFO ] Computed 91 place invariants in 2 ms
[2023-03-21 17:46:28] [INFO ] Implicit Places using invariants in 221 ms returned []
[2023-03-21 17:46:28] [INFO ] Invariant cache hit.
[2023-03-21 17:46:28] [INFO ] Implicit Places using invariants and state equation in 475 ms returned []
Implicit Place search using SMT with State Equation took 719 ms to find 0 implicit places.
[2023-03-21 17:46:28] [INFO ] Invariant cache hit.
[2023-03-21 17:46:29] [INFO ] Dead Transitions using invariants and state equation in 466 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1206 ms. Remains : 532/532 places, 522/522 transitions.
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 p0 (NOT p2) (NOT p1)), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND p1 p0))), (X (NOT (AND p0 p2))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0 p2))), (X p0), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0 p2)))), (X (X p0)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 986 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-21 17:46:30] [INFO ] Invariant cache hit.
[2023-03-21 17:46:30] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 17:46:30] [INFO ] [Nat]Absence check using 91 positive place invariants in 20 ms returned sat
[2023-03-21 17:46:31] [INFO ] After 252ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 17:46:31] [INFO ] Deduced a trap composed of 20 places in 215 ms of which 1 ms to minimize.
[2023-03-21 17:46:31] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 0 ms to minimize.
[2023-03-21 17:46:31] [INFO ] Deduced a trap composed of 17 places in 151 ms of which 21 ms to minimize.
[2023-03-21 17:46:31] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 1 ms to minimize.
[2023-03-21 17:46:32] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 18 ms to minimize.
[2023-03-21 17:46:32] [INFO ] Deduced a trap composed of 15 places in 210 ms of which 17 ms to minimize.
[2023-03-21 17:46:32] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 1 ms to minimize.
[2023-03-21 17:46:32] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 1 ms to minimize.
[2023-03-21 17:46:32] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 1 ms to minimize.
[2023-03-21 17:46:32] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 0 ms to minimize.
[2023-03-21 17:46:33] [INFO ] Deduced a trap composed of 41 places in 175 ms of which 1 ms to minimize.
[2023-03-21 17:46:33] [INFO ] Deduced a trap composed of 33 places in 121 ms of which 1 ms to minimize.
[2023-03-21 17:46:33] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 1 ms to minimize.
[2023-03-21 17:46:33] [INFO ] Deduced a trap composed of 24 places in 219 ms of which 0 ms to minimize.
[2023-03-21 17:46:33] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2362 ms
[2023-03-21 17:46:33] [INFO ] After 2765ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 146 ms.
[2023-03-21 17:46:33] [INFO ] After 3096ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 49 ms.
Support contains 7 out of 532 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 522/522 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 532 transition count 473
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 483 transition count 473
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 98 place count 483 transition count 422
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 200 place count 432 transition count 422
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Deduced a syphon composed of 175 places in 0 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 2 with 350 rules applied. Total rules applied 550 place count 257 transition count 247
Partial Free-agglomeration rule applied 65 times.
Drop transitions removed 65 transitions
Iterating global reduction 2 with 65 rules applied. Total rules applied 615 place count 257 transition count 247
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 616 place count 256 transition count 246
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 617 place count 255 transition count 246
Applied a total of 617 rules in 46 ms. Remains 255 /532 variables (removed 277) and now considering 246/522 (removed 276) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 255/532 places, 246/522 transitions.
Incomplete random walk after 10000 steps, including 10 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 246 rows 255 cols
[2023-03-21 17:46:34] [INFO ] Computed 90 place invariants in 5 ms
[2023-03-21 17:46:34] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 17:46:34] [INFO ] [Nat]Absence check using 88 positive place invariants in 9 ms returned sat
[2023-03-21 17:46:34] [INFO ] [Nat]Absence check using 88 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-21 17:46:34] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 17:46:34] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2023-03-21 17:46:34] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 3 ms to minimize.
[2023-03-21 17:46:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 165 ms
[2023-03-21 17:46:34] [INFO ] After 259ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-21 17:46:34] [INFO ] After 335ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 7 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 246/246 transitions.
Applied a total of 0 rules in 12 ms. Remains 255 /255 variables (removed 0) and now considering 246/246 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 255/255 places, 246/246 transitions.
Finished random walk after 8629 steps, including 9 resets, run visited all 1 properties in 40 ms. (steps per millisecond=215 )
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND p1 p0))), (X (NOT (AND p0 p2))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0 p2))), (X p0), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0 p2)))), (X (X p0)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(F (AND p1 p0 p2)), (F (AND p1 p0)), (F (AND p1 (NOT p0) p2)), (F (AND (NOT p1) p2)), (F (NOT p0)), (F (AND p1 (NOT p0))), (F (AND p0 p2)), (F (AND (NOT p0) p2))]
Knowledge based reduction with 16 factoid took 1148 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Stuttering acceptance computed with spot in 324 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Stuttering acceptance computed with spot in 318 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Product exploration explored 100000 steps with 33375 reset in 307 ms.
Product exploration explored 100000 steps with 33371 reset in 304 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 397 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Support contains 7 out of 532 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 532/532 places, 522/522 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 532 transition count 522
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 23 Pre rules applied. Total rules applied 48 place count 532 transition count 524
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 71 place count 532 transition count 524
Performed 204 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 275 places in 0 ms
Iterating global reduction 1 with 204 rules applied. Total rules applied 275 place count 532 transition count 524
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 342 place count 465 transition count 457
Deduced a syphon composed of 208 places in 0 ms
Iterating global reduction 1 with 67 rules applied. Total rules applied 409 place count 465 transition count 457
Deduced a syphon composed of 208 places in 1 ms
Applied a total of 409 rules in 76 ms. Remains 465 /532 variables (removed 67) and now considering 457/522 (removed 65) transitions.
[2023-03-21 17:46:37] [INFO ] Redundant transitions in 48 ms returned [456]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 456 rows 465 cols
[2023-03-21 17:46:37] [INFO ] Computed 91 place invariants in 2 ms
[2023-03-21 17:46:38] [INFO ] Dead Transitions using invariants and state equation in 326 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 465/532 places, 456/522 transitions.
Deduced a syphon composed of 208 places in 1 ms
Applied a total of 0 rules in 23 ms. Remains 465 /465 variables (removed 0) and now considering 456/456 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 483 ms. Remains : 465/532 places, 456/522 transitions.
Support contains 7 out of 532 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 532/532 places, 522/522 transitions.
Applied a total of 0 rules in 8 ms. Remains 532 /532 variables (removed 0) and now considering 522/522 (removed 0) transitions.
// Phase 1: matrix 522 rows 532 cols
[2023-03-21 17:46:38] [INFO ] Computed 91 place invariants in 2 ms
[2023-03-21 17:46:38] [INFO ] Implicit Places using invariants in 244 ms returned []
[2023-03-21 17:46:38] [INFO ] Invariant cache hit.
[2023-03-21 17:46:38] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 680 ms to find 0 implicit places.
[2023-03-21 17:46:39] [INFO ] Invariant cache hit.
[2023-03-21 17:46:39] [INFO ] Dead Transitions using invariants and state equation in 419 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1121 ms. Remains : 532/532 places, 522/522 transitions.
Treatment of property ShieldIIPs-PT-010B-LTLFireability-11 finished in 22379 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p1)||p0))))'
Support contains 5 out of 538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 538/538 places, 528/528 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 537 transition count 478
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 488 transition count 478
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 98 place count 488 transition count 426
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 202 place count 436 transition count 426
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 208 place count 430 transition count 420
Iterating global reduction 2 with 6 rules applied. Total rules applied 214 place count 430 transition count 420
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 214 place count 430 transition count 417
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 220 place count 427 transition count 417
Performed 173 Post agglomeration using F-continuation condition.Transition count delta: 173
Deduced a syphon composed of 173 places in 0 ms
Reduce places removed 173 places and 0 transitions.
Iterating global reduction 2 with 346 rules applied. Total rules applied 566 place count 254 transition count 244
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 568 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 569 place count 251 transition count 242
Applied a total of 569 rules in 33 ms. Remains 251 /538 variables (removed 287) and now considering 242/528 (removed 286) transitions.
// Phase 1: matrix 242 rows 251 cols
[2023-03-21 17:46:39] [INFO ] Computed 90 place invariants in 0 ms
[2023-03-21 17:46:39] [INFO ] Implicit Places using invariants in 354 ms returned []
[2023-03-21 17:46:39] [INFO ] Invariant cache hit.
[2023-03-21 17:46:40] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 576 ms to find 0 implicit places.
[2023-03-21 17:46:40] [INFO ] Redundant transitions in 45 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
[2023-03-21 17:46:40] [INFO ] Computed 90 place invariants in 1 ms
[2023-03-21 17:46:40] [INFO ] Dead Transitions using invariants and state equation in 418 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 251/538 places, 241/528 transitions.
Applied a total of 0 rules in 13 ms. Remains 251 /251 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1105 ms. Remains : 251/538 places, 241/528 transitions.
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p1)), (AND (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: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s180 1) (NEQ s194 1)), p1:(OR (NEQ s211 1) (NEQ s218 1) (NEQ s228 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 201 reset in 433 ms.
Product exploration explored 100000 steps with 200 reset in 360 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 285 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1327 steps, including 2 resets, run visited all 2 properties in 9 ms. (steps per millisecond=147 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 391 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 251/251 places, 241/241 transitions.
Applied a total of 0 rules in 4 ms. Remains 251 /251 variables (removed 0) and now considering 241/241 (removed 0) transitions.
[2023-03-21 17:46:42] [INFO ] Invariant cache hit.
[2023-03-21 17:46:42] [INFO ] Implicit Places using invariants in 183 ms returned []
[2023-03-21 17:46:42] [INFO ] Invariant cache hit.
[2023-03-21 17:46:43] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
[2023-03-21 17:46:43] [INFO ] Redundant transitions in 56 ms returned []
[2023-03-21 17:46:43] [INFO ] Invariant cache hit.
[2023-03-21 17:46:43] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 674 ms. Remains : 251/251 places, 241/241 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 274 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1110 steps, including 2 resets, run visited all 2 properties in 5 ms. (steps per millisecond=222 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 247 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 199 reset in 397 ms.
Product exploration explored 100000 steps with 195 reset in 450 ms.
Support contains 5 out of 251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 251/251 places, 241/241 transitions.
Applied a total of 0 rules in 3 ms. Remains 251 /251 variables (removed 0) and now considering 241/241 (removed 0) transitions.
[2023-03-21 17:46:45] [INFO ] Invariant cache hit.
[2023-03-21 17:46:45] [INFO ] Implicit Places using invariants in 280 ms returned []
[2023-03-21 17:46:45] [INFO ] Invariant cache hit.
[2023-03-21 17:46:45] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 605 ms to find 0 implicit places.
[2023-03-21 17:46:45] [INFO ] Redundant transitions in 70 ms returned []
[2023-03-21 17:46:45] [INFO ] Invariant cache hit.
[2023-03-21 17:46:46] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 866 ms. Remains : 251/251 places, 241/241 transitions.
Treatment of property ShieldIIPs-PT-010B-LTLFireability-13 finished in 6579 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 3 out of 538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 538/538 places, 528/528 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 537 transition count 476
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 102 place count 486 transition count 476
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 486 transition count 425
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 435 transition count 425
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 209 place count 430 transition count 420
Iterating global reduction 2 with 5 rules applied. Total rules applied 214 place count 430 transition count 420
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 214 place count 430 transition count 418
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 218 place count 428 transition count 418
Performed 172 Post agglomeration using F-continuation condition.Transition count delta: 172
Deduced a syphon composed of 172 places in 1 ms
Reduce places removed 172 places and 0 transitions.
Iterating global reduction 2 with 344 rules applied. Total rules applied 562 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 564 place count 254 transition count 244
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 565 place count 253 transition count 244
Applied a total of 565 rules in 50 ms. Remains 253 /538 variables (removed 285) and now considering 244/528 (removed 284) transitions.
// Phase 1: matrix 244 rows 253 cols
[2023-03-21 17:46:46] [INFO ] Computed 90 place invariants in 1 ms
[2023-03-21 17:46:46] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-21 17:46:46] [INFO ] Invariant cache hit.
[2023-03-21 17:46:46] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2023-03-21 17:46:46] [INFO ] Redundant transitions in 27 ms returned [243]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 243 rows 253 cols
[2023-03-21 17:46:46] [INFO ] Computed 90 place invariants in 1 ms
[2023-03-21 17:46:46] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 253/538 places, 243/528 transitions.
Applied a total of 0 rules in 14 ms. Remains 253 /253 variables (removed 0) and now considering 243/243 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 478 ms. Remains : 253/538 places, 243/528 transitions.
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (EQ s180 1) (EQ s191 1)) (EQ s44 1)), p1:(EQ s44 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 535 steps with 0 reset in 2 ms.
FORMULA ShieldIIPs-PT-010B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010B-LTLFireability-14 finished in 538 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p0)&&F(p1))) U (p2&&X(p3))))'
Support contains 4 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 528/528 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 534 transition count 524
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 534 transition count 524
Applied a total of 8 rules in 28 ms. Remains 534 /538 variables (removed 4) and now considering 524/528 (removed 4) transitions.
// Phase 1: matrix 524 rows 534 cols
[2023-03-21 17:46:46] [INFO ] Computed 91 place invariants in 3 ms
[2023-03-21 17:46:46] [INFO ] Implicit Places using invariants in 211 ms returned []
[2023-03-21 17:46:46] [INFO ] Invariant cache hit.
[2023-03-21 17:46:47] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 771 ms to find 0 implicit places.
[2023-03-21 17:46:47] [INFO ] Invariant cache hit.
[2023-03-21 17:46:47] [INFO ] Dead Transitions using invariants and state equation in 360 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 534/538 places, 524/528 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1160 ms. Remains : 534/538 places, 524/528 transitions.
Stuttering acceptance computed with spot in 383 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p1)), (NOT p3), true, (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 1}, { cond=p2, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) p0 (NOT p3)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(AND p2 p0 (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 3}, { cond=(AND p2 p0 (NOT p3)), acceptance={0} source=2 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s15 1), p0:(NEQ s64 1), p1:(AND (EQ s466 1) (EQ s15 1)), p3:(EQ s374 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1218 steps with 0 reset in 5 ms.
FORMULA ShieldIIPs-PT-010B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010B-LTLFireability-15 finished in 1576 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p0&&X(!p1)&&F(!p2))||(p0&&X(G(!p1)))))))'
Found a Shortening insensitive property : ShieldIIPs-PT-010B-LTLFireability-11
Stuttering acceptance computed with spot in 354 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Support contains 7 out of 538 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 538/538 places, 528/528 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 537 transition count 477
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 100 place count 487 transition count 477
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 487 transition count 426
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 436 transition count 426
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 208 place count 430 transition count 420
Iterating global reduction 2 with 6 rules applied. Total rules applied 214 place count 430 transition count 420
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 214 place count 430 transition count 418
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 218 place count 428 transition count 418
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 558 place count 258 transition count 248
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 560 place count 256 transition count 246
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 561 place count 255 transition count 246
Applied a total of 561 rules in 69 ms. Remains 255 /538 variables (removed 283) and now considering 246/528 (removed 282) transitions.
// Phase 1: matrix 246 rows 255 cols
[2023-03-21 17:46:48] [INFO ] Computed 90 place invariants in 1 ms
[2023-03-21 17:46:49] [INFO ] Implicit Places using invariants in 504 ms returned []
[2023-03-21 17:46:49] [INFO ] Invariant cache hit.
[2023-03-21 17:46:49] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 776 ms to find 0 implicit places.
[2023-03-21 17:46:49] [INFO ] Invariant cache hit.
[2023-03-21 17:46:49] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 255/538 places, 246/528 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1031 ms. Remains : 255/538 places, 246/528 transitions.
Running random walk in product with property : ShieldIIPs-PT-010B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND p0 p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}, { cond=(AND p0 p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p2 p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p2 p1), acceptance={0} source=3 dest: 4}], [{ cond=(AND p0 p2), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s12 0) (EQ s22 0) (EQ s28 0)), p2:(AND (EQ s14 1) (EQ s37 1)), p1:(AND (EQ s112 1) (EQ s128 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33271 reset in 345 ms.
Product exploration explored 100000 steps with 33160 reset in 411 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND p0 p2 p1))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p2))), (X (NOT (AND p2 (NOT p1)))), (X p0), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 1113 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 401 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Finished random walk after 3642 steps, including 6 resets, run visited all 8 properties in 24 ms. (steps per millisecond=151 )
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND p0 p2 p1))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p2))), (X (NOT (AND p2 (NOT p1)))), (X p0), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(F (AND p1 p0 p2)), (F (AND p1 p0)), (F (AND p1 (NOT p0) p2)), (F (AND (NOT p1) p2)), (F (NOT p0)), (F (AND p1 (NOT p0))), (F (AND p0 p2)), (F (AND (NOT p0) p2))]
Knowledge based reduction with 16 factoid took 1365 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 295 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Stuttering acceptance computed with spot in 349 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Support contains 7 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 246/246 transitions.
Applied a total of 0 rules in 2 ms. Remains 255 /255 variables (removed 0) and now considering 246/246 (removed 0) transitions.
[2023-03-21 17:46:54] [INFO ] Invariant cache hit.
[2023-03-21 17:46:54] [INFO ] Implicit Places using invariants in 261 ms returned []
[2023-03-21 17:46:54] [INFO ] Invariant cache hit.
[2023-03-21 17:46:54] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 591 ms to find 0 implicit places.
[2023-03-21 17:46:54] [INFO ] Invariant cache hit.
[2023-03-21 17:46:54] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 771 ms. Remains : 255/255 places, 246/246 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND p1 p0))), (X (NOT (AND p0 p2))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0 p2))), (X p0), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0 p2)))), (X (X p0)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 1137 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Finished random walk after 5872 steps, including 10 resets, run visited all 8 properties in 73 ms. (steps per millisecond=80 )
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND p1 p0))), (X (NOT (AND p0 p2))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0 p2))), (X p0), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0 p2)))), (X (X p0)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(F (AND p1 p0 p2)), (F (AND p1 p0)), (F (AND p1 (NOT p0) p2)), (F (AND (NOT p1) p2)), (F (NOT p0)), (F (AND p1 (NOT p0))), (F (AND p0 p2)), (F (AND (NOT p0) p2))]
Knowledge based reduction with 16 factoid took 1408 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 502 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Stuttering acceptance computed with spot in 469 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Stuttering acceptance computed with spot in 490 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Product exploration explored 100000 steps with 33265 reset in 390 ms.
Product exploration explored 100000 steps with 33470 reset in 341 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 327 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2))]
Support contains 7 out of 255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 246/246 transitions.
Applied a total of 0 rules in 7 ms. Remains 255 /255 variables (removed 0) and now considering 246/246 (removed 0) transitions.
[2023-03-21 17:47:00] [INFO ] Redundant transitions in 90 ms returned [245]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 245 rows 255 cols
[2023-03-21 17:47:00] [INFO ] Computed 90 place invariants in 1 ms
[2023-03-21 17:47:00] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 255/255 places, 245/246 transitions.
Applied a total of 0 rules in 3 ms. Remains 255 /255 variables (removed 0) and now considering 245/245 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 357 ms. Remains : 255/255 places, 245/246 transitions.
Support contains 7 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 246/246 transitions.
Applied a total of 0 rules in 1 ms. Remains 255 /255 variables (removed 0) and now considering 246/246 (removed 0) transitions.
// Phase 1: matrix 246 rows 255 cols
[2023-03-21 17:47:00] [INFO ] Computed 90 place invariants in 0 ms
[2023-03-21 17:47:01] [INFO ] Implicit Places using invariants in 252 ms returned []
[2023-03-21 17:47:01] [INFO ] Invariant cache hit.
[2023-03-21 17:47:01] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
[2023-03-21 17:47:01] [INFO ] Invariant cache hit.
[2023-03-21 17:47:01] [INFO ] Dead Transitions using invariants and state equation in 303 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 775 ms. Remains : 255/255 places, 246/246 transitions.
Treatment of property ShieldIIPs-PT-010B-LTLFireability-11 finished in 13357 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p1)||p0))))'
[2023-03-21 17:47:01] [INFO ] Flatten gal took : 29 ms
[2023-03-21 17:47:01] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-21 17:47:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 538 places, 528 transitions and 1656 arcs took 4 ms.
Total runtime 83777 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2267/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2267/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2267/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldIIPs-PT-010B-LTLFireability-04
Could not compute solution for formula : ShieldIIPs-PT-010B-LTLFireability-11
Could not compute solution for formula : ShieldIIPs-PT-010B-LTLFireability-13

BK_STOP 1679420822849

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name ShieldIIPs-PT-010B-LTLFireability-04
ltl formula formula --ltl=/tmp/2267/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 538 places, 528 transitions and 1656 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2267/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2267/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2267/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.120 real 0.030 user 0.080 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2267/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55f6048673f4]
1: pnml2lts-mc(+0xa2496) [0x55f604867496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7ff6247c7140]
3: pnml2lts-mc(+0x405be5) [0x55f604bcabe5]
4: pnml2lts-mc(+0x16b3f9) [0x55f6049303f9]
5: pnml2lts-mc(+0x164ac4) [0x55f604929ac4]
6: pnml2lts-mc(+0x272e0a) [0x55f604a37e0a]
7: pnml2lts-mc(+0xb61f0) [0x55f60487b1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7ff62461a4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7ff62461a67a]
10: pnml2lts-mc(+0xa1581) [0x55f604866581]
11: pnml2lts-mc(+0xa1910) [0x55f604866910]
12: pnml2lts-mc(+0xa32a2) [0x55f6048682a2]
13: pnml2lts-mc(+0xa50f4) [0x55f60486a0f4]
14: pnml2lts-mc(+0x3f34b3) [0x55f604bb84b3]
15: pnml2lts-mc(+0x7c63d) [0x55f60484163d]
16: pnml2lts-mc(+0x67d86) [0x55f60482cd86]
17: pnml2lts-mc(+0x60a8a) [0x55f604825a8a]
18: pnml2lts-mc(+0x5eb15) [0x55f604823b15]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7ff624602d0a]
20: pnml2lts-mc(+0x6075e) [0x55f60482575e]
ltl formula name ShieldIIPs-PT-010B-LTLFireability-11
ltl formula formula --ltl=/tmp/2267/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 538 places, 528 transitions and 1656 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.100 real 0.020 user 0.050 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2267/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2267/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2267/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2267/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name ShieldIIPs-PT-010B-LTLFireability-13
ltl formula formula --ltl=/tmp/2267/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 538 places, 528 transitions and 1656 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.160 real 0.030 user 0.050 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2267/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2267/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2267/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2267/ltl_2_
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-010B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is 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 r393-oct2-167903716600092"
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 ;