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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 7.6K Feb 26 02:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 26 02:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 02:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 02:02 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.4K Feb 25 16:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 02:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Feb 26 02:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 02:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 113K Feb 26 02:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 88K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679448253880

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-010A
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 01:24:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 01:24:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 01:24:16] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2023-03-22 01:24:16] [INFO ] Transformed 313 places.
[2023-03-22 01:24:16] [INFO ] Transformed 263 transitions.
[2023-03-22 01:24:16] [INFO ] Found NUPN structural information;
[2023-03-22 01:24:17] [INFO ] Parsed PT model containing 313 places and 263 transitions and 1006 arcs in 176 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 5 formulas.
FORMULA ShieldPPPs-PT-010A-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-010A-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-010A-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-010A-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-010A-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 32 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
// Phase 1: matrix 263 rows 313 cols
[2023-03-22 01:24:17] [INFO ] Computed 111 place invariants in 12 ms
[2023-03-22 01:24:18] [INFO ] Implicit Places using invariants in 1223 ms returned []
[2023-03-22 01:24:18] [INFO ] Invariant cache hit.
[2023-03-22 01:24:19] [INFO ] Implicit Places using invariants and state equation in 992 ms returned []
Implicit Place search using SMT with State Equation took 2267 ms to find 0 implicit places.
[2023-03-22 01:24:19] [INFO ] Invariant cache hit.
[2023-03-22 01:24:20] [INFO ] Dead Transitions using invariants and state equation in 481 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2781 ms. Remains : 313/313 places, 263/263 transitions.
Support contains 35 out of 313 places after structural reductions.
[2023-03-22 01:24:20] [INFO ] Flatten gal took : 70 ms
[2023-03-22 01:24:20] [INFO ] Flatten gal took : 27 ms
[2023-03-22 01:24:20] [INFO ] Input system was already deterministic with 263 transitions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 20) seen :19
Finished Best-First random walk after 999 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=249 )
FORMULA ShieldPPPs-PT-010A-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 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((G(F(p0))||(X(p1)&&G(p2)))))'
Support contains 5 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 23 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2023-03-22 01:24:21] [INFO ] Invariant cache hit.
[2023-03-22 01:24:21] [INFO ] Implicit Places using invariants in 427 ms returned []
[2023-03-22 01:24:21] [INFO ] Invariant cache hit.
[2023-03-22 01:24:22] [INFO ] Implicit Places using invariants and state equation in 608 ms returned []
Implicit Place search using SMT with State Equation took 1038 ms to find 0 implicit places.
[2023-03-22 01:24:22] [INFO ] Invariant cache hit.
[2023-03-22 01:24:22] [INFO ] Dead Transitions using invariants and state equation in 516 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1580 ms. Remains : 313/313 places, 263/263 transitions.
Stuttering acceptance computed with spot in 681 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (NOT p0), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=p2, acceptance={} source=1 dest: 4}, { cond=p2, acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(NOT p2), acceptance={} source=5 dest: 3}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s13 0) (EQ s32 0) (EQ s177 0)), p2:(OR (EQ s127 0) (EQ s154 0)), p1:(OR (EQ s13 0) (EQ s32 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 276 reset in 625 ms.
Product exploration explored 100000 steps with 246 reset in 634 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X p2), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X p2))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 811 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 01:24:25] [INFO ] Invariant cache hit.
[2023-03-22 01:24:26] [INFO ] [Real]Absence check using 111 positive place invariants in 85 ms returned sat
[2023-03-22 01:24:26] [INFO ] After 542ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 01:24:26] [INFO ] [Nat]Absence check using 111 positive place invariants in 23 ms returned sat
[2023-03-22 01:24:27] [INFO ] After 257ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 01:24:27] [INFO ] After 353ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 86 ms.
[2023-03-22 01:24:27] [INFO ] After 676ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 257 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=128 )
Parikh walk visited 2 properties in 10 ms.
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X p2), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X p2))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2)), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 9 factoid took 683 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 282 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 7 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2023-03-22 01:24:28] [INFO ] Invariant cache hit.
[2023-03-22 01:24:28] [INFO ] Implicit Places using invariants in 431 ms returned []
[2023-03-22 01:24:28] [INFO ] Invariant cache hit.
[2023-03-22 01:24:29] [INFO ] Implicit Places using invariants and state equation in 519 ms returned []
Implicit Place search using SMT with State Equation took 953 ms to find 0 implicit places.
[2023-03-22 01:24:29] [INFO ] Invariant cache hit.
[2023-03-22 01:24:29] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1138 ms. Remains : 313/313 places, 263/263 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X p2), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 466 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 310 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Finished random walk after 2644 steps, including 3 resets, run visited all 3 properties in 72 ms. (steps per millisecond=36 )
Knowledge obtained : [(AND p0 p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X p2), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X p2))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2)), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 7 factoid took 623 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 232 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 141 reset in 593 ms.
Product exploration explored 100000 steps with 141 reset in 496 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 313 transition count 263
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 2 rules in 61 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2023-03-22 01:24:33] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 263 rows 313 cols
[2023-03-22 01:24:33] [INFO ] Computed 111 place invariants in 3 ms
[2023-03-22 01:24:33] [INFO ] Dead Transitions using invariants and state equation in 274 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 313/313 places, 263/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 385 ms. Remains : 313/313 places, 263/263 transitions.
Support contains 5 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 8 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
// Phase 1: matrix 263 rows 313 cols
[2023-03-22 01:24:33] [INFO ] Computed 111 place invariants in 2 ms
[2023-03-22 01:24:33] [INFO ] Implicit Places using invariants in 221 ms returned []
[2023-03-22 01:24:33] [INFO ] Invariant cache hit.
[2023-03-22 01:24:34] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
[2023-03-22 01:24:34] [INFO ] Invariant cache hit.
[2023-03-22 01:24:34] [INFO ] Dead Transitions using invariants and state equation in 252 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 760 ms. Remains : 313/313 places, 263/263 transitions.
Treatment of property ShieldPPPs-PT-010A-LTLFireability-00 finished in 13393 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 311 transition count 261
Applied a total of 4 rules in 16 ms. Remains 311 /313 variables (removed 2) and now considering 261/263 (removed 2) transitions.
// Phase 1: matrix 261 rows 311 cols
[2023-03-22 01:24:34] [INFO ] Computed 111 place invariants in 1 ms
[2023-03-22 01:24:34] [INFO ] Implicit Places using invariants in 168 ms returned []
[2023-03-22 01:24:34] [INFO ] Invariant cache hit.
[2023-03-22 01:24:34] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
[2023-03-22 01:24:34] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 01:24:34] [INFO ] Invariant cache hit.
[2023-03-22 01:24:35] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 311/313 places, 261/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 667 ms. Remains : 311/313 places, 261/263 transitions.
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLFireability-03 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 s263 1) (EQ s303 1)), p1:(OR (NEQ s43 1) (NEQ s45 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 194 reset in 406 ms.
Product exploration explored 100000 steps with 191 reset in 453 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 p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 400 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 165 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1027 steps, including 1 resets, run visited all 2 properties in 39 ms. (steps per millisecond=26 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 296 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 129 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 13 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2023-03-22 01:24:37] [INFO ] Invariant cache hit.
[2023-03-22 01:24:37] [INFO ] Implicit Places using invariants in 445 ms returned []
[2023-03-22 01:24:37] [INFO ] Invariant cache hit.
[2023-03-22 01:24:38] [INFO ] Implicit Places using invariants and state equation in 538 ms returned []
Implicit Place search using SMT with State Equation took 1006 ms to find 0 implicit places.
[2023-03-22 01:24:38] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-22 01:24:38] [INFO ] Invariant cache hit.
[2023-03-22 01:24:38] [INFO ] Dead Transitions using invariants and state equation in 272 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1313 ms. Remains : 311/311 places, 261/261 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) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 237 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 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1039 steps, including 1 resets, run visited all 2 properties in 27 ms. (steps per millisecond=38 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 272 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 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 189 reset in 453 ms.
Product exploration explored 100000 steps with 192 reset in 420 ms.
Support contains 4 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 13 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2023-03-22 01:24:40] [INFO ] Invariant cache hit.
[2023-03-22 01:24:40] [INFO ] Implicit Places using invariants in 276 ms returned []
[2023-03-22 01:24:40] [INFO ] Invariant cache hit.
[2023-03-22 01:24:41] [INFO ] Implicit Places using invariants and state equation in 492 ms returned []
Implicit Place search using SMT with State Equation took 791 ms to find 0 implicit places.
[2023-03-22 01:24:41] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 01:24:41] [INFO ] Invariant cache hit.
[2023-03-22 01:24:41] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1021 ms. Remains : 311/311 places, 261/261 transitions.
Treatment of property ShieldPPPs-PT-010A-LTLFireability-03 finished in 7084 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)) U (p2 U p3)))))'
Support contains 6 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 311 transition count 261
Applied a total of 4 rules in 18 ms. Remains 311 /313 variables (removed 2) and now considering 261/263 (removed 2) transitions.
[2023-03-22 01:24:41] [INFO ] Invariant cache hit.
[2023-03-22 01:24:41] [INFO ] Implicit Places using invariants in 274 ms returned []
[2023-03-22 01:24:41] [INFO ] Invariant cache hit.
[2023-03-22 01:24:42] [INFO ] Implicit Places using invariants and state equation in 591 ms returned []
Implicit Place search using SMT with State Equation took 870 ms to find 0 implicit places.
[2023-03-22 01:24:42] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 01:24:42] [INFO ] Invariant cache hit.
[2023-03-22 01:24:42] [INFO ] Dead Transitions using invariants and state equation in 299 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 311/313 places, 261/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1195 ms. Remains : 311/313 places, 261/263 transitions.
Stuttering acceptance computed with spot in 401 ms :[(NOT p3), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND p3 (NOT p1)) (AND p2 (NOT p1)) (AND p0 (NOT p1))), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p3), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2) p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p3) p2 p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(EQ s214 1), p2:(AND (EQ s265 1) (EQ s267 1)), p0:(EQ s62 1), p1:(AND (EQ s221 1) (EQ s242 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 2200 reset in 335 ms.
Product exploration explored 100000 steps with 2199 reset in 400 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 p3) (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p3) p2 p0 (NOT p1)))), (X (NOT (AND (NOT p3) p2 (NOT p0) (NOT p1)))), (X (NOT p3)), (X (NOT (OR (AND p3 (NOT p1)) (AND p2 (NOT p1)) (AND p0 (NOT p1))))), (X (NOT (AND (NOT p3) p0 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2) p0 (NOT p1)))), (X (X (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p3) p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 (NOT p0) (NOT p1))))), (X (X (NOT p3))), (X (X (NOT (OR (AND p3 (NOT p1)) (AND p2 (NOT p1)) (AND p0 (NOT p1)))))), (X (X (NOT (AND (NOT p3) p0 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 1080 ms. Reduced automaton from 5 states, 19 edges and 4 AP (stutter insensitive) to 5 states, 19 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 400 ms :[(NOT p3), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Finished random walk after 5488 steps, including 7 resets, run visited all 7 properties in 56 ms. (steps per millisecond=98 )
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p3) p2 p0 (NOT p1)))), (X (NOT (AND (NOT p3) p2 (NOT p0) (NOT p1)))), (X (NOT p3)), (X (NOT (OR (AND p3 (NOT p1)) (AND p2 (NOT p1)) (AND p0 (NOT p1))))), (X (NOT (AND (NOT p3) p0 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2) p0 (NOT p1)))), (X (X (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p3) p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 (NOT p0) (NOT p1))))), (X (X (NOT p3))), (X (X (NOT (OR (AND p3 (NOT p1)) (AND p2 (NOT p1)) (AND p0 (NOT p1)))))), (X (X (NOT (AND (NOT p3) p0 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p1) p0 (NOT p3))), (F (OR (AND (NOT p1) p2) (AND (NOT p1) p0) (AND (NOT p1) p3))), (F (AND (NOT p1) p2 p0 (NOT p3))), (F (AND (NOT p1) (NOT p2) p0 (NOT p3))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (F (AND (NOT p1) p2 (NOT p0) (NOT p3))), (F p3)]
Knowledge based reduction with 15 factoid took 1432 ms. Reduced automaton from 5 states, 19 edges and 4 AP (stutter insensitive) to 5 states, 19 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 409 ms :[(NOT p3), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 404 ms :[(NOT p3), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
[2023-03-22 01:24:47] [INFO ] Invariant cache hit.
[2023-03-22 01:24:47] [INFO ] [Real]Absence check using 111 positive place invariants in 28 ms returned sat
[2023-03-22 01:24:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:24:48] [INFO ] [Real]Absence check using state equation in 435 ms returned sat
[2023-03-22 01:24:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:24:48] [INFO ] [Nat]Absence check using 111 positive place invariants in 24 ms returned sat
[2023-03-22 01:24:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:24:48] [INFO ] [Nat]Absence check using state equation in 253 ms returned sat
[2023-03-22 01:24:48] [INFO ] Computed and/alt/rep : 260/727/260 causal constraints (skipped 0 transitions) in 13 ms.
[2023-03-22 01:24:51] [INFO ] Added : 244 causal constraints over 50 iterations in 2656 ms. Result :sat
Could not prove EG (NOT p3)
Support contains 6 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 8 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2023-03-22 01:24:51] [INFO ] Invariant cache hit.
[2023-03-22 01:24:51] [INFO ] Implicit Places using invariants in 300 ms returned []
[2023-03-22 01:24:51] [INFO ] Invariant cache hit.
[2023-03-22 01:24:52] [INFO ] Implicit Places using invariants and state equation in 531 ms returned []
Implicit Place search using SMT with State Equation took 861 ms to find 0 implicit places.
[2023-03-22 01:24:52] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 01:24:52] [INFO ] Invariant cache hit.
[2023-03-22 01:24:52] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1071 ms. Remains : 311/311 places, 261/261 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 p1) (NOT p2) (NOT p0) (NOT p3)), (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (NOT (AND (NOT p1) p2 p0 (NOT p3)))), (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) p0) (AND (NOT p1) p3)))), (X (NOT p3)), (X (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 p0 (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) p0) (AND (NOT p1) p3))))), (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 964 ms. Reduced automaton from 5 states, 19 edges and 4 AP (stutter insensitive) to 5 states, 19 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 297 ms :[(NOT p3), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Finished random walk after 2553 steps, including 3 resets, run visited all 7 properties in 23 ms. (steps per millisecond=111 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (NOT (AND (NOT p1) p2 p0 (NOT p3)))), (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) p0) (AND (NOT p1) p3)))), (X (NOT p3)), (X (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 p0 (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) p0) (AND (NOT p1) p3))))), (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3)))))]
False Knowledge obtained : [(F (AND (NOT p1) p0 (NOT p3))), (F (OR (AND (NOT p1) p2) (AND (NOT p1) p0) (AND (NOT p1) p3))), (F (AND (NOT p1) p2 p0 (NOT p3))), (F (AND (NOT p1) (NOT p2) p0 (NOT p3))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (F (AND (NOT p1) p2 (NOT p0) (NOT p3))), (F p3)]
Knowledge based reduction with 15 factoid took 1248 ms. Reduced automaton from 5 states, 19 edges and 4 AP (stutter insensitive) to 5 states, 19 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 302 ms :[(NOT p3), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 339 ms :[(NOT p3), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
[2023-03-22 01:24:55] [INFO ] Invariant cache hit.
[2023-03-22 01:24:56] [INFO ] [Real]Absence check using 111 positive place invariants in 28 ms returned sat
[2023-03-22 01:24:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:24:56] [INFO ] [Real]Absence check using state equation in 405 ms returned sat
[2023-03-22 01:24:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:24:56] [INFO ] [Nat]Absence check using 111 positive place invariants in 26 ms returned sat
[2023-03-22 01:24:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:24:57] [INFO ] [Nat]Absence check using state equation in 208 ms returned sat
[2023-03-22 01:24:57] [INFO ] Computed and/alt/rep : 260/727/260 causal constraints (skipped 0 transitions) in 27 ms.
[2023-03-22 01:24:59] [INFO ] Added : 244 causal constraints over 50 iterations in 2837 ms. Result :sat
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 339 ms :[(NOT p3), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 2220 reset in 355 ms.
Product exploration explored 100000 steps with 2202 reset in 482 ms.
Support contains 6 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 7 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2023-03-22 01:25:01] [INFO ] Invariant cache hit.
[2023-03-22 01:25:01] [INFO ] Implicit Places using invariants in 300 ms returned []
[2023-03-22 01:25:01] [INFO ] Invariant cache hit.
[2023-03-22 01:25:01] [INFO ] Implicit Places using invariants and state equation in 497 ms returned []
Implicit Place search using SMT with State Equation took 834 ms to find 0 implicit places.
[2023-03-22 01:25:01] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 01:25:01] [INFO ] Invariant cache hit.
[2023-03-22 01:25:02] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1091 ms. Remains : 311/311 places, 261/261 transitions.
Treatment of property ShieldPPPs-PT-010A-LTLFireability-04 finished in 20723 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||G((p0||X(G(p1)))))))'
Support contains 2 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 3 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
// Phase 1: matrix 263 rows 313 cols
[2023-03-22 01:25:02] [INFO ] Computed 111 place invariants in 2 ms
[2023-03-22 01:25:02] [INFO ] Implicit Places using invariants in 213 ms returned []
[2023-03-22 01:25:02] [INFO ] Invariant cache hit.
[2023-03-22 01:25:03] [INFO ] Implicit Places using invariants and state equation in 984 ms returned []
Implicit Place search using SMT with State Equation took 1207 ms to find 0 implicit places.
[2023-03-22 01:25:03] [INFO ] Invariant cache hit.
[2023-03-22 01:25:03] [INFO ] Dead Transitions using invariants and state equation in 363 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1578 ms. Remains : 313/313 places, 263/263 transitions.
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(EQ s146 1), p1:(EQ s306 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 661 steps with 0 reset in 4 ms.
FORMULA ShieldPPPs-PT-010A-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010A-LTLFireability-05 finished in 1836 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 2 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 311 transition count 261
Applied a total of 4 rules in 11 ms. Remains 311 /313 variables (removed 2) and now considering 261/263 (removed 2) transitions.
// Phase 1: matrix 261 rows 311 cols
[2023-03-22 01:25:04] [INFO ] Computed 111 place invariants in 1 ms
[2023-03-22 01:25:04] [INFO ] Implicit Places using invariants in 235 ms returned []
[2023-03-22 01:25:04] [INFO ] Invariant cache hit.
[2023-03-22 01:25:05] [INFO ] Implicit Places using invariants and state equation in 958 ms returned []
Implicit Place search using SMT with State Equation took 1205 ms to find 0 implicit places.
[2023-03-22 01:25:05] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 01:25:05] [INFO ] Invariant cache hit.
[2023-03-22 01:25:05] [INFO ] Dead Transitions using invariants and state equation in 303 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 311/313 places, 261/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1537 ms. Remains : 311/313 places, 261/263 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s202 0) (EQ s219 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 142 reset in 436 ms.
Product exploration explored 100000 steps with 142 reset in 433 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 176 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0)]
Finished random walk after 42 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=21 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 206 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 6 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2023-03-22 01:25:07] [INFO ] Invariant cache hit.
[2023-03-22 01:25:07] [INFO ] Implicit Places using invariants in 223 ms returned []
[2023-03-22 01:25:07] [INFO ] Invariant cache hit.
[2023-03-22 01:25:07] [INFO ] Implicit Places using invariants and state equation in 523 ms returned []
Implicit Place search using SMT with State Equation took 772 ms to find 0 implicit places.
[2023-03-22 01:25:07] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 01:25:07] [INFO ] Invariant cache hit.
[2023-03-22 01:25:08] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1005 ms. Remains : 311/311 places, 261/261 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Finished random walk after 57 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=57 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 156 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Product exploration explored 100000 steps with 141 reset in 368 ms.
Product exploration explored 100000 steps with 141 reset in 429 ms.
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 6 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2023-03-22 01:25:09] [INFO ] Invariant cache hit.
[2023-03-22 01:25:09] [INFO ] Implicit Places using invariants in 414 ms returned []
[2023-03-22 01:25:09] [INFO ] Invariant cache hit.
[2023-03-22 01:25:10] [INFO ] Implicit Places using invariants and state equation in 675 ms returned []
Implicit Place search using SMT with State Equation took 1117 ms to find 0 implicit places.
[2023-03-22 01:25:10] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 01:25:10] [INFO ] Invariant cache hit.
[2023-03-22 01:25:10] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1309 ms. Remains : 311/311 places, 261/261 transitions.
Treatment of property ShieldPPPs-PT-010A-LTLFireability-06 finished in 6731 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!(!p0 U X((((X(p0)&&G(p0)) U p1)&&X(p1)))))'
Support contains 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 2 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
// Phase 1: matrix 263 rows 313 cols
[2023-03-22 01:25:10] [INFO ] Computed 111 place invariants in 2 ms
[2023-03-22 01:25:11] [INFO ] Implicit Places using invariants in 340 ms returned []
[2023-03-22 01:25:11] [INFO ] Invariant cache hit.
[2023-03-22 01:25:11] [INFO ] Implicit Places using invariants and state equation in 680 ms returned []
Implicit Place search using SMT with State Equation took 1046 ms to find 0 implicit places.
[2023-03-22 01:25:11] [INFO ] Invariant cache hit.
[2023-03-22 01:25:12] [INFO ] Dead Transitions using invariants and state equation in 234 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1297 ms. Remains : 313/313 places, 263/263 transitions.
Stuttering acceptance computed with spot in 258 ms :[p1, p1, p1, (AND p0 p1), true, p0]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s51 1) (EQ s72 1)), p1:(AND (EQ s228 1) (EQ s240 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33192 reset in 387 ms.
Product exploration explored 100000 steps with 33293 reset in 395 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 p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 675 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 344 ms :[p1, p1, p1, (AND p0 p1), true, p0]
Finished random walk after 2869 steps, including 3 resets, run visited all 4 properties in 48 ms. (steps per millisecond=59 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND p0 p1)), (F p0), (F (AND p0 (NOT p1))), (F p1)]
Knowledge based reduction with 9 factoid took 679 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 264 ms :[p1, p1, p1, (AND p0 p1), true, p0]
Stuttering acceptance computed with spot in 356 ms :[p1, p1, p1, (AND p0 p1), true, p0]
Support contains 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 3 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2023-03-22 01:25:15] [INFO ] Invariant cache hit.
[2023-03-22 01:25:15] [INFO ] Implicit Places using invariants in 236 ms returned []
[2023-03-22 01:25:15] [INFO ] Invariant cache hit.
[2023-03-22 01:25:17] [INFO ] Implicit Places using invariants and state equation in 1228 ms returned []
Implicit Place search using SMT with State Equation took 1494 ms to find 0 implicit places.
[2023-03-22 01:25:17] [INFO ] Invariant cache hit.
[2023-03-22 01:25:17] [INFO ] Dead Transitions using invariants and state equation in 240 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1737 ms. Remains : 313/313 places, 263/263 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 (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 452 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 376 ms :[p1, p1, p1, (AND p0 p1), true, p0]
Finished random walk after 298 steps, including 0 resets, run visited all 4 properties in 18 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND p0 p1)), (F p0), (F (AND p0 (NOT p1))), (F p1)]
Knowledge based reduction with 9 factoid took 614 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 289 ms :[p1, p1, p1, (AND p0 p1), true, p0]
Stuttering acceptance computed with spot in 271 ms :[p1, p1, p1, (AND p0 p1), true, p0]
Stuttering acceptance computed with spot in 277 ms :[p1, p1, p1, (AND p0 p1), true, p0]
Product exploration explored 100000 steps with 33399 reset in 342 ms.
Product exploration explored 100000 steps with 33480 reset in 390 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 392 ms :[p1, p1, p1, (AND p0 p1), true, p0]
Support contains 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 313 transition count 263
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 23 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2023-03-22 01:25:20] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 263 rows 313 cols
[2023-03-22 01:25:20] [INFO ] Computed 111 place invariants in 2 ms
[2023-03-22 01:25:21] [INFO ] Dead Transitions using invariants and state equation in 290 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 313/313 places, 263/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 357 ms. Remains : 313/313 places, 263/263 transitions.
Support contains 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 3 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
// Phase 1: matrix 263 rows 313 cols
[2023-03-22 01:25:21] [INFO ] Computed 111 place invariants in 1 ms
[2023-03-22 01:25:21] [INFO ] Implicit Places using invariants in 272 ms returned []
[2023-03-22 01:25:21] [INFO ] Invariant cache hit.
[2023-03-22 01:25:28] [INFO ] Implicit Places using invariants and state equation in 6565 ms returned []
Implicit Place search using SMT with State Equation took 6862 ms to find 0 implicit places.
[2023-03-22 01:25:28] [INFO ] Invariant cache hit.
[2023-03-22 01:25:28] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7085 ms. Remains : 313/313 places, 263/263 transitions.
Treatment of property ShieldPPPs-PT-010A-LTLFireability-07 finished in 17600 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)&&F(p1)))'
Support contains 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 2 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2023-03-22 01:25:28] [INFO ] Invariant cache hit.
[2023-03-22 01:25:29] [INFO ] Implicit Places using invariants in 1511 ms returned []
[2023-03-22 01:25:29] [INFO ] Invariant cache hit.
[2023-03-22 01:25:30] [INFO ] Implicit Places using invariants and state equation in 901 ms returned []
Implicit Place search using SMT with State Equation took 2416 ms to find 0 implicit places.
[2023-03-22 01:25:30] [INFO ] Invariant cache hit.
[2023-03-22 01:25:31] [INFO ] Dead Transitions using invariants and state equation in 272 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2703 ms. Remains : 313/313 places, 263/263 transitions.
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s67 1) (EQ s86 1)), p0:(OR (AND (EQ s49 1) (EQ s60 1)) (EQ s67 0) (EQ s86 0))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 698 reset in 342 ms.
Product exploration explored 100000 steps with 702 reset in 403 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) p0), (X p0), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 424 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (NOT p1)]
Finished random walk after 225 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=112 )
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 5 factoid took 372 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p1)]
[2023-03-22 01:25:33] [INFO ] Invariant cache hit.
[2023-03-22 01:25:33] [INFO ] [Real]Absence check using 111 positive place invariants in 31 ms returned sat
[2023-03-22 01:25:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:25:34] [INFO ] [Real]Absence check using state equation in 505 ms returned sat
[2023-03-22 01:25:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:25:35] [INFO ] [Nat]Absence check using 111 positive place invariants in 33 ms returned sat
[2023-03-22 01:25:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:25:35] [INFO ] [Nat]Absence check using state equation in 342 ms returned sat
[2023-03-22 01:25:35] [INFO ] Computed and/alt/rep : 262/723/262 causal constraints (skipped 0 transitions) in 50 ms.
[2023-03-22 01:25:39] [INFO ] Added : 262 causal constraints over 54 iterations in 3904 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 313 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 : 313/313 places, 263/263 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 311 transition count 261
Applied a total of 4 rules in 23 ms. Remains 311 /313 variables (removed 2) and now considering 261/263 (removed 2) transitions.
// Phase 1: matrix 261 rows 311 cols
[2023-03-22 01:25:39] [INFO ] Computed 111 place invariants in 7 ms
[2023-03-22 01:25:39] [INFO ] Implicit Places using invariants in 213 ms returned []
[2023-03-22 01:25:39] [INFO ] Invariant cache hit.
[2023-03-22 01:25:40] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
[2023-03-22 01:25:40] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 01:25:40] [INFO ] Invariant cache hit.
[2023-03-22 01:25:40] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 311/313 places, 261/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 761 ms. Remains : 311/313 places, 261/263 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 : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p1)]
Finished random walk after 287 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=71 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p1)]
[2023-03-22 01:25:40] [INFO ] Invariant cache hit.
[2023-03-22 01:25:41] [INFO ] [Real]Absence check using 111 positive place invariants in 41 ms returned sat
[2023-03-22 01:25:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:25:42] [INFO ] [Real]Absence check using state equation in 1063 ms returned sat
[2023-03-22 01:25:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:25:43] [INFO ] [Nat]Absence check using 111 positive place invariants in 48 ms returned sat
[2023-03-22 01:25:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:25:44] [INFO ] [Nat]Absence check using state equation in 1232 ms returned sat
[2023-03-22 01:25:44] [INFO ] Computed and/alt/rep : 260/727/260 causal constraints (skipped 0 transitions) in 32 ms.
[2023-03-22 01:25:52] [INFO ] Added : 255 causal constraints over 51 iterations in 8452 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 49 ms :[(NOT p1)]
Product exploration explored 100000 steps with 357 reset in 345 ms.
Product exploration explored 100000 steps with 357 reset in 374 ms.
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 261/261 transitions.
Applied a total of 0 rules in 7 ms. Remains 311 /311 variables (removed 0) and now considering 261/261 (removed 0) transitions.
[2023-03-22 01:25:53] [INFO ] Invariant cache hit.
[2023-03-22 01:25:53] [INFO ] Implicit Places using invariants in 210 ms returned []
[2023-03-22 01:25:53] [INFO ] Invariant cache hit.
[2023-03-22 01:25:54] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
[2023-03-22 01:25:54] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 01:25:54] [INFO ] Invariant cache hit.
[2023-03-22 01:25:54] [INFO ] Dead Transitions using invariants and state equation in 323 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1007 ms. Remains : 311/311 places, 261/261 transitions.
Treatment of property ShieldPPPs-PT-010A-LTLFireability-12 finished in 26095 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 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 2 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
// Phase 1: matrix 263 rows 313 cols
[2023-03-22 01:25:54] [INFO ] Computed 111 place invariants in 1 ms
[2023-03-22 01:25:54] [INFO ] Implicit Places using invariants in 222 ms returned []
[2023-03-22 01:25:54] [INFO ] Invariant cache hit.
[2023-03-22 01:25:55] [INFO ] Implicit Places using invariants and state equation in 767 ms returned []
Implicit Place search using SMT with State Equation took 989 ms to find 0 implicit places.
[2023-03-22 01:25:55] [INFO ] Invariant cache hit.
[2023-03-22 01:25:55] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1181 ms. Remains : 313/313 places, 263/263 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLFireability-13 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 s295 1) (EQ s312 1) (EQ s171 1) (EQ s186 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 791 steps with 0 reset in 3 ms.
FORMULA ShieldPPPs-PT-010A-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010A-LTLFireability-13 finished in 1366 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 2 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 311 transition count 261
Applied a total of 4 rules in 13 ms. Remains 311 /313 variables (removed 2) and now considering 261/263 (removed 2) transitions.
// Phase 1: matrix 261 rows 311 cols
[2023-03-22 01:25:55] [INFO ] Computed 111 place invariants in 2 ms
[2023-03-22 01:25:56] [INFO ] Implicit Places using invariants in 277 ms returned []
[2023-03-22 01:25:56] [INFO ] Invariant cache hit.
[2023-03-22 01:25:56] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 610 ms to find 0 implicit places.
[2023-03-22 01:25:56] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 01:25:56] [INFO ] Invariant cache hit.
[2023-03-22 01:25:56] [INFO ] Dead Transitions using invariants and state equation in 203 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 311/313 places, 261/263 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 832 ms. Remains : 311/313 places, 261/263 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s13 1) (EQ s33 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 708 steps with 0 reset in 7 ms.
FORMULA ShieldPPPs-PT-010A-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-010A-LTLFireability-14 finished in 910 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)))'
Support contains 1 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 263/263 transitions.
Applied a total of 0 rules in 6 ms. Remains 313 /313 variables (removed 0) and now considering 263/263 (removed 0) transitions.
// Phase 1: matrix 263 rows 313 cols
[2023-03-22 01:25:56] [INFO ] Computed 111 place invariants in 15 ms
[2023-03-22 01:25:58] [INFO ] Implicit Places using invariants in 1259 ms returned []
[2023-03-22 01:25:58] [INFO ] Invariant cache hit.
[2023-03-22 01:25:58] [INFO ] Implicit Places using invariants and state equation in 518 ms returned []
Implicit Place search using SMT with State Equation took 1783 ms to find 0 implicit places.
[2023-03-22 01:25:58] [INFO ] Invariant cache hit.
[2023-03-22 01:25:58] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1953 ms. Remains : 313/313 places, 263/263 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-010A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s28 0)], 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 449 ms.
Product exploration explored 100000 steps with 50000 reset in 434 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 : [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 70 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-010A-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-010A-LTLFireability-15 finished in 3022 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(F(p0))||(X(p1)&&G(p2)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(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' '!(F(G(((p0||F(p1)) U (p2 U p3)))))'
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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!(!p0 U X((((X(p0)&&G(p0)) U p1)&&X(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(p0)&&F(p1)))'
[2023-03-22 01:26:00] [INFO ] Flatten gal took : 18 ms
[2023-03-22 01:26:00] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/LTLFireability.sr.xml took 22 ms.
[2023-03-22 01:26:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 313 places, 263 transitions and 1006 arcs took 28 ms.
Total runtime 103645 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2188/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2188/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2188/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2188/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2188/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2188/ltl_5_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldPPPs-PT-010A-LTLFireability-00
Could not compute solution for formula : ShieldPPPs-PT-010A-LTLFireability-03
Could not compute solution for formula : ShieldPPPs-PT-010A-LTLFireability-04
Could not compute solution for formula : ShieldPPPs-PT-010A-LTLFireability-06
Could not compute solution for formula : ShieldPPPs-PT-010A-LTLFireability-07
Could not compute solution for formula : ShieldPPPs-PT-010A-LTLFireability-12

BK_STOP 1679448361883

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name ShieldPPPs-PT-010A-LTLFireability-00
ltl formula formula --ltl=/tmp/2188/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 313 places, 263 transitions and 1006 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.060 real 0.010 user 0.030 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2188/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2188/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2188/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2188/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

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

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name ShieldPPPs-PT-010A-LTLFireability-06
ltl formula formula --ltl=/tmp/2188/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: =============================================================================
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): 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 313 places, 263 transitions and 1006 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.080 real 0.000 user 0.050 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2188/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2188/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2188/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2188/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name ShieldPPPs-PT-010A-LTLFireability-07
ltl formula formula --ltl=/tmp/2188/ltl_4_
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 313 places, 263 transitions and 1006 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.060 real 0.030 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2188/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2188/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2188/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2188/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 11 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
ltl formula name ShieldPPPs-PT-010A-LTLFireability-12
ltl formula formula --ltl=/tmp/2188/ltl_5_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 313 places, 263 transitions and 1006 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.000 user 0.040 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2188/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2188/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2188/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2188/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldPPPs-PT-010A, 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-167903717000436"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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