Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r373-tall-171683788700182.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ShieldIIPt-PT-030A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683788700182
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 22:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Apr 12 22:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 12 22:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K Apr 12 22:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 159K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716953115358

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-030A
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-29 03:25:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 03:25:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 03:25:17] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2024-05-29 03:25:17] [INFO ] Transformed 573 places.
[2024-05-29 03:25:17] [INFO ] Transformed 423 transitions.
[2024-05-29 03:25:17] [INFO ] Found NUPN structural information;
[2024-05-29 03:25:17] [INFO ] Parsed PT model containing 573 places and 423 transitions and 1806 arcs in 172 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldIIPt-PT-030A-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030A-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030A-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030A-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030A-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030A-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030A-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 573 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 573/573 places, 422/422 transitions.
Applied a total of 0 rules in 51 ms. Remains 573 /573 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 573 cols
[2024-05-29 03:25:17] [INFO ] Computed 271 invariants in 28 ms
[2024-05-29 03:25:18] [INFO ] Implicit Places using invariants in 662 ms returned []
[2024-05-29 03:25:18] [INFO ] Invariant cache hit.
[2024-05-29 03:25:19] [INFO ] Implicit Places using invariants and state equation in 706 ms returned []
Implicit Place search using SMT with State Equation took 1395 ms to find 0 implicit places.
[2024-05-29 03:25:19] [INFO ] Invariant cache hit.
[2024-05-29 03:25:19] [INFO ] Dead Transitions using invariants and state equation in 304 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1753 ms. Remains : 573/573 places, 422/422 transitions.
Support contains 28 out of 573 places after structural reductions.
[2024-05-29 03:25:19] [INFO ] Flatten gal took : 98 ms
[2024-05-29 03:25:19] [INFO ] Flatten gal took : 45 ms
[2024-05-29 03:25:19] [INFO ] Input system was already deterministic with 422 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 509 ms. (steps per millisecond=19 ) properties (out of 17) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-29 03:25:20] [INFO ] Invariant cache hit.
[2024-05-29 03:25:20] [INFO ] [Real]Absence check using 271 positive place invariants in 46 ms returned sat
[2024-05-29 03:25:21] [INFO ] After 324ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:1
[2024-05-29 03:25:21] [INFO ] After 593ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 03:25:21] [INFO ] After 874ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 03:25:21] [INFO ] [Nat]Absence check using 271 positive place invariants in 41 ms returned sat
[2024-05-29 03:25:22] [INFO ] After 411ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 03:25:22] [INFO ] After 669ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 234 ms.
[2024-05-29 03:25:22] [INFO ] After 1130ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 1 properties in 203 ms.
Support contains 8 out of 573 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 573/573 places, 422/422 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 573 transition count 421
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 572 transition count 421
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 571 transition count 420
Partial Free-agglomeration rule applied 59 times.
Drop transitions removed 59 transitions
Iterating global reduction 0 with 59 rules applied. Total rules applied 63 place count 571 transition count 420
Applied a total of 63 rules in 102 ms. Remains 571 /573 variables (removed 2) and now considering 420/422 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 571/573 places, 420/422 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 420 rows 571 cols
[2024-05-29 03:25:23] [INFO ] Computed 271 invariants in 10 ms
[2024-05-29 03:25:23] [INFO ] [Real]Absence check using 271 positive place invariants in 56 ms returned sat
[2024-05-29 03:25:23] [INFO ] After 399ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 03:25:23] [INFO ] [Nat]Absence check using 271 positive place invariants in 48 ms returned sat
[2024-05-29 03:25:24] [INFO ] After 223ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 03:25:24] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-29 03:25:24] [INFO ] After 92ms SMT Verify possible using 33 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 03:25:24] [INFO ] After 185ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 54 ms.
[2024-05-29 03:25:24] [INFO ] After 643ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 14 ms.
Support contains 4 out of 571 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 571/571 places, 420/420 transitions.
Applied a total of 0 rules in 28 ms. Remains 571 /571 variables (removed 0) and now considering 420/420 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 571/571 places, 420/420 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 03:25:24] [INFO ] Invariant cache hit.
[2024-05-29 03:25:24] [INFO ] [Real]Absence check using 271 positive place invariants in 42 ms returned sat
[2024-05-29 03:25:24] [INFO ] After 175ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-29 03:25:24] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-29 03:25:24] [INFO ] After 31ms SMT Verify possible using 33 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 03:25:24] [INFO ] After 389ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 03:25:25] [INFO ] [Nat]Absence check using 271 positive place invariants in 48 ms returned sat
[2024-05-29 03:25:25] [INFO ] After 195ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 03:25:25] [INFO ] After 494ms SMT Verify possible using 33 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 03:25:25] [INFO ] After 538ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-05-29 03:25:25] [INFO ] After 947ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 571 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 571/571 places, 420/420 transitions.
Applied a total of 0 rules in 19 ms. Remains 571 /571 variables (removed 0) and now considering 420/420 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 571/571 places, 420/420 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 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4357 steps, run visited all 1 properties in 49 ms. (steps per millisecond=88 )
Probabilistic random walk after 4357 steps, saw 4159 distinct states, run finished after 50 ms. (steps per millisecond=87 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(!p0 U p1)))))'
Support contains 3 out of 573 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 573/573 places, 422/422 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 573 transition count 421
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 572 transition count 421
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 571 transition count 420
Applied a total of 4 rules in 35 ms. Remains 571 /573 variables (removed 2) and now considering 420/422 (removed 2) transitions.
// Phase 1: matrix 420 rows 571 cols
[2024-05-29 03:25:26] [INFO ] Computed 271 invariants in 6 ms
[2024-05-29 03:25:26] [INFO ] Implicit Places using invariants in 362 ms returned [563, 564]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 365 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 569/573 places, 420/422 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 569 transition count 419
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 568 transition count 419
Applied a total of 2 rules in 22 ms. Remains 568 /569 variables (removed 1) and now considering 419/420 (removed 1) transitions.
// Phase 1: matrix 419 rows 568 cols
[2024-05-29 03:25:26] [INFO ] Computed 269 invariants in 3 ms
[2024-05-29 03:25:26] [INFO ] Implicit Places using invariants in 337 ms returned [557]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 340 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 567/573 places, 419/422 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 566 transition count 418
Applied a total of 2 rules in 28 ms. Remains 566 /567 variables (removed 1) and now considering 418/419 (removed 1) transitions.
// Phase 1: matrix 418 rows 566 cols
[2024-05-29 03:25:27] [INFO ] Computed 268 invariants in 3 ms
[2024-05-29 03:25:27] [INFO ] Implicit Places using invariants in 334 ms returned []
[2024-05-29 03:25:27] [INFO ] Invariant cache hit.
[2024-05-29 03:25:27] [INFO ] Implicit Places using invariants and state equation in 627 ms returned []
Implicit Place search using SMT with State Equation took 966 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 566/573 places, 418/422 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1757 ms. Remains : 566/573 places, 418/422 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-030A-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (EQ s553 0) (EQ s142 1)), p0:(NEQ s320 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 647 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 1 ms.
FORMULA ShieldIIPt-PT-030A-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-030A-LTLCardinality-00 finished in 2662 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 573 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 573/573 places, 422/422 transitions.
Applied a total of 0 rules in 11 ms. Remains 573 /573 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 573 cols
[2024-05-29 03:25:28] [INFO ] Computed 271 invariants in 6 ms
[2024-05-29 03:25:29] [INFO ] Implicit Places using invariants in 356 ms returned []
[2024-05-29 03:25:29] [INFO ] Invariant cache hit.
[2024-05-29 03:25:29] [INFO ] Implicit Places using invariants and state equation in 576 ms returned []
Implicit Place search using SMT with State Equation took 934 ms to find 0 implicit places.
[2024-05-29 03:25:29] [INFO ] Invariant cache hit.
[2024-05-29 03:25:30] [INFO ] Dead Transitions using invariants and state equation in 285 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1231 ms. Remains : 573/573 places, 422/422 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030A-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s44 0) (EQ s440 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 1621 ms.
Product exploration explored 100000 steps with 50000 reset in 1647 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 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-030A-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-030A-LTLCardinality-03 finished in 4627 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0 U G(p1)))||(!G((p2 U p0)) U G(p2)))))'
Support contains 4 out of 573 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 573/573 places, 422/422 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 573 transition count 421
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 572 transition count 421
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 571 transition count 420
Applied a total of 4 rules in 27 ms. Remains 571 /573 variables (removed 2) and now considering 420/422 (removed 2) transitions.
// Phase 1: matrix 420 rows 571 cols
[2024-05-29 03:25:33] [INFO ] Computed 271 invariants in 7 ms
[2024-05-29 03:25:33] [INFO ] Implicit Places using invariants in 354 ms returned [563, 564]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 355 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 569/573 places, 420/422 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 569 transition count 419
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 568 transition count 419
Applied a total of 2 rules in 16 ms. Remains 568 /569 variables (removed 1) and now considering 419/420 (removed 1) transitions.
// Phase 1: matrix 419 rows 568 cols
[2024-05-29 03:25:33] [INFO ] Computed 269 invariants in 4 ms
[2024-05-29 03:25:34] [INFO ] Implicit Places using invariants in 303 ms returned [557]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 307 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 567/573 places, 419/422 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 566 transition count 418
Applied a total of 2 rules in 21 ms. Remains 566 /567 variables (removed 1) and now considering 418/419 (removed 1) transitions.
// Phase 1: matrix 418 rows 566 cols
[2024-05-29 03:25:34] [INFO ] Computed 268 invariants in 3 ms
[2024-05-29 03:25:34] [INFO ] Implicit Places using invariants in 341 ms returned []
[2024-05-29 03:25:34] [INFO ] Invariant cache hit.
[2024-05-29 03:25:35] [INFO ] Implicit Places using invariants and state equation in 579 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 : 566/573 places, 418/422 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1655 ms. Remains : 566/573 places, 418/422 transitions.
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-030A-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND p1 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p1:(OR (EQ s386 0) (EQ s504 1)), p2:(OR (EQ s393 0) (EQ s369 1))], nbAcceptance=2, 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 592 ms.
Product exploration explored 100000 steps with 0 reset in 746 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 p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (AND p1 p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 99 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 03:25:37] [INFO ] Invariant cache hit.
[2024-05-29 03:25:37] [INFO ] [Real]Absence check using 268 positive place invariants in 52 ms returned sat
[2024-05-29 03:25:37] [INFO ] After 406ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 03:25:37] [INFO ] [Nat]Absence check using 268 positive place invariants in 39 ms returned sat
[2024-05-29 03:25:37] [INFO ] After 205ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 03:25:37] [INFO ] After 278ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 47 ms.
[2024-05-29 03:25:37] [INFO ] After 496ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 19 ms.
Support contains 4 out of 566 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 566/566 places, 418/418 transitions.
Partial Free-agglomeration rule applied 59 times.
Drop transitions removed 59 transitions
Iterating global reduction 0 with 59 rules applied. Total rules applied 59 place count 566 transition count 418
Applied a total of 59 rules in 25 ms. Remains 566 /566 variables (removed 0) and now considering 418/418 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 566/566 places, 418/418 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 418 rows 566 cols
[2024-05-29 03:25:38] [INFO ] Computed 268 invariants in 5 ms
[2024-05-29 03:25:38] [INFO ] [Real]Absence check using 268 positive place invariants in 41 ms returned sat
[2024-05-29 03:25:38] [INFO ] After 187ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-29 03:25:38] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-29 03:25:38] [INFO ] After 37ms SMT Verify possible using 30 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 03:25:38] [INFO ] After 392ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 03:25:38] [INFO ] [Nat]Absence check using 268 positive place invariants in 47 ms returned sat
[2024-05-29 03:25:38] [INFO ] After 188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 03:25:39] [INFO ] After 646ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 03:25:39] [INFO ] After 694ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2024-05-29 03:25:39] [INFO ] After 1072ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 4 out of 566 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 566/566 places, 418/418 transitions.
Applied a total of 0 rules in 12 ms. Remains 566 /566 variables (removed 0) and now considering 418/418 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 566/566 places, 418/418 transitions.
Finished random walk after 9499 steps, including 2 resets, run visited all 1 properties in 71 ms. (steps per millisecond=133 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (AND p1 p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 p2)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (NOT (AND p1 p2))), (F (AND p1 (NOT p2))), (F (AND (NOT p1) p2))]
Knowledge based reduction with 9 factoid took 188 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p1) (NOT p2))]
Support contains 4 out of 566 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 566/566 places, 418/418 transitions.
Applied a total of 0 rules in 13 ms. Remains 566 /566 variables (removed 0) and now considering 418/418 (removed 0) transitions.
// Phase 1: matrix 418 rows 566 cols
[2024-05-29 03:25:39] [INFO ] Computed 268 invariants in 2 ms
[2024-05-29 03:25:40] [INFO ] Implicit Places using invariants in 309 ms returned []
[2024-05-29 03:25:40] [INFO ] Invariant cache hit.
[2024-05-29 03:25:40] [INFO ] Implicit Places using invariants and state equation in 586 ms returned []
Implicit Place search using SMT with State Equation took 896 ms to find 0 implicit places.
[2024-05-29 03:25:40] [INFO ] Redundant transitions in 28 ms returned []
[2024-05-29 03:25:40] [INFO ] Invariant cache hit.
[2024-05-29 03:25:41] [INFO ] Dead Transitions using invariants and state equation in 304 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1249 ms. Remains : 566/566 places, 418/418 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 p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (AND p1 p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 102 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
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 :0
Running SMT prover for 2 properties.
[2024-05-29 03:25:41] [INFO ] Invariant cache hit.
[2024-05-29 03:25:41] [INFO ] [Real]Absence check using 268 positive place invariants in 37 ms returned sat
[2024-05-29 03:25:41] [INFO ] After 345ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 03:25:42] [INFO ] [Nat]Absence check using 268 positive place invariants in 39 ms returned sat
[2024-05-29 03:25:42] [INFO ] After 201ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 03:25:42] [INFO ] After 270ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 47 ms.
[2024-05-29 03:25:42] [INFO ] After 487ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 21 ms.
Support contains 4 out of 566 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 566/566 places, 418/418 transitions.
Partial Free-agglomeration rule applied 59 times.
Drop transitions removed 59 transitions
Iterating global reduction 0 with 59 rules applied. Total rules applied 59 place count 566 transition count 418
Applied a total of 59 rules in 21 ms. Remains 566 /566 variables (removed 0) and now considering 418/418 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 566/566 places, 418/418 transitions.
Finished random walk after 7210 steps, including 2 resets, run visited all 2 properties in 66 ms. (steps per millisecond=109 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (AND p1 p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 p2)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (NOT (AND p1 p2))), (F (AND p1 (NOT p2))), (F (AND (NOT p1) p2))]
Knowledge based reduction with 9 factoid took 197 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 608 ms.
Stack based approach found an accepted trace after 81366 steps with 0 reset with depth 81367 and stack size 18626 in 636 ms.
FORMULA ShieldIIPt-PT-030A-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-030A-LTLCardinality-05 finished in 10734 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 573 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 573/573 places, 422/422 transitions.
Applied a total of 0 rules in 8 ms. Remains 573 /573 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 573 cols
[2024-05-29 03:25:44] [INFO ] Computed 271 invariants in 2 ms
[2024-05-29 03:25:44] [INFO ] Implicit Places using invariants in 308 ms returned []
[2024-05-29 03:25:44] [INFO ] Invariant cache hit.
[2024-05-29 03:25:45] [INFO ] Implicit Places using invariants and state equation in 586 ms returned []
Implicit Place search using SMT with State Equation took 897 ms to find 0 implicit places.
[2024-05-29 03:25:45] [INFO ] Invariant cache hit.
[2024-05-29 03:25:45] [INFO ] Dead Transitions using invariants and state equation in 286 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1193 ms. Remains : 573/573 places, 422/422 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030A-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(NEQ s358 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1273 ms.
Product exploration explored 100000 steps with 33333 reset in 1330 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 14 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-030A-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-030A-LTLCardinality-07 finished in 3939 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 573 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 573/573 places, 422/422 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 572 transition count 420
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 570 transition count 420
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 568 transition count 419
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 6 place count 568 transition count 418
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 567 transition count 418
Applied a total of 8 rules in 24 ms. Remains 567 /573 variables (removed 6) and now considering 418/422 (removed 4) transitions.
// Phase 1: matrix 418 rows 567 cols
[2024-05-29 03:25:48] [INFO ] Computed 269 invariants in 2 ms
[2024-05-29 03:25:48] [INFO ] Implicit Places using invariants in 309 ms returned [556]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 310 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 566/573 places, 418/422 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 565 transition count 417
Applied a total of 2 rules in 15 ms. Remains 565 /566 variables (removed 1) and now considering 417/418 (removed 1) transitions.
// Phase 1: matrix 417 rows 565 cols
[2024-05-29 03:25:48] [INFO ] Computed 268 invariants in 2 ms
[2024-05-29 03:25:48] [INFO ] Implicit Places using invariants in 292 ms returned []
[2024-05-29 03:25:48] [INFO ] Invariant cache hit.
[2024-05-29 03:25:49] [INFO ] Implicit Places using invariants and state equation in 508 ms returned []
Implicit Place search using SMT with State Equation took 802 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 565/573 places, 417/422 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1153 ms. Remains : 565/573 places, 417/422 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030A-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s188 0) (EQ s526 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 806 reset in 532 ms.
Stack based approach found an accepted trace after 45 steps with 0 reset with depth 46 and stack size 46 in 1 ms.
FORMULA ShieldIIPt-PT-030A-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-030A-LTLCardinality-09 finished in 1774 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (p1&&G(p0)))))'
Support contains 3 out of 573 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 573/573 places, 422/422 transitions.
Applied a total of 0 rules in 7 ms. Remains 573 /573 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 573 cols
[2024-05-29 03:25:49] [INFO ] Computed 271 invariants in 4 ms
[2024-05-29 03:25:50] [INFO ] Implicit Places using invariants in 321 ms returned []
[2024-05-29 03:25:50] [INFO ] Invariant cache hit.
[2024-05-29 03:25:50] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 889 ms to find 0 implicit places.
[2024-05-29 03:25:50] [INFO ] Invariant cache hit.
[2024-05-29 03:25:51] [INFO ] Dead Transitions using invariants and state equation in 282 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1181 ms. Remains : 573/573 places, 422/422 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-030A-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s348 0) (EQ s382 1)), p1:(EQ s505 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 550 ms.
Entered a terminal (fully accepting) state of product in 23324 steps with 0 reset in 165 ms.
FORMULA ShieldIIPt-PT-030A-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030A-LTLCardinality-10 finished in 2053 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 573 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 573/573 places, 422/422 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 573 transition count 421
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 572 transition count 421
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 571 transition count 420
Applied a total of 4 rules in 25 ms. Remains 571 /573 variables (removed 2) and now considering 420/422 (removed 2) transitions.
// Phase 1: matrix 420 rows 571 cols
[2024-05-29 03:25:52] [INFO ] Computed 271 invariants in 3 ms
[2024-05-29 03:25:52] [INFO ] Implicit Places using invariants in 323 ms returned [563, 564]
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 : 569/573 places, 420/422 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 569 transition count 419
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 568 transition count 419
Applied a total of 2 rules in 11 ms. Remains 568 /569 variables (removed 1) and now considering 419/420 (removed 1) transitions.
// Phase 1: matrix 419 rows 568 cols
[2024-05-29 03:25:52] [INFO ] Computed 269 invariants in 2 ms
[2024-05-29 03:25:52] [INFO ] Implicit Places using invariants in 311 ms returned [557]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 312 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 567/573 places, 419/422 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 566 transition count 418
Applied a total of 2 rules in 14 ms. Remains 566 /567 variables (removed 1) and now considering 418/419 (removed 1) transitions.
// Phase 1: matrix 418 rows 566 cols
[2024-05-29 03:25:52] [INFO ] Computed 268 invariants in 1 ms
[2024-05-29 03:25:53] [INFO ] Implicit Places using invariants in 332 ms returned []
[2024-05-29 03:25:53] [INFO ] Invariant cache hit.
[2024-05-29 03:25:53] [INFO ] Implicit Places using invariants and state equation in 571 ms returned []
Implicit Place search using SMT with State Equation took 905 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 566/573 places, 418/422 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1593 ms. Remains : 566/573 places, 418/422 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030A-LTLCardinality-11 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 s368 0) (EQ s164 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 541 ms.
Product exploration explored 100000 steps with 0 reset in 681 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Finished probabilistic random walk after 5724 steps, run visited all 1 properties in 45 ms. (steps per millisecond=127 )
Probabilistic random walk after 5724 steps, saw 5506 distinct states, run finished after 45 ms. (steps per millisecond=127 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 566 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 566/566 places, 418/418 transitions.
Applied a total of 0 rules in 15 ms. Remains 566 /566 variables (removed 0) and now considering 418/418 (removed 0) transitions.
[2024-05-29 03:25:55] [INFO ] Invariant cache hit.
[2024-05-29 03:25:55] [INFO ] Implicit Places using invariants in 339 ms returned []
[2024-05-29 03:25:55] [INFO ] Invariant cache hit.
[2024-05-29 03:25:56] [INFO ] Implicit Places using invariants and state equation in 556 ms returned []
Implicit Place search using SMT with State Equation took 898 ms to find 0 implicit places.
[2024-05-29 03:25:56] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-29 03:25:56] [INFO ] Invariant cache hit.
[2024-05-29 03:25:56] [INFO ] Dead Transitions using invariants and state equation in 265 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1186 ms. Remains : 566/566 places, 418/418 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 1) 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 1) seen :0
Finished probabilistic random walk after 5724 steps, run visited all 1 properties in 41 ms. (steps per millisecond=139 )
Probabilistic random walk after 5724 steps, saw 5506 distinct states, run finished after 42 ms. (steps per millisecond=136 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 313 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 534 ms.
Product exploration explored 100000 steps with 0 reset in 683 ms.
Built C files in :
/tmp/ltsmin13654019122997851132
[2024-05-29 03:25:58] [INFO ] Computing symmetric may disable matrix : 418 transitions.
[2024-05-29 03:25:58] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:25:58] [INFO ] Computing symmetric may enable matrix : 418 transitions.
[2024-05-29 03:25:58] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:25:58] [INFO ] Computing Do-Not-Accords matrix : 418 transitions.
[2024-05-29 03:25:58] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:25:58] [INFO ] Built C files in 80ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13654019122997851132
Running compilation step : cd /tmp/ltsmin13654019122997851132;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 999 ms.
Running link step : cd /tmp/ltsmin13654019122997851132;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin13654019122997851132;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7406893619386213728.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 566 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 566/566 places, 418/418 transitions.
Applied a total of 0 rules in 16 ms. Remains 566 /566 variables (removed 0) and now considering 418/418 (removed 0) transitions.
[2024-05-29 03:26:13] [INFO ] Invariant cache hit.
[2024-05-29 03:26:14] [INFO ] Implicit Places using invariants in 325 ms returned []
[2024-05-29 03:26:14] [INFO ] Invariant cache hit.
[2024-05-29 03:26:14] [INFO ] Implicit Places using invariants and state equation in 612 ms returned []
Implicit Place search using SMT with State Equation took 941 ms to find 0 implicit places.
[2024-05-29 03:26:14] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-29 03:26:14] [INFO ] Invariant cache hit.
[2024-05-29 03:26:15] [INFO ] Dead Transitions using invariants and state equation in 292 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1259 ms. Remains : 566/566 places, 418/418 transitions.
Built C files in :
/tmp/ltsmin17983605881712453130
[2024-05-29 03:26:15] [INFO ] Computing symmetric may disable matrix : 418 transitions.
[2024-05-29 03:26:15] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:26:15] [INFO ] Computing symmetric may enable matrix : 418 transitions.
[2024-05-29 03:26:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:26:15] [INFO ] Computing Do-Not-Accords matrix : 418 transitions.
[2024-05-29 03:26:15] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 03:26:15] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17983605881712453130
Running compilation step : cd /tmp/ltsmin17983605881712453130;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 883 ms.
Running link step : cd /tmp/ltsmin17983605881712453130;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin17983605881712453130;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1126029411577598708.hoa' '--buchi-type=spotba'
LTSmin run took 8247 ms.
FORMULA ShieldIIPt-PT-030A-LTLCardinality-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPt-PT-030A-LTLCardinality-11 finished in 32367 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0&&G(p1))||(p2&&F(p3)))))'
Support contains 6 out of 573 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 573/573 places, 422/422 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 573 transition count 421
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 572 transition count 421
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 571 transition count 420
Applied a total of 4 rules in 25 ms. Remains 571 /573 variables (removed 2) and now considering 420/422 (removed 2) transitions.
// Phase 1: matrix 420 rows 571 cols
[2024-05-29 03:26:24] [INFO ] Computed 271 invariants in 4 ms
[2024-05-29 03:26:24] [INFO ] Implicit Places using invariants in 345 ms returned [563, 564]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 346 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 569/573 places, 420/422 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 569 transition count 419
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 568 transition count 419
Applied a total of 2 rules in 13 ms. Remains 568 /569 variables (removed 1) and now considering 419/420 (removed 1) transitions.
// Phase 1: matrix 419 rows 568 cols
[2024-05-29 03:26:24] [INFO ] Computed 269 invariants in 2 ms
[2024-05-29 03:26:25] [INFO ] Implicit Places using invariants in 310 ms returned [557]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 311 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 567/573 places, 419/422 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 566 transition count 418
Applied a total of 2 rules in 16 ms. Remains 566 /567 variables (removed 1) and now considering 418/419 (removed 1) transitions.
// Phase 1: matrix 418 rows 566 cols
[2024-05-29 03:26:25] [INFO ] Computed 268 invariants in 2 ms
[2024-05-29 03:26:25] [INFO ] Implicit Places using invariants in 329 ms returned []
[2024-05-29 03:26:25] [INFO ] Invariant cache hit.
[2024-05-29 03:26:26] [INFO ] Implicit Places using invariants and state equation in 602 ms returned []
Implicit Place search using SMT with State Equation took 933 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 566/573 places, 418/422 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1646 ms. Remains : 566/573 places, 418/422 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : ShieldIIPt-PT-030A-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p1) p2 (NOT p3))), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1 p2 (NOT p3)), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=3 dest: 1}, { cond=(AND p1 (NOT p3)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s273 0) (EQ s538 1)), p2:(OR (EQ s136 0) (EQ s71 1)), p1:(AND (EQ s276 0) (EQ s171 1)), p3:(AND (EQ s71 0) (EQ s136 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 50000 reset in 1647 ms.
Product exploration explored 100000 steps with 50000 reset in 1717 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1) (NOT p3)), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND p1 (NOT p3)))), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT (AND p0 p1 (NOT p3)))), (X (NOT (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p1) p2 (NOT p3))))), (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p1) p2 (NOT p3)))))), (X (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 25 factoid took 123 ms. Reduced automaton from 4 states, 12 edges and 4 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-030A-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-030A-LTLCardinality-13 finished in 5343 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p1)||p0))))'
Support contains 3 out of 573 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 573/573 places, 422/422 transitions.
Applied a total of 0 rules in 10 ms. Remains 573 /573 variables (removed 0) and now considering 422/422 (removed 0) transitions.
// Phase 1: matrix 422 rows 573 cols
[2024-05-29 03:26:29] [INFO ] Computed 271 invariants in 2 ms
[2024-05-29 03:26:30] [INFO ] Implicit Places using invariants in 339 ms returned []
[2024-05-29 03:26:30] [INFO ] Invariant cache hit.
[2024-05-29 03:26:30] [INFO ] Implicit Places using invariants and state equation in 582 ms returned []
Implicit Place search using SMT with State Equation took 923 ms to find 0 implicit places.
[2024-05-29 03:26:30] [INFO ] Invariant cache hit.
[2024-05-29 03:26:30] [INFO ] Dead Transitions using invariants and state equation in 286 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1220 ms. Remains : 573/573 places, 422/422 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-030A-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s376 1), p0:(OR (EQ s116 0) (EQ s399 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 56719 steps with 0 reset in 310 ms.
FORMULA ShieldIIPt-PT-030A-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030A-LTLCardinality-14 finished in 1676 ms.
All properties solved by simple procedures.
Total runtime 74101 ms.

BK_STOP 1716953192375

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-030A"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is ShieldIIPt-PT-030A, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r373-tall-171683788700182"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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