Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r037-tajo-167813690700707.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is CANInsertWithFailure-PT-010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690700707
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 9.9K Feb 26 00:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 26 00:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 23:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 23:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 00:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 26 00:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 00:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 00:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 698K Mar 5 18:22 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 CANInsertWithFailure-PT-010-LTLCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-010-LTLCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-010-LTLCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-010-LTLCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-010-LTLCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-010-LTLCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-010-LTLCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-010-LTLCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-010-LTLCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-010-LTLCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-010-LTLCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-010-LTLCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-010-LTLCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-010-LTLCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-010-LTLCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-010-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678374058676

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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-010
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-09 15:01:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 15:01:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 15:01:00] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2023-03-09 15:01:00] [INFO ] Transformed 324 places.
[2023-03-09 15:01:00] [INFO ] Transformed 660 transitions.
[2023-03-09 15:01:00] [INFO ] Parsed PT model containing 324 places and 660 transitions and 1800 arcs in 180 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CANInsertWithFailure-PT-010-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-010-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 52 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 660/660 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 323 transition count 660
Applied a total of 1 rules in 35 ms. Remains 323 /324 variables (removed 1) and now considering 660/660 (removed 0) transitions.
// Phase 1: matrix 660 rows 323 cols
[2023-03-09 15:01:00] [INFO ] Computed 12 place invariants in 23 ms
[2023-03-09 15:01:01] [INFO ] Implicit Places using invariants in 249 ms returned []
[2023-03-09 15:01:01] [INFO ] Invariant cache hit.
[2023-03-09 15:01:01] [INFO ] State equation strengthened by 190 read => feed constraints.
[2023-03-09 15:01:01] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 780 ms to find 0 implicit places.
[2023-03-09 15:01:01] [INFO ] Invariant cache hit.
[2023-03-09 15:01:01] [INFO ] Dead Transitions using invariants and state equation in 306 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 323/324 places, 660/660 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1139 ms. Remains : 323/324 places, 660/660 transitions.
Support contains 52 out of 323 places after structural reductions.
[2023-03-09 15:01:02] [INFO ] Flatten gal took : 78 ms
[2023-03-09 15:01:02] [INFO ] Flatten gal took : 28 ms
[2023-03-09 15:01:02] [INFO ] Input system was already deterministic with 660 transitions.
Incomplete random walk after 10000 steps, including 45 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 32) seen :27
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-09 15:01:02] [INFO ] Invariant cache hit.
[2023-03-09 15:01:02] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-09 15:01:02] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-09 15:01:02] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 15:01:02] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-09 15:01:03] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 15:01:03] [INFO ] After 281ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-09 15:01:03] [INFO ] State equation strengthened by 190 read => feed constraints.
[2023-03-09 15:01:03] [INFO ] After 171ms SMT Verify possible using 190 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-09 15:01:03] [INFO ] After 397ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 128 ms.
[2023-03-09 15:01:03] [INFO ] After 945ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 44 ms.
Support contains 8 out of 323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 660/660 transitions.
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 323 transition count 594
Reduce places removed 66 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 67 rules applied. Total rules applied 133 place count 257 transition count 593
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 134 place count 256 transition count 593
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 306 place count 170 transition count 507
Drop transitions removed 69 transitions
Redundant transition composition rules discarded 69 transitions
Iterating global reduction 3 with 69 rules applied. Total rules applied 375 place count 170 transition count 438
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 378 place count 170 transition count 435
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 381 place count 167 transition count 435
Partial Free-agglomeration rule applied 108 times.
Drop transitions removed 108 transitions
Iterating global reduction 4 with 108 rules applied. Total rules applied 489 place count 167 transition count 435
Applied a total of 489 rules in 76 ms. Remains 167 /323 variables (removed 156) and now considering 435/660 (removed 225) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 167/323 places, 435/660 transitions.
Incomplete random walk after 10000 steps, including 194 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 1041623 steps, run timeout after 3001 ms. (steps per millisecond=347 ) properties seen :{}
Probabilistic random walk after 1041623 steps, saw 137624 distinct states, run finished after 3002 ms. (steps per millisecond=346 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 435 rows 167 cols
[2023-03-09 15:01:07] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-09 15:01:07] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-09 15:01:07] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 15:01:07] [INFO ] After 107ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2023-03-09 15:01:07] [INFO ] State equation strengthened by 380 read => feed constraints.
[2023-03-09 15:01:07] [INFO ] After 62ms SMT Verify possible using 380 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 15:01:07] [INFO ] After 235ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 15:01:07] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-09 15:01:07] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 15:01:07] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-09 15:01:07] [INFO ] After 107ms SMT Verify possible using 380 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-09 15:01:07] [INFO ] After 244ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-03-09 15:01:08] [INFO ] After 526ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 22 ms.
Support contains 8 out of 167 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 435/435 transitions.
Applied a total of 0 rules in 9 ms. Remains 167 /167 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 167/167 places, 435/435 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 435/435 transitions.
Applied a total of 0 rules in 8 ms. Remains 167 /167 variables (removed 0) and now considering 435/435 (removed 0) transitions.
[2023-03-09 15:01:08] [INFO ] Invariant cache hit.
[2023-03-09 15:01:08] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-09 15:01:08] [INFO ] Invariant cache hit.
[2023-03-09 15:01:08] [INFO ] State equation strengthened by 380 read => feed constraints.
[2023-03-09 15:01:08] [INFO ] Implicit Places using invariants and state equation in 446 ms returned []
Implicit Place search using SMT with State Equation took 591 ms to find 0 implicit places.
[2023-03-09 15:01:08] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-09 15:01:08] [INFO ] Invariant cache hit.
[2023-03-09 15:01:08] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 770 ms. Remains : 167/167 places, 435/435 transitions.
Graph (trivial) has 342 edges and 167 vertex of which 103 / 167 are part of one of the 2 SCC in 3 ms
Free SCC test removed 101 places
Drop transitions removed 232 transitions
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 329 transitions.
Graph (complete) has 173 edges and 66 vertex of which 37 are kept as prefixes of interest. Removing 29 places using SCC suffix rule.1 ms
Discarding 29 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Drop transitions removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 31 place count 37 transition count 69
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 45 place count 23 transition count 48
Iterating global reduction 1 with 14 rules applied. Total rules applied 59 place count 23 transition count 48
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 66 place count 23 transition count 41
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 2 with 2 rules applied. Total rules applied 68 place count 22 transition count 40
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 2 with 2 rules applied. Total rules applied 70 place count 21 transition count 39
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 21 transition count 38
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 21 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 73 place count 20 transition count 37
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 74 place count 19 transition count 36
Applied a total of 74 rules in 20 ms. Remains 19 /167 variables (removed 148) and now considering 36/435 (removed 399) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 36 rows 19 cols
[2023-03-09 15:01:08] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-09 15:01:08] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-09 15:01:08] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 15:01:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-09 15:01:08] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-09 15:01:08] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-09 15:01:08] [INFO ] After 85ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
FORMULA CANInsertWithFailure-PT-010-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 42 stabilizing places and 70 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||((p1&&G(p2)) U X(G(p3))))))'
Support contains 6 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 3 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
// Phase 1: matrix 660 rows 323 cols
[2023-03-09 15:01:09] [INFO ] Computed 12 place invariants in 5 ms
[2023-03-09 15:01:09] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-09 15:01:09] [INFO ] Invariant cache hit.
[2023-03-09 15:01:09] [INFO ] State equation strengthened by 190 read => feed constraints.
[2023-03-09 15:01:09] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
[2023-03-09 15:01:09] [INFO ] Invariant cache hit.
[2023-03-09 15:01:09] [INFO ] Dead Transitions using invariants and state equation in 223 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 711 ms. Remains : 323/323 places, 660/660 transitions.
Stuttering acceptance computed with spot in 455 ms :[(AND (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p0)), (AND (NOT p0) (NOT p3)), (AND (NOT p3) (NOT p2) (NOT p0)), true, (NOT p2), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 5}], [{ cond=p3, acceptance={} source=1 dest: 1}, { cond=(NOT p3), acceptance={} source=1 dest: 7}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p2 p3), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2 (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) p3), acceptance={} source=3 dest: 1}, { cond=(AND p2 p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 7}, { cond=(AND p2 (NOT p3)), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p0) p3), acceptance={} source=4 dest: 1}, { cond=(AND p0 p3), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=4 dest: 7}, { cond=(AND p0 (NOT p3)), acceptance={} source=4 dest: 9}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=5 dest: 3}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=5 dest: 5}, { cond=(AND p0 p1 p2), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2) p3), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) p2 p3), acceptance={} source=6 dest: 3}, { cond=(AND p0 (NOT p2) p3), acceptance={} source=6 dest: 4}, { cond=(AND p0 p2 p3), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=6 dest: 8}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=6 dest: 9}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=6 dest: 10}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(NOT p2), acceptance={} source=8 dest: 7}, { cond=p2, acceptance={} source=8 dest: 8}], [{ cond=(NOT p0), acceptance={} source=9 dest: 7}, { cond=p0, acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=10 dest: 7}, { cond=(AND (NOT p0) p2), acceptance={} source=10 dest: 8}, { cond=(AND p0 (NOT p2)), acceptance={} source=10 dest: 9}, { cond=(AND p0 p2), acceptance={} source=10 dest: 10}]], initial=0, aps=[p3:(GT s10 s34), p1:(LEQ 3 s321), p2:(LEQ s272 s57), p0:(LEQ 1 s44)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA CANInsertWithFailure-PT-010-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLCardinality-00 finished in 1231 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 p1)||X(p2)) U (p1||G(p2))))'
Support contains 3 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 4 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
[2023-03-09 15:01:10] [INFO ] Invariant cache hit.
[2023-03-09 15:01:10] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-09 15:01:10] [INFO ] Invariant cache hit.
[2023-03-09 15:01:10] [INFO ] State equation strengthened by 190 read => feed constraints.
[2023-03-09 15:01:11] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
[2023-03-09 15:01:11] [INFO ] Invariant cache hit.
[2023-03-09 15:01:11] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 835 ms. Remains : 323/323 places, 660/660 transitions.
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(LEQ 1 s25), p0:(LEQ 2 s288), p2:(LEQ 1 s308)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-010-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLCardinality-01 finished in 987 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 67 place count 323 transition count 593
Reduce places removed 67 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 68 rules applied. Total rules applied 135 place count 256 transition count 592
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 136 place count 255 transition count 592
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 136 place count 255 transition count 591
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 138 place count 254 transition count 591
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 314 place count 166 transition count 503
Drop transitions removed 72 transitions
Redundant transition composition rules discarded 72 transitions
Iterating global reduction 3 with 72 rules applied. Total rules applied 386 place count 166 transition count 431
Applied a total of 386 rules in 40 ms. Remains 166 /323 variables (removed 157) and now considering 431/660 (removed 229) transitions.
// Phase 1: matrix 431 rows 166 cols
[2023-03-09 15:01:11] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-09 15:01:11] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-09 15:01:11] [INFO ] Invariant cache hit.
[2023-03-09 15:01:11] [INFO ] State equation strengthened by 286 read => feed constraints.
[2023-03-09 15:01:11] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
[2023-03-09 15:01:11] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 15:01:11] [INFO ] Invariant cache hit.
[2023-03-09 15:01:12] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 166/323 places, 431/660 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 677 ms. Remains : 166/323 places, 431/660 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLCardinality-03 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:(GT s24 s60)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 294 steps with 9 reset in 5 ms.
FORMULA CANInsertWithFailure-PT-010-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLCardinality-03 finished in 754 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((X((F(p0) U p1))&&G(p2))))'
Support contains 5 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 3 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
// Phase 1: matrix 660 rows 323 cols
[2023-03-09 15:01:12] [INFO ] Computed 12 place invariants in 5 ms
[2023-03-09 15:01:12] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-09 15:01:12] [INFO ] Invariant cache hit.
[2023-03-09 15:01:12] [INFO ] State equation strengthened by 190 read => feed constraints.
[2023-03-09 15:01:12] [INFO ] Implicit Places using invariants and state equation in 424 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
[2023-03-09 15:01:12] [INFO ] Invariant cache hit.
[2023-03-09 15:01:12] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 733 ms. Remains : 323/323 places, 660/660 transitions.
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={0} source=3 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(LEQ s312 s36), p1:(LEQ s24 s318), p0:(LEQ 2 s165)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 943 reset in 247 ms.
Stack based approach found an accepted trace after 37388 steps with 300 reset with depth 206 and stack size 206 in 137 ms.
FORMULA CANInsertWithFailure-PT-010-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLCardinality-04 finished in 1359 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)))||((p0||X(p1))&&X(X(F(p2))))))'
Support contains 5 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 4 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
[2023-03-09 15:01:13] [INFO ] Invariant cache hit.
[2023-03-09 15:01:13] [INFO ] Implicit Places using invariants in 200 ms returned []
[2023-03-09 15:01:13] [INFO ] Invariant cache hit.
[2023-03-09 15:01:13] [INFO ] State equation strengthened by 190 read => feed constraints.
[2023-03-09 15:01:14] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 647 ms to find 0 implicit places.
[2023-03-09 15:01:14] [INFO ] Invariant cache hit.
[2023-03-09 15:01:14] [INFO ] Dead Transitions using invariants and state equation in 277 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 929 ms. Remains : 323/323 places, 660/660 transitions.
Stuttering acceptance computed with spot in 203 ms :[true, (NOT p1), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={} source=5 dest: 2}, { cond=(NOT p0), acceptance={} source=5 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}]], initial=4, aps=[p1:(LEQ 1 s12), p0:(GT s243 s158), p2:(LEQ s171 s196)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-010-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLCardinality-06 finished in 1154 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 4 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
[2023-03-09 15:01:14] [INFO ] Invariant cache hit.
[2023-03-09 15:01:14] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-09 15:01:14] [INFO ] Invariant cache hit.
[2023-03-09 15:01:14] [INFO ] State equation strengthened by 190 read => feed constraints.
[2023-03-09 15:01:15] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
[2023-03-09 15:01:15] [INFO ] Invariant cache hit.
[2023-03-09 15:01:15] [INFO ] Dead Transitions using invariants and state equation in 233 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 717 ms. Remains : 323/323 places, 660/660 transitions.
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 2 s206)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-010-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLCardinality-07 finished in 800 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||G(p1))))'
Support contains 4 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 4 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
[2023-03-09 15:01:15] [INFO ] Invariant cache hit.
[2023-03-09 15:01:15] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-09 15:01:15] [INFO ] Invariant cache hit.
[2023-03-09 15:01:15] [INFO ] State equation strengthened by 190 read => feed constraints.
[2023-03-09 15:01:16] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 504 ms to find 0 implicit places.
[2023-03-09 15:01:16] [INFO ] Invariant cache hit.
[2023-03-09 15:01:16] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 740 ms. Remains : 323/323 places, 660/660 transitions.
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 1}, { cond=p1, acceptance={} source=5 dest: 2}]], initial=4, aps=[p0:(AND (GT s1 s217) (LEQ s284 s56)), p1:(LEQ s1 s217)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 311 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-010-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLCardinality-08 finished in 924 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||X(F((p0&&X(F(p1))))))))))'
Support contains 2 out of 323 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 5 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
[2023-03-09 15:01:16] [INFO ] Invariant cache hit.
[2023-03-09 15:01:16] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-09 15:01:16] [INFO ] Invariant cache hit.
[2023-03-09 15:01:16] [INFO ] State equation strengthened by 190 read => feed constraints.
[2023-03-09 15:01:16] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
[2023-03-09 15:01:16] [INFO ] Invariant cache hit.
[2023-03-09 15:01:17] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 713 ms. Remains : 323/323 places, 660/660 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ s78 s55)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 192 ms.
Product exploration explored 100000 steps with 33333 reset in 241 ms.
Computed a total of 42 stabilizing places and 70 stable transitions
Computed a total of 42 stabilizing places and 70 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-010-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-010-LTLCardinality-09 finished in 1348 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 U G((p1 U (p0&&G(p2)))))))'
Support contains 5 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 3 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
[2023-03-09 15:01:17] [INFO ] Invariant cache hit.
[2023-03-09 15:01:17] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-09 15:01:17] [INFO ] Invariant cache hit.
[2023-03-09 15:01:18] [INFO ] State equation strengthened by 190 read => feed constraints.
[2023-03-09 15:01:18] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
[2023-03-09 15:01:18] [INFO ] Invariant cache hit.
[2023-03-09 15:01:18] [INFO ] Dead Transitions using invariants and state equation in 208 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 674 ms. Remains : 323/323 places, 660/660 transitions.
Stuttering acceptance computed with spot in 379 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND p1 (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1} source=1 dest: 5}, { cond=(AND p0 p2 (NOT p1)), acceptance={1} source=1 dest: 6}, { cond=(AND p0 p2 p1), acceptance={1} source=1 dest: 7}], [{ cond=true, acceptance={0, 1} source=2 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={} source=3 dest: 2}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p2) p1)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=3 dest: 8}, { cond=(AND p0 p2 p1), acceptance={1} source=3 dest: 9}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={} source=4 dest: 2}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p2) p1)), acceptance={} source=4 dest: 3}, { cond=(OR (AND p0 p2) p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=4 dest: 8}, { cond=(AND p0 p2 p1), acceptance={} source=4 dest: 9}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1} source=5 dest: 5}, { cond=(AND p0 p2 (NOT p1)), acceptance={1} source=5 dest: 6}, { cond=(AND p0 p2 p1), acceptance={1} source=5 dest: 7}], [{ cond=(AND p0 (NOT p2) p1), acceptance={0} source=6 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=6 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1} source=6 dest: 5}, { cond=(AND p0 p2 p1), acceptance={} source=6 dest: 6}, { cond=(AND p0 p2 (NOT p1)), acceptance={1} source=6 dest: 6}, { cond=(AND p0 p2 p1), acceptance={1} source=6 dest: 7}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=6 dest: 8}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=6 dest: 9}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=6 dest: 10}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=7 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=7 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1} source=7 dest: 5}, { cond=(AND p0 p2 (NOT p1)), acceptance={1} source=7 dest: 6}, { cond=(AND p0 p2 p1), acceptance={1} source=7 dest: 7}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=7 dest: 8}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=7 dest: 9}], [{ cond=(NOT p2), acceptance={} source=8 dest: 2}, { cond=p2, acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=9 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=9 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=9 dest: 8}, { cond=(AND p2 p1), acceptance={1} source=9 dest: 9}], [{ cond=(AND (NOT p2) p1), acceptance={} source=10 dest: 4}, { cond=(AND p2 p1), acceptance={} source=10 dest: 10}]], initial=0, aps=[p0:(LEQ 1 s134), p2:(LEQ s151 s120), p1:(OR (LEQ s48 s144) (LEQ s151 s120))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1873 steps with 9 reset in 6 ms.
FORMULA CANInsertWithFailure-PT-010-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLCardinality-10 finished in 1084 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(F(p0))&&(X(p1)||G(p2)))))'
Support contains 7 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 4 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
[2023-03-09 15:01:18] [INFO ] Invariant cache hit.
[2023-03-09 15:01:18] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-09 15:01:18] [INFO ] Invariant cache hit.
[2023-03-09 15:01:19] [INFO ] State equation strengthened by 190 read => feed constraints.
[2023-03-09 15:01:19] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
[2023-03-09 15:01:19] [INFO ] Invariant cache hit.
[2023-03-09 15:01:19] [INFO ] Dead Transitions using invariants and state equation in 240 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 711 ms. Remains : 323/323 places, 660/660 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s79 s23), p2:(LEQ s125 s312), p1:(AND (GT 1 s221) (GT s157 s310))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 266 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-010-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLCardinality-11 finished in 844 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 3 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
[2023-03-09 15:01:19] [INFO ] Invariant cache hit.
[2023-03-09 15:01:19] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-09 15:01:19] [INFO ] Invariant cache hit.
[2023-03-09 15:01:19] [INFO ] State equation strengthened by 190 read => feed constraints.
[2023-03-09 15:01:20] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 532 ms to find 0 implicit places.
[2023-03-09 15:01:20] [INFO ] Invariant cache hit.
[2023-03-09 15:01:20] [INFO ] Dead Transitions using invariants and state equation in 237 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 773 ms. Remains : 323/323 places, 660/660 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s43 s313)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 731 steps with 7 reset in 2 ms.
FORMULA CANInsertWithFailure-PT-010-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLCardinality-12 finished in 846 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 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 323 transition count 591
Reduce places removed 69 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 70 rules applied. Total rules applied 139 place count 254 transition count 590
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 140 place count 253 transition count 590
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 284 place count 181 transition count 518
Drop transitions removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 3 with 55 rules applied. Total rules applied 339 place count 181 transition count 463
Partial Post-agglomeration rule applied 34 times.
Drop transitions removed 34 transitions
Iterating global reduction 3 with 34 rules applied. Total rules applied 373 place count 181 transition count 463
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 389 place count 165 transition count 447
Iterating global reduction 3 with 16 rules applied. Total rules applied 405 place count 165 transition count 447
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 413 place count 165 transition count 439
Applied a total of 413 rules in 40 ms. Remains 165 /323 variables (removed 158) and now considering 439/660 (removed 221) transitions.
// Phase 1: matrix 439 rows 165 cols
[2023-03-09 15:01:20] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-09 15:01:20] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-09 15:01:20] [INFO ] Invariant cache hit.
[2023-03-09 15:01:20] [INFO ] State equation strengthened by 295 read => feed constraints.
[2023-03-09 15:01:20] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
[2023-03-09 15:01:20] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 15:01:20] [INFO ] Invariant cache hit.
[2023-03-09 15:01:21] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 165/323 places, 439/660 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 548 ms. Remains : 165/323 places, 439/660 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s8 s149)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 119 steps with 1 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-010-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-010-LTLCardinality-13 finished in 585 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(p0) U (F(!p0) U (X(p2)&&p1))))))'
Support contains 8 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 4 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
// Phase 1: matrix 660 rows 323 cols
[2023-03-09 15:01:21] [INFO ] Computed 12 place invariants in 5 ms
[2023-03-09 15:01:21] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-09 15:01:21] [INFO ] Invariant cache hit.
[2023-03-09 15:01:21] [INFO ] State equation strengthened by 190 read => feed constraints.
[2023-03-09 15:01:21] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
[2023-03-09 15:01:21] [INFO ] Invariant cache hit.
[2023-03-09 15:01:21] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 676 ms. Remains : 323/323 places, 660/660 transitions.
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), false, (NOT p2), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), p0, (AND p0 p1 (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-010-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(AND p1 p0), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 7}, { cond=(AND p1 p0), acceptance={} source=5 dest: 8}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=6 dest: 7}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=6 dest: 8}], [{ cond=p0, acceptance={} source=7 dest: 7}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=8 dest: 7}]], initial=0, aps=[p1:(AND (LEQ s126 s278) (LEQ s317 s310)), p0:(LEQ s46 s210), p2:(LEQ s227 s125)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 260 ms.
Product exploration explored 100000 steps with 25000 reset in 279 ms.
Computed a total of 42 stabilizing places and 70 stable transitions
Computed a total of 42 stabilizing places and 70 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 102 ms. Reduced automaton from 9 states, 20 edges and 3 AP (stutter sensitive) to 9 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 296 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), false, (NOT p2), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), p0, (AND p0 p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 44 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 12) seen :7
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :2
Running SMT prover for 3 properties.
[2023-03-09 15:01:23] [INFO ] Invariant cache hit.
[2023-03-09 15:01:23] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 15:01:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-09 15:01:23] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 15:01:23] [INFO ] After 182ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 15:01:23] [INFO ] State equation strengthened by 190 read => feed constraints.
[2023-03-09 15:01:23] [INFO ] After 198ms SMT Verify possible using 190 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-09 15:01:23] [INFO ] After 315ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-03-09 15:01:23] [INFO ] After 645ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 9 ms.
Support contains 8 out of 323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 660/660 transitions.
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 323 transition count 594
Reduce places removed 66 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 68 rules applied. Total rules applied 134 place count 257 transition count 592
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 136 place count 255 transition count 592
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 136 place count 255 transition count 591
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 138 place count 254 transition count 591
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 294 place count 176 transition count 513
Drop transitions removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 3 with 62 rules applied. Total rules applied 356 place count 176 transition count 451
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 357 place count 176 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 358 place count 175 transition count 450
Partial Free-agglomeration rule applied 124 times.
Drop transitions removed 124 transitions
Iterating global reduction 4 with 124 rules applied. Total rules applied 482 place count 175 transition count 450
Applied a total of 482 rules in 46 ms. Remains 175 /323 variables (removed 148) and now considering 450/660 (removed 210) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 175/323 places, 450/660 transitions.
Incomplete random walk after 10000 steps, including 165 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1028314 steps, run timeout after 3001 ms. (steps per millisecond=342 ) properties seen :{}
Probabilistic random walk after 1028314 steps, saw 129925 distinct states, run finished after 3001 ms. (steps per millisecond=342 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 450 rows 175 cols
[2023-03-09 15:01:27] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-09 15:01:27] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 15:01:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-09 15:01:27] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 15:01:27] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 15:01:27] [INFO ] State equation strengthened by 380 read => feed constraints.
[2023-03-09 15:01:27] [INFO ] After 94ms SMT Verify possible using 380 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-09 15:01:27] [INFO ] After 170ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-09 15:01:27] [INFO ] After 370ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 5 ms.
Support contains 8 out of 175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 450/450 transitions.
Applied a total of 0 rules in 6 ms. Remains 175 /175 variables (removed 0) and now considering 450/450 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 175/175 places, 450/450 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 450/450 transitions.
Applied a total of 0 rules in 5 ms. Remains 175 /175 variables (removed 0) and now considering 450/450 (removed 0) transitions.
[2023-03-09 15:01:27] [INFO ] Invariant cache hit.
[2023-03-09 15:01:27] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-09 15:01:27] [INFO ] Invariant cache hit.
[2023-03-09 15:01:27] [INFO ] State equation strengthened by 380 read => feed constraints.
[2023-03-09 15:01:28] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
[2023-03-09 15:01:28] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 15:01:28] [INFO ] Invariant cache hit.
[2023-03-09 15:01:28] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 648 ms. Remains : 175/175 places, 450/450 transitions.
Graph (trivial) has 347 edges and 175 vertex of which 103 / 175 are part of one of the 2 SCC in 1 ms
Free SCC test removed 101 places
Drop transitions removed 233 transitions
Ensure Unique test removed 95 transitions
Reduce isomorphic transitions removed 328 transitions.
Graph (complete) has 186 edges and 74 vertex of which 46 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.1 ms
Discarding 28 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Drop transitions removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 21 place count 46 transition count 95
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 35 place count 32 transition count 67
Iterating global reduction 1 with 14 rules applied. Total rules applied 49 place count 32 transition count 67
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 56 place count 25 transition count 53
Iterating global reduction 1 with 7 rules applied. Total rules applied 63 place count 25 transition count 53
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 70 place count 25 transition count 46
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 2 with 2 rules applied. Total rules applied 72 place count 24 transition count 45
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 2 with 2 rules applied. Total rules applied 74 place count 23 transition count 44
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 78 place count 23 transition count 40
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 82 place count 23 transition count 36
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 88 place count 19 transition count 34
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 90 place count 17 transition count 32
Applied a total of 90 rules in 20 ms. Remains 17 /175 variables (removed 158) and now considering 32/450 (removed 418) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 32 rows 17 cols
[2023-03-09 15:01:28] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-09 15:01:28] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 15:01:28] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 15:01:28] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-09 15:01:28] [INFO ] After 55ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p1 p0 p2), (X (X p1))]
False Knowledge obtained : [(F (AND (NOT p2) p1)), (F (AND (NOT p2) (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) p1)), (F (NOT p0)), (F (AND p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p2) (NOT p1))), (F (AND p0 (NOT p2) p1))]
Knowledge based reduction with 2 factoid took 281 ms. Reduced automaton from 9 states, 20 edges and 3 AP (stutter sensitive) to 9 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 290 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), false, (NOT p2), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), p0, (AND p0 p1 (NOT p2))]
Stuttering acceptance computed with spot in 270 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), false, (NOT p2), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), p0, (AND p0 p1 (NOT p2))]
Support contains 8 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 5 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
// Phase 1: matrix 660 rows 323 cols
[2023-03-09 15:01:29] [INFO ] Computed 12 place invariants in 4 ms
[2023-03-09 15:01:29] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-09 15:01:29] [INFO ] Invariant cache hit.
[2023-03-09 15:01:29] [INFO ] State equation strengthened by 190 read => feed constraints.
[2023-03-09 15:01:29] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 527 ms to find 0 implicit places.
[2023-03-09 15:01:29] [INFO ] Invariant cache hit.
[2023-03-09 15:01:29] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 732 ms. Remains : 323/323 places, 660/660 transitions.
Computed a total of 42 stabilizing places and 70 stable transitions
Computed a total of 42 stabilizing places and 70 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 9 states, 20 edges and 3 AP (stutter sensitive) to 9 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 248 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), false, (NOT p2), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), p0, (AND p0 p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 46 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 12) seen :7
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-09 15:01:30] [INFO ] Invariant cache hit.
[2023-03-09 15:01:30] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 15:01:30] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-09 15:01:30] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 15:01:31] [INFO ] After 183ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 15:01:31] [INFO ] State equation strengthened by 190 read => feed constraints.
[2023-03-09 15:01:31] [INFO ] After 112ms SMT Verify possible using 190 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-09 15:01:31] [INFO ] After 219ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-03-09 15:01:31] [INFO ] After 543ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 22 ms.
Support contains 8 out of 323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 660/660 transitions.
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 323 transition count 594
Reduce places removed 66 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 68 rules applied. Total rules applied 134 place count 257 transition count 592
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 136 place count 255 transition count 592
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 136 place count 255 transition count 591
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 138 place count 254 transition count 591
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 294 place count 176 transition count 513
Drop transitions removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 3 with 62 rules applied. Total rules applied 356 place count 176 transition count 451
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 357 place count 176 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 358 place count 175 transition count 450
Partial Free-agglomeration rule applied 124 times.
Drop transitions removed 124 transitions
Iterating global reduction 4 with 124 rules applied. Total rules applied 482 place count 175 transition count 450
Applied a total of 482 rules in 36 ms. Remains 175 /323 variables (removed 148) and now considering 450/660 (removed 210) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 175/323 places, 450/660 transitions.
Incomplete random walk after 10000 steps, including 166 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 35 ms. (steps per millisecond=285 ) 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
Interrupted probabilistic random walk after 656885 steps, run timeout after 3001 ms. (steps per millisecond=218 ) properties seen :{}
Probabilistic random walk after 656885 steps, saw 89451 distinct states, run finished after 3001 ms. (steps per millisecond=218 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 450 rows 175 cols
[2023-03-09 15:01:34] [INFO ] Computed 12 place invariants in 7 ms
[2023-03-09 15:01:34] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 15:01:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2023-03-09 15:01:34] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 15:01:34] [INFO ] After 130ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 15:01:34] [INFO ] State equation strengthened by 380 read => feed constraints.
[2023-03-09 15:01:35] [INFO ] After 131ms SMT Verify possible using 380 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-09 15:01:35] [INFO ] After 224ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 65 ms.
[2023-03-09 15:01:35] [INFO ] After 491ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 11 ms.
Support contains 8 out of 175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 450/450 transitions.
Applied a total of 0 rules in 6 ms. Remains 175 /175 variables (removed 0) and now considering 450/450 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 175/175 places, 450/450 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 450/450 transitions.
Applied a total of 0 rules in 6 ms. Remains 175 /175 variables (removed 0) and now considering 450/450 (removed 0) transitions.
[2023-03-09 15:01:35] [INFO ] Invariant cache hit.
[2023-03-09 15:01:35] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-03-09 15:01:35] [INFO ] Invariant cache hit.
[2023-03-09 15:01:35] [INFO ] State equation strengthened by 380 read => feed constraints.
[2023-03-09 15:01:35] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 616 ms to find 0 implicit places.
[2023-03-09 15:01:35] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 15:01:35] [INFO ] Invariant cache hit.
[2023-03-09 15:01:36] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 781 ms. Remains : 175/175 places, 450/450 transitions.
Graph (trivial) has 347 edges and 175 vertex of which 103 / 175 are part of one of the 2 SCC in 0 ms
Free SCC test removed 101 places
Drop transitions removed 233 transitions
Ensure Unique test removed 95 transitions
Reduce isomorphic transitions removed 328 transitions.
Graph (complete) has 186 edges and 74 vertex of which 46 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.1 ms
Discarding 28 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Drop transitions removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 21 place count 46 transition count 95
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 35 place count 32 transition count 67
Iterating global reduction 1 with 14 rules applied. Total rules applied 49 place count 32 transition count 67
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 56 place count 25 transition count 53
Iterating global reduction 1 with 7 rules applied. Total rules applied 63 place count 25 transition count 53
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 70 place count 25 transition count 46
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 2 with 2 rules applied. Total rules applied 72 place count 24 transition count 45
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 2 with 2 rules applied. Total rules applied 74 place count 23 transition count 44
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 78 place count 23 transition count 40
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 82 place count 23 transition count 36
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 88 place count 19 transition count 34
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 90 place count 17 transition count 32
Applied a total of 90 rules in 6 ms. Remains 17 /175 variables (removed 158) and now considering 32/450 (removed 418) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 32 rows 17 cols
[2023-03-09 15:01:36] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-09 15:01:36] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 15:01:36] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 15:01:36] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-09 15:01:36] [INFO ] After 90ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p1 p0 p2), (X (X p1))]
False Knowledge obtained : [(F (AND (NOT p2) p1)), (F (AND (NOT p2) (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) p1)), (F (NOT p0)), (F (AND p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p2) (NOT p1))), (F (AND p0 (NOT p2) p1))]
Knowledge based reduction with 2 factoid took 253 ms. Reduced automaton from 9 states, 20 edges and 3 AP (stutter sensitive) to 9 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), false, (NOT p2), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), p0, (AND p0 p1 (NOT p2))]
Stuttering acceptance computed with spot in 253 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), false, (NOT p2), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), p0, (AND p0 p1 (NOT p2))]
Stuttering acceptance computed with spot in 465 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), false, (NOT p2), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), p0, (AND p0 p1 (NOT p2))]
Product exploration explored 100000 steps with 25000 reset in 176 ms.
Product exploration explored 100000 steps with 25000 reset in 183 ms.
Applying partial POR strategy [false, false, false, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 284 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), false, (NOT p2), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), p0, (AND p0 p1 (NOT p2))]
Support contains 8 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 323 transition count 660
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 48 place count 323 transition count 660
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 59 place count 323 transition count 660
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 79 place count 303 transition count 640
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 99 place count 303 transition count 640
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -138
Deduced a syphon composed of 127 places in 0 ms
Iterating global reduction 1 with 88 rules applied. Total rules applied 187 place count 303 transition count 778
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 224 place count 266 transition count 741
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 1 with 37 rules applied. Total rules applied 261 place count 266 transition count 741
Deduced a syphon composed of 90 places in 0 ms
Drop transitions removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 1 with 62 rules applied. Total rules applied 323 place count 266 transition count 679
Deduced a syphon composed of 90 places in 1 ms
Applied a total of 323 rules in 76 ms. Remains 266 /323 variables (removed 57) and now considering 679/660 (removed -19) transitions.
[2023-03-09 15:01:38] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 679 rows 266 cols
[2023-03-09 15:01:38] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-09 15:01:38] [INFO ] Dead Transitions using invariants and state equation in 273 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 266/323 places, 679/660 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 361 ms. Remains : 266/323 places, 679/660 transitions.
Built C files in :
/tmp/ltsmin13410460009363985668
[2023-03-09 15:01:38] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13410460009363985668
Running compilation step : cd /tmp/ltsmin13410460009363985668;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 895 ms.
Running link step : cd /tmp/ltsmin13410460009363985668;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin13410460009363985668;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4645485399375809016.hoa' '--buchi-type=spotba'
LTSmin run took 577 ms.
FORMULA CANInsertWithFailure-PT-010-LTLCardinality-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CANInsertWithFailure-PT-010-LTLCardinality-15 finished in 18962 ms.
All properties solved by simple procedures.
Total runtime 39772 ms.

BK_STOP 1678374100680

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANInsertWithFailure-PT-010"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is CANInsertWithFailure-PT-010, 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 r037-tajo-167813690700707"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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