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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 720K
-rw-r--r-- 1 mcc users 7.3K Feb 25 16:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 16:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 16:36 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.9K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Feb 25 16:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 16:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 16:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 25 16:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 332K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679424315407

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-020B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 18:45:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 18:45:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 18:45:19] [INFO ] Load time of PNML (sax parser for PT used): 166 ms
[2023-03-21 18:45:19] [INFO ] Transformed 1203 places.
[2023-03-21 18:45:19] [INFO ] Transformed 1183 transitions.
[2023-03-21 18:45:19] [INFO ] Found NUPN structural information;
[2023-03-21 18:45:19] [INFO ] Parsed PT model containing 1203 places and 1183 transitions and 3566 arcs in 366 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldIIPs-PT-020B-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 1203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1203/1203 places, 1183/1183 transitions.
Discarding 134 places :
Symmetric choice reduction at 0 with 134 rule applications. Total rules 134 place count 1069 transition count 1049
Iterating global reduction 0 with 134 rules applied. Total rules applied 268 place count 1069 transition count 1049
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 269 place count 1068 transition count 1048
Iterating global reduction 0 with 1 rules applied. Total rules applied 270 place count 1068 transition count 1048
Applied a total of 270 rules in 374 ms. Remains 1068 /1203 variables (removed 135) and now considering 1048/1183 (removed 135) transitions.
// Phase 1: matrix 1048 rows 1068 cols
[2023-03-21 18:45:20] [INFO ] Computed 181 place invariants in 23 ms
[2023-03-21 18:45:21] [INFO ] Implicit Places using invariants in 976 ms returned []
[2023-03-21 18:45:21] [INFO ] Invariant cache hit.
[2023-03-21 18:45:23] [INFO ] Implicit Places using invariants and state equation in 1874 ms returned []
Implicit Place search using SMT with State Equation took 2924 ms to find 0 implicit places.
[2023-03-21 18:45:23] [INFO ] Invariant cache hit.
[2023-03-21 18:45:24] [INFO ] Dead Transitions using invariants and state equation in 1031 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1068/1203 places, 1048/1183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4343 ms. Remains : 1068/1203 places, 1048/1183 transitions.
Support contains 44 out of 1068 places after structural reductions.
[2023-03-21 18:45:24] [INFO ] Flatten gal took : 114 ms
[2023-03-21 18:45:24] [INFO ] Flatten gal took : 75 ms
[2023-03-21 18:45:24] [INFO ] Input system was already deterministic with 1048 transitions.
Support contains 43 out of 1068 places (down from 44) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 474 ms. (steps per millisecond=21 ) properties (out of 31) seen :29
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-21 18:45:25] [INFO ] Invariant cache hit.
[2023-03-21 18:45:25] [INFO ] [Real]Absence check using 181 positive place invariants in 154 ms returned sat
[2023-03-21 18:45:26] [INFO ] After 1379ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 18:45:27] [INFO ] [Nat]Absence check using 181 positive place invariants in 123 ms returned sat
[2023-03-21 18:45:27] [INFO ] After 623ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 18:45:28] [INFO ] Deduced a trap composed of 25 places in 344 ms of which 7 ms to minimize.
[2023-03-21 18:45:29] [INFO ] Deduced a trap composed of 31 places in 940 ms of which 1 ms to minimize.
[2023-03-21 18:45:29] [INFO ] Deduced a trap composed of 32 places in 526 ms of which 1 ms to minimize.
[2023-03-21 18:45:30] [INFO ] Deduced a trap composed of 30 places in 336 ms of which 14 ms to minimize.
[2023-03-21 18:45:30] [INFO ] Deduced a trap composed of 33 places in 245 ms of which 26 ms to minimize.
[2023-03-21 18:45:31] [INFO ] Deduced a trap composed of 16 places in 430 ms of which 1 ms to minimize.
[2023-03-21 18:45:31] [INFO ] Deduced a trap composed of 32 places in 274 ms of which 1 ms to minimize.
[2023-03-21 18:45:31] [INFO ] Deduced a trap composed of 16 places in 457 ms of which 26 ms to minimize.
[2023-03-21 18:45:32] [INFO ] Deduced a trap composed of 32 places in 185 ms of which 1 ms to minimize.
[2023-03-21 18:45:32] [INFO ] Deduced a trap composed of 33 places in 154 ms of which 0 ms to minimize.
[2023-03-21 18:45:32] [INFO ] Deduced a trap composed of 37 places in 446 ms of which 1 ms to minimize.
[2023-03-21 18:45:33] [INFO ] Deduced a trap composed of 20 places in 357 ms of which 0 ms to minimize.
[2023-03-21 18:45:33] [INFO ] Deduced a trap composed of 37 places in 356 ms of which 1 ms to minimize.
[2023-03-21 18:45:34] [INFO ] Deduced a trap composed of 45 places in 351 ms of which 0 ms to minimize.
[2023-03-21 18:45:34] [INFO ] Deduced a trap composed of 25 places in 275 ms of which 0 ms to minimize.
[2023-03-21 18:45:34] [INFO ] Deduced a trap composed of 26 places in 273 ms of which 0 ms to minimize.
[2023-03-21 18:45:35] [INFO ] Deduced a trap composed of 22 places in 450 ms of which 0 ms to minimize.
[2023-03-21 18:45:35] [INFO ] Deduced a trap composed of 19 places in 280 ms of which 1 ms to minimize.
[2023-03-21 18:45:35] [INFO ] Deduced a trap composed of 28 places in 278 ms of which 1 ms to minimize.
[2023-03-21 18:45:36] [INFO ] Deduced a trap composed of 26 places in 251 ms of which 0 ms to minimize.
[2023-03-21 18:45:36] [INFO ] Deduced a trap composed of 34 places in 445 ms of which 0 ms to minimize.
[2023-03-21 18:45:36] [INFO ] Deduced a trap composed of 29 places in 266 ms of which 5 ms to minimize.
[2023-03-21 18:45:37] [INFO ] Deduced a trap composed of 31 places in 233 ms of which 1 ms to minimize.
[2023-03-21 18:45:37] [INFO ] Deduced a trap composed of 20 places in 179 ms of which 14 ms to minimize.
[2023-03-21 18:45:37] [INFO ] Deduced a trap composed of 33 places in 333 ms of which 9 ms to minimize.
[2023-03-21 18:45:38] [INFO ] Deduced a trap composed of 47 places in 140 ms of which 1 ms to minimize.
[2023-03-21 18:45:38] [INFO ] Deduced a trap composed of 38 places in 153 ms of which 1 ms to minimize.
[2023-03-21 18:45:39] [INFO ] Deduced a trap composed of 39 places in 887 ms of which 1 ms to minimize.
[2023-03-21 18:45:39] [INFO ] Deduced a trap composed of 27 places in 159 ms of which 0 ms to minimize.
[2023-03-21 18:45:39] [INFO ] Deduced a trap composed of 40 places in 291 ms of which 1 ms to minimize.
[2023-03-21 18:45:40] [INFO ] Deduced a trap composed of 28 places in 588 ms of which 0 ms to minimize.
[2023-03-21 18:45:41] [INFO ] Deduced a trap composed of 39 places in 649 ms of which 1 ms to minimize.
[2023-03-21 18:45:41] [INFO ] Deduced a trap composed of 46 places in 222 ms of which 13 ms to minimize.
[2023-03-21 18:45:41] [INFO ] Deduced a trap composed of 34 places in 169 ms of which 2 ms to minimize.
[2023-03-21 18:45:41] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 1 ms to minimize.
[2023-03-21 18:45:41] [INFO ] Deduced a trap composed of 53 places in 132 ms of which 1 ms to minimize.
[2023-03-21 18:45:42] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 1 ms to minimize.
[2023-03-21 18:45:42] [INFO ] Deduced a trap composed of 52 places in 306 ms of which 1 ms to minimize.
[2023-03-21 18:45:42] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 14485 ms
[2023-03-21 18:45:42] [INFO ] After 15234ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 130 ms.
[2023-03-21 18:45:42] [INFO ] After 15789ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 90 ms.
Support contains 7 out of 1068 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1068/1068 places, 1048/1048 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 1068 transition count 948
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 968 transition count 948
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 200 place count 968 transition count 847
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 402 place count 867 transition count 847
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 408 place count 861 transition count 841
Iterating global reduction 2 with 6 rules applied. Total rules applied 414 place count 861 transition count 841
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 414 place count 861 transition count 837
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 422 place count 857 transition count 837
Performed 355 Post agglomeration using F-continuation condition.Transition count delta: 355
Deduced a syphon composed of 355 places in 4 ms
Reduce places removed 355 places and 0 transitions.
Iterating global reduction 2 with 710 rules applied. Total rules applied 1132 place count 502 transition count 482
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 133 times.
Drop transitions removed 133 transitions
Iterating global reduction 2 with 133 rules applied. Total rules applied 1265 place count 502 transition count 482
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1266 place count 501 transition count 481
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1267 place count 500 transition count 481
Applied a total of 1267 rules in 405 ms. Remains 500 /1068 variables (removed 568) and now considering 481/1048 (removed 567) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 414 ms. Remains : 500/1068 places, 481/1048 transitions.
Finished random walk after 2095 steps, including 1 resets, run visited all 2 properties in 56 ms. (steps per millisecond=37 )
FORMULA ShieldIIPs-PT-020B-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 244 stabilizing places and 244 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 1068 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1068/1068 places, 1048/1048 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1062 transition count 1042
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1062 transition count 1042
Applied a total of 12 rules in 68 ms. Remains 1062 /1068 variables (removed 6) and now considering 1042/1048 (removed 6) transitions.
// Phase 1: matrix 1042 rows 1062 cols
[2023-03-21 18:45:43] [INFO ] Computed 181 place invariants in 5 ms
[2023-03-21 18:45:44] [INFO ] Implicit Places using invariants in 975 ms returned []
[2023-03-21 18:45:44] [INFO ] Invariant cache hit.
[2023-03-21 18:45:46] [INFO ] Implicit Places using invariants and state equation in 1717 ms returned []
Implicit Place search using SMT with State Equation took 2731 ms to find 0 implicit places.
[2023-03-21 18:45:46] [INFO ] Invariant cache hit.
[2023-03-21 18:45:47] [INFO ] Dead Transitions using invariants and state equation in 775 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1062/1068 places, 1042/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3575 ms. Remains : 1062/1068 places, 1042/1048 transitions.
Stuttering acceptance computed with spot in 250 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s562 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 869 ms.
Product exploration explored 100000 steps with 50000 reset in 810 ms.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-020B-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-020B-LTLFireability-00 finished in 5759 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 G(p1))&&(p0||G(p2)))) U p1)))'
Support contains 3 out of 1068 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1068/1068 places, 1048/1048 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1063 transition count 1043
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1063 transition count 1043
Applied a total of 10 rules in 76 ms. Remains 1063 /1068 variables (removed 5) and now considering 1043/1048 (removed 5) transitions.
// Phase 1: matrix 1043 rows 1063 cols
[2023-03-21 18:45:49] [INFO ] Computed 181 place invariants in 4 ms
[2023-03-21 18:45:49] [INFO ] Implicit Places using invariants in 334 ms returned []
[2023-03-21 18:45:49] [INFO ] Invariant cache hit.
[2023-03-21 18:45:52] [INFO ] Implicit Places using invariants and state equation in 2376 ms returned []
Implicit Place search using SMT with State Equation took 2714 ms to find 0 implicit places.
[2023-03-21 18:45:52] [INFO ] Invariant cache hit.
[2023-03-21 18:45:53] [INFO ] Dead Transitions using invariants and state equation in 775 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1063/1068 places, 1043/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3579 ms. Remains : 1063/1068 places, 1043/1048 transitions.
Stuttering acceptance computed with spot in 464 ms :[(NOT p1), (NOT p1), true, (NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 3}, { cond=(OR (AND p1 p2) p0), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=4 dest: 5}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={} source=5 dest: 2}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 2}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(EQ s1042 1), p0:(EQ s330 1), p2:(EQ s283 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-020B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020B-LTLFireability-01 finished in 4080 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)||(X(X(!p0)) U ((X(X(!p0))&&G(!p1))||X(X(G(!p0))))))))'
Support contains 4 out of 1068 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1068/1068 places, 1048/1048 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 1067 transition count 947
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 967 transition count 947
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 200 place count 967 transition count 846
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 402 place count 866 transition count 846
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 408 place count 860 transition count 840
Iterating global reduction 2 with 6 rules applied. Total rules applied 414 place count 860 transition count 840
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 414 place count 860 transition count 836
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 422 place count 856 transition count 836
Performed 349 Post agglomeration using F-continuation condition.Transition count delta: 349
Deduced a syphon composed of 349 places in 1 ms
Reduce places removed 349 places and 0 transitions.
Iterating global reduction 2 with 698 rules applied. Total rules applied 1120 place count 507 transition count 487
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1122 place count 505 transition count 485
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1123 place count 504 transition count 485
Applied a total of 1123 rules in 173 ms. Remains 504 /1068 variables (removed 564) and now considering 485/1048 (removed 563) transitions.
// Phase 1: matrix 485 rows 504 cols
[2023-03-21 18:45:53] [INFO ] Computed 180 place invariants in 2 ms
[2023-03-21 18:45:54] [INFO ] Implicit Places using invariants in 266 ms returned []
[2023-03-21 18:45:54] [INFO ] Invariant cache hit.
[2023-03-21 18:45:55] [INFO ] Implicit Places using invariants and state equation in 912 ms returned []
Implicit Place search using SMT with State Equation took 1193 ms to find 0 implicit places.
[2023-03-21 18:45:55] [INFO ] Redundant transitions in 147 ms returned [484]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 484 rows 504 cols
[2023-03-21 18:45:55] [INFO ] Computed 180 place invariants in 2 ms
[2023-03-21 18:45:55] [INFO ] Dead Transitions using invariants and state equation in 675 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 504/1068 places, 484/1048 transitions.
Applied a total of 0 rules in 12 ms. Remains 504 /504 variables (removed 0) and now considering 484/484 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2211 ms. Remains : 504/1068 places, 484/1048 transitions.
Stuttering acceptance computed with spot in 370 ms :[false, false, false, false, false, false]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0, 2} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 2} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={1} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={2} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 2} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={1} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={2} source=1 dest: 4}, { cond=(AND p1 p0), acceptance={0, 1} source=1 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={0, 2} source=1 dest: 5}], [{ cond=(AND p1 p0), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0, 2} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={2} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={1} source=3 dest: 4}, { cond=(AND p1 p0), acceptance={0, 1} source=3 dest: 5}], [{ cond=(AND p1 p0), acceptance={0, 1} source=4 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=4 dest: 2}], [{ cond=(AND p1 p0), acceptance={0, 1} source=5 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=5 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={1} source=5 dest: 2}]], initial=0, aps=[p1:(AND (EQ s31 1) (EQ s43 1)), p0:(AND (EQ s366 1) (EQ s388 1))], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 211 reset in 614 ms.
Product exploration explored 100000 steps with 218 reset in 732 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 (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 694 ms. Reduced automaton from 6 states, 24 edges and 2 AP (stutter insensitive) to 6 states, 24 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 352 ms :[false, false, false, false, false, false]
Incomplete random walk after 10000 steps, including 9 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-21 18:45:58] [INFO ] Invariant cache hit.
[2023-03-21 18:45:59] [INFO ] [Real]Absence check using 180 positive place invariants in 94 ms returned sat
[2023-03-21 18:45:59] [INFO ] After 672ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 18:45:59] [INFO ] [Nat]Absence check using 180 positive place invariants in 96 ms returned sat
[2023-03-21 18:46:00] [INFO ] After 389ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 18:46:00] [INFO ] After 418ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-21 18:46:00] [INFO ] After 636ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 4 out of 504 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 504/504 places, 484/484 transitions.
Partial Free-agglomeration rule applied 117 times.
Drop transitions removed 117 transitions
Iterating global reduction 0 with 117 rules applied. Total rules applied 117 place count 504 transition count 484
Applied a total of 117 rules in 37 ms. Remains 504 /504 variables (removed 0) and now considering 484/484 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 504/504 places, 484/484 transitions.
Finished random walk after 1354 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=150 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 p1)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 9 factoid took 651 ms. Reduced automaton from 6 states, 24 edges and 2 AP (stutter insensitive) to 6 states, 24 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 420 ms :[false, false, false, false, false, false]
Stuttering acceptance computed with spot in 303 ms :[false, false, false, false, false, false]
Support contains 4 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 484/484 transitions.
Applied a total of 0 rules in 14 ms. Remains 504 /504 variables (removed 0) and now considering 484/484 (removed 0) transitions.
[2023-03-21 18:46:01] [INFO ] Invariant cache hit.
[2023-03-21 18:46:01] [INFO ] Implicit Places using invariants in 274 ms returned []
[2023-03-21 18:46:01] [INFO ] Invariant cache hit.
[2023-03-21 18:46:02] [INFO ] Implicit Places using invariants and state equation in 798 ms returned []
Implicit Place search using SMT with State Equation took 1105 ms to find 0 implicit places.
[2023-03-21 18:46:02] [INFO ] Redundant transitions in 111 ms returned []
[2023-03-21 18:46:02] [INFO ] Invariant cache hit.
[2023-03-21 18:46:03] [INFO ] Dead Transitions using invariants and state equation in 631 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1880 ms. Remains : 504/504 places, 484/484 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 p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 610 ms. Reduced automaton from 6 states, 24 edges and 2 AP (stutter insensitive) to 6 states, 24 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 392 ms :[false, false, false, false, false, false]
Incomplete random walk after 10000 steps, including 9 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-21 18:46:04] [INFO ] Invariant cache hit.
[2023-03-21 18:46:04] [INFO ] [Real]Absence check using 180 positive place invariants in 40 ms returned sat
[2023-03-21 18:46:05] [INFO ] After 365ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 18:46:05] [INFO ] [Nat]Absence check using 180 positive place invariants in 113 ms returned sat
[2023-03-21 18:46:05] [INFO ] After 466ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 18:46:05] [INFO ] After 543ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-21 18:46:05] [INFO ] After 840ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 504 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 504/504 places, 484/484 transitions.
Partial Free-agglomeration rule applied 117 times.
Drop transitions removed 117 transitions
Iterating global reduction 0 with 117 rules applied. Total rules applied 117 place count 504 transition count 484
Applied a total of 117 rules in 46 ms. Remains 504 /504 variables (removed 0) and now considering 484/484 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 504/504 places, 484/484 transitions.
Finished random walk after 5986 steps, including 2 resets, run visited all 1 properties in 41 ms. (steps per millisecond=146 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 p1)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 9 factoid took 752 ms. Reduced automaton from 6 states, 24 edges and 2 AP (stutter insensitive) to 6 states, 24 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 347 ms :[false, false, false, false, false, false]
Stuttering acceptance computed with spot in 424 ms :[false, false, false, false, false, false]
Stuttering acceptance computed with spot in 359 ms :[false, false, false, false, false, false]
Product exploration explored 100000 steps with 207 reset in 598 ms.
Product exploration explored 100000 steps with 224 reset in 690 ms.
Support contains 4 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 484/484 transitions.
Applied a total of 0 rules in 9 ms. Remains 504 /504 variables (removed 0) and now considering 484/484 (removed 0) transitions.
[2023-03-21 18:46:09] [INFO ] Invariant cache hit.
[2023-03-21 18:46:11] [INFO ] Implicit Places using invariants in 2511 ms returned []
[2023-03-21 18:46:11] [INFO ] Invariant cache hit.
[2023-03-21 18:46:12] [INFO ] Implicit Places using invariants and state equation in 522 ms returned []
Implicit Place search using SMT with State Equation took 3069 ms to find 0 implicit places.
[2023-03-21 18:46:12] [INFO ] Redundant transitions in 240 ms returned []
[2023-03-21 18:46:12] [INFO ] Invariant cache hit.
[2023-03-21 18:46:12] [INFO ] Dead Transitions using invariants and state equation in 348 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3673 ms. Remains : 504/504 places, 484/484 transitions.
Treatment of property ShieldIIPs-PT-020B-LTLFireability-02 finished in 19337 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||F(p1)))))'
Support contains 4 out of 1068 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1068/1068 places, 1048/1048 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 1067 transition count 947
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 967 transition count 947
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 200 place count 967 transition count 847
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 400 place count 867 transition count 847
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 405 place count 862 transition count 842
Iterating global reduction 2 with 5 rules applied. Total rules applied 410 place count 862 transition count 842
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 410 place count 862 transition count 838
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 418 place count 858 transition count 838
Performed 354 Post agglomeration using F-continuation condition.Transition count delta: 354
Deduced a syphon composed of 354 places in 0 ms
Reduce places removed 354 places and 0 transitions.
Iterating global reduction 2 with 708 rules applied. Total rules applied 1126 place count 504 transition count 484
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1128 place count 502 transition count 482
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1129 place count 501 transition count 482
Applied a total of 1129 rules in 140 ms. Remains 501 /1068 variables (removed 567) and now considering 482/1048 (removed 566) transitions.
// Phase 1: matrix 482 rows 501 cols
[2023-03-21 18:46:13] [INFO ] Computed 180 place invariants in 1 ms
[2023-03-21 18:46:13] [INFO ] Implicit Places using invariants in 238 ms returned []
[2023-03-21 18:46:13] [INFO ] Invariant cache hit.
[2023-03-21 18:46:14] [INFO ] Implicit Places using invariants and state equation in 1201 ms returned []
Implicit Place search using SMT with State Equation took 1440 ms to find 0 implicit places.
[2023-03-21 18:46:14] [INFO ] Redundant transitions in 119 ms returned [481]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 481 rows 501 cols
[2023-03-21 18:46:14] [INFO ] Computed 180 place invariants in 2 ms
[2023-03-21 18:46:14] [INFO ] Dead Transitions using invariants and state equation in 278 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 501/1068 places, 481/1048 transitions.
Applied a total of 0 rules in 9 ms. Remains 501 /501 variables (removed 0) and now considering 481/481 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1993 ms. Remains : 501/1068 places, 481/1048 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s88 1) (EQ s97 1) (EQ s103 1)), p1:(EQ s67 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 128 reset in 588 ms.
Product exploration explored 100000 steps with 128 reset in 614 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 419 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 130 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 642 steps, including 0 resets, run visited all 2 properties in 8 ms. (steps per millisecond=80 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 320 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 166 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-21 18:46:17] [INFO ] Invariant cache hit.
[2023-03-21 18:46:17] [INFO ] [Real]Absence check using 180 positive place invariants in 84 ms returned sat
[2023-03-21 18:46:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 18:46:18] [INFO ] [Real]Absence check using state equation in 570 ms returned sat
[2023-03-21 18:46:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 18:46:18] [INFO ] [Nat]Absence check using 180 positive place invariants in 97 ms returned sat
[2023-03-21 18:46:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 18:46:19] [INFO ] [Nat]Absence check using state equation in 862 ms returned sat
[2023-03-21 18:46:19] [INFO ] Computed and/alt/rep : 479/1192/479 causal constraints (skipped 0 transitions) in 34 ms.
[2023-03-21 18:46:25] [INFO ] Added : 436 causal constraints over 88 iterations in 6116 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 501/501 places, 481/481 transitions.
Applied a total of 0 rules in 8 ms. Remains 501 /501 variables (removed 0) and now considering 481/481 (removed 0) transitions.
[2023-03-21 18:46:25] [INFO ] Invariant cache hit.
[2023-03-21 18:46:26] [INFO ] Implicit Places using invariants in 353 ms returned []
[2023-03-21 18:46:26] [INFO ] Invariant cache hit.
[2023-03-21 18:46:27] [INFO ] Implicit Places using invariants and state equation in 1012 ms returned []
Implicit Place search using SMT with State Equation took 1366 ms to find 0 implicit places.
[2023-03-21 18:46:27] [INFO ] Redundant transitions in 61 ms returned []
[2023-03-21 18:46:27] [INFO ] Invariant cache hit.
[2023-03-21 18:46:27] [INFO ] Dead Transitions using invariants and state equation in 304 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1775 ms. Remains : 501/501 places, 481/481 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 320 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 135 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 837 steps, including 0 resets, run visited all 2 properties in 23 ms. (steps per millisecond=36 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 348 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-21 18:46:28] [INFO ] Invariant cache hit.
[2023-03-21 18:46:29] [INFO ] [Real]Absence check using 180 positive place invariants in 72 ms returned sat
[2023-03-21 18:46:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 18:46:30] [INFO ] [Real]Absence check using state equation in 936 ms returned sat
[2023-03-21 18:46:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 18:46:30] [INFO ] [Nat]Absence check using 180 positive place invariants in 114 ms returned sat
[2023-03-21 18:46:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 18:46:31] [INFO ] [Nat]Absence check using state equation in 877 ms returned sat
[2023-03-21 18:46:31] [INFO ] Computed and/alt/rep : 479/1192/479 causal constraints (skipped 0 transitions) in 41 ms.
[2023-03-21 18:46:37] [INFO ] Added : 436 causal constraints over 88 iterations in 5896 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 128 reset in 524 ms.
Product exploration explored 100000 steps with 128 reset in 602 ms.
Support contains 4 out of 501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 501/501 places, 481/481 transitions.
Applied a total of 0 rules in 9 ms. Remains 501 /501 variables (removed 0) and now considering 481/481 (removed 0) transitions.
[2023-03-21 18:46:38] [INFO ] Invariant cache hit.
[2023-03-21 18:46:38] [INFO ] Implicit Places using invariants in 304 ms returned []
[2023-03-21 18:46:38] [INFO ] Invariant cache hit.
[2023-03-21 18:46:39] [INFO ] Implicit Places using invariants and state equation in 814 ms returned []
Implicit Place search using SMT with State Equation took 1160 ms to find 0 implicit places.
[2023-03-21 18:46:39] [INFO ] Redundant transitions in 77 ms returned []
[2023-03-21 18:46:39] [INFO ] Invariant cache hit.
[2023-03-21 18:46:40] [INFO ] Dead Transitions using invariants and state equation in 867 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2135 ms. Remains : 501/501 places, 481/481 transitions.
Treatment of property ShieldIIPs-PT-020B-LTLFireability-04 finished in 27879 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1068 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1068/1068 places, 1048/1048 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 1067 transition count 946
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 1 with 101 rules applied. Total rules applied 202 place count 966 transition count 946
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 202 place count 966 transition count 845
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 404 place count 865 transition count 845
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 410 place count 859 transition count 839
Iterating global reduction 2 with 6 rules applied. Total rules applied 416 place count 859 transition count 839
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 416 place count 859 transition count 835
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 424 place count 855 transition count 835
Performed 353 Post agglomeration using F-continuation condition.Transition count delta: 353
Deduced a syphon composed of 353 places in 1 ms
Reduce places removed 353 places and 0 transitions.
Iterating global reduction 2 with 706 rules applied. Total rules applied 1130 place count 502 transition count 482
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1132 place count 500 transition count 480
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1133 place count 499 transition count 480
Applied a total of 1133 rules in 94 ms. Remains 499 /1068 variables (removed 569) and now considering 480/1048 (removed 568) transitions.
// Phase 1: matrix 480 rows 499 cols
[2023-03-21 18:46:40] [INFO ] Computed 180 place invariants in 3 ms
[2023-03-21 18:46:41] [INFO ] Implicit Places using invariants in 339 ms returned []
[2023-03-21 18:46:41] [INFO ] Invariant cache hit.
[2023-03-21 18:46:41] [INFO ] Implicit Places using invariants and state equation in 532 ms returned []
Implicit Place search using SMT with State Equation took 873 ms to find 0 implicit places.
[2023-03-21 18:46:41] [INFO ] Redundant transitions in 96 ms returned [479]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 479 rows 499 cols
[2023-03-21 18:46:41] [INFO ] Computed 180 place invariants in 4 ms
[2023-03-21 18:46:43] [INFO ] Dead Transitions using invariants and state equation in 1137 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 499/1068 places, 479/1048 transitions.
Applied a total of 0 rules in 15 ms. Remains 499 /499 variables (removed 0) and now considering 479/479 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2238 ms. Remains : 499/1068 places, 479/1048 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s300 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 1052 steps with 0 reset in 8 ms.
FORMULA ShieldIIPs-PT-020B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020B-LTLFireability-05 finished in 2326 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(X(F(p1))))))'
Support contains 2 out of 1068 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1068/1068 places, 1048/1048 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1064 transition count 1044
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1064 transition count 1044
Applied a total of 8 rules in 57 ms. Remains 1064 /1068 variables (removed 4) and now considering 1044/1048 (removed 4) transitions.
// Phase 1: matrix 1044 rows 1064 cols
[2023-03-21 18:46:43] [INFO ] Computed 181 place invariants in 10 ms
[2023-03-21 18:46:43] [INFO ] Implicit Places using invariants in 458 ms returned []
[2023-03-21 18:46:43] [INFO ] Invariant cache hit.
[2023-03-21 18:46:46] [INFO ] Implicit Places using invariants and state equation in 3041 ms returned []
Implicit Place search using SMT with State Equation took 3518 ms to find 0 implicit places.
[2023-03-21 18:46:46] [INFO ] Invariant cache hit.
[2023-03-21 18:46:47] [INFO ] Dead Transitions using invariants and state equation in 799 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1064/1068 places, 1044/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4388 ms. Remains : 1064/1068 places, 1044/1048 transitions.
Stuttering acceptance computed with spot in 307 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(EQ s256 0), p0:(EQ s686 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 401 ms.
Product exploration explored 100000 steps with 25000 reset in 382 ms.
Computed a total of 240 stabilizing places and 240 stable transitions
Computed a total of 240 stabilizing places and 240 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 236 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 1615 steps, including 0 resets, run visited all 1 properties in 23 ms. (steps per millisecond=70 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 339 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 246 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 1064 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1064/1064 places, 1044/1044 transitions.
Applied a total of 0 rules in 58 ms. Remains 1064 /1064 variables (removed 0) and now considering 1044/1044 (removed 0) transitions.
[2023-03-21 18:46:50] [INFO ] Invariant cache hit.
[2023-03-21 18:46:50] [INFO ] Implicit Places using invariants in 755 ms returned []
[2023-03-21 18:46:50] [INFO ] Invariant cache hit.
[2023-03-21 18:46:52] [INFO ] Implicit Places using invariants and state equation in 1218 ms returned []
Implicit Place search using SMT with State Equation took 1985 ms to find 0 implicit places.
[2023-03-21 18:46:52] [INFO ] Invariant cache hit.
[2023-03-21 18:46:52] [INFO ] Dead Transitions using invariants and state equation in 692 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2736 ms. Remains : 1064/1064 places, 1044/1044 transitions.
Computed a total of 240 stabilizing places and 240 stable transitions
Computed a total of 240 stabilizing places and 240 stable transitions
Knowledge obtained : [p1, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 102 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 1703 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=154 )
Knowledge obtained : [p1, true]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 142 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 226 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 203 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 392 ms.
Product exploration explored 100000 steps with 25000 reset in 437 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 229 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 1064 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1064/1064 places, 1044/1044 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 1064 transition count 1044
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 42 Pre rules applied. Total rules applied 100 place count 1064 transition count 1048
Deduced a syphon composed of 142 places in 1 ms
Iterating global reduction 1 with 42 rules applied. Total rules applied 142 place count 1064 transition count 1048
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 143 place count 1063 transition count 1047
Deduced a syphon composed of 142 places in 2 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 144 place count 1063 transition count 1047
Performed 419 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 561 places in 1 ms
Iterating global reduction 1 with 419 rules applied. Total rules applied 563 place count 1063 transition count 1047
Renaming transitions due to excessive name length > 1024 char.
Discarding 140 places :
Symmetric choice reduction at 1 with 140 rule applications. Total rules 703 place count 923 transition count 907
Deduced a syphon composed of 421 places in 1 ms
Iterating global reduction 1 with 140 rules applied. Total rules applied 843 place count 923 transition count 907
Deduced a syphon composed of 421 places in 1 ms
Applied a total of 843 rules in 399 ms. Remains 923 /1064 variables (removed 141) and now considering 907/1044 (removed 137) transitions.
[2023-03-21 18:46:55] [INFO ] Redundant transitions in 76 ms returned [906]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 906 rows 923 cols
[2023-03-21 18:46:55] [INFO ] Computed 181 place invariants in 8 ms
[2023-03-21 18:46:56] [INFO ] Dead Transitions using invariants and state equation in 570 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 923/1064 places, 906/1044 transitions.
Deduced a syphon composed of 421 places in 1 ms
Applied a total of 0 rules in 22 ms. Remains 923 /923 variables (removed 0) and now considering 906/906 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1096 ms. Remains : 923/1064 places, 906/1044 transitions.
Support contains 1 out of 1064 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1064/1064 places, 1044/1044 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1063 transition count 1043
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1063 transition count 1043
Applied a total of 2 rules in 37 ms. Remains 1063 /1064 variables (removed 1) and now considering 1043/1044 (removed 1) transitions.
// Phase 1: matrix 1043 rows 1063 cols
[2023-03-21 18:46:56] [INFO ] Computed 181 place invariants in 7 ms
[2023-03-21 18:46:56] [INFO ] Implicit Places using invariants in 405 ms returned []
[2023-03-21 18:46:56] [INFO ] Invariant cache hit.
[2023-03-21 18:46:58] [INFO ] Implicit Places using invariants and state equation in 1283 ms returned []
Implicit Place search using SMT with State Equation took 1691 ms to find 0 implicit places.
[2023-03-21 18:46:58] [INFO ] Invariant cache hit.
[2023-03-21 18:46:58] [INFO ] Dead Transitions using invariants and state equation in 799 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1063/1064 places, 1043/1044 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2528 ms. Remains : 1063/1064 places, 1043/1044 transitions.
Treatment of property ShieldIIPs-PT-020B-LTLFireability-06 finished in 15748 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(X(p1))||(!p2 U (p3||G(!p2))))))'
Support contains 6 out of 1068 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1068/1068 places, 1048/1048 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1063 transition count 1043
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1063 transition count 1043
Applied a total of 10 rules in 54 ms. Remains 1063 /1068 variables (removed 5) and now considering 1043/1048 (removed 5) transitions.
// Phase 1: matrix 1043 rows 1063 cols
[2023-03-21 18:46:59] [INFO ] Computed 181 place invariants in 8 ms
[2023-03-21 18:46:59] [INFO ] Implicit Places using invariants in 526 ms returned []
[2023-03-21 18:46:59] [INFO ] Invariant cache hit.
[2023-03-21 18:47:01] [INFO ] Implicit Places using invariants and state equation in 2032 ms returned []
Implicit Place search using SMT with State Equation took 2560 ms to find 0 implicit places.
[2023-03-21 18:47:01] [INFO ] Invariant cache hit.
[2023-03-21 18:47:02] [INFO ] Dead Transitions using invariants and state equation in 774 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1063/1068 places, 1043/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3389 ms. Remains : 1063/1068 places, 1043/1048 transitions.
Stuttering acceptance computed with spot in 579 ms :[(NOT p1), (AND (NOT p1) (NOT p3) p2 (NOT p0)), (AND (NOT p3) p2), (AND (NOT p1) (NOT p3) p2 (NOT p0)), (AND (NOT p1) (NOT p3) p2), (AND (NOT p3) p2 (NOT p1)), (NOT p1), true]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 7}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={} source=6 dest: 0}], [{ cond=true, acceptance={0} source=7 dest: 7}]], initial=1, aps=[p1:(AND (EQ s850 1) (EQ s159 1)), p3:(AND (NOT (AND (EQ s760 1) (EQ s797 1))) (NOT (AND (EQ s300 1) (EQ s325 1)))), p2:(AND (EQ s300 1) (EQ s325 1)), p0:(...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 715 ms.
Product exploration explored 100000 steps with 50000 reset in 654 ms.
Computed a total of 240 stabilizing places and 240 stable transitions
Computed a total of 240 stabilizing places and 240 stable transitions
Knowledge obtained : [(AND (NOT p1) p3 (NOT p2) (NOT p0)), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), true, (X (X (NOT (AND (NOT p3) p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))
Knowledge based reduction with 6 factoid took 251 ms. Reduced automaton from 8 states, 12 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-020B-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-020B-LTLFireability-07 finished in 5661 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((G(F((p0||G(p1))))||G(p2)))))'
Support contains 3 out of 1068 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1068/1068 places, 1048/1048 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1062 transition count 1042
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1062 transition count 1042
Applied a total of 12 rules in 66 ms. Remains 1062 /1068 variables (removed 6) and now considering 1042/1048 (removed 6) transitions.
// Phase 1: matrix 1042 rows 1062 cols
[2023-03-21 18:47:04] [INFO ] Computed 181 place invariants in 8 ms
[2023-03-21 18:47:05] [INFO ] Implicit Places using invariants in 534 ms returned []
[2023-03-21 18:47:05] [INFO ] Invariant cache hit.
[2023-03-21 18:47:06] [INFO ] Implicit Places using invariants and state equation in 1192 ms returned []
Implicit Place search using SMT with State Equation took 1750 ms to find 0 implicit places.
[2023-03-21 18:47:06] [INFO ] Invariant cache hit.
[2023-03-21 18:47:07] [INFO ] Dead Transitions using invariants and state equation in 718 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1062/1068 places, 1042/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2536 ms. Remains : 1062/1068 places, 1042/1048 transitions.
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p2:(EQ s594 1), p1:(EQ s531 1), p0:(EQ s23 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 287 reset in 441 ms.
Product exploration explored 100000 steps with 288 reset in 476 ms.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Detected a total of 239/1062 stabilizing places and 239/1042 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 229 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 905 steps, including 0 resets, run visited all 2 properties in 13 ms. (steps per millisecond=69 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 4 factoid took 372 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 262 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2023-03-21 18:47:09] [INFO ] Invariant cache hit.
[2023-03-21 18:47:10] [INFO ] [Real]Absence check using 181 positive place invariants in 116 ms returned sat
[2023-03-21 18:47:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 18:47:13] [INFO ] [Real]Absence check using state equation in 3392 ms returned sat
[2023-03-21 18:47:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 18:47:14] [INFO ] [Nat]Absence check using 181 positive place invariants in 137 ms returned sat
[2023-03-21 18:47:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 18:47:17] [INFO ] [Nat]Absence check using state equation in 2917 ms returned sat
[2023-03-21 18:47:17] [INFO ] Deduced a trap composed of 35 places in 173 ms of which 1 ms to minimize.
[2023-03-21 18:47:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 309 ms
[2023-03-21 18:47:17] [INFO ] Computed and/alt/rep : 1041/2342/1041 causal constraints (skipped 0 transitions) in 144 ms.
[2023-03-21 18:47:28] [INFO ] Added : 450 causal constraints over 90 iterations in 11254 ms. Result :unknown
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 2 out of 1062 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1062/1062 places, 1042/1042 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 1061 transition count 942
Reduce places removed 99 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 100 rules applied. Total rules applied 199 place count 962 transition count 941
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 200 place count 961 transition count 941
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 200 place count 961 transition count 841
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 400 place count 861 transition count 841
Performed 355 Post agglomeration using F-continuation condition.Transition count delta: 355
Deduced a syphon composed of 355 places in 1 ms
Reduce places removed 355 places and 0 transitions.
Iterating global reduction 3 with 710 rules applied. Total rules applied 1110 place count 506 transition count 486
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1112 place count 504 transition count 484
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1113 place count 503 transition count 484
Applied a total of 1113 rules in 84 ms. Remains 503 /1062 variables (removed 559) and now considering 484/1042 (removed 558) transitions.
// Phase 1: matrix 484 rows 503 cols
[2023-03-21 18:47:28] [INFO ] Computed 180 place invariants in 3 ms
[2023-03-21 18:47:29] [INFO ] Implicit Places using invariants in 481 ms returned []
[2023-03-21 18:47:29] [INFO ] Invariant cache hit.
[2023-03-21 18:47:30] [INFO ] Implicit Places using invariants and state equation in 877 ms returned []
Implicit Place search using SMT with State Equation took 1368 ms to find 0 implicit places.
[2023-03-21 18:47:30] [INFO ] Redundant transitions in 190 ms returned [483]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 483 rows 503 cols
[2023-03-21 18:47:30] [INFO ] Computed 180 place invariants in 3 ms
[2023-03-21 18:47:30] [INFO ] Dead Transitions using invariants and state equation in 451 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 503/1062 places, 483/1042 transitions.
Applied a total of 0 rules in 9 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2125 ms. Remains : 503/1062 places, 483/1042 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/503 stabilizing places and 2/483 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), true, (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 5 factoid took 431 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 343 steps, including 0 resets, run visited all 2 properties in 6 ms. (steps per millisecond=57 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), true, (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 5 factoid took 490 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2023-03-21 18:47:32] [INFO ] Invariant cache hit.
[2023-03-21 18:47:32] [INFO ] [Real]Absence check using 180 positive place invariants in 132 ms returned sat
[2023-03-21 18:47:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 18:47:33] [INFO ] [Real]Absence check using state equation in 843 ms returned sat
[2023-03-21 18:47:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 18:47:34] [INFO ] [Nat]Absence check using 180 positive place invariants in 75 ms returned sat
[2023-03-21 18:47:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 18:47:35] [INFO ] [Nat]Absence check using state equation in 837 ms returned sat
[2023-03-21 18:47:35] [INFO ] Computed and/alt/rep : 479/1221/479 causal constraints (skipped 1 transitions) in 35 ms.
[2023-03-21 18:47:48] [INFO ] Added : 479 causal constraints over 96 iterations in 13401 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering criterion allowed to conclude after 1036 steps with 0 reset in 6 ms.
FORMULA ShieldIIPs-PT-020B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020B-LTLFireability-08 finished in 44175 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 1068 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1068/1068 places, 1048/1048 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 1067 transition count 947
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 967 transition count 947
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 200 place count 967 transition count 846
Deduced a syphon composed of 101 places in 64 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 402 place count 866 transition count 846
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 407 place count 861 transition count 841
Iterating global reduction 2 with 5 rules applied. Total rules applied 412 place count 861 transition count 841
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 412 place count 861 transition count 838
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 418 place count 858 transition count 838
Performed 354 Post agglomeration using F-continuation condition.Transition count delta: 354
Deduced a syphon composed of 354 places in 0 ms
Reduce places removed 354 places and 0 transitions.
Iterating global reduction 2 with 708 rules applied. Total rules applied 1126 place count 504 transition count 484
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1128 place count 502 transition count 482
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1129 place count 501 transition count 482
Applied a total of 1129 rules in 147 ms. Remains 501 /1068 variables (removed 567) and now considering 482/1048 (removed 566) transitions.
// Phase 1: matrix 482 rows 501 cols
[2023-03-21 18:47:48] [INFO ] Computed 180 place invariants in 3 ms
[2023-03-21 18:47:49] [INFO ] Implicit Places using invariants in 354 ms returned []
[2023-03-21 18:47:49] [INFO ] Invariant cache hit.
[2023-03-21 18:47:50] [INFO ] Implicit Places using invariants and state equation in 867 ms returned []
Implicit Place search using SMT with State Equation took 1237 ms to find 0 implicit places.
[2023-03-21 18:47:50] [INFO ] Redundant transitions in 81 ms returned [481]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 481 rows 501 cols
[2023-03-21 18:47:50] [INFO ] Computed 180 place invariants in 1 ms
[2023-03-21 18:47:50] [INFO ] Dead Transitions using invariants and state equation in 364 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 501/1068 places, 481/1048 transitions.
Applied a total of 0 rules in 7 ms. Remains 501 /501 variables (removed 0) and now considering 481/481 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1857 ms. Remains : 501/1068 places, 481/1048 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLFireability-09 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 s424 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 1042 steps with 1 reset in 7 ms.
FORMULA ShieldIIPs-PT-020B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020B-LTLFireability-09 finished in 2020 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||X(p0)) U (G((p0||X(p0)))||((p0||X(p0))&&G(p1)))))'
Support contains 2 out of 1068 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1068/1068 places, 1048/1048 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1062 transition count 1042
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1062 transition count 1042
Applied a total of 12 rules in 39 ms. Remains 1062 /1068 variables (removed 6) and now considering 1042/1048 (removed 6) transitions.
// Phase 1: matrix 1042 rows 1062 cols
[2023-03-21 18:47:50] [INFO ] Computed 181 place invariants in 19 ms
[2023-03-21 18:47:51] [INFO ] Implicit Places using invariants in 396 ms returned []
[2023-03-21 18:47:51] [INFO ] Invariant cache hit.
[2023-03-21 18:47:52] [INFO ] Implicit Places using invariants and state equation in 1407 ms returned []
Implicit Place search using SMT with State Equation took 1817 ms to find 0 implicit places.
[2023-03-21 18:47:52] [INFO ] Invariant cache hit.
[2023-03-21 18:47:54] [INFO ] Dead Transitions using invariants and state equation in 1546 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1062/1068 places, 1042/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3403 ms. Remains : 1062/1068 places, 1042/1048 transitions.
Stuttering acceptance computed with spot in 258 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 2}, { cond=(AND p1 p0), acceptance={} source=4 dest: 3}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(NEQ s649 1), p0:(NEQ s953 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 13180 steps with 5 reset in 94 ms.
FORMULA ShieldIIPs-PT-020B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020B-LTLFireability-12 finished in 3787 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(p1)))))'
Support contains 4 out of 1068 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1068/1068 places, 1048/1048 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1062 transition count 1042
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1062 transition count 1042
Applied a total of 12 rules in 64 ms. Remains 1062 /1068 variables (removed 6) and now considering 1042/1048 (removed 6) transitions.
[2023-03-21 18:47:54] [INFO ] Invariant cache hit.
[2023-03-21 18:47:55] [INFO ] Implicit Places using invariants in 573 ms returned []
[2023-03-21 18:47:55] [INFO ] Invariant cache hit.
[2023-03-21 18:47:56] [INFO ] Implicit Places using invariants and state equation in 1105 ms returned []
Implicit Place search using SMT with State Equation took 1694 ms to find 0 implicit places.
[2023-03-21 18:47:56] [INFO ] Invariant cache hit.
[2023-03-21 18:47:57] [INFO ] Dead Transitions using invariants and state equation in 1562 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1062/1068 places, 1042/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3327 ms. Remains : 1062/1068 places, 1042/1048 transitions.
Stuttering acceptance computed with spot in 233 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s823 1) (EQ s831 1) (EQ s852 1) (EQ s971 1)), p1:(EQ s971 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 236 reset in 435 ms.
Product exploration explored 100000 steps with 232 reset in 428 ms.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 175 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 423 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=141 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 216 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-21 18:47:59] [INFO ] Invariant cache hit.
[2023-03-21 18:48:00] [INFO ] [Real]Absence check using 181 positive place invariants in 262 ms returned sat
[2023-03-21 18:48:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 18:48:03] [INFO ] [Real]Absence check using state equation in 2756 ms returned sat
[2023-03-21 18:48:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 18:48:05] [INFO ] [Nat]Absence check using 181 positive place invariants in 734 ms returned sat
[2023-03-21 18:48:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 18:48:07] [INFO ] [Nat]Absence check using state equation in 2882 ms returned sat
[2023-03-21 18:48:08] [INFO ] Computed and/alt/rep : 1041/2342/1041 causal constraints (skipped 0 transitions) in 72 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 18:48:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (AND (NOT p0) (NOT p1))
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 1062 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1062/1062 places, 1042/1042 transitions.
Applied a total of 0 rules in 19 ms. Remains 1062 /1062 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
[2023-03-21 18:48:18] [INFO ] Invariant cache hit.
[2023-03-21 18:48:19] [INFO ] Implicit Places using invariants in 721 ms returned []
[2023-03-21 18:48:19] [INFO ] Invariant cache hit.
[2023-03-21 18:48:21] [INFO ] Implicit Places using invariants and state equation in 1978 ms returned []
Implicit Place search using SMT with State Equation took 2713 ms to find 0 implicit places.
[2023-03-21 18:48:21] [INFO ] Invariant cache hit.
[2023-03-21 18:48:22] [INFO ] Dead Transitions using invariants and state equation in 684 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3418 ms. Remains : 1062/1062 places, 1042/1042 transitions.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 131 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 370 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=123 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 153 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-21 18:48:23] [INFO ] Invariant cache hit.
[2023-03-21 18:48:23] [INFO ] [Real]Absence check using 181 positive place invariants in 117 ms returned sat
[2023-03-21 18:48:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 18:48:26] [INFO ] [Real]Absence check using state equation in 2404 ms returned sat
[2023-03-21 18:48:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 18:48:26] [INFO ] [Nat]Absence check using 181 positive place invariants in 122 ms returned sat
[2023-03-21 18:48:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 18:48:30] [INFO ] [Nat]Absence check using state equation in 3237 ms returned sat
[2023-03-21 18:48:30] [INFO ] Computed and/alt/rep : 1041/2342/1041 causal constraints (skipped 0 transitions) in 86 ms.
[2023-03-21 18:48:41] [INFO ] Added : 400 causal constraints over 80 iterations in 11030 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 226 reset in 499 ms.
Product exploration explored 100000 steps with 232 reset in 438 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 1062 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1062/1062 places, 1042/1042 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 1062 transition count 1042
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 41 Pre rules applied. Total rules applied 99 place count 1062 transition count 1044
Deduced a syphon composed of 140 places in 1 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 140 place count 1062 transition count 1044
Performed 420 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 560 places in 1 ms
Iterating global reduction 1 with 420 rules applied. Total rules applied 560 place count 1062 transition count 1044
Renaming transitions due to excessive name length > 1024 char.
Discarding 141 places :
Symmetric choice reduction at 1 with 141 rule applications. Total rules 701 place count 921 transition count 903
Deduced a syphon composed of 419 places in 0 ms
Iterating global reduction 1 with 141 rules applied. Total rules applied 842 place count 921 transition count 903
Deduced a syphon composed of 419 places in 0 ms
Applied a total of 842 rules in 292 ms. Remains 921 /1062 variables (removed 141) and now considering 903/1042 (removed 139) transitions.
[2023-03-21 18:48:43] [INFO ] Redundant transitions in 139 ms returned [902]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 902 rows 921 cols
[2023-03-21 18:48:43] [INFO ] Computed 181 place invariants in 5 ms
[2023-03-21 18:48:43] [INFO ] Dead Transitions using invariants and state equation in 732 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 921/1062 places, 902/1042 transitions.
Deduced a syphon composed of 419 places in 1 ms
Applied a total of 0 rules in 45 ms. Remains 921 /921 variables (removed 0) and now considering 902/902 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1260 ms. Remains : 921/1062 places, 902/1042 transitions.
Support contains 4 out of 1062 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1062/1062 places, 1042/1042 transitions.
Applied a total of 0 rules in 41 ms. Remains 1062 /1062 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
// Phase 1: matrix 1042 rows 1062 cols
[2023-03-21 18:48:43] [INFO ] Computed 181 place invariants in 7 ms
[2023-03-21 18:48:45] [INFO ] Implicit Places using invariants in 1088 ms returned []
[2023-03-21 18:48:45] [INFO ] Invariant cache hit.
[2023-03-21 18:48:46] [INFO ] Implicit Places using invariants and state equation in 1375 ms returned []
Implicit Place search using SMT with State Equation took 2487 ms to find 0 implicit places.
[2023-03-21 18:48:46] [INFO ] Invariant cache hit.
[2023-03-21 18:48:47] [INFO ] Dead Transitions using invariants and state equation in 852 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3385 ms. Remains : 1062/1062 places, 1042/1042 transitions.
Treatment of property ShieldIIPs-PT-020B-LTLFireability-13 finished in 52828 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||(p1&&F(p2))))))'
Support contains 3 out of 1068 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1068/1068 places, 1048/1048 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 1067 transition count 947
Reduce places removed 100 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 101 rules applied. Total rules applied 201 place count 967 transition count 946
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 202 place count 966 transition count 946
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 202 place count 966 transition count 845
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 404 place count 865 transition count 845
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 410 place count 859 transition count 839
Iterating global reduction 3 with 6 rules applied. Total rules applied 416 place count 859 transition count 839
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 416 place count 859 transition count 835
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 424 place count 855 transition count 835
Performed 349 Post agglomeration using F-continuation condition.Transition count delta: 349
Deduced a syphon composed of 349 places in 1 ms
Reduce places removed 349 places and 0 transitions.
Iterating global reduction 3 with 698 rules applied. Total rules applied 1122 place count 506 transition count 486
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1124 place count 504 transition count 484
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1125 place count 503 transition count 484
Applied a total of 1125 rules in 153 ms. Remains 503 /1068 variables (removed 565) and now considering 484/1048 (removed 564) transitions.
// Phase 1: matrix 484 rows 503 cols
[2023-03-21 18:48:47] [INFO ] Computed 180 place invariants in 1 ms
[2023-03-21 18:48:47] [INFO ] Implicit Places using invariants in 339 ms returned []
[2023-03-21 18:48:47] [INFO ] Invariant cache hit.
[2023-03-21 18:48:48] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 827 ms to find 0 implicit places.
[2023-03-21 18:48:48] [INFO ] Redundant transitions in 57 ms returned [483]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 483 rows 503 cols
[2023-03-21 18:48:48] [INFO ] Computed 180 place invariants in 1 ms
[2023-03-21 18:48:48] [INFO ] Dead Transitions using invariants and state equation in 515 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 503/1068 places, 483/1048 transitions.
Applied a total of 0 rules in 7 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1587 ms. Remains : 503/1068 places, 483/1048 transitions.
Stuttering acceptance computed with spot in 235 ms :[(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 : ShieldIIPs-PT-020B-LTLFireability-14 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) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s255 0), p0:(AND (EQ s255 0) (EQ s178 1)), p2:(EQ s454 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1494 steps with 11 reset in 20 ms.
FORMULA ShieldIIPs-PT-020B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020B-LTLFireability-14 finished in 1874 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 3 out of 1068 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1068/1068 places, 1048/1048 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1062 transition count 1042
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1062 transition count 1042
Applied a total of 12 rules in 75 ms. Remains 1062 /1068 variables (removed 6) and now considering 1042/1048 (removed 6) transitions.
// Phase 1: matrix 1042 rows 1062 cols
[2023-03-21 18:48:49] [INFO ] Computed 181 place invariants in 2 ms
[2023-03-21 18:48:49] [INFO ] Implicit Places using invariants in 464 ms returned []
[2023-03-21 18:48:49] [INFO ] Invariant cache hit.
[2023-03-21 18:48:51] [INFO ] Implicit Places using invariants and state equation in 1146 ms returned []
Implicit Place search using SMT with State Equation took 1613 ms to find 0 implicit places.
[2023-03-21 18:48:51] [INFO ] Invariant cache hit.
[2023-03-21 18:48:51] [INFO ] Dead Transitions using invariants and state equation in 893 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1062/1068 places, 1042/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2609 ms. Remains : 1062/1068 places, 1042/1048 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-020B-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:(AND (EQ s615 1) (EQ s623 1) (EQ s644 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]]
Stuttering criterion allowed to conclude after 2184 steps with 0 reset in 30 ms.
FORMULA ShieldIIPs-PT-020B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020B-LTLFireability-15 finished in 2876 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)||(X(X(!p0)) U ((X(X(!p0))&&G(!p1))||X(X(G(!p0))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||F(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' '!(X((G(p0)||X(X(F(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' '!(X(F((p0||X(p1)))))'
Found a Shortening insensitive property : ShieldIIPs-PT-020B-LTLFireability-13
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 1068 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1068/1068 places, 1048/1048 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 1067 transition count 947
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 967 transition count 947
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 200 place count 967 transition count 846
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 402 place count 866 transition count 846
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 408 place count 860 transition count 840
Iterating global reduction 2 with 6 rules applied. Total rules applied 414 place count 860 transition count 840
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 414 place count 860 transition count 836
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 422 place count 856 transition count 836
Performed 353 Post agglomeration using F-continuation condition.Transition count delta: 353
Deduced a syphon composed of 353 places in 1 ms
Reduce places removed 353 places and 0 transitions.
Iterating global reduction 2 with 706 rules applied. Total rules applied 1128 place count 503 transition count 483
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1130 place count 501 transition count 481
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1131 place count 500 transition count 481
Applied a total of 1131 rules in 111 ms. Remains 500 /1068 variables (removed 568) and now considering 481/1048 (removed 567) transitions.
// Phase 1: matrix 481 rows 500 cols
[2023-03-21 18:48:52] [INFO ] Computed 180 place invariants in 2 ms
[2023-03-21 18:48:53] [INFO ] Implicit Places using invariants in 396 ms returned []
[2023-03-21 18:48:53] [INFO ] Invariant cache hit.
[2023-03-21 18:48:54] [INFO ] Implicit Places using invariants and state equation in 1659 ms returned []
Implicit Place search using SMT with State Equation took 2084 ms to find 0 implicit places.
[2023-03-21 18:48:54] [INFO ] Invariant cache hit.
[2023-03-21 18:48:55] [INFO ] Dead Transitions using invariants and state equation in 321 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 500/1068 places, 481/1048 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2518 ms. Remains : 500/1068 places, 481/1048 transitions.
Running random walk in product with property : ShieldIIPs-PT-020B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s385 1) (EQ s390 1) (EQ s401 1) (EQ s455 1)), p1:(EQ s455 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]]
Product exploration explored 100000 steps with 1787 reset in 494 ms.
Product exploration explored 100000 steps with 1775 reset in 528 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 251 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 342 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 96 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=48 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 314 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-21 18:48:57] [INFO ] Invariant cache hit.
[2023-03-21 18:48:58] [INFO ] [Real]Absence check using 180 positive place invariants in 55 ms returned sat
[2023-03-21 18:48:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 18:48:59] [INFO ] [Real]Absence check using state equation in 1141 ms returned sat
[2023-03-21 18:48:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 18:49:02] [INFO ] [Nat]Absence check using 180 positive place invariants in 65 ms returned sat
[2023-03-21 18:49:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 18:49:03] [INFO ] [Nat]Absence check using state equation in 1059 ms returned sat
[2023-03-21 18:49:03] [INFO ] Computed and/alt/rep : 480/1193/480 causal constraints (skipped 0 transitions) in 53 ms.
[2023-03-21 18:49:08] [INFO ] Added : 389 causal constraints over 79 iterations in 5539 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 481/481 transitions.
Applied a total of 0 rules in 3 ms. Remains 500 /500 variables (removed 0) and now considering 481/481 (removed 0) transitions.
[2023-03-21 18:49:08] [INFO ] Invariant cache hit.
[2023-03-21 18:49:09] [INFO ] Implicit Places using invariants in 988 ms returned []
[2023-03-21 18:49:09] [INFO ] Invariant cache hit.
[2023-03-21 18:49:10] [INFO ] Implicit Places using invariants and state equation in 878 ms returned []
Implicit Place search using SMT with State Equation took 1877 ms to find 0 implicit places.
[2023-03-21 18:49:10] [INFO ] Invariant cache hit.
[2023-03-21 18:49:10] [INFO ] Dead Transitions using invariants and state equation in 253 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2150 ms. Remains : 500/500 places, 481/481 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 35 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 227 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 270 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-21 18:49:11] [INFO ] Invariant cache hit.
[2023-03-21 18:49:12] [INFO ] [Real]Absence check using 180 positive place invariants in 52 ms returned sat
[2023-03-21 18:49:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 18:49:12] [INFO ] [Real]Absence check using state equation in 677 ms returned sat
[2023-03-21 18:49:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 18:49:13] [INFO ] [Nat]Absence check using 180 positive place invariants in 55 ms returned sat
[2023-03-21 18:49:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 18:49:13] [INFO ] [Nat]Absence check using state equation in 536 ms returned sat
[2023-03-21 18:49:14] [INFO ] Computed and/alt/rep : 480/1193/480 causal constraints (skipped 0 transitions) in 40 ms.
[2023-03-21 18:49:19] [INFO ] Added : 389 causal constraints over 79 iterations in 5696 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1778 reset in 444 ms.
Product exploration explored 100000 steps with 1762 reset in 554 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 481/481 transitions.
Applied a total of 0 rules in 18 ms. Remains 500 /500 variables (removed 0) and now considering 481/481 (removed 0) transitions.
[2023-03-21 18:49:21] [INFO ] Redundant transitions in 141 ms returned [480]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 480 rows 500 cols
[2023-03-21 18:49:21] [INFO ] Computed 180 place invariants in 2 ms
[2023-03-21 18:49:21] [INFO ] Dead Transitions using invariants and state equation in 317 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 500/500 places, 480/481 transitions.
Applied a total of 0 rules in 6 ms. Remains 500 /500 variables (removed 0) and now considering 480/480 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 517 ms. Remains : 500/500 places, 480/481 transitions.
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 481/481 transitions.
Applied a total of 0 rules in 4 ms. Remains 500 /500 variables (removed 0) and now considering 481/481 (removed 0) transitions.
// Phase 1: matrix 481 rows 500 cols
[2023-03-21 18:49:21] [INFO ] Computed 180 place invariants in 1 ms
[2023-03-21 18:49:22] [INFO ] Implicit Places using invariants in 341 ms returned []
[2023-03-21 18:49:22] [INFO ] Invariant cache hit.
[2023-03-21 18:49:23] [INFO ] Implicit Places using invariants and state equation in 1089 ms returned []
Implicit Place search using SMT with State Equation took 1448 ms to find 0 implicit places.
[2023-03-21 18:49:23] [INFO ] Invariant cache hit.
[2023-03-21 18:49:23] [INFO ] Dead Transitions using invariants and state equation in 268 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1720 ms. Remains : 500/500 places, 481/481 transitions.
Treatment of property ShieldIIPs-PT-020B-LTLFireability-13 finished in 31018 ms.
[2023-03-21 18:49:23] [INFO ] Flatten gal took : 51 ms
[2023-03-21 18:49:23] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-21 18:49:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1068 places, 1048 transitions and 3296 arcs took 6 ms.
Total runtime 244491 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2367/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2367/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2367/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2367/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldIIPs-PT-020B-LTLFireability-02
Could not compute solution for formula : ShieldIIPs-PT-020B-LTLFireability-04
Could not compute solution for formula : ShieldIIPs-PT-020B-LTLFireability-06
Could not compute solution for formula : ShieldIIPs-PT-020B-LTLFireability-13

BK_STOP 1679424566520

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name ShieldIIPs-PT-020B-LTLFireability-02
ltl formula formula --ltl=/tmp/2367/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 1068 places, 1048 transitions and 3296 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2367/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2367/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2367/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.300 real 0.070 user 0.210 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2367/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 17 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name ShieldIIPs-PT-020B-LTLFireability-04
ltl formula formula --ltl=/tmp/2367/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1068 places, 1048 transitions and 3296 arcs
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 Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.360 real 0.060 user 0.130 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2367/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2367/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2367/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2367/ltl_1_
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name ShieldIIPs-PT-020B-LTLFireability-06
ltl formula formula --ltl=/tmp/2367/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1068 places, 1048 transitions and 3296 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.400 real 0.120 user 0.100 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2367/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2367/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2367/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2367/ltl_2_
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:
ltl formula name ShieldIIPs-PT-020B-LTLFireability-13
ltl formula formula --ltl=/tmp/2367/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 1068 places, 1048 transitions and 3296 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2367/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2367/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2367/ltl_3_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.250 real 0.090 user 0.120 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2367/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
double free or corruption (fasttop)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldIIPs-PT-020B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r393-oct2-167903716600108"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-020B.tgz
mv ShieldIIPs-PT-020B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;