fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r393-oct2-167903716800291
Last Updated
May 14, 2023

About the Execution of LTSMin+red for ShieldIIPt-PT-030A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
894.876 95028.00 157992.00 75.10 TTFTFFFTT?F?FFT? normal

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-167903716800291.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 ShieldIIPt-PT-030A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903716800291
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 7.5K Feb 25 17:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 25 17:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 17:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 17:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Feb 25 18:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 18:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 25 17:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 17:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 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 159K 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 ShieldIIPt-PT-030A-LTLCardinality-00
FORMULA_NAME ShieldIIPt-PT-030A-LTLCardinality-01
FORMULA_NAME ShieldIIPt-PT-030A-LTLCardinality-02
FORMULA_NAME ShieldIIPt-PT-030A-LTLCardinality-03
FORMULA_NAME ShieldIIPt-PT-030A-LTLCardinality-04
FORMULA_NAME ShieldIIPt-PT-030A-LTLCardinality-05
FORMULA_NAME ShieldIIPt-PT-030A-LTLCardinality-06
FORMULA_NAME ShieldIIPt-PT-030A-LTLCardinality-07
FORMULA_NAME ShieldIIPt-PT-030A-LTLCardinality-08
FORMULA_NAME ShieldIIPt-PT-030A-LTLCardinality-09
FORMULA_NAME ShieldIIPt-PT-030A-LTLCardinality-10
FORMULA_NAME ShieldIIPt-PT-030A-LTLCardinality-11
FORMULA_NAME ShieldIIPt-PT-030A-LTLCardinality-12
FORMULA_NAME ShieldIIPt-PT-030A-LTLCardinality-13
FORMULA_NAME ShieldIIPt-PT-030A-LTLCardinality-14
FORMULA_NAME ShieldIIPt-PT-030A-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679436798284

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-030A
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 22:13:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 22:13:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 22:13:21] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2023-03-21 22:13:21] [INFO ] Transformed 573 places.
[2023-03-21 22:13:21] [INFO ] Transformed 423 transitions.
[2023-03-21 22:13:21] [INFO ] Found NUPN structural information;
[2023-03-21 22:13:21] [INFO ] Parsed PT model containing 573 places and 423 transitions and 1806 arcs in 175 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldIIPt-PT-030A-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030A-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030A-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030A-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030A-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030A-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030A-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 573 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 573/573 places, 422/422 transitions.
Applied a total of 0 rules in 84 ms. Remains 573 /573 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 573 cols
[2023-03-21 22:13:21] [INFO ] Computed 271 place invariants in 13 ms
[2023-03-21 22:13:22] [INFO ] Implicit Places using invariants in 903 ms returned []
[2023-03-21 22:13:22] [INFO ] Invariant cache hit.
[2023-03-21 22:13:23] [INFO ] Implicit Places using invariants and state equation in 979 ms returned []
Implicit Place search using SMT with State Equation took 1955 ms to find 0 implicit places.
[2023-03-21 22:13:23] [INFO ] Invariant cache hit.
[2023-03-21 22:13:24] [INFO ] Dead Transitions using invariants and state equation in 746 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2788 ms. Remains : 573/573 places, 422/422 transitions.
Support contains 26 out of 573 places after structural reductions.
[2023-03-21 22:13:24] [INFO ] Flatten gal took : 128 ms
[2023-03-21 22:13:24] [INFO ] Flatten gal took : 45 ms
[2023-03-21 22:13:24] [INFO ] Input system was already deterministic with 422 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 601 ms. (steps per millisecond=16 ) properties (out of 14) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-21 22:13:26] [INFO ] Invariant cache hit.
[2023-03-21 22:13:26] [INFO ] [Real]Absence check using 271 positive place invariants in 142 ms returned sat
[2023-03-21 22:13:27] [INFO ] After 1196ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-21 22:13:27] [INFO ] [Nat]Absence check using 271 positive place invariants in 67 ms returned sat
[2023-03-21 22:13:28] [INFO ] After 709ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-21 22:13:29] [INFO ] After 1270ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 494 ms.
[2023-03-21 22:13:29] [INFO ] After 2345ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 538 ms.
Support contains 15 out of 573 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 573/573 places, 422/422 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 573 transition count 421
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 572 transition count 421
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 571 transition count 420
Partial Free-agglomeration rule applied 56 times.
Drop transitions removed 56 transitions
Iterating global reduction 0 with 56 rules applied. Total rules applied 60 place count 571 transition count 420
Applied a total of 60 rules in 70 ms. Remains 571 /573 variables (removed 2) and now considering 420/422 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 571/573 places, 420/422 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 294 ms. (steps per millisecond=34 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 8) seen :0
Finished probabilistic random walk after 8230 steps, run visited all 8 properties in 177 ms. (steps per millisecond=46 )
Probabilistic random walk after 8230 steps, saw 7955 distinct states, run finished after 178 ms. (steps per millisecond=46 ) properties seen :8
FORMULA ShieldIIPt-PT-030A-LTLCardinality-13 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' '!(F(p0))'
Support contains 1 out of 573 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 573/573 places, 422/422 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 573 transition count 421
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 572 transition count 421
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 571 transition count 420
Applied a total of 4 rules in 68 ms. Remains 571 /573 variables (removed 2) and now considering 420/422 (removed 2) transitions.
// Phase 1: matrix 420 rows 571 cols
[2023-03-21 22:13:31] [INFO ] Computed 271 place invariants in 3 ms
[2023-03-21 22:13:32] [INFO ] Implicit Places using invariants in 500 ms returned [563, 564]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 505 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 569/573 places, 420/422 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 569 transition count 419
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 568 transition count 419
Applied a total of 2 rules in 32 ms. Remains 568 /569 variables (removed 1) and now considering 419/420 (removed 1) transitions.
// Phase 1: matrix 419 rows 568 cols
[2023-03-21 22:13:32] [INFO ] Computed 269 place invariants in 4 ms
[2023-03-21 22:13:32] [INFO ] Implicit Places using invariants in 462 ms returned [557]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 475 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 567/573 places, 419/422 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 566 transition count 418
Applied a total of 2 rules in 23 ms. Remains 566 /567 variables (removed 1) and now considering 418/419 (removed 1) transitions.
// Phase 1: matrix 418 rows 566 cols
[2023-03-21 22:13:32] [INFO ] Computed 268 place invariants in 2 ms
[2023-03-21 22:13:33] [INFO ] Implicit Places using invariants in 397 ms returned []
[2023-03-21 22:13:33] [INFO ] Invariant cache hit.
[2023-03-21 22:13:34] [INFO ] Implicit Places using invariants and state equation in 708 ms returned []
Implicit Place search using SMT with State Equation took 1112 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 566/573 places, 418/422 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2219 ms. Remains : 566/573 places, 418/422 transitions.
Stuttering acceptance computed with spot in 266 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030A-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s268 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 1300 ms.
Product exploration explored 100000 steps with 50000 reset in 1217 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 : [(NOT 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 174 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-030A-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-030A-LTLCardinality-01 finished in 5272 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 573 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 573/573 places, 422/422 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 573 transition count 421
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 572 transition count 421
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 571 transition count 420
Applied a total of 4 rules in 23 ms. Remains 571 /573 variables (removed 2) and now considering 420/422 (removed 2) transitions.
// Phase 1: matrix 420 rows 571 cols
[2023-03-21 22:13:37] [INFO ] Computed 271 place invariants in 3 ms
[2023-03-21 22:13:37] [INFO ] Implicit Places using invariants in 426 ms returned [563, 564]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 431 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 569/573 places, 420/422 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 569 transition count 419
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 568 transition count 419
Applied a total of 2 rules in 31 ms. Remains 568 /569 variables (removed 1) and now considering 419/420 (removed 1) transitions.
// Phase 1: matrix 419 rows 568 cols
[2023-03-21 22:13:37] [INFO ] Computed 269 place invariants in 3 ms
[2023-03-21 22:13:37] [INFO ] Implicit Places using invariants in 447 ms returned [557]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 464 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 567/573 places, 419/422 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 566 transition count 418
Applied a total of 2 rules in 32 ms. Remains 566 /567 variables (removed 1) and now considering 418/419 (removed 1) transitions.
// Phase 1: matrix 418 rows 566 cols
[2023-03-21 22:13:38] [INFO ] Computed 268 place invariants in 3 ms
[2023-03-21 22:13:38] [INFO ] Implicit Places using invariants in 321 ms returned []
[2023-03-21 22:13:38] [INFO ] Invariant cache hit.
[2023-03-21 22:13:39] [INFO ] Implicit Places using invariants and state equation in 956 ms returned []
Implicit Place search using SMT with State Equation took 1280 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 566/573 places, 418/422 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2270 ms. Remains : 566/573 places, 418/422 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030A-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s364 0) (EQ s166 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 19 reset in 663 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 0 ms.
FORMULA ShieldIIPt-PT-030A-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-030A-LTLCardinality-02 finished in 3047 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((p1&&F(G(p2))))))'
Support contains 5 out of 573 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 573/573 places, 422/422 transitions.
Applied a total of 0 rules in 20 ms. Remains 573 /573 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 573 cols
[2023-03-21 22:13:40] [INFO ] Computed 271 place invariants in 1 ms
[2023-03-21 22:13:40] [INFO ] Implicit Places using invariants in 435 ms returned []
[2023-03-21 22:13:40] [INFO ] Invariant cache hit.
[2023-03-21 22:13:41] [INFO ] Implicit Places using invariants and state equation in 684 ms returned []
Implicit Place search using SMT with State Equation took 1138 ms to find 0 implicit places.
[2023-03-21 22:13:41] [INFO ] Invariant cache hit.
[2023-03-21 22:13:41] [INFO ] Dead Transitions using invariants and state equation in 263 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1434 ms. Remains : 573/573 places, 422/422 transitions.
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-030A-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s94 0) (EQ s125 1)), p1:(OR (EQ s383 0) (EQ s354 1)), p2:(EQ s194 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 561 ms.
Stack based approach found an accepted trace after 20 steps with 0 reset with depth 21 and stack size 21 in 1 ms.
FORMULA ShieldIIPt-PT-030A-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-030A-LTLCardinality-04 finished in 2225 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(p1)||G(p2))&&p0)))'
Support contains 7 out of 573 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 573/573 places, 422/422 transitions.
Applied a total of 0 rules in 5 ms. Remains 573 /573 variables (removed 0) and now considering 422/422 (removed 0) transitions.
[2023-03-21 22:13:42] [INFO ] Invariant cache hit.
[2023-03-21 22:13:45] [INFO ] Implicit Places using invariants in 2679 ms returned []
[2023-03-21 22:13:45] [INFO ] Invariant cache hit.
[2023-03-21 22:13:49] [INFO ] Implicit Places using invariants and state equation in 4345 ms returned []
Implicit Place search using SMT with State Equation took 7057 ms to find 0 implicit places.
[2023-03-21 22:13:49] [INFO ] Invariant cache hit.
[2023-03-21 22:13:50] [INFO ] Dead Transitions using invariants and state equation in 832 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7903 ms. Remains : 573/573 places, 422/422 transitions.
Stuttering acceptance computed with spot in 282 ms :[true, (NOT p1), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-030A-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(OR (EQ s72 0) (EQ s390 1)), p0:(AND (NEQ s266 0) (NEQ s246 1) (NEQ s198 0) (NEQ s317 1)), p2:(EQ s250 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-030A-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030A-LTLCardinality-06 finished in 8212 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 573 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 573/573 places, 422/422 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 573 transition count 421
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 572 transition count 421
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 571 transition count 420
Applied a total of 4 rules in 31 ms. Remains 571 /573 variables (removed 2) and now considering 420/422 (removed 2) transitions.
// Phase 1: matrix 420 rows 571 cols
[2023-03-21 22:13:50] [INFO ] Computed 271 place invariants in 4 ms
[2023-03-21 22:13:51] [INFO ] Implicit Places using invariants in 1047 ms returned [563, 564]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1049 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 569/573 places, 420/422 transitions.
Applied a total of 0 rules in 13 ms. Remains 569 /569 variables (removed 0) and now considering 420/420 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1106 ms. Remains : 569/573 places, 420/422 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030A-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s558 0) (EQ s97 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 566 ms.
Product exploration explored 100000 steps with 0 reset in 925 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 207 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Finished probabilistic random walk after 9359 steps, run visited all 1 properties in 68 ms. (steps per millisecond=137 )
Probabilistic random walk after 9359 steps, saw 9090 distinct states, run finished after 68 ms. (steps per millisecond=137 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 155 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 569 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 569/569 places, 420/420 transitions.
Applied a total of 0 rules in 10 ms. Remains 569 /569 variables (removed 0) and now considering 420/420 (removed 0) transitions.
// Phase 1: matrix 420 rows 569 cols
[2023-03-21 22:13:54] [INFO ] Computed 269 place invariants in 1 ms
[2023-03-21 22:13:54] [INFO ] Implicit Places using invariants in 562 ms returned []
[2023-03-21 22:13:54] [INFO ] Invariant cache hit.
[2023-03-21 22:13:59] [INFO ] Implicit Places using invariants and state equation in 5059 ms returned []
Implicit Place search using SMT with State Equation took 5666 ms to find 0 implicit places.
[2023-03-21 22:13:59] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-21 22:13:59] [INFO ] Invariant cache hit.
[2023-03-21 22:14:00] [INFO ] Dead Transitions using invariants and state equation in 322 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6055 ms. Remains : 569/569 places, 420/420 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 90 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Finished probabilistic random walk after 9359 steps, run visited all 1 properties in 63 ms. (steps per millisecond=148 )
Probabilistic random walk after 9359 steps, saw 9090 distinct states, run finished after 63 ms. (steps per millisecond=148 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 157 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 541 ms.
Product exploration explored 100000 steps with 0 reset in 703 ms.
Support contains 2 out of 569 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 569/569 places, 420/420 transitions.
Applied a total of 0 rules in 21 ms. Remains 569 /569 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2023-03-21 22:14:02] [INFO ] Invariant cache hit.
[2023-03-21 22:14:02] [INFO ] Implicit Places using invariants in 385 ms returned []
[2023-03-21 22:14:02] [INFO ] Invariant cache hit.
[2023-03-21 22:14:05] [INFO ] Implicit Places using invariants and state equation in 3132 ms returned []
Implicit Place search using SMT with State Equation took 3521 ms to find 0 implicit places.
[2023-03-21 22:14:05] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-21 22:14:05] [INFO ] Invariant cache hit.
[2023-03-21 22:14:06] [INFO ] Dead Transitions using invariants and state equation in 622 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4186 ms. Remains : 569/569 places, 420/420 transitions.
Treatment of property ShieldIIPt-PT-030A-LTLCardinality-09 finished in 16211 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U G(p1)))'
Support contains 3 out of 573 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 573/573 places, 422/422 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 572 transition count 420
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 570 transition count 420
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 568 transition count 419
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 6 place count 568 transition count 418
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 567 transition count 418
Applied a total of 8 rules in 21 ms. Remains 567 /573 variables (removed 6) and now considering 418/422 (removed 4) transitions.
// Phase 1: matrix 418 rows 567 cols
[2023-03-21 22:14:06] [INFO ] Computed 269 place invariants in 1 ms
[2023-03-21 22:14:07] [INFO ] Implicit Places using invariants in 448 ms returned [556]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 470 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 566/573 places, 418/422 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 565 transition count 417
Applied a total of 2 rules in 56 ms. Remains 565 /566 variables (removed 1) and now considering 417/418 (removed 1) transitions.
// Phase 1: matrix 417 rows 565 cols
[2023-03-21 22:14:07] [INFO ] Computed 268 place invariants in 2 ms
[2023-03-21 22:14:11] [INFO ] Implicit Places using invariants in 4359 ms returned []
[2023-03-21 22:14:11] [INFO ] Invariant cache hit.
[2023-03-21 22:14:12] [INFO ] Implicit Places using invariants and state equation in 512 ms returned []
Implicit Place search using SMT with State Equation took 4906 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 565/573 places, 417/422 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5453 ms. Remains : 565/573 places, 417/422 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : ShieldIIPt-PT-030A-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s167 0) (EQ s57 1)), p0:(EQ s25 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 512 ms.
Product exploration explored 100000 steps with 0 reset in 635 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 468 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 180 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 290 ms. (steps per millisecond=34 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Finished probabilistic random walk after 21528 steps, run visited all 4 properties in 302 ms. (steps per millisecond=71 )
Probabilistic random walk after 21528 steps, saw 20917 distinct states, run finished after 303 ms. (steps per millisecond=71 ) properties seen :4
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F p0), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 9 factoid took 565 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 185 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Support contains 3 out of 565 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 565/565 places, 417/417 transitions.
Applied a total of 0 rules in 8 ms. Remains 565 /565 variables (removed 0) and now considering 417/417 (removed 0) transitions.
[2023-03-21 22:14:16] [INFO ] Invariant cache hit.
[2023-03-21 22:14:16] [INFO ] Implicit Places using invariants in 436 ms returned []
[2023-03-21 22:14:16] [INFO ] Invariant cache hit.
[2023-03-21 22:14:22] [INFO ] Implicit Places using invariants and state equation in 5502 ms returned []
Implicit Place search using SMT with State Equation took 5943 ms to find 0 implicit places.
[2023-03-21 22:14:22] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-21 22:14:22] [INFO ] Invariant cache hit.
[2023-03-21 22:14:22] [INFO ] Dead Transitions using invariants and state equation in 329 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6293 ms. Remains : 565/565 places, 417/417 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 557 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 281 ms. (steps per millisecond=35 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 4) seen :0
Finished probabilistic random walk after 21528 steps, run visited all 4 properties in 381 ms. (steps per millisecond=56 )
Probabilistic random walk after 21528 steps, saw 20917 distinct states, run finished after 382 ms. (steps per millisecond=56 ) properties seen :4
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F p0), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 9 factoid took 718 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 228 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 0 reset in 580 ms.
Product exploration explored 100000 steps with 0 reset in 703 ms.
Support contains 3 out of 565 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 565/565 places, 417/417 transitions.
Applied a total of 0 rules in 8 ms. Remains 565 /565 variables (removed 0) and now considering 417/417 (removed 0) transitions.
[2023-03-21 22:14:26] [INFO ] Invariant cache hit.
[2023-03-21 22:14:27] [INFO ] Implicit Places using invariants in 446 ms returned []
[2023-03-21 22:14:27] [INFO ] Invariant cache hit.
[2023-03-21 22:14:28] [INFO ] Implicit Places using invariants and state equation in 885 ms returned []
Implicit Place search using SMT with State Equation took 1348 ms to find 0 implicit places.
[2023-03-21 22:14:28] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-21 22:14:28] [INFO ] Invariant cache hit.
[2023-03-21 22:14:28] [INFO ] Dead Transitions using invariants and state equation in 309 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1705 ms. Remains : 565/565 places, 417/417 transitions.
Treatment of property ShieldIIPt-PT-030A-LTLCardinality-11 finished in 21757 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 573 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 573/573 places, 422/422 transitions.
Applied a total of 0 rules in 5 ms. Remains 573 /573 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 573 cols
[2023-03-21 22:14:28] [INFO ] Computed 271 place invariants in 2 ms
[2023-03-21 22:14:28] [INFO ] Implicit Places using invariants in 480 ms returned []
[2023-03-21 22:14:28] [INFO ] Invariant cache hit.
[2023-03-21 22:14:29] [INFO ] Implicit Places using invariants and state equation in 741 ms returned []
Implicit Place search using SMT with State Equation took 1238 ms to find 0 implicit places.
[2023-03-21 22:14:29] [INFO ] Invariant cache hit.
[2023-03-21 22:14:37] [INFO ] Dead Transitions using invariants and state equation in 7932 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9198 ms. Remains : 573/573 places, 422/422 transitions.
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030A-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s1 0) (OR (EQ s93 0) (EQ s450 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-030A-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030A-LTLCardinality-12 finished in 9380 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 573 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 573/573 places, 422/422 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 572 transition count 420
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 570 transition count 420
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 568 transition count 419
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 6 place count 568 transition count 418
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 567 transition count 418
Applied a total of 8 rules in 45 ms. Remains 567 /573 variables (removed 6) and now considering 418/422 (removed 4) transitions.
// Phase 1: matrix 418 rows 567 cols
[2023-03-21 22:14:37] [INFO ] Computed 269 place invariants in 3 ms
[2023-03-21 22:14:38] [INFO ] Implicit Places using invariants in 562 ms returned [556]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 580 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 566/573 places, 418/422 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 565 transition count 417
Applied a total of 2 rules in 25 ms. Remains 565 /566 variables (removed 1) and now considering 417/418 (removed 1) transitions.
// Phase 1: matrix 417 rows 565 cols
[2023-03-21 22:14:38] [INFO ] Computed 268 place invariants in 1 ms
[2023-03-21 22:14:38] [INFO ] Implicit Places using invariants in 371 ms returned []
[2023-03-21 22:14:38] [INFO ] Invariant cache hit.
[2023-03-21 22:14:39] [INFO ] Implicit Places using invariants and state equation in 839 ms returned []
Implicit Place search using SMT with State Equation took 1247 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 565/573 places, 417/422 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1897 ms. Remains : 565/573 places, 417/422 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030A-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s95 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 0 reset in 567 ms.
Product exploration explored 100000 steps with 0 reset in 668 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 174 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 69 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Finished probabilistic random walk after 8744 steps, run visited all 1 properties in 58 ms. (steps per millisecond=150 )
Probabilistic random walk after 8744 steps, saw 8475 distinct states, run finished after 71 ms. (steps per millisecond=123 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 188 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 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Support contains 1 out of 565 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 565/565 places, 417/417 transitions.
Applied a total of 0 rules in 18 ms. Remains 565 /565 variables (removed 0) and now considering 417/417 (removed 0) transitions.
[2023-03-21 22:14:41] [INFO ] Invariant cache hit.
[2023-03-21 22:14:42] [INFO ] Implicit Places using invariants in 327 ms returned []
[2023-03-21 22:14:42] [INFO ] Invariant cache hit.
[2023-03-21 22:14:42] [INFO ] Implicit Places using invariants and state equation in 687 ms returned []
Implicit Place search using SMT with State Equation took 1052 ms to find 0 implicit places.
[2023-03-21 22:14:42] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-21 22:14:42] [INFO ] Invariant cache hit.
[2023-03-21 22:14:46] [INFO ] Dead Transitions using invariants and state equation in 3246 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4338 ms. Remains : 565/565 places, 417/417 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 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 74 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Finished probabilistic random walk after 8744 steps, run visited all 1 properties in 63 ms. (steps per millisecond=138 )
Probabilistic random walk after 8744 steps, saw 8475 distinct states, run finished after 72 ms. (steps per millisecond=121 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 158 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 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 522 ms.
Product exploration explored 100000 steps with 0 reset in 641 ms.
Support contains 1 out of 565 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 565/565 places, 417/417 transitions.
Applied a total of 0 rules in 8 ms. Remains 565 /565 variables (removed 0) and now considering 417/417 (removed 0) transitions.
[2023-03-21 22:14:48] [INFO ] Invariant cache hit.
[2023-03-21 22:14:48] [INFO ] Implicit Places using invariants in 340 ms returned []
[2023-03-21 22:14:48] [INFO ] Invariant cache hit.
[2023-03-21 22:14:49] [INFO ] Implicit Places using invariants and state equation in 903 ms returned []
Implicit Place search using SMT with State Equation took 1259 ms to find 0 implicit places.
[2023-03-21 22:14:49] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-21 22:14:49] [INFO ] Invariant cache hit.
[2023-03-21 22:14:51] [INFO ] Dead Transitions using invariants and state equation in 2253 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3550 ms. Remains : 565/565 places, 417/417 transitions.
Treatment of property ShieldIIPt-PT-030A-LTLCardinality-15 finished in 13824 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U G(p1)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-03-21 22:14:52] [INFO ] Flatten gal took : 77 ms
[2023-03-21 22:14:52] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2023-03-21 22:14:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 573 places, 422 transitions and 1804 arcs took 7 ms.
Total runtime 91178 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1176/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1176/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1176/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldIIPt-PT-030A-LTLCardinality-09
Could not compute solution for formula : ShieldIIPt-PT-030A-LTLCardinality-11
Could not compute solution for formula : ShieldIIPt-PT-030A-LTLCardinality-15

BK_STOP 1679436893312

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name ShieldIIPt-PT-030A-LTLCardinality-09
ltl formula formula --ltl=/tmp/1176/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 573 places, 422 transitions and 1804 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1176/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1176/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.020 user 0.030 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1176/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1176/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name ShieldIIPt-PT-030A-LTLCardinality-11
ltl formula formula --ltl=/tmp/1176/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 573 places, 422 transitions and 1804 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.020 user 0.030 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1176/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1176/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1176/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1176/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 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 ShieldIIPt-PT-030A-LTLCardinality-15
ltl formula formula --ltl=/tmp/1176/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 573 places, 422 transitions and 1804 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1176/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1176/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1176/ltl_2_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.100 real 0.040 user 0.040 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1176/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 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:
0: pnml2lts-mc(+0xa23f4) [0x5620a15db3f4]
1: pnml2lts-mc(+0xa2496) [0x5620a15db496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f15621cc140]
3: pnml2lts-mc(+0x405be5) [0x5620a193ebe5]
4: pnml2lts-mc(+0x16b3f9) [0x5620a16a43f9]
5: pnml2lts-mc(+0x164ac4) [0x5620a169dac4]
6: pnml2lts-mc(+0x272e0a) [0x5620a17abe0a]
7: pnml2lts-mc(+0xb61f0) [0x5620a15ef1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f156201f4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f156201f67a]
10: pnml2lts-mc(+0xa1581) [0x5620a15da581]
11: pnml2lts-mc(+0xa1910) [0x5620a15da910]
12: pnml2lts-mc(+0xa32a2) [0x5620a15dc2a2]
13: pnml2lts-mc(+0xa50f4) [0x5620a15de0f4]
14: pnml2lts-mc(+0xa516b) [0x5620a15de16b]
15: pnml2lts-mc(+0x3f34b3) [0x5620a192c4b3]
16: pnml2lts-mc(+0x7c63d) [0x5620a15b563d]
17: pnml2lts-mc(+0x67d86) [0x5620a15a0d86]
18: pnml2lts-mc(+0x60a8a) [0x5620a1599a8a]
19: pnml2lts-mc(+0x5eb15) [0x5620a1597b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f1562007d0a]
21: pnml2lts-mc(+0x6075e) [0x5620a159975e]

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="ShieldIIPt-PT-030A"
export BK_EXAMINATION="LTLCardinality"
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 ShieldIIPt-PT-030A, examination is LTLCardinality"
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-167903716800291"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-030A.tgz
mv ShieldIIPt-PT-030A execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;