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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2674.512 81225.00 132864.00 108.50 TFFFF?TFFFFFT?TT 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-167903716800275.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-020A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903716800275
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 6.2K Feb 25 17:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 25 17:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 17:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 17:29 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.6K Feb 25 16:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:56 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 9.1K Feb 25 18:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 18:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 18:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 25 18:00 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 105K 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-020A-LTLCardinality-00
FORMULA_NAME ShieldIIPt-PT-020A-LTLCardinality-01
FORMULA_NAME ShieldIIPt-PT-020A-LTLCardinality-02
FORMULA_NAME ShieldIIPt-PT-020A-LTLCardinality-03
FORMULA_NAME ShieldIIPt-PT-020A-LTLCardinality-04
FORMULA_NAME ShieldIIPt-PT-020A-LTLCardinality-05
FORMULA_NAME ShieldIIPt-PT-020A-LTLCardinality-06
FORMULA_NAME ShieldIIPt-PT-020A-LTLCardinality-07
FORMULA_NAME ShieldIIPt-PT-020A-LTLCardinality-08
FORMULA_NAME ShieldIIPt-PT-020A-LTLCardinality-09
FORMULA_NAME ShieldIIPt-PT-020A-LTLCardinality-10
FORMULA_NAME ShieldIIPt-PT-020A-LTLCardinality-11
FORMULA_NAME ShieldIIPt-PT-020A-LTLCardinality-12
FORMULA_NAME ShieldIIPt-PT-020A-LTLCardinality-13
FORMULA_NAME ShieldIIPt-PT-020A-LTLCardinality-14
FORMULA_NAME ShieldIIPt-PT-020A-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679436204171

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-020A
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 22:03:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 22:03:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 22:03:27] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2023-03-21 22:03:27] [INFO ] Transformed 383 places.
[2023-03-21 22:03:27] [INFO ] Transformed 283 transitions.
[2023-03-21 22:03:27] [INFO ] Found NUPN structural information;
[2023-03-21 22:03:27] [INFO ] Parsed PT model containing 383 places and 283 transitions and 1206 arcs in 185 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldIIPt-PT-020A-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020A-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020A-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020A-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020A-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020A-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020A-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 383/383 places, 282/282 transitions.
Applied a total of 0 rules in 89 ms. Remains 383 /383 variables (removed 0) and now considering 282/282 (removed 0) transitions.
// Phase 1: matrix 282 rows 383 cols
[2023-03-21 22:03:28] [INFO ] Computed 181 place invariants in 31 ms
[2023-03-21 22:03:30] [INFO ] Implicit Places using invariants in 1956 ms returned []
[2023-03-21 22:03:30] [INFO ] Invariant cache hit.
[2023-03-21 22:03:31] [INFO ] Implicit Places using invariants and state equation in 1819 ms returned []
Implicit Place search using SMT with State Equation took 3828 ms to find 0 implicit places.
[2023-03-21 22:03:31] [INFO ] Invariant cache hit.
[2023-03-21 22:03:32] [INFO ] Dead Transitions using invariants and state equation in 396 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4320 ms. Remains : 383/383 places, 282/282 transitions.
Support contains 20 out of 383 places after structural reductions.
[2023-03-21 22:03:32] [INFO ] Flatten gal took : 118 ms
[2023-03-21 22:03:32] [INFO ] Flatten gal took : 56 ms
[2023-03-21 22:03:32] [INFO ] Input system was already deterministic with 282 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 402 ms. (steps per millisecond=24 ) properties (out of 12) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-21 22:03:33] [INFO ] Invariant cache hit.
[2023-03-21 22:03:33] [INFO ] [Real]Absence check using 181 positive place invariants in 26 ms returned sat
[2023-03-21 22:03:33] [INFO ] After 159ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-21 22:03:33] [INFO ] After 216ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-21 22:03:33] [INFO ] After 443ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 282/282 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 383 transition count 281
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 382 transition count 281
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 381 transition count 280
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 0 with 40 rules applied. Total rules applied 44 place count 381 transition count 280
Applied a total of 44 rules in 68 ms. Remains 381 /383 variables (removed 2) and now considering 280/282 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 381/383 places, 280/282 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 1) seen :0
Finished probabilistic random walk after 48390 steps, run visited all 1 properties in 346 ms. (steps per millisecond=139 )
Probabilistic random walk after 48390 steps, saw 44918 distinct states, run finished after 347 ms. (steps per millisecond=139 ) properties seen :1
FORMULA ShieldIIPt-PT-020A-LTLCardinality-04 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(X((G((F(p1)&&F(G(p2))))&&p0))))'
Support contains 4 out of 383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 383/383 places, 282/282 transitions.
Applied a total of 0 rules in 7 ms. Remains 383 /383 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2023-03-21 22:03:34] [INFO ] Invariant cache hit.
[2023-03-21 22:03:35] [INFO ] Implicit Places using invariants in 612 ms returned []
[2023-03-21 22:03:35] [INFO ] Invariant cache hit.
[2023-03-21 22:03:35] [INFO ] Implicit Places using invariants and state equation in 547 ms returned []
Implicit Place search using SMT with State Equation took 1165 ms to find 0 implicit places.
[2023-03-21 22:03:35] [INFO ] Invariant cache hit.
[2023-03-21 22:03:36] [INFO ] Dead Transitions using invariants and state equation in 696 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1870 ms. Remains : 383/383 places, 282/282 transitions.
Stuttering acceptance computed with spot in 657 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-020A-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 5}, { cond=p0, acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=p2, acceptance={} source=5 dest: 5}, { cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s259 0) (EQ s133 1)), p1:(OR (EQ s336 0) (EQ s346 1)), p2:(OR (EQ s133 0) (EQ s259 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA ShieldIIPt-PT-020A-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020A-LTLCardinality-01 finished in 2638 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 383 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 383/383 places, 282/282 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 383 transition count 281
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 382 transition count 281
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 381 transition count 280
Applied a total of 4 rules in 23 ms. Remains 381 /383 variables (removed 2) and now considering 280/282 (removed 2) transitions.
// Phase 1: matrix 280 rows 381 cols
[2023-03-21 22:03:37] [INFO ] Computed 181 place invariants in 3 ms
[2023-03-21 22:03:37] [INFO ] Implicit Places using invariants in 398 ms returned [373, 374]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 402 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 379/383 places, 280/282 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 379 transition count 279
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 378 transition count 279
Applied a total of 2 rules in 46 ms. Remains 378 /379 variables (removed 1) and now considering 279/280 (removed 1) transitions.
// Phase 1: matrix 279 rows 378 cols
[2023-03-21 22:03:37] [INFO ] Computed 179 place invariants in 3 ms
[2023-03-21 22:03:38] [INFO ] Implicit Places using invariants in 278 ms returned [367]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 282 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 377/383 places, 279/282 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 376 transition count 278
Applied a total of 2 rules in 16 ms. Remains 376 /377 variables (removed 1) and now considering 278/279 (removed 1) transitions.
// Phase 1: matrix 278 rows 376 cols
[2023-03-21 22:03:38] [INFO ] Computed 178 place invariants in 17 ms
[2023-03-21 22:03:38] [INFO ] Implicit Places using invariants in 280 ms returned []
[2023-03-21 22:03:38] [INFO ] Invariant cache hit.
[2023-03-21 22:03:39] [INFO ] Implicit Places using invariants and state equation in 643 ms returned []
Implicit Place search using SMT with State Equation took 925 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 376/383 places, 278/282 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1696 ms. Remains : 376/383 places, 278/282 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-020A-LTLCardinality-02 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 s364 0) (EQ s163 1))], 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 571 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 1 ms.
FORMULA ShieldIIPt-PT-020A-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-020A-LTLCardinality-02 finished in 2343 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Support contains 2 out of 383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 383/383 places, 282/282 transitions.
Applied a total of 0 rules in 3 ms. Remains 383 /383 variables (removed 0) and now considering 282/282 (removed 0) transitions.
// Phase 1: matrix 282 rows 383 cols
[2023-03-21 22:03:39] [INFO ] Computed 181 place invariants in 16 ms
[2023-03-21 22:03:39] [INFO ] Implicit Places using invariants in 235 ms returned []
[2023-03-21 22:03:39] [INFO ] Invariant cache hit.
[2023-03-21 22:03:40] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 720 ms to find 0 implicit places.
[2023-03-21 22:03:40] [INFO ] Invariant cache hit.
[2023-03-21 22:03:40] [INFO ] Dead Transitions using invariants and state equation in 293 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1017 ms. Remains : 383/383 places, 282/282 transitions.
Stuttering acceptance computed with spot in 352 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-020A-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(OR (EQ s225 0) (EQ s39 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 606 ms.
Product exploration explored 100000 steps with 20000 reset in 624 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, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 140 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 315 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 963 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=137 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 192 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 322 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 354 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 383/383 places, 282/282 transitions.
Applied a total of 0 rules in 14 ms. Remains 383 /383 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2023-03-21 22:03:43] [INFO ] Invariant cache hit.
[2023-03-21 22:03:44] [INFO ] Implicit Places using invariants in 477 ms returned []
[2023-03-21 22:03:44] [INFO ] Invariant cache hit.
[2023-03-21 22:03:45] [INFO ] Implicit Places using invariants and state equation in 808 ms returned []
Implicit Place search using SMT with State Equation took 1315 ms to find 0 implicit places.
[2023-03-21 22:03:45] [INFO ] Invariant cache hit.
[2023-03-21 22:03:45] [INFO ] Dead Transitions using invariants and state equation in 341 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1689 ms. Remains : 383/383 places, 282/282 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, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 147 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 307 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 970 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=138 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 155 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 319 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 386 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 341 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 592 ms.
Product exploration explored 100000 steps with 20000 reset in 607 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 305 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 383 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 383/383 places, 282/282 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 383 transition count 282
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 383 transition count 282
Performed 1 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 1 rules applied. Total rules applied 2 place count 383 transition count 282
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 2 rules in 108 ms. Remains 383 /383 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2023-03-21 22:03:49] [INFO ] Redundant transitions in 30 ms returned []
// Phase 1: matrix 282 rows 383 cols
[2023-03-21 22:03:49] [INFO ] Computed 181 place invariants in 2 ms
[2023-03-21 22:03:49] [INFO ] Dead Transitions using invariants and state equation in 305 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 383/383 places, 282/282 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 458 ms. Remains : 383/383 places, 282/282 transitions.
Support contains 2 out of 383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 383/383 places, 282/282 transitions.
Applied a total of 0 rules in 10 ms. Remains 383 /383 variables (removed 0) and now considering 282/282 (removed 0) transitions.
// Phase 1: matrix 282 rows 383 cols
[2023-03-21 22:03:49] [INFO ] Computed 181 place invariants in 1 ms
[2023-03-21 22:03:49] [INFO ] Implicit Places using invariants in 336 ms returned []
[2023-03-21 22:03:49] [INFO ] Invariant cache hit.
[2023-03-21 22:03:50] [INFO ] Implicit Places using invariants and state equation in 698 ms returned []
Implicit Place search using SMT with State Equation took 1038 ms to find 0 implicit places.
[2023-03-21 22:03:50] [INFO ] Invariant cache hit.
[2023-03-21 22:03:50] [INFO ] Dead Transitions using invariants and state equation in 387 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1451 ms. Remains : 383/383 places, 282/282 transitions.
Treatment of property ShieldIIPt-PT-020A-LTLCardinality-05 finished in 11169 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 383 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 383/383 places, 282/282 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 383 transition count 281
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 382 transition count 281
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 381 transition count 280
Applied a total of 4 rules in 16 ms. Remains 381 /383 variables (removed 2) and now considering 280/282 (removed 2) transitions.
// Phase 1: matrix 280 rows 381 cols
[2023-03-21 22:03:50] [INFO ] Computed 181 place invariants in 1 ms
[2023-03-21 22:03:51] [INFO ] Implicit Places using invariants in 265 ms returned [373, 374]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 268 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 379/383 places, 280/282 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 379 transition count 279
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 378 transition count 279
Applied a total of 2 rules in 11 ms. Remains 378 /379 variables (removed 1) and now considering 279/280 (removed 1) transitions.
// Phase 1: matrix 279 rows 378 cols
[2023-03-21 22:03:51] [INFO ] Computed 179 place invariants in 2 ms
[2023-03-21 22:03:51] [INFO ] Implicit Places using invariants in 302 ms returned [367]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 304 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 377/383 places, 279/282 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 376 transition count 278
Applied a total of 2 rules in 23 ms. Remains 376 /377 variables (removed 1) and now considering 278/279 (removed 1) transitions.
// Phase 1: matrix 278 rows 376 cols
[2023-03-21 22:03:51] [INFO ] Computed 178 place invariants in 2 ms
[2023-03-21 22:03:51] [INFO ] Implicit Places using invariants in 377 ms returned []
[2023-03-21 22:03:51] [INFO ] Invariant cache hit.
[2023-03-21 22:03:52] [INFO ] Implicit Places using invariants and state equation in 875 ms returned []
Implicit Place search using SMT with State Equation took 1258 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 376/383 places, 278/282 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1880 ms. Remains : 376/383 places, 278/282 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-020A-LTLCardinality-09 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 s371 1)], 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 467 ms.
Stack based approach found an accepted trace after 183 steps with 0 reset with depth 184 and stack size 184 in 2 ms.
FORMULA ShieldIIPt-PT-020A-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-020A-LTLCardinality-09 finished in 2396 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 3 out of 383 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 383/383 places, 282/282 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 383 transition count 281
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 382 transition count 281
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 381 transition count 280
Applied a total of 4 rules in 15 ms. Remains 381 /383 variables (removed 2) and now considering 280/282 (removed 2) transitions.
// Phase 1: matrix 280 rows 381 cols
[2023-03-21 22:03:53] [INFO ] Computed 181 place invariants in 2 ms
[2023-03-21 22:03:53] [INFO ] Implicit Places using invariants in 302 ms returned [373, 374]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 324 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 379/383 places, 280/282 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 379 transition count 279
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 378 transition count 279
Applied a total of 2 rules in 16 ms. Remains 378 /379 variables (removed 1) and now considering 279/280 (removed 1) transitions.
// Phase 1: matrix 279 rows 378 cols
[2023-03-21 22:03:53] [INFO ] Computed 179 place invariants in 1 ms
[2023-03-21 22:03:54] [INFO ] Implicit Places using invariants in 718 ms returned [367]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 719 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 377/383 places, 279/282 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 376 transition count 278
Applied a total of 2 rules in 10 ms. Remains 376 /377 variables (removed 1) and now considering 278/279 (removed 1) transitions.
// Phase 1: matrix 278 rows 376 cols
[2023-03-21 22:03:54] [INFO ] Computed 178 place invariants in 1 ms
[2023-03-21 22:03:54] [INFO ] Implicit Places using invariants in 345 ms returned []
[2023-03-21 22:03:54] [INFO ] Invariant cache hit.
[2023-03-21 22:03:55] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 906 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 376/383 places, 278/282 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2002 ms. Remains : 376/383 places, 278/282 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-020A-LTLCardinality-10 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 s224 0) (EQ s141 1) (EQ s228 0))], 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 95 reset in 495 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA ShieldIIPt-PT-020A-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-020A-LTLCardinality-10 finished in 2684 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 383 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 383/383 places, 282/282 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 383 transition count 281
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 382 transition count 281
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 381 transition count 280
Applied a total of 4 rules in 18 ms. Remains 381 /383 variables (removed 2) and now considering 280/282 (removed 2) transitions.
// Phase 1: matrix 280 rows 381 cols
[2023-03-21 22:03:55] [INFO ] Computed 181 place invariants in 2 ms
[2023-03-21 22:03:56] [INFO ] Implicit Places using invariants in 300 ms returned [373, 374]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 301 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 379/383 places, 280/282 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 379 transition count 279
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 378 transition count 279
Applied a total of 2 rules in 9 ms. Remains 378 /379 variables (removed 1) and now considering 279/280 (removed 1) transitions.
// Phase 1: matrix 279 rows 378 cols
[2023-03-21 22:03:56] [INFO ] Computed 179 place invariants in 1 ms
[2023-03-21 22:03:56] [INFO ] Implicit Places using invariants in 235 ms returned [367]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 236 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 377/383 places, 279/282 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 376 transition count 278
Applied a total of 2 rules in 10 ms. Remains 376 /377 variables (removed 1) and now considering 278/279 (removed 1) transitions.
// Phase 1: matrix 278 rows 376 cols
[2023-03-21 22:03:56] [INFO ] Computed 178 place invariants in 1 ms
[2023-03-21 22:03:56] [INFO ] Implicit Places using invariants in 391 ms returned []
[2023-03-21 22:03:56] [INFO ] Invariant cache hit.
[2023-03-21 22:03:57] [INFO ] Implicit Places using invariants and state equation in 898 ms returned []
Implicit Place search using SMT with State Equation took 1291 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 376/383 places, 278/282 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1867 ms. Remains : 376/383 places, 278/282 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-020A-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s354 0) (EQ s258 1))], 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 485 ms.
Stack based approach found an accepted trace after 32 steps with 0 reset with depth 33 and stack size 33 in 0 ms.
FORMULA ShieldIIPt-PT-020A-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-020A-LTLCardinality-11 finished in 2448 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G((X(G(p1))||p0)))))))'
Support contains 4 out of 383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 383/383 places, 282/282 transitions.
Applied a total of 0 rules in 3 ms. Remains 383 /383 variables (removed 0) and now considering 282/282 (removed 0) transitions.
// Phase 1: matrix 282 rows 383 cols
[2023-03-21 22:03:58] [INFO ] Computed 181 place invariants in 3 ms
[2023-03-21 22:03:58] [INFO ] Implicit Places using invariants in 336 ms returned []
[2023-03-21 22:03:58] [INFO ] Invariant cache hit.
[2023-03-21 22:03:59] [INFO ] Implicit Places using invariants and state equation in 558 ms returned []
Implicit Place search using SMT with State Equation took 921 ms to find 0 implicit places.
[2023-03-21 22:03:59] [INFO ] Invariant cache hit.
[2023-03-21 22:03:59] [INFO ] Dead Transitions using invariants and state equation in 474 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1406 ms. Remains : 383/383 places, 282/282 transitions.
Stuttering acceptance computed with spot in 405 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-020A-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p1:(OR (EQ s44 0) (EQ s364 1)), p0:(OR (EQ s20 0) (EQ s191 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, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 482 ms.
Product exploration explored 100000 steps with 0 reset in 671 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 p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 137 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 352 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 451590 steps, run timeout after 3001 ms. (steps per millisecond=150 ) properties seen :{1=1}
Probabilistic random walk after 451590 steps, saw 436580 distinct states, run finished after 3002 ms. (steps per millisecond=150 ) properties seen :1
Running SMT prover for 1 properties.
[2023-03-21 22:04:05] [INFO ] Invariant cache hit.
[2023-03-21 22:04:05] [INFO ] [Real]Absence check using 181 positive place invariants in 37 ms returned sat
[2023-03-21 22:04:05] [INFO ] After 162ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-21 22:04:05] [INFO ] After 205ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-21 22:04:05] [INFO ] After 387ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 282/282 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 383 transition count 281
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 382 transition count 281
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 381 transition count 280
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 0 with 40 rules applied. Total rules applied 44 place count 381 transition count 280
Applied a total of 44 rules in 18 ms. Remains 381 /383 variables (removed 2) and now considering 280/282 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 381/383 places, 280/282 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Finished probabilistic random walk after 48390 steps, run visited all 1 properties in 301 ms. (steps per millisecond=160 )
Probabilistic random walk after 48390 steps, saw 44918 distinct states, run finished after 301 ms. (steps per millisecond=160 ) properties seen :1
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 171 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 506 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 418 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 383/383 places, 282/282 transitions.
Applied a total of 0 rules in 2 ms. Remains 383 /383 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2023-03-21 22:04:07] [INFO ] Invariant cache hit.
[2023-03-21 22:04:07] [INFO ] Implicit Places using invariants in 316 ms returned []
[2023-03-21 22:04:07] [INFO ] Invariant cache hit.
[2023-03-21 22:04:08] [INFO ] Implicit Places using invariants and state equation in 923 ms returned []
Implicit Place search using SMT with State Equation took 1274 ms to find 0 implicit places.
[2023-03-21 22:04:08] [INFO ] Invariant cache hit.
[2023-03-21 22:04:08] [INFO ] Dead Transitions using invariants and state equation in 392 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1669 ms. Remains : 383/383 places, 282/282 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 p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 179 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 426 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 4844 steps, including 1 resets, run visited all 2 properties in 136 ms. (steps per millisecond=35 )
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 152 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 474 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 357 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 289 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 443 ms.
Product exploration explored 100000 steps with 0 reset in 885 ms.
Applying partial POR strategy [true, true, false, false, false, false, false]
Stuttering acceptance computed with spot in 366 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 383 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 383/383 places, 282/282 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 383 transition count 282
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 383 transition count 282
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 383 transition count 282
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 13 ms. Remains 383 /383 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2023-03-21 22:04:12] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 282 rows 383 cols
[2023-03-21 22:04:12] [INFO ] Computed 181 place invariants in 1 ms
[2023-03-21 22:04:13] [INFO ] Dead Transitions using invariants and state equation in 936 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 383/383 places, 282/282 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 997 ms. Remains : 383/383 places, 282/282 transitions.
Support contains 4 out of 383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 383/383 places, 282/282 transitions.
Applied a total of 0 rules in 3 ms. Remains 383 /383 variables (removed 0) and now considering 282/282 (removed 0) transitions.
// Phase 1: matrix 282 rows 383 cols
[2023-03-21 22:04:13] [INFO ] Computed 181 place invariants in 1 ms
[2023-03-21 22:04:13] [INFO ] Implicit Places using invariants in 259 ms returned []
[2023-03-21 22:04:13] [INFO ] Invariant cache hit.
[2023-03-21 22:04:14] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 677 ms to find 0 implicit places.
[2023-03-21 22:04:14] [INFO ] Invariant cache hit.
[2023-03-21 22:04:14] [INFO ] Dead Transitions using invariants and state equation in 295 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 976 ms. Remains : 383/383 places, 282/282 transitions.
Treatment of property ShieldIIPt-PT-020A-LTLCardinality-13 finished in 16218 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 2 out of 383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 383/383 places, 282/282 transitions.
Applied a total of 0 rules in 2 ms. Remains 383 /383 variables (removed 0) and now considering 282/282 (removed 0) transitions.
[2023-03-21 22:04:14] [INFO ] Invariant cache hit.
[2023-03-21 22:04:14] [INFO ] Implicit Places using invariants in 211 ms returned []
[2023-03-21 22:04:14] [INFO ] Invariant cache hit.
[2023-03-21 22:04:15] [INFO ] Implicit Places using invariants and state equation in 564 ms returned []
Implicit Place search using SMT with State Equation took 789 ms to find 0 implicit places.
[2023-03-21 22:04:15] [INFO ] Invariant cache hit.
[2023-03-21 22:04:17] [INFO ] Dead Transitions using invariants and state equation in 2451 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3266 ms. Remains : 383/383 places, 282/282 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-020A-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s90 0) (EQ s69 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 733 ms.
Product exploration explored 100000 steps with 50000 reset in 801 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 127 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-020A-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-020A-LTLCardinality-14 finished in 5113 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Found a Shortening insensitive property : ShieldIIPt-PT-020A-LTLCardinality-05
Stuttering acceptance computed with spot in 388 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 383 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 383/383 places, 282/282 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 382 transition count 280
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 380 transition count 280
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 378 transition count 279
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 378 transition count 278
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 377 transition count 278
Applied a total of 8 rules in 22 ms. Remains 377 /383 variables (removed 6) and now considering 278/282 (removed 4) transitions.
// Phase 1: matrix 278 rows 377 cols
[2023-03-21 22:04:20] [INFO ] Computed 179 place invariants in 31 ms
[2023-03-21 22:04:20] [INFO ] Implicit Places using invariants in 526 ms returned [366]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 529 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 376/383 places, 278/282 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 375 transition count 277
Applied a total of 2 rules in 10 ms. Remains 375 /376 variables (removed 1) and now considering 277/278 (removed 1) transitions.
// Phase 1: matrix 277 rows 375 cols
[2023-03-21 22:04:20] [INFO ] Computed 178 place invariants in 1 ms
[2023-03-21 22:04:21] [INFO ] Implicit Places using invariants in 290 ms returned []
[2023-03-21 22:04:21] [INFO ] Invariant cache hit.
[2023-03-21 22:04:21] [INFO ] Implicit Places using invariants and state equation in 663 ms returned []
Implicit Place search using SMT with State Equation took 955 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 375/383 places, 277/282 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1517 ms. Remains : 375/383 places, 277/282 transitions.
Running random walk in product with property : ShieldIIPt-PT-020A-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(OR (EQ s224 0) (EQ s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 387 ms.
Product exploration explored 100000 steps with 20000 reset in 415 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, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 149 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 3611 steps, including 1 resets, run visited all 1 properties in 28 ms. (steps per millisecond=128 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 189 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 270 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 277 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 277/277 transitions.
Applied a total of 0 rules in 6 ms. Remains 375 /375 variables (removed 0) and now considering 277/277 (removed 0) transitions.
[2023-03-21 22:04:23] [INFO ] Invariant cache hit.
[2023-03-21 22:04:24] [INFO ] Implicit Places using invariants in 263 ms returned []
[2023-03-21 22:04:24] [INFO ] Invariant cache hit.
[2023-03-21 22:04:24] [INFO ] Implicit Places using invariants and state equation in 619 ms returned []
Implicit Place search using SMT with State Equation took 904 ms to find 0 implicit places.
[2023-03-21 22:04:24] [INFO ] Invariant cache hit.
[2023-03-21 22:04:24] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1195 ms. Remains : 375/375 places, 277/277 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, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 130 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 4527 steps, including 1 resets, run visited all 1 properties in 25 ms. (steps per millisecond=181 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 197 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 416 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 342 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 303 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 404 ms.
Product exploration explored 100000 steps with 20000 reset in 455 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 315 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 375 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 375/375 places, 277/277 transitions.
Applied a total of 0 rules in 7 ms. Remains 375 /375 variables (removed 0) and now considering 277/277 (removed 0) transitions.
[2023-03-21 22:04:27] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-21 22:04:28] [INFO ] Invariant cache hit.
[2023-03-21 22:04:28] [INFO ] Dead Transitions using invariants and state equation in 638 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 696 ms. Remains : 375/375 places, 277/277 transitions.
Support contains 2 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 277/277 transitions.
Applied a total of 0 rules in 4 ms. Remains 375 /375 variables (removed 0) and now considering 277/277 (removed 0) transitions.
[2023-03-21 22:04:28] [INFO ] Invariant cache hit.
[2023-03-21 22:04:28] [INFO ] Implicit Places using invariants in 227 ms returned []
[2023-03-21 22:04:28] [INFO ] Invariant cache hit.
[2023-03-21 22:04:29] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 710 ms to find 0 implicit places.
[2023-03-21 22:04:29] [INFO ] Invariant cache hit.
[2023-03-21 22:04:29] [INFO ] Dead Transitions using invariants and state equation in 298 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1016 ms. Remains : 375/375 places, 277/277 transitions.
Treatment of property ShieldIIPt-PT-020A-LTLCardinality-05 finished in 9989 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G((X(G(p1))||p0)))))))'
Found a Lengthening insensitive property : ShieldIIPt-PT-020A-LTLCardinality-13
Stuttering acceptance computed with spot in 446 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 383 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 383/383 places, 282/282 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 383 transition count 281
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 382 transition count 281
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 381 transition count 280
Applied a total of 4 rules in 10 ms. Remains 381 /383 variables (removed 2) and now considering 280/282 (removed 2) transitions.
// Phase 1: matrix 280 rows 381 cols
[2023-03-21 22:04:30] [INFO ] Computed 181 place invariants in 1 ms
[2023-03-21 22:04:30] [INFO ] Implicit Places using invariants in 465 ms returned [373, 374]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 468 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 379/383 places, 280/282 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 379 transition count 279
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 378 transition count 279
Applied a total of 2 rules in 9 ms. Remains 378 /379 variables (removed 1) and now considering 279/280 (removed 1) transitions.
// Phase 1: matrix 279 rows 378 cols
[2023-03-21 22:04:30] [INFO ] Computed 179 place invariants in 10 ms
[2023-03-21 22:04:31] [INFO ] Implicit Places using invariants in 376 ms returned [367]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 377 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 377/383 places, 279/282 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 376 transition count 278
Applied a total of 2 rules in 9 ms. Remains 376 /377 variables (removed 1) and now considering 278/279 (removed 1) transitions.
// Phase 1: matrix 278 rows 376 cols
[2023-03-21 22:04:31] [INFO ] Computed 178 place invariants in 2 ms
[2023-03-21 22:04:31] [INFO ] Implicit Places using invariants in 354 ms returned []
[2023-03-21 22:04:31] [INFO ] Invariant cache hit.
[2023-03-21 22:04:32] [INFO ] Implicit Places using invariants and state equation in 869 ms returned []
Implicit Place search using SMT with State Equation took 1238 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 376/383 places, 278/282 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 2111 ms. Remains : 376/383 places, 278/282 transitions.
Running random walk in product with property : ShieldIIPt-PT-020A-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p1:(OR (EQ s44 0) (EQ s364 1)), p0:(OR (EQ s20 0) (EQ s191 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, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 397 ms.
Product exploration explored 100000 steps with 0 reset in 492 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 p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 152 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 484 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Finished probabilistic random walk after 14481 steps, run visited all 2 properties in 148 ms. (steps per millisecond=97 )
Probabilistic random walk after 14481 steps, saw 13982 distinct states, run finished after 149 ms. (steps per millisecond=97 ) properties seen :2
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 163 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 386 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 367 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 278/278 transitions.
Applied a total of 0 rules in 2 ms. Remains 376 /376 variables (removed 0) and now considering 278/278 (removed 0) transitions.
[2023-03-21 22:04:35] [INFO ] Invariant cache hit.
[2023-03-21 22:04:35] [INFO ] Implicit Places using invariants in 253 ms returned []
[2023-03-21 22:04:35] [INFO ] Invariant cache hit.
[2023-03-21 22:04:36] [INFO ] Implicit Places using invariants and state equation in 752 ms returned []
Implicit Place search using SMT with State Equation took 1022 ms to find 0 implicit places.
[2023-03-21 22:04:36] [INFO ] Invariant cache hit.
[2023-03-21 22:04:36] [INFO ] Dead Transitions using invariants and state equation in 361 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1400 ms. Remains : 376/376 places, 278/278 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 p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 102 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 423 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-21 22:04:37] [INFO ] Invariant cache hit.
[2023-03-21 22:04:37] [INFO ] [Real]Absence check using 178 positive place invariants in 22 ms returned sat
[2023-03-21 22:04:37] [INFO ] After 183ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-21 22:04:37] [INFO ] After 231ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:04:37] [INFO ] After 369ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:04:37] [INFO ] [Nat]Absence check using 178 positive place invariants in 88 ms returned sat
[2023-03-21 22:04:38] [INFO ] After 227ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 22:04:38] [INFO ] After 250ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-21 22:04:38] [INFO ] After 469ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 376 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 376/376 places, 278/278 transitions.
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 0 with 39 rules applied. Total rules applied 39 place count 376 transition count 278
Applied a total of 39 rules in 25 ms. Remains 376 /376 variables (removed 0) and now considering 278/278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 376/376 places, 278/278 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Finished probabilistic random walk after 48346 steps, run visited all 1 properties in 247 ms. (steps per millisecond=195 )
Probabilistic random walk after 48346 steps, saw 44933 distinct states, run finished after 260 ms. (steps per millisecond=185 ) properties seen :1
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 247 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 351 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 471 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 367 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 524 ms.
Product exploration explored 100000 steps with 0 reset in 485 ms.
Applying partial POR strategy [true, true, false, false, false, false, false]
Stuttering acceptance computed with spot in 369 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 376 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 376/376 places, 278/278 transitions.
Applied a total of 0 rules in 7 ms. Remains 376 /376 variables (removed 0) and now considering 278/278 (removed 0) transitions.
[2023-03-21 22:04:41] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-21 22:04:41] [INFO ] Invariant cache hit.
[2023-03-21 22:04:42] [INFO ] Dead Transitions using invariants and state equation in 894 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 916 ms. Remains : 376/376 places, 278/278 transitions.
Support contains 4 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 278/278 transitions.
Applied a total of 0 rules in 3 ms. Remains 376 /376 variables (removed 0) and now considering 278/278 (removed 0) transitions.
[2023-03-21 22:04:42] [INFO ] Invariant cache hit.
[2023-03-21 22:04:43] [INFO ] Implicit Places using invariants in 1069 ms returned []
[2023-03-21 22:04:43] [INFO ] Invariant cache hit.
[2023-03-21 22:04:44] [INFO ] Implicit Places using invariants and state equation in 516 ms returned []
Implicit Place search using SMT with State Equation took 1598 ms to find 0 implicit places.
[2023-03-21 22:04:44] [INFO ] Invariant cache hit.
[2023-03-21 22:04:44] [INFO ] Dead Transitions using invariants and state equation in 284 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1899 ms. Remains : 376/376 places, 278/278 transitions.
Treatment of property ShieldIIPt-PT-020A-LTLCardinality-13 finished in 14668 ms.
[2023-03-21 22:04:44] [INFO ] Flatten gal took : 41 ms
[2023-03-21 22:04:44] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-21 22:04:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 383 places, 282 transitions and 1204 arcs took 24 ms.
Total runtime 76856 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1826/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1826/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldIIPt-PT-020A-LTLCardinality-05
Could not compute solution for formula : ShieldIIPt-PT-020A-LTLCardinality-13

BK_STOP 1679436285396

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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-020A-LTLCardinality-05
ltl formula formula --ltl=/tmp/1826/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 383 places, 282 transitions and 1204 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1826/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1826/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1826/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.100 real 0.020 user 0.050 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1826/ltl_0_
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
double free or corruption (fasttop)
ltl formula name ShieldIIPt-PT-020A-LTLCardinality-13
ltl formula formula --ltl=/tmp/1826/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
pnml2lts-mc( 0/ 4): Petri net has 383 places, 282 transitions and 1204 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1826/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1826/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1826/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.130 real 0.010 user 0.070 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1826/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted

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-020A"
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-020A, 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-167903716800275"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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