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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 680K
-rw-r--r-- 1 mcc users 7.4K Feb 25 21:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 25 21:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 20:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 25 20:58 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.9K Feb 25 17:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 21:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Feb 25 21:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 25 21:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 21:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:00 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 201K 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 ShieldPPPt-PT-030A-LTLCardinality-00
FORMULA_NAME ShieldPPPt-PT-030A-LTLCardinality-01
FORMULA_NAME ShieldPPPt-PT-030A-LTLCardinality-02
FORMULA_NAME ShieldPPPt-PT-030A-LTLCardinality-03
FORMULA_NAME ShieldPPPt-PT-030A-LTLCardinality-04
FORMULA_NAME ShieldPPPt-PT-030A-LTLCardinality-05
FORMULA_NAME ShieldPPPt-PT-030A-LTLCardinality-06
FORMULA_NAME ShieldPPPt-PT-030A-LTLCardinality-07
FORMULA_NAME ShieldPPPt-PT-030A-LTLCardinality-08
FORMULA_NAME ShieldPPPt-PT-030A-LTLCardinality-09
FORMULA_NAME ShieldPPPt-PT-030A-LTLCardinality-10
FORMULA_NAME ShieldPPPt-PT-030A-LTLCardinality-11
FORMULA_NAME ShieldPPPt-PT-030A-LTLCardinality-12
FORMULA_NAME ShieldPPPt-PT-030A-LTLCardinality-13
FORMULA_NAME ShieldPPPt-PT-030A-LTLCardinality-14
FORMULA_NAME ShieldPPPt-PT-030A-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679465681524

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=ShieldPPPt-PT-030A
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 06:14:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 06:14:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 06:14:44] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2023-03-22 06:14:44] [INFO ] Transformed 753 places.
[2023-03-22 06:14:44] [INFO ] Transformed 543 transitions.
[2023-03-22 06:14:44] [INFO ] Found NUPN structural information;
[2023-03-22 06:14:44] [INFO ] Parsed PT model containing 753 places and 543 transitions and 2166 arcs in 205 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 3 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldPPPt-PT-030A-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030A-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030A-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030A-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030A-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030A-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 68 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
// Phase 1: matrix 542 rows 753 cols
[2023-03-22 06:14:44] [INFO ] Computed 331 place invariants in 14 ms
[2023-03-22 06:14:45] [INFO ] Implicit Places using invariants in 1146 ms returned []
[2023-03-22 06:14:45] [INFO ] Invariant cache hit.
[2023-03-22 06:14:47] [INFO ] Implicit Places using invariants and state equation in 1360 ms returned []
Implicit Place search using SMT with State Equation took 2536 ms to find 0 implicit places.
[2023-03-22 06:14:47] [INFO ] Invariant cache hit.
[2023-03-22 06:14:47] [INFO ] Dead Transitions using invariants and state equation in 443 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3061 ms. Remains : 753/753 places, 542/542 transitions.
Support contains 36 out of 753 places after structural reductions.
[2023-03-22 06:14:47] [INFO ] Flatten gal took : 122 ms
[2023-03-22 06:14:48] [INFO ] Flatten gal took : 74 ms
[2023-03-22 06:14:48] [INFO ] Input system was already deterministic with 542 transitions.
Support contains 30 out of 753 places (down from 36) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 531 ms. (steps per millisecond=18 ) properties (out of 18) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 11) 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 11) 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 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-22 06:14:49] [INFO ] Invariant cache hit.
[2023-03-22 06:14:50] [INFO ] [Real]Absence check using 331 positive place invariants in 79 ms returned sat
[2023-03-22 06:14:51] [INFO ] After 1872ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-22 06:14:52] [INFO ] [Nat]Absence check using 331 positive place invariants in 75 ms returned sat
[2023-03-22 06:14:53] [INFO ] After 1019ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-22 06:14:54] [INFO ] After 1990ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 681 ms.
[2023-03-22 06:14:54] [INFO ] After 3379ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 6 properties in 1044 ms.
Support contains 8 out of 753 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 753/753 places, 542/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 751 transition count 540
Partial Free-agglomeration rule applied 116 times.
Drop transitions removed 116 transitions
Iterating global reduction 0 with 116 rules applied. Total rules applied 120 place count 751 transition count 540
Applied a total of 120 rules in 141 ms. Remains 751 /753 variables (removed 2) and now considering 540/542 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 751/753 places, 540/542 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 540 rows 751 cols
[2023-03-22 06:14:56] [INFO ] Computed 331 place invariants in 4 ms
[2023-03-22 06:14:56] [INFO ] [Real]Absence check using 331 positive place invariants in 85 ms returned sat
[2023-03-22 06:14:57] [INFO ] After 744ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 06:14:57] [INFO ] [Nat]Absence check using 331 positive place invariants in 65 ms returned sat
[2023-03-22 06:14:57] [INFO ] After 327ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 06:14:57] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 06:14:58] [INFO ] After 119ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-22 06:14:58] [INFO ] Deduced a trap composed of 8 places in 171 ms of which 3 ms to minimize.
[2023-03-22 06:14:58] [INFO ] Deduced a trap composed of 7 places in 191 ms of which 27 ms to minimize.
[2023-03-22 06:14:59] [INFO ] Deduced a trap composed of 6 places in 223 ms of which 29 ms to minimize.
[2023-03-22 06:14:59] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 0 ms to minimize.
[2023-03-22 06:14:59] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 0 ms to minimize.
[2023-03-22 06:14:59] [INFO ] Deduced a trap composed of 6 places in 182 ms of which 1 ms to minimize.
[2023-03-22 06:14:59] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 0 ms to minimize.
[2023-03-22 06:14:59] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 1 ms to minimize.
[2023-03-22 06:14:59] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1666 ms
[2023-03-22 06:14:59] [INFO ] After 2016ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 130 ms.
[2023-03-22 06:15:00] [INFO ] After 2880ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 109 ms.
Support contains 6 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 540/540 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 751 transition count 540
Applied a total of 1 rules in 136 ms. Remains 751 /751 variables (removed 0) and now considering 540/540 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 751/751 places, 540/540 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 164218 steps, run timeout after 3002 ms. (steps per millisecond=54 ) properties seen :{0=1, 2=1}
Probabilistic random walk after 164218 steps, saw 157235 distinct states, run finished after 3003 ms. (steps per millisecond=54 ) properties seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 540 rows 751 cols
[2023-03-22 06:15:03] [INFO ] Computed 331 place invariants in 5 ms
[2023-03-22 06:15:04] [INFO ] [Real]Absence check using 331 positive place invariants in 63 ms returned sat
[2023-03-22 06:15:04] [INFO ] After 470ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 06:15:04] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-22 06:15:04] [INFO ] After 68ms SMT Verify possible using 31 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 06:15:04] [INFO ] After 826ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 06:15:04] [INFO ] [Nat]Absence check using 331 positive place invariants in 78 ms returned sat
[2023-03-22 06:15:05] [INFO ] After 271ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 06:15:05] [INFO ] After 47ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 06:15:05] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 1 ms to minimize.
[2023-03-22 06:15:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 211 ms
[2023-03-22 06:15:05] [INFO ] After 305ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-22 06:15:05] [INFO ] After 854ms 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 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 540/540 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 750 transition count 539
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 749 transition count 539
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 2 place count 749 transition count 537
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 747 transition count 537
Applied a total of 6 rules in 134 ms. Remains 747 /751 variables (removed 4) and now considering 537/540 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 747/751 places, 537/540 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Finished probabilistic random walk after 260420 steps, run visited all 1 properties in 2291 ms. (steps per millisecond=113 )
Probabilistic random walk after 260420 steps, saw 249694 distinct states, run finished after 2292 ms. (steps per millisecond=113 ) properties seen :1
FORMULA ShieldPPPt-PT-030A-LTLCardinality-11 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((p0||F(G(p1)))))'
Support contains 3 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 25 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
// Phase 1: matrix 542 rows 753 cols
[2023-03-22 06:15:08] [INFO ] Computed 331 place invariants in 3 ms
[2023-03-22 06:15:09] [INFO ] Implicit Places using invariants in 717 ms returned []
[2023-03-22 06:15:09] [INFO ] Invariant cache hit.
[2023-03-22 06:15:10] [INFO ] Implicit Places using invariants and state equation in 1441 ms returned []
Implicit Place search using SMT with State Equation took 2161 ms to find 0 implicit places.
[2023-03-22 06:15:10] [INFO ] Invariant cache hit.
[2023-03-22 06:15:11] [INFO ] Dead Transitions using invariants and state equation in 482 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2681 ms. Remains : 753/753 places, 542/542 transitions.
Stuttering acceptance computed with spot in 282 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-030A-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(EQ s546 0), p1:(AND (EQ s546 0) (EQ s490 0) (EQ s553 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 648 ms.
Stack based approach found an accepted trace after 30 steps with 0 reset with depth 31 and stack size 31 in 0 ms.
FORMULA ShieldPPPt-PT-030A-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030A-LTLCardinality-00 finished in 3689 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((p0||X(p1))))'
Support contains 3 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 25 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
[2023-03-22 06:15:12] [INFO ] Invariant cache hit.
[2023-03-22 06:15:12] [INFO ] Implicit Places using invariants in 832 ms returned []
[2023-03-22 06:15:12] [INFO ] Invariant cache hit.
[2023-03-22 06:15:13] [INFO ] Implicit Places using invariants and state equation in 963 ms returned []
Implicit Place search using SMT with State Equation took 1810 ms to find 0 implicit places.
[2023-03-22 06:15:13] [INFO ] Invariant cache hit.
[2023-03-22 06:15:14] [INFO ] Dead Transitions using invariants and state equation in 595 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2431 ms. Remains : 753/753 places, 542/542 transitions.
Stuttering acceptance computed with spot in 98 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-030A-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s521 1), p1:(OR (EQ s381 0) (EQ s610 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][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 570 ms.
Product exploration explored 100000 steps with 0 reset in 674 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p0), true, (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 469 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 06:15:16] [INFO ] Invariant cache hit.
[2023-03-22 06:15:16] [INFO ] [Real]Absence check using 331 positive place invariants in 60 ms returned sat
[2023-03-22 06:15:17] [INFO ] After 247ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 06:15:17] [INFO ] After 314ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-22 06:15:17] [INFO ] After 577ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 753 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 753/753 places, 542/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 751 transition count 540
Partial Free-agglomeration rule applied 118 times.
Drop transitions removed 118 transitions
Iterating global reduction 0 with 118 rules applied. Total rules applied 122 place count 751 transition count 540
Applied a total of 122 rules in 62 ms. Remains 751 /753 variables (removed 2) and now considering 540/542 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 751/753 places, 540/542 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Finished probabilistic random walk after 36603 steps, run visited all 1 properties in 294 ms. (steps per millisecond=124 )
Probabilistic random walk after 36603 steps, saw 34274 distinct states, run finished after 295 ms. (steps per millisecond=124 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p0), true, (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p0)))), (F p0), (F (AND p1 p0)), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 736 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 105 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 8 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
[2023-03-22 06:15:18] [INFO ] Invariant cache hit.
[2023-03-22 06:15:19] [INFO ] Implicit Places using invariants in 491 ms returned []
[2023-03-22 06:15:19] [INFO ] Invariant cache hit.
[2023-03-22 06:15:20] [INFO ] Implicit Places using invariants and state equation in 1088 ms returned []
Implicit Place search using SMT with State Equation took 1601 ms to find 0 implicit places.
[2023-03-22 06:15:20] [INFO ] Invariant cache hit.
[2023-03-22 06:15:20] [INFO ] Dead Transitions using invariants and state equation in 428 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2038 ms. Remains : 753/753 places, 542/542 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (AND p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X p0), true, (X (X p1)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 437 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 06:15:21] [INFO ] Invariant cache hit.
[2023-03-22 06:15:21] [INFO ] [Real]Absence check using 331 positive place invariants in 50 ms returned sat
[2023-03-22 06:15:21] [INFO ] After 262ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 06:15:21] [INFO ] After 322ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-22 06:15:21] [INFO ] After 580ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 753 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 753/753 places, 542/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 751 transition count 540
Partial Free-agglomeration rule applied 118 times.
Drop transitions removed 118 transitions
Iterating global reduction 0 with 118 rules applied. Total rules applied 122 place count 751 transition count 540
Applied a total of 122 rules in 77 ms. Remains 751 /753 variables (removed 2) and now considering 540/542 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 751/753 places, 540/542 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Finished probabilistic random walk after 36603 steps, run visited all 1 properties in 283 ms. (steps per millisecond=129 )
Probabilistic random walk after 36603 steps, saw 34274 distinct states, run finished after 283 ms. (steps per millisecond=129 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (AND p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X p0), true, (X (X p1)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p0)))), (F p0), (F (AND p1 p0)), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 649 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 99 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 112 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 515 ms.
Product exploration explored 100000 steps with 0 reset in 592 ms.
Support contains 3 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 16 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
[2023-03-22 06:15:24] [INFO ] Invariant cache hit.
[2023-03-22 06:15:25] [INFO ] Implicit Places using invariants in 647 ms returned []
[2023-03-22 06:15:25] [INFO ] Invariant cache hit.
[2023-03-22 06:15:26] [INFO ] Implicit Places using invariants and state equation in 741 ms returned []
Implicit Place search using SMT with State Equation took 1410 ms to find 0 implicit places.
[2023-03-22 06:15:26] [INFO ] Invariant cache hit.
[2023-03-22 06:15:26] [INFO ] Dead Transitions using invariants and state equation in 530 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1992 ms. Remains : 753/753 places, 542/542 transitions.
Treatment of property ShieldPPPt-PT-030A-LTLCardinality-01 finished in 14827 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 753 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Reduce places removed 1 places and 1 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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 750 transition count 540
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 3 place count 750 transition count 538
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 748 transition count 538
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 9 place count 747 transition count 537
Applied a total of 9 rules in 77 ms. Remains 747 /753 variables (removed 6) and now considering 537/542 (removed 5) transitions.
// Phase 1: matrix 537 rows 747 cols
[2023-03-22 06:15:26] [INFO ] Computed 330 place invariants in 1 ms
[2023-03-22 06:15:27] [INFO ] Implicit Places using invariants in 422 ms returned [730, 734]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 438 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 745/753 places, 537/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 743 transition count 535
Applied a total of 4 rules in 24 ms. Remains 743 /745 variables (removed 2) and now considering 535/537 (removed 2) transitions.
// Phase 1: matrix 535 rows 743 cols
[2023-03-22 06:15:27] [INFO ] Computed 328 place invariants in 2 ms
[2023-03-22 06:15:27] [INFO ] Implicit Places using invariants in 402 ms returned []
[2023-03-22 06:15:27] [INFO ] Invariant cache hit.
[2023-03-22 06:15:28] [INFO ] Implicit Places using invariants and state equation in 899 ms returned []
Implicit Place search using SMT with State Equation took 1326 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 743/753 places, 535/542 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1878 ms. Remains : 743/753 places, 535/542 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030A-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s648 0) (EQ s240 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1 reset in 467 ms.
Stack based approach found an accepted trace after 74 steps with 0 reset with depth 75 and stack size 75 in 1 ms.
FORMULA ShieldPPPt-PT-030A-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030A-LTLCardinality-02 finished in 2399 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U ((p1 U (!p2||X(p1))) U G(p1))))'
Support contains 5 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 8 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
// Phase 1: matrix 542 rows 753 cols
[2023-03-22 06:15:29] [INFO ] Computed 331 place invariants in 3 ms
[2023-03-22 06:15:29] [INFO ] Implicit Places using invariants in 499 ms returned []
[2023-03-22 06:15:29] [INFO ] Invariant cache hit.
[2023-03-22 06:15:30] [INFO ] Implicit Places using invariants and state equation in 997 ms returned []
Implicit Place search using SMT with State Equation took 1505 ms to find 0 implicit places.
[2023-03-22 06:15:30] [INFO ] Invariant cache hit.
[2023-03-22 06:15:31] [INFO ] Dead Transitions using invariants and state equation in 450 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1964 ms. Remains : 753/753 places, 542/542 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030A-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s706 1), p2:(OR (EQ s349 0) (EQ s697 1)), p0:(OR (EQ s72 0) (EQ s509 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 525 ms.
Product exploration explored 100000 steps with 0 reset in 650 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p2)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), true, (X (X (AND (NOT p1) p2))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 460 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) 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 3) seen :0
Running SMT prover for 3 properties.
[2023-03-22 06:15:33] [INFO ] Invariant cache hit.
[2023-03-22 06:15:33] [INFO ] [Real]Absence check using 331 positive place invariants in 85 ms returned sat
[2023-03-22 06:15:34] [INFO ] After 608ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 06:15:34] [INFO ] [Nat]Absence check using 331 positive place invariants in 49 ms returned sat
[2023-03-22 06:15:34] [INFO ] After 393ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 06:15:35] [INFO ] After 589ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 118 ms.
[2023-03-22 06:15:35] [INFO ] After 1068ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 34 ms.
Support contains 5 out of 753 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 753/753 places, 542/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 751 transition count 540
Partial Free-agglomeration rule applied 116 times.
Drop transitions removed 116 transitions
Iterating global reduction 0 with 116 rules applied. Total rules applied 120 place count 751 transition count 540
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 121 place count 750 transition count 539
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 122 place count 749 transition count 539
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 122 place count 749 transition count 537
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 126 place count 747 transition count 537
Applied a total of 126 rules in 78 ms. Remains 747 /753 variables (removed 6) and now considering 537/542 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 747/753 places, 537/542 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 186410 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 186410 steps, saw 179734 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 537 rows 747 cols
[2023-03-22 06:15:38] [INFO ] Computed 330 place invariants in 2 ms
[2023-03-22 06:15:38] [INFO ] [Real]Absence check using 330 positive place invariants in 137 ms returned sat
[2023-03-22 06:15:38] [INFO ] After 300ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 06:15:39] [INFO ] [Nat]Absence check using 330 positive place invariants in 69 ms returned sat
[2023-03-22 06:15:39] [INFO ] After 234ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 06:15:39] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 06:15:39] [INFO ] After 74ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 06:15:39] [INFO ] After 159ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-22 06:15:39] [INFO ] After 707ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 5 out of 747 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 747/747 places, 537/537 transitions.
Applied a total of 0 rules in 34 ms. Remains 747 /747 variables (removed 0) and now considering 537/537 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 747/747 places, 537/537 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) 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 266865 steps, run visited all 1 properties in 2168 ms. (steps per millisecond=123 )
Probabilistic random walk after 266865 steps, saw 258418 distinct states, run finished after 2181 ms. (steps per millisecond=122 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p2)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), true, (X (X (AND (NOT p1) p2))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))), (F (NOT p0)), (F (OR (NOT p2) p1)), (F p1), (F (NOT (AND p2 (NOT p1)))), (F (AND (NOT p0) p2 (NOT p1)))]
Knowledge based reduction with 9 factoid took 643 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
// Phase 1: matrix 542 rows 753 cols
[2023-03-22 06:15:42] [INFO ] Computed 331 place invariants in 4 ms
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p2)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), true, (X (X (AND (NOT p1) p2))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))), (F (NOT p0)), (F (OR (NOT p2) p1)), (F p1), (F (NOT (AND p2 (NOT p1)))), (F (AND (NOT p0) p2 (NOT p1))), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 9 factoid took 410 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-030A-LTLCardinality-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-030A-LTLCardinality-06 finished in 14585 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 753 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 751 transition count 540
Applied a total of 4 rules in 70 ms. Remains 751 /753 variables (removed 2) and now considering 540/542 (removed 2) transitions.
// Phase 1: matrix 540 rows 751 cols
[2023-03-22 06:15:43] [INFO ] Computed 331 place invariants in 1 ms
[2023-03-22 06:15:44] [INFO ] Implicit Places using invariants in 508 ms returned [744]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 522 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 750/753 places, 540/542 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 750 transition count 538
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 748 transition count 538
Applied a total of 4 rules in 38 ms. Remains 748 /750 variables (removed 2) and now considering 538/540 (removed 2) transitions.
// Phase 1: matrix 538 rows 748 cols
[2023-03-22 06:15:44] [INFO ] Computed 330 place invariants in 2 ms
[2023-03-22 06:15:45] [INFO ] Implicit Places using invariants in 494 ms returned [731, 735]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 501 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 746/753 places, 538/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 744 transition count 536
Applied a total of 4 rules in 43 ms. Remains 744 /746 variables (removed 2) and now considering 536/538 (removed 2) transitions.
// Phase 1: matrix 536 rows 744 cols
[2023-03-22 06:15:45] [INFO ] Computed 328 place invariants in 1 ms
[2023-03-22 06:15:45] [INFO ] Implicit Places using invariants in 453 ms returned []
[2023-03-22 06:15:45] [INFO ] Invariant cache hit.
[2023-03-22 06:15:46] [INFO ] Implicit Places using invariants and state equation in 945 ms returned []
Implicit Place search using SMT with State Equation took 1431 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 744/753 places, 536/542 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2627 ms. Remains : 744/753 places, 536/542 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030A-LTLCardinality-07 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 (NEQ s343 0) (NEQ s603 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 515 ms.
Stack based approach found an accepted trace after 28 steps with 0 reset with depth 29 and stack size 29 in 0 ms.
FORMULA ShieldPPPt-PT-030A-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030A-LTLCardinality-07 finished in 3225 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G((!p0||(!p1&&X(F(!p2))))))))'
Support contains 6 out of 753 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 751 transition count 540
Applied a total of 4 rules in 31 ms. Remains 751 /753 variables (removed 2) and now considering 540/542 (removed 2) transitions.
// Phase 1: matrix 540 rows 751 cols
[2023-03-22 06:15:47] [INFO ] Computed 331 place invariants in 2 ms
[2023-03-22 06:15:47] [INFO ] Implicit Places using invariants in 788 ms returned [744]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 789 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 750/753 places, 540/542 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 750 transition count 538
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 748 transition count 538
Applied a total of 4 rules in 15 ms. Remains 748 /750 variables (removed 2) and now considering 538/540 (removed 2) transitions.
// Phase 1: matrix 538 rows 748 cols
[2023-03-22 06:15:47] [INFO ] Computed 330 place invariants in 2 ms
[2023-03-22 06:15:48] [INFO ] Implicit Places using invariants in 461 ms returned [731, 735]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 475 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 746/753 places, 538/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 744 transition count 536
Applied a total of 4 rules in 36 ms. Remains 744 /746 variables (removed 2) and now considering 536/538 (removed 2) transitions.
// Phase 1: matrix 536 rows 744 cols
[2023-03-22 06:15:48] [INFO ] Computed 328 place invariants in 2 ms
[2023-03-22 06:15:48] [INFO ] Implicit Places using invariants in 416 ms returned []
[2023-03-22 06:15:48] [INFO ] Invariant cache hit.
[2023-03-22 06:15:49] [INFO ] Implicit Places using invariants and state equation in 804 ms returned []
Implicit Place search using SMT with State Equation took 1266 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 744/753 places, 536/542 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2612 ms. Remains : 744/753 places, 536/542 transitions.
Stuttering acceptance computed with spot in 332 ms :[(OR (AND p0 p1) (AND p0 p2)), (OR (AND p0 p1) (AND p0 p2)), true, p2, (AND p0 p2), (AND p2 p0)]
Running random walk in product with property : ShieldPPPt-PT-030A-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 p2), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 p2), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(OR (EQ s53 0) (EQ s212 1)), p1:(OR (EQ s298 0) (EQ s697 1)), p2:(OR (EQ s568 0) (EQ s228 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 530 ms.
Product exploration explored 100000 steps with 0 reset in 598 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 p1 p2), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p2))), (X (OR (NOT p0) (NOT p1))), (X (AND (NOT p0) p2)), (X (X p2)), (X (X (NOT p0))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p2)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p2)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 837 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 170 ms :[(OR (AND p0 p1) (AND p0 p2)), (AND p0 p1), true, p2]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 06:15:52] [INFO ] Invariant cache hit.
[2023-03-22 06:15:52] [INFO ] [Real]Absence check using 328 positive place invariants in 91 ms returned sat
[2023-03-22 06:15:52] [INFO ] After 360ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 06:15:53] [INFO ] [Nat]Absence check using 328 positive place invariants in 99 ms returned sat
[2023-03-22 06:15:53] [INFO ] After 444ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 06:15:53] [INFO ] After 702ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 201 ms.
[2023-03-22 06:15:54] [INFO ] After 1198ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 740 steps, including 0 resets, run visited all 2 properties in 15 ms. (steps per millisecond=49 )
Parikh walk visited 2 properties in 17 ms.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p2))), (X (OR (NOT p0) (NOT p1))), (X (AND (NOT p0) p2)), (X (X p2)), (X (X (NOT p0))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p2)))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p2)))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p0)), (F (OR (NOT p1) (NOT p0))), (F (AND (NOT p1) p0)), (F (NOT (AND p1 p0)))]
Knowledge based reduction with 15 factoid took 997 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[(OR (AND p0 p1) (AND p0 p2)), (AND p0 p1), true, p2]
Stuttering acceptance computed with spot in 157 ms :[(OR (AND p0 p1) (AND p0 p2)), (AND p0 p1), true, p2]
[2023-03-22 06:15:55] [INFO ] Invariant cache hit.
[2023-03-22 06:15:56] [INFO ] [Real]Absence check using 328 positive place invariants in 225 ms returned sat
[2023-03-22 06:15:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 06:15:56] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2023-03-22 06:15:56] [INFO ] Computed and/alt/rep : 535/1667/535 causal constraints (skipped 0 transitions) in 35 ms.
[2023-03-22 06:15:56] [INFO ] Added : 0 causal constraints over 0 iterations in 101 ms. Result :sat
Could not prove EG (AND p0 p1)
Support contains 6 out of 744 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 744/744 places, 536/536 transitions.
Applied a total of 0 rules in 33 ms. Remains 744 /744 variables (removed 0) and now considering 536/536 (removed 0) transitions.
[2023-03-22 06:15:56] [INFO ] Invariant cache hit.
[2023-03-22 06:15:56] [INFO ] Implicit Places using invariants in 386 ms returned []
[2023-03-22 06:15:56] [INFO ] Invariant cache hit.
[2023-03-22 06:15:57] [INFO ] Implicit Places using invariants and state equation in 1019 ms returned []
Implicit Place search using SMT with State Equation took 1435 ms to find 0 implicit places.
[2023-03-22 06:15:57] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-22 06:15:58] [INFO ] Invariant cache hit.
[2023-03-22 06:15:58] [INFO ] Dead Transitions using invariants and state equation in 432 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1942 ms. Remains : 744/744 places, 536/536 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 p2), (X (NOT p0)), (X (OR (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (X p2)), (X (X (NOT p0))), true, (X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 584 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 223 ms :[(OR (AND p0 p1) (AND p0 p2)), (AND p0 p1), true, p2]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 06:15:59] [INFO ] Invariant cache hit.
[2023-03-22 06:15:59] [INFO ] [Real]Absence check using 328 positive place invariants in 73 ms returned sat
[2023-03-22 06:15:59] [INFO ] After 239ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 06:16:00] [INFO ] [Nat]Absence check using 328 positive place invariants in 45 ms returned sat
[2023-03-22 06:16:00] [INFO ] After 536ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 06:16:00] [INFO ] After 751ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 207 ms.
[2023-03-22 06:16:01] [INFO ] After 1147ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 802 steps, including 0 resets, run visited all 2 properties in 28 ms. (steps per millisecond=28 )
Parikh walk visited 2 properties in 27 ms.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT p0)), (X (OR (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (X p2)), (X (X (NOT p0))), true, (X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p0)), (F (OR (NOT p0) (NOT p1))), (F (AND p0 (NOT p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 11 factoid took 885 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 210 ms :[(OR (AND p0 p1) (AND p0 p2)), (AND p0 p1), true, p2]
Stuttering acceptance computed with spot in 201 ms :[(OR (AND p0 p1) (AND p0 p2)), (AND p0 p1), true, p2]
[2023-03-22 06:16:02] [INFO ] Invariant cache hit.
[2023-03-22 06:16:03] [INFO ] [Real]Absence check using 328 positive place invariants in 140 ms returned sat
[2023-03-22 06:16:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 06:16:03] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2023-03-22 06:16:03] [INFO ] Computed and/alt/rep : 535/1667/535 causal constraints (skipped 0 transitions) in 48 ms.
[2023-03-22 06:16:03] [INFO ] Added : 0 causal constraints over 0 iterations in 127 ms. Result :sat
Could not prove EG (AND p0 p1)
Stuttering acceptance computed with spot in 156 ms :[(OR (AND p0 p1) (AND p0 p2)), (AND p0 p1), true, p2]
Product exploration explored 100000 steps with 0 reset in 556 ms.
Product exploration explored 100000 steps with 0 reset in 779 ms.
Support contains 6 out of 744 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 744/744 places, 536/536 transitions.
Applied a total of 0 rules in 39 ms. Remains 744 /744 variables (removed 0) and now considering 536/536 (removed 0) transitions.
[2023-03-22 06:16:05] [INFO ] Invariant cache hit.
[2023-03-22 06:16:05] [INFO ] Implicit Places using invariants in 601 ms returned []
[2023-03-22 06:16:05] [INFO ] Invariant cache hit.
[2023-03-22 06:16:06] [INFO ] Implicit Places using invariants and state equation in 942 ms returned []
Implicit Place search using SMT with State Equation took 1544 ms to find 0 implicit places.
[2023-03-22 06:16:06] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-22 06:16:06] [INFO ] Invariant cache hit.
[2023-03-22 06:16:07] [INFO ] Dead Transitions using invariants and state equation in 503 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2097 ms. Remains : 744/744 places, 536/536 transitions.
Treatment of property ShieldPPPt-PT-030A-LTLCardinality-08 finished in 20050 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||(F(!p1) U G(p0))))))'
Support contains 1 out of 753 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 : 753/753 places, 542/542 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 752 transition count 541
Applied a total of 2 rules in 57 ms. Remains 752 /753 variables (removed 1) and now considering 541/542 (removed 1) transitions.
// Phase 1: matrix 541 rows 752 cols
[2023-03-22 06:16:07] [INFO ] Computed 331 place invariants in 2 ms
[2023-03-22 06:16:07] [INFO ] Implicit Places using invariants in 672 ms returned []
[2023-03-22 06:16:07] [INFO ] Invariant cache hit.
[2023-03-22 06:16:08] [INFO ] Implicit Places using invariants and state equation in 822 ms returned []
Implicit Place search using SMT with State Equation took 1520 ms to find 0 implicit places.
[2023-03-22 06:16:08] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-22 06:16:08] [INFO ] Invariant cache hit.
[2023-03-22 06:16:09] [INFO ] Dead Transitions using invariants and state equation in 484 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 752/753 places, 541/542 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2090 ms. Remains : 752/753 places, 541/542 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-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:(EQ s513 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 8 reset in 649 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA ShieldPPPt-PT-030A-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030A-LTLCardinality-09 finished in 2911 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&&G(p1)))))'
Support contains 4 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 7 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
// Phase 1: matrix 542 rows 753 cols
[2023-03-22 06:16:10] [INFO ] Computed 331 place invariants in 2 ms
[2023-03-22 06:16:10] [INFO ] Implicit Places using invariants in 521 ms returned []
[2023-03-22 06:16:10] [INFO ] Invariant cache hit.
[2023-03-22 06:16:11] [INFO ] Implicit Places using invariants and state equation in 928 ms returned []
Implicit Place search using SMT with State Equation took 1464 ms to find 0 implicit places.
[2023-03-22 06:16:11] [INFO ] Invariant cache hit.
[2023-03-22 06:16:12] [INFO ] Dead Transitions using invariants and state equation in 467 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1947 ms. Remains : 753/753 places, 542/542 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-030A-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s47 0) (EQ s157 1)), p1:(OR (EQ s47 0) (EQ s157 1) (EQ s728 0) (EQ s152 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 464 ms.
Product exploration explored 100000 steps with 0 reset in 860 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 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 373 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 265885 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 265885 steps, saw 259172 distinct states, run finished after 3008 ms. (steps per millisecond=88 ) properties seen :2
Running SMT prover for 1 properties.
[2023-03-22 06:16:17] [INFO ] Invariant cache hit.
[2023-03-22 06:16:17] [INFO ] [Real]Absence check using 331 positive place invariants in 108 ms returned sat
[2023-03-22 06:16:18] [INFO ] After 706ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 06:16:18] [INFO ] [Nat]Absence check using 331 positive place invariants in 47 ms returned sat
[2023-03-22 06:16:18] [INFO ] After 358ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 06:16:18] [INFO ] After 497ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 106 ms.
[2023-03-22 06:16:18] [INFO ] After 827ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 58 ms.
Support contains 4 out of 753 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 753/753 places, 542/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 15 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 751 transition count 540
Partial Free-agglomeration rule applied 117 times.
Drop transitions removed 117 transitions
Iterating global reduction 0 with 117 rules applied. Total rules applied 121 place count 751 transition count 540
Applied a total of 121 rules in 81 ms. Remains 751 /753 variables (removed 2) and now considering 540/542 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 751/753 places, 540/542 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 370404 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :{}
Probabilistic random walk after 370404 steps, saw 358728 distinct states, run finished after 3003 ms. (steps per millisecond=123 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 540 rows 751 cols
[2023-03-22 06:16:22] [INFO ] Computed 331 place invariants in 5 ms
[2023-03-22 06:16:22] [INFO ] [Real]Absence check using 331 positive place invariants in 185 ms returned sat
[2023-03-22 06:16:23] [INFO ] After 892ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 06:16:23] [INFO ] [Nat]Absence check using 331 positive place invariants in 64 ms returned sat
[2023-03-22 06:16:23] [INFO ] After 420ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 06:16:23] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-22 06:16:23] [INFO ] After 70ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 06:16:24] [INFO ] After 188ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-03-22 06:16:24] [INFO ] After 947ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 ms.
Support contains 4 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 540/540 transitions.
Applied a total of 0 rules in 15 ms. Remains 751 /751 variables (removed 0) and now considering 540/540 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 751/751 places, 540/540 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 540/540 transitions.
Applied a total of 0 rules in 11 ms. Remains 751 /751 variables (removed 0) and now considering 540/540 (removed 0) transitions.
[2023-03-22 06:16:24] [INFO ] Invariant cache hit.
[2023-03-22 06:16:24] [INFO ] Implicit Places using invariants in 479 ms returned [744]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 485 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 750/751 places, 540/540 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 750 transition count 538
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 748 transition count 538
Applied a total of 4 rules in 14 ms. Remains 748 /750 variables (removed 2) and now considering 538/540 (removed 2) transitions.
// Phase 1: matrix 538 rows 748 cols
[2023-03-22 06:16:24] [INFO ] Computed 330 place invariants in 1 ms
[2023-03-22 06:16:25] [INFO ] Implicit Places using invariants in 570 ms returned [731, 735]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 584 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 746/751 places, 538/540 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 744 transition count 536
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 744 transition count 536
Applied a total of 4 rules in 42 ms. Remains 744 /746 variables (removed 2) and now considering 536/538 (removed 2) transitions.
// Phase 1: matrix 536 rows 744 cols
[2023-03-22 06:16:25] [INFO ] Computed 328 place invariants in 1 ms
[2023-03-22 06:16:25] [INFO ] Implicit Places using invariants in 405 ms returned []
[2023-03-22 06:16:25] [INFO ] Invariant cache hit.
[2023-03-22 06:16:26] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-22 06:16:26] [INFO ] Implicit Places using invariants and state equation in 1242 ms returned []
Implicit Place search using SMT with State Equation took 1681 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 744/751 places, 536/540 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2818 ms. Remains : 744/751 places, 536/540 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 357943 steps, run timeout after 3008 ms. (steps per millisecond=118 ) properties seen :{}
Probabilistic random walk after 357943 steps, saw 345391 distinct states, run finished after 3017 ms. (steps per millisecond=118 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 06:16:30] [INFO ] Invariant cache hit.
[2023-03-22 06:16:30] [INFO ] [Real]Absence check using 328 positive place invariants in 60 ms returned sat
[2023-03-22 06:16:30] [INFO ] After 457ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 06:16:30] [INFO ] [Nat]Absence check using 328 positive place invariants in 80 ms returned sat
[2023-03-22 06:16:31] [INFO ] After 495ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 06:16:31] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-22 06:16:31] [INFO ] After 155ms SMT Verify possible using 29 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 06:16:31] [INFO ] After 266ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 98 ms.
[2023-03-22 06:16:31] [INFO ] After 1094ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 690 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=86 )
Parikh walk visited 1 properties in 8 ms.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (OR (NOT p0) (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 6 factoid took 344 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 4 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 18 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
// Phase 1: matrix 542 rows 753 cols
[2023-03-22 06:16:32] [INFO ] Computed 331 place invariants in 4 ms
[2023-03-22 06:16:32] [INFO ] Implicit Places using invariants in 480 ms returned []
[2023-03-22 06:16:32] [INFO ] Invariant cache hit.
[2023-03-22 06:16:33] [INFO ] Implicit Places using invariants and state equation in 1098 ms returned []
Implicit Place search using SMT with State Equation took 1581 ms to find 0 implicit places.
[2023-03-22 06:16:33] [INFO ] Invariant cache hit.
[2023-03-22 06:16:34] [INFO ] Dead Transitions using invariants and state equation in 359 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1971 ms. Remains : 753/753 places, 542/542 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 314 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 335985 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 335985 steps, saw 326748 distinct states, run finished after 3001 ms. (steps per millisecond=111 ) properties seen :2
Running SMT prover for 1 properties.
[2023-03-22 06:16:38] [INFO ] Invariant cache hit.
[2023-03-22 06:16:38] [INFO ] [Real]Absence check using 331 positive place invariants in 62 ms returned sat
[2023-03-22 06:16:38] [INFO ] After 647ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 06:16:39] [INFO ] [Nat]Absence check using 331 positive place invariants in 48 ms returned sat
[2023-03-22 06:16:39] [INFO ] After 486ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 06:16:39] [INFO ] After 656ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 75 ms.
[2023-03-22 06:16:39] [INFO ] After 1001ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 26 ms.
Support contains 4 out of 753 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 753/753 places, 542/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 751 transition count 540
Partial Free-agglomeration rule applied 117 times.
Drop transitions removed 117 transitions
Iterating global reduction 0 with 117 rules applied. Total rules applied 121 place count 751 transition count 540
Applied a total of 121 rules in 171 ms. Remains 751 /753 variables (removed 2) and now considering 540/542 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 751/753 places, 540/542 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) 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
Interrupted probabilistic random walk after 357156 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :{}
Probabilistic random walk after 357156 steps, saw 345711 distinct states, run finished after 3004 ms. (steps per millisecond=118 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 540 rows 751 cols
[2023-03-22 06:16:43] [INFO ] Computed 331 place invariants in 2 ms
[2023-03-22 06:16:43] [INFO ] [Real]Absence check using 331 positive place invariants in 87 ms returned sat
[2023-03-22 06:16:43] [INFO ] After 594ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 06:16:44] [INFO ] [Nat]Absence check using 331 positive place invariants in 297 ms returned sat
[2023-03-22 06:16:44] [INFO ] After 363ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 06:16:44] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-22 06:16:44] [INFO ] After 120ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 06:16:44] [INFO ] After 313ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-22 06:16:44] [INFO ] After 1209ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 20 ms.
Support contains 4 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 540/540 transitions.
Applied a total of 0 rules in 45 ms. Remains 751 /751 variables (removed 0) and now considering 540/540 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 751/751 places, 540/540 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 540/540 transitions.
Applied a total of 0 rules in 19 ms. Remains 751 /751 variables (removed 0) and now considering 540/540 (removed 0) transitions.
[2023-03-22 06:16:45] [INFO ] Invariant cache hit.
[2023-03-22 06:16:45] [INFO ] Implicit Places using invariants in 801 ms returned [744]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 815 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 750/751 places, 540/540 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 750 transition count 538
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 748 transition count 538
Applied a total of 4 rules in 79 ms. Remains 748 /750 variables (removed 2) and now considering 538/540 (removed 2) transitions.
// Phase 1: matrix 538 rows 748 cols
[2023-03-22 06:16:45] [INFO ] Computed 330 place invariants in 1 ms
[2023-03-22 06:16:48] [INFO ] Implicit Places using invariants in 2815 ms returned [731, 735]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2819 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 746/751 places, 538/540 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 744 transition count 536
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 744 transition count 536
Applied a total of 4 rules in 41 ms. Remains 744 /746 variables (removed 2) and now considering 536/538 (removed 2) transitions.
// Phase 1: matrix 536 rows 744 cols
[2023-03-22 06:16:48] [INFO ] Computed 328 place invariants in 3 ms
[2023-03-22 06:16:49] [INFO ] Implicit Places using invariants in 417 ms returned []
[2023-03-22 06:16:49] [INFO ] Invariant cache hit.
[2023-03-22 06:16:49] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-22 06:16:50] [INFO ] Implicit Places using invariants and state equation in 1113 ms returned []
Implicit Place search using SMT with State Equation took 1534 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 744/751 places, 536/540 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 5307 ms. Remains : 744/751 places, 536/540 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 371464 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :{}
Probabilistic random walk after 371464 steps, saw 358687 distinct states, run finished after 3014 ms. (steps per millisecond=123 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 06:16:53] [INFO ] Invariant cache hit.
[2023-03-22 06:16:53] [INFO ] [Real]Absence check using 328 positive place invariants in 47 ms returned sat
[2023-03-22 06:16:53] [INFO ] After 464ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 06:16:54] [INFO ] [Nat]Absence check using 328 positive place invariants in 93 ms returned sat
[2023-03-22 06:16:54] [INFO ] After 277ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 06:16:54] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-22 06:16:54] [INFO ] After 102ms SMT Verify possible using 29 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 06:16:54] [INFO ] After 170ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-22 06:16:54] [INFO ] After 764ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 685 steps, including 0 resets, run visited all 1 properties in 14 ms. (steps per millisecond=48 )
Parikh walk visited 1 properties in 14 ms.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (OR (NOT p0) (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 6 factoid took 580 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 525 ms.
Product exploration explored 100000 steps with 0 reset in 614 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 4 out of 753 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Performed 2 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 2 rules applied. Total rules applied 2 place count 753 transition count 542
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 77 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
[2023-03-22 06:16:57] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 542 rows 753 cols
[2023-03-22 06:16:57] [INFO ] Computed 331 place invariants in 1 ms
[2023-03-22 06:16:57] [INFO ] Dead Transitions using invariants and state equation in 466 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 753/753 places, 542/542 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 565 ms. Remains : 753/753 places, 542/542 transitions.
Support contains 4 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 13 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
// Phase 1: matrix 542 rows 753 cols
[2023-03-22 06:16:58] [INFO ] Computed 331 place invariants in 1 ms
[2023-03-22 06:16:58] [INFO ] Implicit Places using invariants in 619 ms returned []
[2023-03-22 06:16:58] [INFO ] Invariant cache hit.
[2023-03-22 06:16:59] [INFO ] Implicit Places using invariants and state equation in 792 ms returned []
Implicit Place search using SMT with State Equation took 1448 ms to find 0 implicit places.
[2023-03-22 06:16:59] [INFO ] Invariant cache hit.
[2023-03-22 06:16:59] [INFO ] Dead Transitions using invariants and state equation in 478 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1961 ms. Remains : 753/753 places, 542/542 transitions.
Treatment of property ShieldPPPt-PT-030A-LTLCardinality-10 finished in 49933 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 24 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
[2023-03-22 06:17:00] [INFO ] Invariant cache hit.
[2023-03-22 06:17:00] [INFO ] Implicit Places using invariants in 476 ms returned []
[2023-03-22 06:17:00] [INFO ] Invariant cache hit.
[2023-03-22 06:17:01] [INFO ] Implicit Places using invariants and state equation in 850 ms returned []
Implicit Place search using SMT with State Equation took 1328 ms to find 0 implicit places.
[2023-03-22 06:17:01] [INFO ] Invariant cache hit.
[2023-03-22 06:17:01] [INFO ] Dead Transitions using invariants and state equation in 493 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1860 ms. Remains : 753/753 places, 542/542 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldPPPt-PT-030A-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s341 0) (EQ s474 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1593 ms.
Product exploration explored 100000 steps with 50000 reset in 1597 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), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-030A-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-030A-LTLCardinality-12 finished in 5277 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((p0||X(p1))))'
Found a Lengthening insensitive property : ShieldPPPt-PT-030A-LTLCardinality-01
Stuttering acceptance computed with spot in 181 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 753 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 751 transition count 540
Applied a total of 4 rules in 46 ms. Remains 751 /753 variables (removed 2) and now considering 540/542 (removed 2) transitions.
// Phase 1: matrix 540 rows 751 cols
[2023-03-22 06:17:05] [INFO ] Computed 331 place invariants in 4 ms
[2023-03-22 06:17:06] [INFO ] Implicit Places using invariants in 514 ms returned [744]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 524 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 750/753 places, 540/542 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 750 transition count 538
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 748 transition count 538
Applied a total of 4 rules in 20 ms. Remains 748 /750 variables (removed 2) and now considering 538/540 (removed 2) transitions.
// Phase 1: matrix 538 rows 748 cols
[2023-03-22 06:17:06] [INFO ] Computed 330 place invariants in 1 ms
[2023-03-22 06:17:06] [INFO ] Implicit Places using invariants in 465 ms returned [731, 735]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 469 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 746/753 places, 538/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 744 transition count 536
Applied a total of 4 rules in 22 ms. Remains 744 /746 variables (removed 2) and now considering 536/538 (removed 2) transitions.
// Phase 1: matrix 536 rows 744 cols
[2023-03-22 06:17:06] [INFO ] Computed 328 place invariants in 1 ms
[2023-03-22 06:17:07] [INFO ] Implicit Places using invariants in 431 ms returned []
[2023-03-22 06:17:07] [INFO ] Invariant cache hit.
[2023-03-22 06:17:08] [INFO ] Implicit Places using invariants and state equation in 962 ms returned []
Implicit Place search using SMT with State Equation took 1425 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 744/753 places, 536/542 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 2506 ms. Remains : 744/753 places, 536/542 transitions.
Running random walk in product with property : ShieldPPPt-PT-030A-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s521 1), p1:(OR (EQ s381 0) (EQ s610 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 565 ms.
Product exploration explored 100000 steps with 0 reset in 662 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p0), true, (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 546 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 06:17:10] [INFO ] Invariant cache hit.
[2023-03-22 06:17:10] [INFO ] [Real]Absence check using 328 positive place invariants in 93 ms returned sat
[2023-03-22 06:17:10] [INFO ] After 604ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 06:17:10] [INFO ] [Nat]Absence check using 328 positive place invariants in 46 ms returned sat
[2023-03-22 06:17:11] [INFO ] After 197ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 06:17:11] [INFO ] After 246ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-22 06:17:11] [INFO ] After 547ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 744 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 744/744 places, 536/536 transitions.
Partial Free-agglomeration rule applied 116 times.
Drop transitions removed 116 transitions
Iterating global reduction 0 with 116 rules applied. Total rules applied 116 place count 744 transition count 536
Applied a total of 116 rules in 56 ms. Remains 744 /744 variables (removed 0) and now considering 536/536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 744/744 places, 536/536 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Finished probabilistic random walk after 35352 steps, run visited all 1 properties in 354 ms. (steps per millisecond=99 )
Probabilistic random walk after 35352 steps, saw 32916 distinct states, run finished after 355 ms. (steps per millisecond=99 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p0), true, (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p0)))), (F p0), (F (AND p1 p0)), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 570 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 86 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 744 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 744/744 places, 536/536 transitions.
Applied a total of 0 rules in 9 ms. Remains 744 /744 variables (removed 0) and now considering 536/536 (removed 0) transitions.
[2023-03-22 06:17:12] [INFO ] Invariant cache hit.
[2023-03-22 06:17:13] [INFO ] Implicit Places using invariants in 506 ms returned []
[2023-03-22 06:17:13] [INFO ] Invariant cache hit.
[2023-03-22 06:17:14] [INFO ] Implicit Places using invariants and state equation in 946 ms returned []
Implicit Place search using SMT with State Equation took 1473 ms to find 0 implicit places.
[2023-03-22 06:17:14] [INFO ] Invariant cache hit.
[2023-03-22 06:17:14] [INFO ] Dead Transitions using invariants and state equation in 418 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1915 ms. Remains : 744/744 places, 536/536 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (AND p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X p0), true, (X (X p1)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 391 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 06:17:15] [INFO ] Invariant cache hit.
[2023-03-22 06:17:15] [INFO ] [Real]Absence check using 328 positive place invariants in 81 ms returned sat
[2023-03-22 06:17:15] [INFO ] After 655ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 06:17:15] [INFO ] [Nat]Absence check using 328 positive place invariants in 59 ms returned sat
[2023-03-22 06:17:16] [INFO ] After 188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 06:17:16] [INFO ] After 243ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-22 06:17:16] [INFO ] After 535ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 744 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 744/744 places, 536/536 transitions.
Partial Free-agglomeration rule applied 116 times.
Drop transitions removed 116 transitions
Iterating global reduction 0 with 116 rules applied. Total rules applied 116 place count 744 transition count 536
Applied a total of 116 rules in 38 ms. Remains 744 /744 variables (removed 0) and now considering 536/536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 744/744 places, 536/536 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Finished probabilistic random walk after 35352 steps, run visited all 1 properties in 255 ms. (steps per millisecond=138 )
Probabilistic random walk after 35352 steps, saw 32916 distinct states, run finished after 256 ms. (steps per millisecond=138 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (AND p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X p0), true, (X (X p1)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p0)))), (F p0), (F (AND p1 p0)), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 589 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 142 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 85 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 461 ms.
Product exploration explored 100000 steps with 0 reset in 659 ms.
Support contains 3 out of 744 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 744/744 places, 536/536 transitions.
Applied a total of 0 rules in 11 ms. Remains 744 /744 variables (removed 0) and now considering 536/536 (removed 0) transitions.
[2023-03-22 06:17:18] [INFO ] Invariant cache hit.
[2023-03-22 06:17:19] [INFO ] Implicit Places using invariants in 558 ms returned []
[2023-03-22 06:17:19] [INFO ] Invariant cache hit.
[2023-03-22 06:17:20] [INFO ] Implicit Places using invariants and state equation in 690 ms returned []
Implicit Place search using SMT with State Equation took 1269 ms to find 0 implicit places.
[2023-03-22 06:17:20] [INFO ] Invariant cache hit.
[2023-03-22 06:17:20] [INFO ] Dead Transitions using invariants and state equation in 333 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1636 ms. Remains : 744/744 places, 536/536 transitions.
Treatment of property ShieldPPPt-PT-030A-LTLCardinality-01 finished in 15284 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G((!p0||(!p1&&X(F(!p2))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&G(p1)))))'
Found a Shortening insensitive property : ShieldPPPt-PT-030A-LTLCardinality-10
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 4 out of 753 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 751 transition count 540
Applied a total of 4 rules in 35 ms. Remains 751 /753 variables (removed 2) and now considering 540/542 (removed 2) transitions.
// Phase 1: matrix 540 rows 751 cols
[2023-03-22 06:17:20] [INFO ] Computed 331 place invariants in 2 ms
[2023-03-22 06:17:21] [INFO ] Implicit Places using invariants in 575 ms returned [744]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 589 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 750/753 places, 540/542 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 750 transition count 538
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 748 transition count 538
Applied a total of 4 rules in 16 ms. Remains 748 /750 variables (removed 2) and now considering 538/540 (removed 2) transitions.
// Phase 1: matrix 538 rows 748 cols
[2023-03-22 06:17:21] [INFO ] Computed 330 place invariants in 1 ms
[2023-03-22 06:17:21] [INFO ] Implicit Places using invariants in 395 ms returned [731, 735]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 408 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 746/753 places, 538/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 744 transition count 536
Applied a total of 4 rules in 23 ms. Remains 744 /746 variables (removed 2) and now considering 536/538 (removed 2) transitions.
// Phase 1: matrix 536 rows 744 cols
[2023-03-22 06:17:21] [INFO ] Computed 328 place invariants in 1 ms
[2023-03-22 06:17:22] [INFO ] Implicit Places using invariants in 410 ms returned []
[2023-03-22 06:17:22] [INFO ] Invariant cache hit.
[2023-03-22 06:17:23] [INFO ] Implicit Places using invariants and state equation in 899 ms returned []
Implicit Place search using SMT with State Equation took 1311 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 744/753 places, 536/542 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 2390 ms. Remains : 744/753 places, 536/542 transitions.
Running random walk in product with property : ShieldPPPt-PT-030A-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s47 0) (EQ s157 1)), p1:(OR (EQ s47 0) (EQ s157 1) (EQ s728 0) (EQ s152 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 461 ms.
Product exploration explored 100000 steps with 0 reset in 618 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 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 349 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 360690 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 360690 steps, saw 350144 distinct states, run finished after 3001 ms. (steps per millisecond=120 ) properties seen :2
Running SMT prover for 1 properties.
[2023-03-22 06:17:28] [INFO ] Invariant cache hit.
[2023-03-22 06:17:28] [INFO ] [Real]Absence check using 328 positive place invariants in 136 ms returned sat
[2023-03-22 06:17:28] [INFO ] After 636ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 06:17:29] [INFO ] [Nat]Absence check using 328 positive place invariants in 43 ms returned sat
[2023-03-22 06:17:29] [INFO ] After 271ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 06:17:29] [INFO ] After 377ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 66 ms.
[2023-03-22 06:17:29] [INFO ] After 654ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 29 ms.
Support contains 4 out of 744 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 744/744 places, 536/536 transitions.
Partial Free-agglomeration rule applied 115 times.
Drop transitions removed 115 transitions
Iterating global reduction 0 with 115 rules applied. Total rules applied 115 place count 744 transition count 536
Applied a total of 115 rules in 43 ms. Remains 744 /744 variables (removed 0) and now considering 536/536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 744/744 places, 536/536 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 1) seen :0
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
Interrupted probabilistic random walk after 350911 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :{}
Probabilistic random walk after 350911 steps, saw 340766 distinct states, run finished after 3001 ms. (steps per millisecond=116 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 536 rows 744 cols
[2023-03-22 06:17:32] [INFO ] Computed 328 place invariants in 4 ms
[2023-03-22 06:17:33] [INFO ] [Real]Absence check using 328 positive place invariants in 72 ms returned sat
[2023-03-22 06:17:33] [INFO ] After 677ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 06:17:33] [INFO ] [Nat]Absence check using 328 positive place invariants in 41 ms returned sat
[2023-03-22 06:17:33] [INFO ] After 290ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 06:17:33] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-22 06:17:34] [INFO ] After 137ms SMT Verify possible using 29 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 06:17:34] [INFO ] After 242ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 97 ms.
[2023-03-22 06:17:34] [INFO ] After 828ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 1092 steps, including 0 resets, run visited all 1 properties in 10 ms. (steps per millisecond=109 )
Parikh walk visited 1 properties in 11 ms.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (OR (NOT p0) (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 6 factoid took 496 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 4 out of 744 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 744/744 places, 536/536 transitions.
Applied a total of 0 rules in 9 ms. Remains 744 /744 variables (removed 0) and now considering 536/536 (removed 0) transitions.
// Phase 1: matrix 536 rows 744 cols
[2023-03-22 06:17:35] [INFO ] Computed 328 place invariants in 2 ms
[2023-03-22 06:17:35] [INFO ] Implicit Places using invariants in 484 ms returned []
[2023-03-22 06:17:35] [INFO ] Invariant cache hit.
[2023-03-22 06:17:36] [INFO ] Implicit Places using invariants and state equation in 833 ms returned []
Implicit Place search using SMT with State Equation took 1347 ms to find 0 implicit places.
[2023-03-22 06:17:36] [INFO ] Invariant cache hit.
[2023-03-22 06:17:36] [INFO ] Dead Transitions using invariants and state equation in 434 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1797 ms. Remains : 744/744 places, 536/536 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 288 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 370810 steps, run timeout after 3057 ms. (steps per millisecond=121 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 370810 steps, saw 359865 distinct states, run finished after 3058 ms. (steps per millisecond=121 ) properties seen :2
Running SMT prover for 1 properties.
[2023-03-22 06:17:40] [INFO ] Invariant cache hit.
[2023-03-22 06:17:41] [INFO ] [Real]Absence check using 328 positive place invariants in 49 ms returned sat
[2023-03-22 06:17:41] [INFO ] After 515ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 06:17:41] [INFO ] [Nat]Absence check using 328 positive place invariants in 44 ms returned sat
[2023-03-22 06:17:42] [INFO ] After 430ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 06:17:42] [INFO ] After 536ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 73 ms.
[2023-03-22 06:17:42] [INFO ] After 844ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 41 ms.
Support contains 4 out of 744 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 744/744 places, 536/536 transitions.
Partial Free-agglomeration rule applied 115 times.
Drop transitions removed 115 transitions
Iterating global reduction 0 with 115 rules applied. Total rules applied 115 place count 744 transition count 536
Applied a total of 115 rules in 35 ms. Remains 744 /744 variables (removed 0) and now considering 536/536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 744/744 places, 536/536 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 339435 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :{}
Probabilistic random walk after 339435 steps, saw 329485 distinct states, run finished after 3001 ms. (steps per millisecond=113 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 536 rows 744 cols
[2023-03-22 06:17:45] [INFO ] Computed 328 place invariants in 1 ms
[2023-03-22 06:17:45] [INFO ] [Real]Absence check using 328 positive place invariants in 70 ms returned sat
[2023-03-22 06:17:46] [INFO ] After 674ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 06:17:46] [INFO ] [Nat]Absence check using 328 positive place invariants in 55 ms returned sat
[2023-03-22 06:17:46] [INFO ] After 380ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 06:17:46] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-22 06:17:46] [INFO ] After 121ms SMT Verify possible using 29 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 06:17:46] [INFO ] After 209ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-22 06:17:46] [INFO ] After 891ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 1031 steps, including 0 resets, run visited all 1 properties in 10 ms. (steps per millisecond=103 )
Parikh walk visited 1 properties in 9 ms.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (OR (NOT p0) (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 6 factoid took 534 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 607 ms.
Product exploration explored 100000 steps with 0 reset in 571 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 4 out of 744 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 744/744 places, 536/536 transitions.
Applied a total of 0 rules in 30 ms. Remains 744 /744 variables (removed 0) and now considering 536/536 (removed 0) transitions.
[2023-03-22 06:17:49] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 536 rows 744 cols
[2023-03-22 06:17:49] [INFO ] Computed 328 place invariants in 4 ms
[2023-03-22 06:17:50] [INFO ] Dead Transitions using invariants and state equation in 476 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 528 ms. Remains : 744/744 places, 536/536 transitions.
Support contains 4 out of 744 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 744/744 places, 536/536 transitions.
Applied a total of 0 rules in 8 ms. Remains 744 /744 variables (removed 0) and now considering 536/536 (removed 0) transitions.
[2023-03-22 06:17:50] [INFO ] Invariant cache hit.
[2023-03-22 06:17:50] [INFO ] Implicit Places using invariants in 418 ms returned []
[2023-03-22 06:17:50] [INFO ] Invariant cache hit.
[2023-03-22 06:17:51] [INFO ] Implicit Places using invariants and state equation in 1078 ms returned []
Implicit Place search using SMT with State Equation took 1502 ms to find 0 implicit places.
[2023-03-22 06:17:51] [INFO ] Invariant cache hit.
[2023-03-22 06:17:52] [INFO ] Dead Transitions using invariants and state equation in 478 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2020 ms. Remains : 744/744 places, 536/536 transitions.
Treatment of property ShieldPPPt-PT-030A-LTLCardinality-10 finished in 31495 ms.
[2023-03-22 06:17:52] [INFO ] Flatten gal took : 37 ms
[2023-03-22 06:17:52] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-22 06:17:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 753 places, 542 transitions and 2164 arcs took 5 ms.
Total runtime 188073 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2339/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2339/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2339/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldPPPt-PT-030A-LTLCardinality-01
Could not compute solution for formula : ShieldPPPt-PT-030A-LTLCardinality-08
Could not compute solution for formula : ShieldPPPt-PT-030A-LTLCardinality-10

BK_STOP 1679465873375

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name ShieldPPPt-PT-030A-LTLCardinality-01
ltl formula formula --ltl=/tmp/2339/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 753 places, 542 transitions and 2164 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.130 real 0.030 user 0.070 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2339/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2339/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2339/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2339/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name ShieldPPPt-PT-030A-LTLCardinality-08
ltl formula formula --ltl=/tmp/2339/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 753 places, 542 transitions and 2164 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.100 real 0.030 user 0.030 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2339/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2339/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2339/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2339/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name ShieldPPPt-PT-030A-LTLCardinality-10
ltl formula formula --ltl=/tmp/2339/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 753 places, 542 transitions and 2164 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.110 real 0.030 user 0.040 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2339/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2339/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2339/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2339/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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