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-167903717000396.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 ShieldPPPs-PT-003B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903717000396
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.1K Feb 26 02:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 02:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 02:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 02:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 02:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 26 02:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 02:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 26 02:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:58 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 52K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679444425469

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=ShieldPPPs-PT-003B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 00:20:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 00:20:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 00:20:30] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2023-03-22 00:20:30] [INFO ] Transformed 207 places.
[2023-03-22 00:20:30] [INFO ] Transformed 192 transitions.
[2023-03-22 00:20:30] [INFO ] Found NUPN structural information;
[2023-03-22 00:20:30] [INFO ] Parsed PT model containing 207 places and 192 transitions and 528 arcs in 326 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldPPPs-PT-003B-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-003B-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-003B-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 192/192 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 192 transition count 177
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 192 transition count 177
Applied a total of 30 rules in 74 ms. Remains 192 /207 variables (removed 15) and now considering 177/192 (removed 15) transitions.
// Phase 1: matrix 177 rows 192 cols
[2023-03-22 00:20:30] [INFO ] Computed 34 place invariants in 7 ms
[2023-03-22 00:20:31] [INFO ] Implicit Places using invariants in 669 ms returned []
[2023-03-22 00:20:31] [INFO ] Invariant cache hit.
[2023-03-22 00:20:31] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 1072 ms to find 0 implicit places.
[2023-03-22 00:20:31] [INFO ] Invariant cache hit.
[2023-03-22 00:20:32] [INFO ] Dead Transitions using invariants and state equation in 567 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 192/207 places, 177/192 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1714 ms. Remains : 192/207 places, 177/192 transitions.
Support contains 39 out of 192 places after structural reductions.
[2023-03-22 00:20:32] [INFO ] Flatten gal took : 36 ms
[2023-03-22 00:20:32] [INFO ] Flatten gal took : 17 ms
[2023-03-22 00:20:32] [INFO ] Input system was already deterministic with 177 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 32) seen :31
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:20:32] [INFO ] Invariant cache hit.
[2023-03-22 00:20:32] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-22 00:20:32] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA ShieldPPPs-PT-003B-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 39 stabilizing places and 39 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' '!(G(F((p0||G(p1)))))'
Support contains 4 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 177/177 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 191 transition count 154
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 169 transition count 154
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 44 place count 169 transition count 139
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 74 place count 154 transition count 139
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 80 place count 148 transition count 133
Iterating global reduction 2 with 6 rules applied. Total rules applied 86 place count 148 transition count 133
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 86 place count 148 transition count 131
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 90 place count 146 transition count 131
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 186 place count 98 transition count 83
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 188 place count 96 transition count 81
Applied a total of 188 rules in 72 ms. Remains 96 /192 variables (removed 96) and now considering 81/177 (removed 96) transitions.
// Phase 1: matrix 81 rows 96 cols
[2023-03-22 00:20:33] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-22 00:20:34] [INFO ] Implicit Places using invariants in 507 ms returned []
[2023-03-22 00:20:34] [INFO ] Invariant cache hit.
[2023-03-22 00:20:34] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 779 ms to find 0 implicit places.
[2023-03-22 00:20:34] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 00:20:34] [INFO ] Invariant cache hit.
[2023-03-22 00:20:34] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 96/192 places, 81/177 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1009 ms. Remains : 96/192 places, 81/177 transitions.
Stuttering acceptance computed with spot in 442 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s3 1) (EQ s25 1)), p0:(AND (EQ s52 1) (EQ s74 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 1862 reset in 412 ms.
Product exploration explored 100000 steps with 1842 reset in 346 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 (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 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 160 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 48 steps, including 0 resets, run visited all 2 properties in 24 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 387 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 131 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-22 00:20:37] [INFO ] Invariant cache hit.
[2023-03-22 00:20:37] [INFO ] [Real]Absence check using 34 positive place invariants in 11 ms returned sat
[2023-03-22 00:20:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 00:20:37] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2023-03-22 00:20:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 00:20:37] [INFO ] [Nat]Absence check using 34 positive place invariants in 6 ms returned sat
[2023-03-22 00:20:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 00:20:37] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2023-03-22 00:20:37] [INFO ] Computed and/alt/rep : 77/151/77 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 00:20:37] [INFO ] Added : 50 causal constraints over 10 iterations in 178 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 81/81 transitions.
Applied a total of 0 rules in 3 ms. Remains 96 /96 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-22 00:20:37] [INFO ] Invariant cache hit.
[2023-03-22 00:20:37] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-22 00:20:37] [INFO ] Invariant cache hit.
[2023-03-22 00:20:38] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2023-03-22 00:20:38] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 00:20:38] [INFO ] Invariant cache hit.
[2023-03-22 00:20:38] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 266 ms. Remains : 96/96 places, 81/81 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 (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 258 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 138 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 58 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 408 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 124 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-22 00:20:39] [INFO ] Invariant cache hit.
[2023-03-22 00:20:39] [INFO ] [Real]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-22 00:20:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 00:20:39] [INFO ] [Real]Absence check using state equation in 325 ms returned sat
[2023-03-22 00:20:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 00:20:39] [INFO ] [Nat]Absence check using 34 positive place invariants in 6 ms returned sat
[2023-03-22 00:20:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 00:20:40] [INFO ] [Nat]Absence check using state equation in 529 ms returned sat
[2023-03-22 00:20:40] [INFO ] Computed and/alt/rep : 77/151/77 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-22 00:20:40] [INFO ] Added : 50 causal constraints over 10 iterations in 329 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1854 reset in 236 ms.
Product exploration explored 100000 steps with 1858 reset in 358 ms.
Support contains 4 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 81/81 transitions.
Applied a total of 0 rules in 4 ms. Remains 96 /96 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-22 00:20:41] [INFO ] Invariant cache hit.
[2023-03-22 00:20:41] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-22 00:20:41] [INFO ] Invariant cache hit.
[2023-03-22 00:20:41] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
[2023-03-22 00:20:41] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 00:20:41] [INFO ] Invariant cache hit.
[2023-03-22 00:20:41] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 426 ms. Remains : 96/96 places, 81/81 transitions.
Treatment of property ShieldPPPs-PT-003B-LTLFireability-01 finished in 8163 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(F((p1&&F(p2)))))) U p1))'
Support contains 3 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 177/177 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 192 transition count 154
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 169 transition count 154
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 46 place count 169 transition count 139
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 76 place count 154 transition count 139
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 82 place count 148 transition count 133
Iterating global reduction 2 with 6 rules applied. Total rules applied 88 place count 148 transition count 133
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 88 place count 148 transition count 131
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 92 place count 146 transition count 131
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 188 place count 98 transition count 83
Applied a total of 188 rules in 17 ms. Remains 98 /192 variables (removed 94) and now considering 83/177 (removed 94) transitions.
// Phase 1: matrix 83 rows 98 cols
[2023-03-22 00:20:41] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-22 00:20:42] [INFO ] Implicit Places using invariants in 598 ms returned []
[2023-03-22 00:20:42] [INFO ] Invariant cache hit.
[2023-03-22 00:20:44] [INFO ] Implicit Places using invariants and state equation in 2042 ms returned []
Implicit Place search using SMT with State Equation took 2647 ms to find 0 implicit places.
[2023-03-22 00:20:44] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 00:20:44] [INFO ] Invariant cache hit.
[2023-03-22 00:20:44] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 98/192 places, 83/177 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2744 ms. Remains : 98/192 places, 83/177 transitions.
Stuttering acceptance computed with spot in 304 ms :[(NOT p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s4 1), p0:(OR (EQ s0 1) (EQ s60 1)), p2:(EQ s60 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 229 steps with 1 reset in 1 ms.
FORMULA ShieldPPPs-PT-003B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-003B-LTLFireability-02 finished in 3075 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 (p1 U X(p2))) U G(p0)) U X(!p3)))'
Support contains 3 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 177/177 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 187 transition count 172
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 187 transition count 172
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 186 transition count 171
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 186 transition count 171
Applied a total of 12 rules in 27 ms. Remains 186 /192 variables (removed 6) and now considering 171/177 (removed 6) transitions.
// Phase 1: matrix 171 rows 186 cols
[2023-03-22 00:20:45] [INFO ] Computed 34 place invariants in 3 ms
[2023-03-22 00:20:45] [INFO ] Implicit Places using invariants in 169 ms returned []
[2023-03-22 00:20:45] [INFO ] Invariant cache hit.
[2023-03-22 00:20:45] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 504 ms to find 0 implicit places.
[2023-03-22 00:20:45] [INFO ] Invariant cache hit.
[2023-03-22 00:20:45] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 186/192 places, 171/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 705 ms. Remains : 186/192 places, 171/177 transitions.
Stuttering acceptance computed with spot in 519 ms :[p3, (AND (NOT p2) p3), p3, (AND p0 (NOT p2) p3), true, (NOT p2), (NOT p0), (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p2) p3), acceptance={} source=1 dest: 4}], [{ cond=p3, acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=2 dest: 5}, { cond=p3, acceptance={} source=2 dest: 6}, { cond=(AND (NOT p0) p1 p3), acceptance={} source=2 dest: 7}], [{ cond=(AND p0 (NOT p1) (NOT p2) p3), acceptance={} source=3 dest: 5}, { cond=(AND p0 p1 (NOT p2) p3), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}, { cond=(NOT p0), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(EQ s163 1), p1:(EQ s56 1), p2:(EQ s114 1), p3:(AND (EQ s163 1) (EQ s56 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 188 ms.
Product exploration explored 100000 steps with 50000 reset in 248 ms.
Computed a total of 35 stabilizing places and 35 stable transitions
Computed a total of 35 stabilizing places and 35 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT p3)), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND p0 (NOT p1) (NOT p2) p3))), (X (NOT (AND p0 p1 (NOT p2) p3))), (X (NOT (AND (NOT p0) p1 p3))), (X (NOT (AND (NOT p0) (NOT p1) p3))), true, (X (X (NOT p3))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p3))
Knowledge based reduction with 17 factoid took 517 ms. Reduced automaton from 8 states, 18 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-003B-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-003B-LTLFireability-03 finished in 2259 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(p1)))&&X(G(p2))))'
Support contains 2 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 177/177 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 186 transition count 171
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 186 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 185 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 185 transition count 170
Applied a total of 14 rules in 8 ms. Remains 185 /192 variables (removed 7) and now considering 170/177 (removed 7) transitions.
// Phase 1: matrix 170 rows 185 cols
[2023-03-22 00:20:47] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-22 00:20:47] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-22 00:20:47] [INFO ] Invariant cache hit.
[2023-03-22 00:20:47] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2023-03-22 00:20:47] [INFO ] Invariant cache hit.
[2023-03-22 00:20:47] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 185/192 places, 170/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 392 ms. Remains : 185/192 places, 170/177 transitions.
Stuttering acceptance computed with spot in 264 ms :[(NOT p2), true, (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND p0 p2) (AND p1 p2)), acceptance={0} source=3 dest: 0}, { cond=(NOT p2), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p2:(EQ s138 1), p0:(EQ s161 1), p1:(EQ s138 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-003B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-003B-LTLFireability-05 finished in 705 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((G(p0) U ((F(p1)||X(p2)) U (G((F(p1)||X(p2)))||(!p3&&(F(p1)||X(p2)))))))))'
Support contains 5 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 177/177 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 188 transition count 173
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 188 transition count 173
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 187 transition count 172
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 187 transition count 172
Applied a total of 10 rules in 9 ms. Remains 187 /192 variables (removed 5) and now considering 172/177 (removed 5) transitions.
// Phase 1: matrix 172 rows 187 cols
[2023-03-22 00:20:47] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-22 00:20:48] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-22 00:20:48] [INFO ] Invariant cache hit.
[2023-03-22 00:20:48] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
[2023-03-22 00:20:48] [INFO ] Invariant cache hit.
[2023-03-22 00:20:48] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 187/192 places, 172/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 705 ms. Remains : 187/192 places, 172/177 transitions.
Stuttering acceptance computed with spot in 824 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), false, false, false]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}, { cond=(AND p3 (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 2} source=1 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1, 2} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 5}, { cond=(AND p3 (NOT p1) (NOT p0) (NOT p2)), acceptance={1, 2} source=1 dest: 6}, { cond=(AND p3 (NOT p1) p0 (NOT p2)), acceptance={1, 2} source=1 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=2 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 2} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 5}, { cond=(AND p3 (NOT p1) (NOT p0) (NOT p2)), acceptance={1, 2} source=2 dest: 6}, { cond=(AND p3 (NOT p1) p0 (NOT p2)), acceptance={2} source=2 dest: 7}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=2 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=3 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 2} source=3 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1, 2} source=3 dest: 3}, { cond=(AND p3 (NOT p1) (NOT p0) (NOT p2)), acceptance={1, 2} source=3 dest: 6}, { cond=(AND p3 (NOT p1) p0 (NOT p2)), acceptance={1, 2} source=3 dest: 8}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 1}, { cond=(AND p3 p0), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=5 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 2} source=5 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0, 1, 2} source=5 dest: 3}, { cond=(NOT p1), acceptance={0, 1} source=5 dest: 5}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={1, 2} source=5 dest: 6}, { cond=(AND p3 (NOT p1) p0), acceptance={1, 2} source=5 dest: 8}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1} source=6 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0, 1, 2} source=6 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 2} source=6 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 1, 2} source=6 dest: 3}, { cond=(AND p3 (NOT p1) p0), acceptance={1} source=6 dest: 6}, { cond=(AND p3 (NOT p1) (NOT p0) p2), acceptance={1, 2} source=6 dest: 6}, { cond=(AND p3 (NOT p1) p0 p2), acceptance={1, 2} source=6 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={0, 1, 2} source=7 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 2} source=7 dest: 2}, { cond=(AND p3 (NOT p1) (NOT p0) p2), acceptance={1, 2} source=7 dest: 6}, { cond=(AND p3 (NOT p1) p0 p2), acceptance={2} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={0, 1, 2} source=8 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 2} source=8 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 1, 2} source=8 dest: 3}, { cond=(AND p3 (NOT p1) (NOT p0) p2), acceptance={1, 2} source=8 dest: 6}, { cond=(AND p3 (NOT p1) p0 p2), acceptance={1, 2} source=8 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={0, 1, 2} source=9 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 2} source=9 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0, 1} source=9 dest: 5}, { cond=(AND p3 (NOT p1) (NOT p0) p2), acceptance={1, 2} source=9 dest: 6}, { cond=(AND p3 (NOT p1) p0 p2), acceptance={2} source=9 dest: 7}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=9 dest: 9}]], initial=0, aps=[p1:(EQ s106 1), p0:(EQ s63 1), p3:(AND (EQ s91 1) (EQ s172 1)), p2:(EQ s166 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4642 reset in 186 ms.
Product exploration explored 100000 steps with 4749 reset in 272 ms.
Computed a total of 37 stabilizing places and 37 stable transitions
Computed a total of 37 stabilizing places and 37 stable transitions
Detected a total of 37/187 stabilizing places and 37/172 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), (X (NOT (AND p3 (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p3 (NOT p1) p0 (NOT p2)))), (X (NOT (AND p3 p0))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (AND (NOT p1) (NOT p2))), (X (X (NOT (AND p3 (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p3 p0)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p3 (NOT p1) p0 p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND p3 (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p3 (NOT p1) (NOT p0))))), (X (X (NOT (AND p3 (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p3 (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 25 factoid took 4511 ms. Reduced automaton from 10 states, 52 edges and 4 AP (stutter sensitive) to 15 states, 78 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 1230 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), false, false, false, false, false, false, false, false]
Incomplete random walk after 10000 steps, including 17 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 16) seen :12
Finished Best-First random walk after 661 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=330 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), (X (NOT (AND p3 (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p3 (NOT p1) p0 (NOT p2)))), (X (NOT (AND p3 p0))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (AND (NOT p1) (NOT p2))), (X (X (NOT (AND p3 (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p3 p0)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p3 (NOT p1) p0 p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (X (X (NOT (AND p3 (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p3 (NOT p1) (NOT p0))))), (X (X (NOT (AND p3 (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p3 (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND p0 p2 (NOT p1) (NOT p3))), (F (AND p0 p3)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p2 (NOT p1) (NOT p3))), (F (AND (NOT p0) (NOT p2) (NOT p1) p3)), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (AND p0 p2 (NOT p1) p3)), (F (AND (NOT p0) p2 (NOT p1) p3)), (F (AND p0 p2 (NOT p1))), (F (AND p0 (NOT p1) p3)), (F (AND p0 (NOT p2) (NOT p1) p3)), (F (AND (NOT p0) p2 (NOT p1))), (F (AND (NOT p0) p3)), (F (AND p0 (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p1) p3)), (F (OR (AND p0 (NOT p1)) (AND p2 (NOT p1))))]
Knowledge based reduction with 25 factoid took 7021 ms. Reduced automaton from 15 states, 78 edges and 4 AP (stutter insensitive) to 15 states, 78 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 1243 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 1366 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), false, false, false, false, false, false, false, false]
[2023-03-22 00:21:05] [INFO ] Invariant cache hit.
[2023-03-22 00:21:05] [INFO ] [Real]Absence check using 34 positive place invariants in 10 ms returned sat
[2023-03-22 00:21:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 00:21:05] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2023-03-22 00:21:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 00:21:06] [INFO ] [Nat]Absence check using 34 positive place invariants in 16 ms returned sat
[2023-03-22 00:21:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 00:21:06] [INFO ] [Nat]Absence check using state equation in 346 ms returned sat
[2023-03-22 00:21:06] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 4 ms to minimize.
[2023-03-22 00:21:06] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2023-03-22 00:21:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 190 ms
[2023-03-22 00:21:06] [INFO ] Computed and/alt/rep : 171/301/171 causal constraints (skipped 0 transitions) in 17 ms.
[2023-03-22 00:21:08] [INFO ] Added : 171 causal constraints over 35 iterations in 1294 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 5 out of 187 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 187/187 places, 172/172 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 186 transition count 150
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 165 transition count 150
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 42 place count 165 transition count 135
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 72 place count 150 transition count 135
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 170 place count 101 transition count 86
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 172 place count 99 transition count 84
Applied a total of 172 rules in 23 ms. Remains 99 /187 variables (removed 88) and now considering 84/172 (removed 88) transitions.
// Phase 1: matrix 84 rows 99 cols
[2023-03-22 00:21:08] [INFO ] Computed 34 place invariants in 0 ms
[2023-03-22 00:21:08] [INFO ] Implicit Places using invariants in 195 ms returned []
[2023-03-22 00:21:08] [INFO ] Invariant cache hit.
[2023-03-22 00:21:08] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
[2023-03-22 00:21:08] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 00:21:08] [INFO ] Invariant cache hit.
[2023-03-22 00:21:08] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/187 places, 84/172 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 696 ms. Remains : 99/187 places, 84/172 transitions.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Detected a total of 5/99 stabilizing places and 5/84 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) p3))), (X (NOT (AND p0 p2 (NOT p1) p3))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 (NOT p1) p3))), (X (NOT (AND p0 p2 (NOT p1) (NOT p3)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p3))), (X (NOT (AND (NOT p0) p2 (NOT p1) p3))), (X (NOT (AND p0 (NOT p2) (NOT p1) p3))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) p3))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) p3)))), (X (X (NOT (AND p0 p2 (NOT p1) p3)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (NOT (AND p0 p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1) p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1) p3)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (OR (AND p0 (NOT p1)) (AND p2 (NOT p1)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p2 (NOT p1))))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND (NOT p0) p2 (NOT p1) (NOT p3))), (X (NOT (AND (NOT p0) p2 (NOT p1) (NOT p3)))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (OR (AND p0 (NOT p1)) (AND p2 (NOT p1))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p2 (NOT p1)))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1) (NOT p3))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
Knowledge based reduction with 25 factoid took 8128 ms. Reduced automaton from 15 states, 78 edges and 4 AP (stutter insensitive) to 15 states, 78 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 1135 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), false, false, false, false, false, false, false, false]
Incomplete random walk after 10000 steps, including 42 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 16) seen :13
Finished Best-First random walk after 149 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=74 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) p3))), (X (NOT (AND p0 p2 (NOT p1) p3))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 (NOT p1) p3))), (X (NOT (AND p0 p2 (NOT p1) (NOT p3)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p3))), (X (NOT (AND (NOT p0) p2 (NOT p1) p3))), (X (NOT (AND p0 (NOT p2) (NOT p1) p3))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) p3))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) p3)))), (X (X (NOT (AND p0 p2 (NOT p1) p3)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (NOT (AND p0 p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1) p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1) p3)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (OR (AND p0 (NOT p1)) (AND p2 (NOT p1)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p2 (NOT p1))))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND (NOT p0) p2 (NOT p1) (NOT p3))), (X (NOT (AND (NOT p0) p2 (NOT p1) (NOT p3)))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (OR (AND p0 (NOT p1)) (AND p2 (NOT p1))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p2 (NOT p1)))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1) (NOT p3))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (AND p0 (NOT p1) p2 (NOT p3))), (F (AND p0 p3)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1) p2 (NOT p3))), (F (AND (NOT p0) (NOT p1) (NOT p2) p3)), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND p0 (NOT p1) p2 p3)), (F (AND (NOT p0) (NOT p1) p2 p3)), (F (AND p0 (NOT p1) p2)), (F (AND p0 (NOT p1) p3)), (F (AND p0 (NOT p1) (NOT p2) p3)), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) p3)), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) p3)), (F (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)))]
Knowledge based reduction with 25 factoid took 9048 ms. Reduced automaton from 15 states, 78 edges and 4 AP (stutter insensitive) to 15 states, 78 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 1191 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 1350 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), false, false, false, false, false, false, false, false]
[2023-03-22 00:21:29] [INFO ] Invariant cache hit.
[2023-03-22 00:21:30] [INFO ] [Real]Absence check using 34 positive place invariants in 12 ms returned sat
[2023-03-22 00:21:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 00:21:30] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2023-03-22 00:21:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 00:21:30] [INFO ] [Nat]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-22 00:21:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 00:21:30] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2023-03-22 00:21:30] [INFO ] Computed and/alt/rep : 81/184/81 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-22 00:21:31] [INFO ] Added : 76 causal constraints over 16 iterations in 617 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 1155 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), false, false, false, false, false, false, false, false]
Product exploration explored 100000 steps with 16373 reset in 297 ms.
Product exploration explored 100000 steps with 16046 reset in 255 ms.
Support contains 5 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 84/84 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-22 00:21:32] [INFO ] Invariant cache hit.
[2023-03-22 00:21:32] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-22 00:21:32] [INFO ] Invariant cache hit.
[2023-03-22 00:21:33] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2023-03-22 00:21:33] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 00:21:33] [INFO ] Invariant cache hit.
[2023-03-22 00:21:33] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 242 ms. Remains : 99/99 places, 84/84 transitions.
Treatment of property ShieldPPPs-PT-003B-LTLFireability-06 finished in 45239 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((p0 U (p1||G(p0))))&&(G(!p2)||(!p2&&F(p3)))))))'
Support contains 4 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 177/177 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 187 transition count 172
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 187 transition count 172
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 186 transition count 171
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 186 transition count 171
Applied a total of 12 rules in 4 ms. Remains 186 /192 variables (removed 6) and now considering 171/177 (removed 6) transitions.
// Phase 1: matrix 171 rows 186 cols
[2023-03-22 00:21:33] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-22 00:21:33] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-22 00:21:33] [INFO ] Invariant cache hit.
[2023-03-22 00:21:33] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
[2023-03-22 00:21:33] [INFO ] Invariant cache hit.
[2023-03-22 00:21:33] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 186/192 places, 171/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 543 ms. Remains : 186/192 places, 171/177 transitions.
Stuttering acceptance computed with spot in 480 ms :[(OR p2 (AND (NOT p0) (NOT p1))), (OR p2 (AND (NOT p0) (NOT p1))), (OR p2 (AND (NOT p0) (NOT p1))), true, (AND (NOT p1) (NOT p0)), (AND (NOT p3) p2), (NOT p3)]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p2, acceptance={} source=2 dest: 3}, { cond=(NOT p2), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=5 dest: 5}, { cond=(AND p2 (NOT p3)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p3), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(AND (EQ s174 1) (EQ s5 1) (EQ s24 1)), p3:(EQ s173 1), p1:(AND (NOT (AND (EQ s5 1) (EQ s24 1))) (NEQ s174 1)), p0:(NEQ s174 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 939 steps with 2 reset in 5 ms.
FORMULA ShieldPPPs-PT-003B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-003B-LTLFireability-07 finished in 1055 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) U p1) U p2)))'
Support contains 4 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 177/177 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 186 transition count 171
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 186 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 185 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 185 transition count 170
Applied a total of 14 rules in 13 ms. Remains 185 /192 variables (removed 7) and now considering 170/177 (removed 7) transitions.
// Phase 1: matrix 170 rows 185 cols
[2023-03-22 00:21:34] [INFO ] Computed 34 place invariants in 6 ms
[2023-03-22 00:21:34] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-22 00:21:34] [INFO ] Invariant cache hit.
[2023-03-22 00:21:34] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
[2023-03-22 00:21:34] [INFO ] Invariant cache hit.
[2023-03-22 00:21:34] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 185/192 places, 170/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 598 ms. Remains : 185/192 places, 170/177 transitions.
Stuttering acceptance computed with spot in 249 ms :[(NOT p2), (NOT p2), true, (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s168 1), p1:(NEQ s54 1), p0:(AND (EQ s149 1) (EQ s183 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 7298 reset in 164 ms.
Product exploration explored 100000 steps with 7453 reset in 136 ms.
Computed a total of 35 stabilizing places and 35 stable transitions
Computed a total of 35 stabilizing places and 35 stable transitions
Detected a total of 35/185 stabilizing places and 35/170 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (OR (AND (NOT p2) p1) (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (OR (AND (NOT p2) p1) (AND (NOT p2) p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 752 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 269 ms :[(NOT p2), (NOT p2), true, (NOT p0), (NOT p1)]
Finished random walk after 3421 steps, including 6 resets, run visited all 6 properties in 40 ms. (steps per millisecond=85 )
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (OR (AND (NOT p2) p1) (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (OR (AND (NOT p2) p1) (AND (NOT p2) p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F p0), (F (AND (NOT p1) p0)), (F (NOT (OR (AND p1 (NOT p2)) (AND (NOT p2) p0)))), (F (AND (NOT p1) (NOT p2) p0)), (F (AND (NOT p1) (NOT p2) (NOT p0)))]
Knowledge based reduction with 12 factoid took 1095 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(NOT p2), (NOT p2), true, (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 307 ms :[(NOT p2), (NOT p2), true, (NOT p0), (NOT p1)]
[2023-03-22 00:21:38] [INFO ] Invariant cache hit.
[2023-03-22 00:21:38] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-22 00:21:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 00:21:38] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2023-03-22 00:21:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 00:21:38] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-22 00:21:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 00:21:38] [INFO ] [Nat]Absence check using state equation in 326 ms returned sat
[2023-03-22 00:21:39] [INFO ] Deduced a trap composed of 16 places in 187 ms of which 21 ms to minimize.
[2023-03-22 00:21:39] [INFO ] Deduced a trap composed of 20 places in 170 ms of which 13 ms to minimize.
[2023-03-22 00:21:39] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 0 ms to minimize.
[2023-03-22 00:21:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 461 ms
[2023-03-22 00:21:39] [INFO ] Computed and/alt/rep : 169/299/169 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-22 00:21:40] [INFO ] Added : 134 causal constraints over 27 iterations in 616 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 4 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 170/170 transitions.
Applied a total of 0 rules in 1 ms. Remains 185 /185 variables (removed 0) and now considering 170/170 (removed 0) transitions.
[2023-03-22 00:21:40] [INFO ] Invariant cache hit.
[2023-03-22 00:21:40] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-22 00:21:40] [INFO ] Invariant cache hit.
[2023-03-22 00:21:40] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2023-03-22 00:21:40] [INFO ] Invariant cache hit.
[2023-03-22 00:21:40] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 447 ms. Remains : 185/185 places, 170/170 transitions.
Computed a total of 35 stabilizing places and 35 stable transitions
Computed a total of 35 stabilizing places and 35 stable transitions
Detected a total of 35/185 stabilizing places and 35/170 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (OR (AND p1 (NOT p2)) (AND (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (OR (AND p1 (NOT p2)) (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 944 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 341 ms :[(NOT p2), (NOT p2), true, (NOT p0), (NOT p1)]
Finished random walk after 3420 steps, including 6 resets, run visited all 6 properties in 36 ms. (steps per millisecond=95 )
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (OR (AND p1 (NOT p2)) (AND (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (OR (AND p1 (NOT p2)) (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F p0), (F (AND p0 (NOT p1))), (F (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1)))), (F (AND p0 (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p2) (NOT p1)))]
Knowledge based reduction with 12 factoid took 976 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(NOT p2), (NOT p2), true, (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 228 ms :[(NOT p2), (NOT p2), true, (NOT p0), (NOT p1)]
[2023-03-22 00:21:43] [INFO ] Invariant cache hit.
[2023-03-22 00:21:43] [INFO ] [Real]Absence check using 34 positive place invariants in 15 ms returned sat
[2023-03-22 00:21:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 00:21:43] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2023-03-22 00:21:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 00:21:43] [INFO ] [Nat]Absence check using 34 positive place invariants in 15 ms returned sat
[2023-03-22 00:21:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 00:21:43] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2023-03-22 00:21:44] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 1 ms to minimize.
[2023-03-22 00:21:44] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 1 ms to minimize.
[2023-03-22 00:21:44] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2023-03-22 00:21:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 320 ms
[2023-03-22 00:21:44] [INFO ] Computed and/alt/rep : 169/299/169 causal constraints (skipped 0 transitions) in 14 ms.
[2023-03-22 00:21:45] [INFO ] Added : 134 causal constraints over 27 iterations in 843 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 182 ms :[(NOT p2), (NOT p2), true, (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 7468 reset in 160 ms.
Product exploration explored 100000 steps with 7548 reset in 174 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 330 ms :[(NOT p2), (NOT p2), true, (NOT p0), (NOT p1)]
Support contains 4 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 170/170 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 185 transition count 170
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 21 place count 185 transition count 171
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 29 place count 185 transition count 171
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 1 with 58 rules applied. Total rules applied 87 place count 185 transition count 171
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 107 place count 165 transition count 151
Deduced a syphon composed of 67 places in 1 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 127 place count 165 transition count 151
Deduced a syphon composed of 67 places in 0 ms
Applied a total of 127 rules in 33 ms. Remains 165 /185 variables (removed 20) and now considering 151/170 (removed 19) transitions.
[2023-03-22 00:21:46] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 151 rows 165 cols
[2023-03-22 00:21:46] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-22 00:21:46] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 165/185 places, 151/170 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 254 ms. Remains : 165/185 places, 151/170 transitions.
Support contains 4 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 170/170 transitions.
Applied a total of 0 rules in 2 ms. Remains 185 /185 variables (removed 0) and now considering 170/170 (removed 0) transitions.
// Phase 1: matrix 170 rows 185 cols
[2023-03-22 00:21:46] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-22 00:21:46] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-22 00:21:46] [INFO ] Invariant cache hit.
[2023-03-22 00:21:46] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
[2023-03-22 00:21:46] [INFO ] Invariant cache hit.
[2023-03-22 00:21:47] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 654 ms. Remains : 185/185 places, 170/170 transitions.
Treatment of property ShieldPPPs-PT-003B-LTLFireability-08 finished in 12921 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||X(p1)) U (G((!p0||X(p1)))||((!p0||X(p1))&&G(!p1))))))'
Support contains 2 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 177/177 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 186 transition count 171
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 186 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 185 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 185 transition count 170
Applied a total of 14 rules in 6 ms. Remains 185 /192 variables (removed 7) and now considering 170/177 (removed 7) transitions.
[2023-03-22 00:21:47] [INFO ] Invariant cache hit.
[2023-03-22 00:21:47] [INFO ] Implicit Places using invariants in 333 ms returned []
[2023-03-22 00:21:47] [INFO ] Invariant cache hit.
[2023-03-22 00:21:47] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
[2023-03-22 00:21:47] [INFO ] Invariant cache hit.
[2023-03-22 00:21:47] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 185/192 places, 170/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 707 ms. Remains : 185/192 places, 170/177 transitions.
Stuttering acceptance computed with spot in 400 ms :[true, (AND (NOT p1) p0), (AND (NOT p1) p0), false, false, (NOT p1), p1]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 4}, { cond=(AND p1 p0), acceptance={} source=3 dest: 5}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p1 p0), acceptance={} source=4 dest: 5}, { cond=(NOT p1), acceptance={} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p1 p0), acceptance={} source=5 dest: 5}], [{ cond=p1, acceptance={} source=6 dest: 0}, { cond=(NOT p1), acceptance={} source=6 dest: 6}]], initial=1, aps=[p1:(NEQ s92 1), p0:(EQ s56 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, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2217 steps with 3 reset in 5 ms.
FORMULA ShieldPPPs-PT-003B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-003B-LTLFireability-09 finished in 1152 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 6 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 177/177 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 191 transition count 156
Reduce places removed 20 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 21 rules applied. Total rules applied 41 place count 171 transition count 155
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 170 transition count 155
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 42 place count 170 transition count 139
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 74 place count 154 transition count 139
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 80 place count 148 transition count 133
Iterating global reduction 3 with 6 rules applied. Total rules applied 86 place count 148 transition count 133
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 86 place count 148 transition count 132
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 88 place count 147 transition count 132
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 184 place count 99 transition count 84
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 186 place count 97 transition count 82
Applied a total of 186 rules in 27 ms. Remains 97 /192 variables (removed 95) and now considering 82/177 (removed 95) transitions.
// Phase 1: matrix 82 rows 97 cols
[2023-03-22 00:21:48] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-22 00:21:48] [INFO ] Implicit Places using invariants in 132 ms returned []
[2023-03-22 00:21:48] [INFO ] Invariant cache hit.
[2023-03-22 00:21:48] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
[2023-03-22 00:21:48] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 00:21:48] [INFO ] Invariant cache hit.
[2023-03-22 00:21:48] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/192 places, 82/177 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 380 ms. Remains : 97/192 places, 82/177 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (EQ s74 0) (EQ s76 0)) (OR (EQ s68 0) (EQ s85 0)) (OR (AND (EQ s78 1) (EQ s96 1)) (AND (EQ s68 1) (EQ s85 1))))], nbAcceptance=1, 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 190 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-003B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-003B-LTLFireability-11 finished in 426 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 177/177 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 191 transition count 153
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 168 transition count 153
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 46 place count 168 transition count 138
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 76 place count 153 transition count 138
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 82 place count 147 transition count 132
Iterating global reduction 2 with 6 rules applied. Total rules applied 88 place count 147 transition count 132
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 88 place count 147 transition count 130
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 92 place count 145 transition count 130
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 192 place count 95 transition count 80
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 194 place count 93 transition count 78
Applied a total of 194 rules in 16 ms. Remains 93 /192 variables (removed 99) and now considering 78/177 (removed 99) transitions.
// Phase 1: matrix 78 rows 93 cols
[2023-03-22 00:21:48] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-22 00:21:48] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-22 00:21:48] [INFO ] Invariant cache hit.
[2023-03-22 00:21:48] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2023-03-22 00:21:48] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 00:21:48] [INFO ] Invariant cache hit.
[2023-03-22 00:21:49] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/192 places, 78/177 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 391 ms. Remains : 93/192 places, 78/177 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s52 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 15619 steps with 323 reset in 31 ms.
FORMULA ShieldPPPs-PT-003B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-003B-LTLFireability-12 finished in 536 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&X((p0 U (X((!p1&&X((!p1 U (p2||G(!p1))))))||G(p0))))))))'
Support contains 1 out of 192 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 177/177 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 187 transition count 172
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 187 transition count 172
Applied a total of 10 rules in 16 ms. Remains 187 /192 variables (removed 5) and now considering 172/177 (removed 5) transitions.
// Phase 1: matrix 172 rows 187 cols
[2023-03-22 00:21:49] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-22 00:21:49] [INFO ] Implicit Places using invariants in 160 ms returned []
[2023-03-22 00:21:49] [INFO ] Invariant cache hit.
[2023-03-22 00:21:49] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
[2023-03-22 00:21:49] [INFO ] Invariant cache hit.
[2023-03-22 00:21:49] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 187/192 places, 172/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 628 ms. Remains : 187/192 places, 172/177 transitions.
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-003B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-003B-LTLFireability-13 finished in 770 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(F(p0))))'
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 177/177 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 186 transition count 171
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 186 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 185 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 185 transition count 170
Applied a total of 14 rules in 17 ms. Remains 185 /192 variables (removed 7) and now considering 170/177 (removed 7) transitions.
// Phase 1: matrix 170 rows 185 cols
[2023-03-22 00:21:50] [INFO ] Computed 34 place invariants in 0 ms
[2023-03-22 00:21:50] [INFO ] Implicit Places using invariants in 183 ms returned []
[2023-03-22 00:21:50] [INFO ] Invariant cache hit.
[2023-03-22 00:21:50] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
[2023-03-22 00:21:50] [INFO ] Invariant cache hit.
[2023-03-22 00:21:50] [INFO ] Dead Transitions using invariants and state equation in 213 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 185/192 places, 170/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 629 ms. Remains : 185/192 places, 170/177 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-15 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}]], initial=2, aps=[p0:(EQ s130 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 5148 reset in 146 ms.
Product exploration explored 100000 steps with 5129 reset in 110 ms.
Computed a total of 35 stabilizing places and 35 stable transitions
Computed a total of 35 stabilizing places and 35 stable transitions
Detected a total of 35/185 stabilizing places and 35/170 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 190 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 220 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 216 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-22 00:21:52] [INFO ] Invariant cache hit.
[2023-03-22 00:21:52] [INFO ] [Real]Absence check using 34 positive place invariants in 9 ms returned sat
[2023-03-22 00:21:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 00:21:52] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2023-03-22 00:21:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 00:21:52] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-22 00:21:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 00:21:53] [INFO ] [Nat]Absence check using state equation in 565 ms returned sat
[2023-03-22 00:21:53] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2023-03-22 00:21:53] [INFO ] Deduced a trap composed of 19 places in 156 ms of which 1 ms to minimize.
[2023-03-22 00:21:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 266 ms
[2023-03-22 00:21:53] [INFO ] Computed and/alt/rep : 169/299/169 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-22 00:21:54] [INFO ] Added : 145 causal constraints over 31 iterations in 1145 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 170/170 transitions.
Applied a total of 0 rules in 2 ms. Remains 185 /185 variables (removed 0) and now considering 170/170 (removed 0) transitions.
[2023-03-22 00:21:54] [INFO ] Invariant cache hit.
[2023-03-22 00:21:55] [INFO ] Implicit Places using invariants in 460 ms returned []
[2023-03-22 00:21:55] [INFO ] Invariant cache hit.
[2023-03-22 00:21:55] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 757 ms to find 0 implicit places.
[2023-03-22 00:21:55] [INFO ] Invariant cache hit.
[2023-03-22 00:21:55] [INFO ] Dead Transitions using invariants and state equation in 270 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1030 ms. Remains : 185/185 places, 170/170 transitions.
Computed a total of 35 stabilizing places and 35 stable transitions
Computed a total of 35 stabilizing places and 35 stable transitions
Detected a total of 35/185 stabilizing places and 35/170 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 172 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 220 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-22 00:21:56] [INFO ] Invariant cache hit.
[2023-03-22 00:21:57] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-22 00:21:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 00:21:57] [INFO ] [Real]Absence check using state equation in 520 ms returned sat
[2023-03-22 00:21:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 00:21:58] [INFO ] [Nat]Absence check using 34 positive place invariants in 15 ms returned sat
[2023-03-22 00:21:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 00:21:58] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2023-03-22 00:21:58] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 0 ms to minimize.
[2023-03-22 00:21:58] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2023-03-22 00:21:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 135 ms
[2023-03-22 00:21:58] [INFO ] Computed and/alt/rep : 169/299/169 causal constraints (skipped 0 transitions) in 24 ms.
[2023-03-22 00:21:59] [INFO ] Added : 145 causal constraints over 31 iterations in 1221 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5170 reset in 125 ms.
Product exploration explored 100000 steps with 5152 reset in 155 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 170/170 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 185 transition count 170
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 22 place count 185 transition count 171
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 29 place count 185 transition count 171
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 1 with 60 rules applied. Total rules applied 89 place count 185 transition count 171
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 112 place count 162 transition count 148
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 135 place count 162 transition count 148
Deduced a syphon composed of 66 places in 0 ms
Applied a total of 135 rules in 30 ms. Remains 162 /185 variables (removed 23) and now considering 148/170 (removed 22) transitions.
[2023-03-22 00:22:00] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 148 rows 162 cols
[2023-03-22 00:22:00] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-22 00:22:00] [INFO ] Dead Transitions using invariants and state equation in 508 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 162/185 places, 148/170 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 554 ms. Remains : 162/185 places, 148/170 transitions.
Support contains 1 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 170/170 transitions.
Applied a total of 0 rules in 17 ms. Remains 185 /185 variables (removed 0) and now considering 170/170 (removed 0) transitions.
// Phase 1: matrix 170 rows 185 cols
[2023-03-22 00:22:00] [INFO ] Computed 34 place invariants in 4 ms
[2023-03-22 00:22:01] [INFO ] Implicit Places using invariants in 299 ms returned []
[2023-03-22 00:22:01] [INFO ] Invariant cache hit.
[2023-03-22 00:22:01] [INFO ] Implicit Places using invariants and state equation in 618 ms returned []
Implicit Place search using SMT with State Equation took 936 ms to find 0 implicit places.
[2023-03-22 00:22:01] [INFO ] Invariant cache hit.
[2023-03-22 00:22:01] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1098 ms. Remains : 185/185 places, 170/170 transitions.
Treatment of property ShieldPPPs-PT-003B-LTLFireability-15 finished in 11967 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||G(p1)))))'
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((G(p0) U ((F(p1)||X(p2)) U (G((F(p1)||X(p2)))||(!p3&&(F(p1)||X(p2)))))))))'
Found a Shortening insensitive property : ShieldPPPs-PT-003B-LTLFireability-06
Stuttering acceptance computed with spot in 837 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), false, false, false]
Support contains 5 out of 192 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 192/192 places, 177/177 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 191 transition count 155
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 170 transition count 155
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 42 place count 170 transition count 140
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 72 place count 155 transition count 140
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 76 place count 151 transition count 136
Iterating global reduction 2 with 4 rules applied. Total rules applied 80 place count 151 transition count 136
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 80 place count 151 transition count 135
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 150 transition count 135
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 180 place count 101 transition count 86
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 182 place count 99 transition count 84
Applied a total of 182 rules in 12 ms. Remains 99 /192 variables (removed 93) and now considering 84/177 (removed 93) transitions.
// Phase 1: matrix 84 rows 99 cols
[2023-03-22 00:22:03] [INFO ] Computed 34 place invariants in 3 ms
[2023-03-22 00:22:03] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-22 00:22:03] [INFO ] Invariant cache hit.
[2023-03-22 00:22:03] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2023-03-22 00:22:03] [INFO ] Invariant cache hit.
[2023-03-22 00:22:03] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 99/192 places, 84/177 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 367 ms. Remains : 99/192 places, 84/177 transitions.
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}, { cond=(AND p3 (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 2} source=1 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1, 2} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 5}, { cond=(AND p3 (NOT p1) (NOT p0) (NOT p2)), acceptance={1, 2} source=1 dest: 6}, { cond=(AND p3 (NOT p1) p0 (NOT p2)), acceptance={1, 2} source=1 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=2 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 2} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 5}, { cond=(AND p3 (NOT p1) (NOT p0) (NOT p2)), acceptance={1, 2} source=2 dest: 6}, { cond=(AND p3 (NOT p1) p0 (NOT p2)), acceptance={2} source=2 dest: 7}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=2 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=3 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 2} source=3 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1, 2} source=3 dest: 3}, { cond=(AND p3 (NOT p1) (NOT p0) (NOT p2)), acceptance={1, 2} source=3 dest: 6}, { cond=(AND p3 (NOT p1) p0 (NOT p2)), acceptance={1, 2} source=3 dest: 8}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 1}, { cond=(AND p3 p0), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=5 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 2} source=5 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0, 1, 2} source=5 dest: 3}, { cond=(NOT p1), acceptance={0, 1} source=5 dest: 5}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={1, 2} source=5 dest: 6}, { cond=(AND p3 (NOT p1) p0), acceptance={1, 2} source=5 dest: 8}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1} source=6 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0, 1, 2} source=6 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 2} source=6 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 1, 2} source=6 dest: 3}, { cond=(AND p3 (NOT p1) p0), acceptance={1} source=6 dest: 6}, { cond=(AND p3 (NOT p1) (NOT p0) p2), acceptance={1, 2} source=6 dest: 6}, { cond=(AND p3 (NOT p1) p0 p2), acceptance={1, 2} source=6 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={0, 1, 2} source=7 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 2} source=7 dest: 2}, { cond=(AND p3 (NOT p1) (NOT p0) p2), acceptance={1, 2} source=7 dest: 6}, { cond=(AND p3 (NOT p1) p0 p2), acceptance={2} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={0, 1, 2} source=8 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 2} source=8 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 1, 2} source=8 dest: 3}, { cond=(AND p3 (NOT p1) (NOT p0) p2), acceptance={1, 2} source=8 dest: 6}, { cond=(AND p3 (NOT p1) p0 p2), acceptance={1, 2} source=8 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={0, 1, 2} source=9 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 2} source=9 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0, 1} source=9 dest: 5}, { cond=(AND p3 (NOT p1) (NOT p0) p2), acceptance={1, 2} source=9 dest: 6}, { cond=(AND p3 (NOT p1) p0 p2), acceptance={2} source=9 dest: 7}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=9 dest: 9}]], initial=0, aps=[p1:(EQ s56 1), p0:(EQ s32 1), p3:(AND (EQ s46 1) (EQ s91 1)), p2:(EQ s87 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 17407 reset in 187 ms.
Product exploration explored 100000 steps with 17304 reset in 244 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Detected a total of 5/99 stabilizing places and 5/84 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), (X (NOT (AND p3 (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p3 (NOT p1) p0 (NOT p2)))), (X (NOT (AND p3 p0))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND p3 (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p3 p0)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p3 (NOT p1) p0 p2)))), (X (X (NOT (AND p3 (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p3 (NOT p1) (NOT p0))))), (X (X (NOT (AND p3 (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p3 (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 18 factoid took 4872 ms. Reduced automaton from 10 states, 52 edges and 4 AP (stutter sensitive) to 15 states, 78 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 1528 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), false, false, false, false, false, false, false, false]
Incomplete random walk after 10000 steps, including 42 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 16) seen :15
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:22:10] [INFO ] Invariant cache hit.
[2023-03-22 00:22:10] [INFO ] [Real]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-22 00:22:10] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:22:10] [INFO ] [Nat]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-22 00:22:10] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:22:11] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 2 ms to minimize.
[2023-03-22 00:22:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2023-03-22 00:22:11] [INFO ] After 135ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-22 00:22:11] [INFO ] After 194ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 84/84 transitions.
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 17 place count 99 transition count 84
Applied a total of 17 rules in 5 ms. Remains 99 /99 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 99/99 places, 84/84 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1792050 steps, run timeout after 3001 ms. (steps per millisecond=597 ) properties seen :{}
Probabilistic random walk after 1792050 steps, saw 345888 distinct states, run finished after 3014 ms. (steps per millisecond=594 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 84 rows 99 cols
[2023-03-22 00:22:14] [INFO ] Computed 34 place invariants in 4 ms
[2023-03-22 00:22:14] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2023-03-22 00:22:14] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 00:22:14] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:22:14] [INFO ] [Nat]Absence check using 33 positive place invariants in 11 ms returned sat
[2023-03-22 00:22:14] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 00:22:14] [INFO ] After 151ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:22:14] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 1 ms to minimize.
[2023-03-22 00:22:14] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 0 ms to minimize.
[2023-03-22 00:22:15] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 26 ms to minimize.
[2023-03-22 00:22:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 513 ms
[2023-03-22 00:22:15] [INFO ] After 673ms 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-22 00:22:15] [INFO ] After 761ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 84/84 transitions.
Applied a total of 0 rules in 5 ms. Remains 99 /99 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 99/99 places, 84/84 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 84/84 transitions.
Applied a total of 0 rules in 5 ms. Remains 99 /99 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-22 00:22:15] [INFO ] Invariant cache hit.
[2023-03-22 00:22:15] [INFO ] Implicit Places using invariants in 654 ms returned []
[2023-03-22 00:22:15] [INFO ] Invariant cache hit.
[2023-03-22 00:22:16] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 926 ms to find 0 implicit places.
[2023-03-22 00:22:16] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 00:22:16] [INFO ] Invariant cache hit.
[2023-03-22 00:22:16] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1036 ms. Remains : 99/99 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 99 /99 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-22 00:22:16] [INFO ] Invariant cache hit.
[2023-03-22 00:22:16] [INFO ] [Real]Absence check using 33 positive place invariants in 190 ms returned sat
[2023-03-22 00:22:16] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 25 ms returned sat
[2023-03-22 00:22:16] [INFO ] After 579ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 00:22:16] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-22 00:22:16] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 00:22:16] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 00:22:16] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 0 ms to minimize.
[2023-03-22 00:22:17] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 1 ms to minimize.
[2023-03-22 00:22:17] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2023-03-22 00:22:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 274 ms
[2023-03-22 00:22:17] [INFO ] After 392ms 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-22 00:22:17] [INFO ] After 466ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), (X (NOT (AND p3 (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p3 (NOT p1) p0 (NOT p2)))), (X (NOT (AND p3 p0))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND p3 (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p3 p0)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p3 (NOT p1) p0 p2)))), (X (X (NOT (AND p3 (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p3 (NOT p1) (NOT p0))))), (X (X (NOT (AND p3 (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p3 (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (F (AND p0 p2 (NOT p1) (NOT p3))), (F (AND p0 p3)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p2 (NOT p1) (NOT p3))), (F (AND (NOT p0) (NOT p2) (NOT p1) p3)), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (AND (NOT p0) p2 (NOT p1) p3)), (F (AND p0 p2 (NOT p1))), (F (AND p0 (NOT p1) p3)), (F (AND p0 (NOT p2) (NOT p1) p3)), (F (AND (NOT p0) p2 (NOT p1))), (F (AND (NOT p0) p3)), (F (AND p0 (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p1) p3)), (F (OR (AND p0 (NOT p1)) (AND p2 (NOT p1))))]
Knowledge based reduction with 18 factoid took 6420 ms. Reduced automaton from 15 states, 78 edges and 4 AP (stutter insensitive) to 15 states, 78 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 1261 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 1334 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), false, false, false, false, false, false, false, false]
// Phase 1: matrix 84 rows 99 cols
[2023-03-22 00:22:26] [INFO ] Computed 34 place invariants in 0 ms
[2023-03-22 00:22:26] [INFO ] [Real]Absence check using 34 positive place invariants in 11 ms returned sat
[2023-03-22 00:22:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 00:22:26] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2023-03-22 00:22:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 00:22:26] [INFO ] [Nat]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-22 00:22:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 00:22:26] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-22 00:22:26] [INFO ] Computed and/alt/rep : 81/184/81 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 00:22:26] [INFO ] Added : 52 causal constraints over 11 iterations in 225 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 5 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 84/84 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-22 00:22:26] [INFO ] Invariant cache hit.
[2023-03-22 00:22:26] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-22 00:22:26] [INFO ] Invariant cache hit.
[2023-03-22 00:22:27] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 689 ms to find 0 implicit places.
[2023-03-22 00:22:27] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 00:22:27] [INFO ] Invariant cache hit.
[2023-03-22 00:22:27] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 816 ms. Remains : 99/99 places, 84/84 transitions.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Detected a total of 5/99 stabilizing places and 5/84 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) p3))), (X (NOT (AND p0 p2 (NOT p1) p3))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 (NOT p1) p3))), (X (NOT (AND p0 p2 (NOT p1) (NOT p3)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p3))), (X (NOT (AND (NOT p0) p2 (NOT p1) p3))), (X (NOT (AND p0 (NOT p2) (NOT p1) p3))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) p3))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) p3)))), (X (X (NOT (AND p0 p2 (NOT p1) p3)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (NOT (AND p0 p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1) p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1) p3)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (OR (AND p0 (NOT p1)) (AND p2 (NOT p1)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p2 (NOT p1))))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND (NOT p0) p2 (NOT p1) (NOT p3))), (X (NOT (AND (NOT p0) p2 (NOT p1) (NOT p3)))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (OR (AND p0 (NOT p1)) (AND p2 (NOT p1))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p2 (NOT p1)))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1) (NOT p3))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
Knowledge based reduction with 25 factoid took 7954 ms. Reduced automaton from 15 states, 78 edges and 4 AP (stutter insensitive) to 15 states, 78 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 1055 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), false, false, false, false, false, false, false, false]
Finished random walk after 1550 steps, including 7 resets, run visited all 16 properties in 19 ms. (steps per millisecond=81 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) p3))), (X (NOT (AND p0 p2 (NOT p1) p3))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 (NOT p1) p3))), (X (NOT (AND p0 p2 (NOT p1) (NOT p3)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p3))), (X (NOT (AND (NOT p0) p2 (NOT p1) p3))), (X (NOT (AND p0 (NOT p2) (NOT p1) p3))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) p3))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) p3)))), (X (X (NOT (AND p0 p2 (NOT p1) p3)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (NOT (AND p0 p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1) p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1) p3)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p3)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (OR (AND p0 (NOT p1)) (AND p2 (NOT p1)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p2 (NOT p1))))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND (NOT p0) p2 (NOT p1) (NOT p3))), (X (NOT (AND (NOT p0) p2 (NOT p1) (NOT p3)))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (OR (AND p0 (NOT p1)) (AND p2 (NOT p1))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p2 (NOT p1)))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1) (NOT p3))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (AND p0 (NOT p1) p2 (NOT p3))), (F (AND p0 p3)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1) p2 (NOT p3))), (F (AND (NOT p0) (NOT p1) (NOT p2) p3)), (F (AND p0 (NOT p1) p2 p3)), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND (NOT p0) (NOT p1) p2 p3)), (F (AND p0 (NOT p1) p2)), (F (AND p0 (NOT p1) p3)), (F (AND p0 (NOT p1) (NOT p2) p3)), (F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) p3)), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) p3)), (F (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)))]
Knowledge based reduction with 25 factoid took 8038 ms. Reduced automaton from 15 states, 78 edges and 4 AP (stutter insensitive) to 15 states, 78 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 1260 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 1457 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), false, false, false, false, false, false, false, false]
[2023-03-22 00:22:47] [INFO ] Invariant cache hit.
[2023-03-22 00:22:48] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-22 00:22:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 00:22:48] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2023-03-22 00:22:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 00:22:48] [INFO ] [Nat]Absence check using 34 positive place invariants in 12 ms returned sat
[2023-03-22 00:22:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 00:22:48] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2023-03-22 00:22:48] [INFO ] Computed and/alt/rep : 81/184/81 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 00:22:49] [INFO ] Added : 79 causal constraints over 16 iterations in 267 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 1595 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), false, false, false, false, false, false, false, false]
Product exploration explored 100000 steps with 16279 reset in 241 ms.
Product exploration explored 100000 steps with 16400 reset in 235 ms.
Support contains 5 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 84/84 transitions.
Applied a total of 0 rules in 8 ms. Remains 99 /99 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-22 00:22:51] [INFO ] Invariant cache hit.
[2023-03-22 00:22:51] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-22 00:22:51] [INFO ] Invariant cache hit.
[2023-03-22 00:22:51] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
[2023-03-22 00:22:51] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 00:22:51] [INFO ] Invariant cache hit.
[2023-03-22 00:22:51] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 617 ms. Remains : 99/99 places, 84/84 transitions.
Treatment of property ShieldPPPs-PT-003B-LTLFireability-06 finished in 49880 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) U p1) U p2)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Found a Shortening insensitive property : ShieldPPPs-PT-003B-LTLFireability-15
Stuttering acceptance computed with spot in 263 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 192/192 places, 177/177 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 191 transition count 153
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 168 transition count 153
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 46 place count 168 transition count 138
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 76 place count 153 transition count 138
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 82 place count 147 transition count 132
Iterating global reduction 2 with 6 rules applied. Total rules applied 88 place count 147 transition count 132
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 88 place count 147 transition count 130
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 92 place count 145 transition count 130
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 188 place count 97 transition count 82
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 190 place count 95 transition count 80
Applied a total of 190 rules in 35 ms. Remains 95 /192 variables (removed 97) and now considering 80/177 (removed 97) transitions.
// Phase 1: matrix 80 rows 95 cols
[2023-03-22 00:22:52] [INFO ] Computed 34 place invariants in 0 ms
[2023-03-22 00:22:52] [INFO ] Implicit Places using invariants in 202 ms returned []
[2023-03-22 00:22:52] [INFO ] Invariant cache hit.
[2023-03-22 00:22:52] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
[2023-03-22 00:22:52] [INFO ] Invariant cache hit.
[2023-03-22 00:22:52] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 95/192 places, 80/177 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 498 ms. Remains : 95/192 places, 80/177 transitions.
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-15 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}]], initial=2, aps=[p0:(EQ s65 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 243 steps with 0 reset in 1 ms.
Treatment of property ShieldPPPs-PT-003B-LTLFireability-15 finished in 855 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-22 00:22:52] [INFO ] Flatten gal took : 10 ms
[2023-03-22 00:22:52] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-22 00:22:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 192 places, 177 transitions and 498 arcs took 2 ms.
Total runtime 143034 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3618/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3618/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3618/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3618/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldPPPs-PT-003B-LTLFireability-01
Could not compute solution for formula : ShieldPPPs-PT-003B-LTLFireability-06
Could not compute solution for formula : ShieldPPPs-PT-003B-LTLFireability-08
Could not compute solution for formula : ShieldPPPs-PT-003B-LTLFireability-15

BK_STOP 1679444574132

--------------------
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 ShieldPPPs-PT-003B-LTLFireability-01
ltl formula formula --ltl=/tmp/3618/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 192 places, 177 transitions and 498 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.090 real 0.020 user 0.050 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3618/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3618/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3618/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3618/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 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:
malloc_consolidate(): invalid chunk size
ltl formula name ShieldPPPs-PT-003B-LTLFireability-06
ltl formula formula --ltl=/tmp/3618/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: =============================================================================
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
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 192 places, 177 transitions and 498 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.050 real 0.020 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3618/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3618/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3618/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3618/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 12 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 ShieldPPPs-PT-003B-LTLFireability-08
ltl formula formula --ltl=/tmp/3618/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
pnml2lts-mc( 0/ 4): Petri net has 192 places, 177 transitions and 498 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
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.050 real 0.010 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3618/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3618/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3618/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3618/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name ShieldPPPs-PT-003B-LTLFireability-15
ltl formula formula --ltl=/tmp/3618/ltl_3_
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 192 places, 177 transitions and 498 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.050 real 0.010 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3618/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3618/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3618/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3618/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 3 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) [0x5652624fc3f4]
1: pnml2lts-mc(+0xa2496) [0x5652624fc496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fc27ab1f140]
3: pnml2lts-mc(+0x405be5) [0x56526285fbe5]
4: pnml2lts-mc(+0x16b3f9) [0x5652625c53f9]
5: pnml2lts-mc(+0x164ac4) [0x5652625beac4]
6: pnml2lts-mc(+0x272e0a) [0x5652626cce0a]
7: pnml2lts-mc(+0xb61f0) [0x5652625101f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7fc27a9724d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7fc27a97267a]
10: pnml2lts-mc(+0xa1581) [0x5652624fb581]
11: pnml2lts-mc(+0xa1910) [0x5652624fb910]
12: pnml2lts-mc(+0xa32a2) [0x5652624fd2a2]
13: pnml2lts-mc(+0xa50f4) [0x5652624ff0f4]
14: pnml2lts-mc(+0x3f34b3) [0x56526284d4b3]
15: pnml2lts-mc(+0x7c63d) [0x5652624d663d]
16: pnml2lts-mc(+0x67d86) [0x5652624c1d86]
17: pnml2lts-mc(+0x60a8a) [0x5652624baa8a]
18: pnml2lts-mc(+0x5eb15) [0x5652624b8b15]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7fc27a95ad0a]
20: pnml2lts-mc(+0x6075e) [0x5652624ba75e]

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPs-PT-003B"
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 ShieldPPPs-PT-003B, 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-167903717000396"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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