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.r041-tajo-167813695100732.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 ltsminxred
Input is CANInsertWithFailure-PT-040, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813695100732
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 9.3K Feb 26 01:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 01:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 00:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 00:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 01:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 26 01:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 01:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 01:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:41 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 9.8M 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-040-LTLFireability-00
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-01
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-02
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-03
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-04
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-05
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-06
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-07
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-08
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-09
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-10
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-11
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-12
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-13
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-14
FORMULA_NAME CANInsertWithFailure-PT-040-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678661685741

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-040
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 22:54:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 22:54:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 22:54:48] [INFO ] Load time of PNML (sax parser for PT used): 402 ms
[2023-03-12 22:54:48] [INFO ] Transformed 3684 places.
[2023-03-12 22:54:48] [INFO ] Transformed 9840 transitions.
[2023-03-12 22:54:48] [INFO ] Parsed PT model containing 3684 places and 9840 transitions and 26400 arcs in 572 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CANInsertWithFailure-PT-040-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-040-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-040-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-040-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 3684 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3684/3684 places, 9840/9840 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3683 transition count 9840
Applied a total of 1 rules in 500 ms. Remains 3683 /3684 variables (removed 1) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2023-03-12 22:54:49] [INFO ] Computed 42 place invariants in 574 ms
[2023-03-12 22:54:50] [INFO ] Implicit Places using invariants in 1682 ms returned []
[2023-03-12 22:54:50] [INFO ] Invariant cache hit.
[2023-03-12 22:54:53] [INFO ] Implicit Places using invariants and state equation in 2833 ms returned []
Implicit Place search using SMT with State Equation took 4595 ms to find 0 implicit places.
[2023-03-12 22:54:53] [INFO ] Invariant cache hit.
[2023-03-12 22:54:59] [INFO ] Dead Transitions using invariants and state equation in 5423 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3683/3684 places, 9840/9840 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10523 ms. Remains : 3683/3684 places, 9840/9840 transitions.
Support contains 38 out of 3683 places after structural reductions.
[2023-03-12 22:54:59] [INFO ] Flatten gal took : 457 ms
[2023-03-12 22:55:00] [INFO ] Flatten gal took : 481 ms
[2023-03-12 22:55:00] [INFO ] Input system was already deterministic with 9840 transitions.
Support contains 37 out of 3683 places (down from 38) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 10 resets, run finished after 558 ms. (steps per millisecond=17 ) properties (out of 29) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-12 22:55:01] [INFO ] Invariant cache hit.
[2023-03-12 22:55:02] [INFO ] [Real]Absence check using 40 positive place invariants in 46 ms returned sat
[2023-03-12 22:55:02] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 54 ms returned sat
[2023-03-12 22:55:06] [INFO ] After 3093ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:10
[2023-03-12 22:55:06] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-12 22:55:09] [INFO ] After 2863ms SMT Verify possible using 3160 Read/Feed constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-12 22:55:09] [INFO ] After 7898ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-12 22:55:10] [INFO ] [Nat]Absence check using 40 positive place invariants in 35 ms returned sat
[2023-03-12 22:55:10] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 42 ms returned sat
[2023-03-12 22:55:19] [INFO ] After 7908ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-12 22:55:34] [INFO ] After 15653ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-12 22:55:34] [INFO ] After 15657ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-12 22:55:34] [INFO ] After 25099ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 5 properties in 216 ms.
Support contains 6 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1554 Post agglomeration using F-continuation condition.Transition count delta: 1554
Deduced a syphon composed of 1554 places in 5 ms
Reduce places removed 1554 places and 0 transitions.
Iterating global reduction 2 with 3108 rules applied. Total rules applied 3668 place count 1849 transition count 8006
Drop transitions removed 1476 transitions
Redundant transition composition rules discarded 1476 transitions
Iterating global reduction 2 with 1476 rules applied. Total rules applied 5144 place count 1849 transition count 6530
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5145 place count 1849 transition count 6529
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5146 place count 1848 transition count 6529
Partial Free-agglomeration rule applied 1641 times.
Drop transitions removed 1641 transitions
Iterating global reduction 3 with 1641 rules applied. Total rules applied 6787 place count 1848 transition count 6529
Applied a total of 6787 rules in 2273 ms. Remains 1848 /3683 variables (removed 1835) and now considering 6529/9840 (removed 3311) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2274 ms. Remains : 1848/3683 places, 6529/9840 transitions.
Incomplete random walk after 10000 steps, including 54 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 6529 rows 1848 cols
[2023-03-12 22:55:37] [INFO ] Computed 42 place invariants in 213 ms
[2023-03-12 22:55:37] [INFO ] [Real]Absence check using 40 positive place invariants in 15 ms returned sat
[2023-03-12 22:55:38] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 17 ms returned sat
[2023-03-12 22:55:40] [INFO ] After 2001ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2023-03-12 22:55:40] [INFO ] State equation strengthened by 6392 read => feed constraints.
[2023-03-12 22:55:41] [INFO ] After 1520ms SMT Verify possible using 6392 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 22:55:41] [INFO ] After 3975ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 22:55:42] [INFO ] [Nat]Absence check using 40 positive place invariants in 22 ms returned sat
[2023-03-12 22:55:42] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 25 ms returned sat
[2023-03-12 22:55:44] [INFO ] After 2460ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 22:55:45] [INFO ] After 1107ms SMT Verify possible using 6392 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 22:55:47] [INFO ] After 2721ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 674 ms.
[2023-03-12 22:55:47] [INFO ] After 6288ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 14 ms.
Support contains 2 out of 1848 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1848/1848 places, 6529/6529 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 1844 transition count 6525
Applied a total of 8 rules in 374 ms. Remains 1844 /1848 variables (removed 4) and now considering 6525/6529 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 375 ms. Remains : 1844/1848 places, 6525/6529 transitions.
Finished random walk after 5245 steps, including 28 resets, run visited all 2 properties in 62 ms. (steps per millisecond=84 )
FORMULA CANInsertWithFailure-PT-040-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 162 stabilizing places and 280 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 195 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2023-03-12 22:55:49] [INFO ] Computed 42 place invariants in 569 ms
[2023-03-12 22:55:50] [INFO ] Implicit Places using invariants in 1362 ms returned []
[2023-03-12 22:55:50] [INFO ] Invariant cache hit.
[2023-03-12 22:55:51] [INFO ] Implicit Places using invariants and state equation in 711 ms returned []
Implicit Place search using SMT with State Equation took 2088 ms to find 0 implicit places.
[2023-03-12 22:55:51] [INFO ] Invariant cache hit.
[2023-03-12 22:55:56] [INFO ] Dead Transitions using invariants and state equation in 5245 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7534 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 228 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-01 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:(GEQ s116 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 946 steps with 0 reset in 23 ms.
FORMULA CANInsertWithFailure-PT-040-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-01 finished in 7870 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U (X((p1 U p2))||G(p3))))'
Support contains 4 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 257 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2023-03-12 22:55:57] [INFO ] Invariant cache hit.
[2023-03-12 22:55:59] [INFO ] Implicit Places using invariants in 2003 ms returned []
[2023-03-12 22:55:59] [INFO ] Invariant cache hit.
[2023-03-12 22:55:59] [INFO ] Implicit Places using invariants and state equation in 827 ms returned []
Implicit Place search using SMT with State Equation took 2834 ms to find 0 implicit places.
[2023-03-12 22:55:59] [INFO ] Invariant cache hit.
[2023-03-12 22:56:04] [INFO ] Dead Transitions using invariants and state equation in 4460 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7556 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 381 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=p3, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=(AND p3 (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND p3 (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p3 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p3 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND p3 (NOT p2) (NOT p1)), acceptance={} source=4 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(NOT p3), acceptance={} source=7 dest: 6}, { cond=p3, acceptance={} source=7 dest: 7}]], initial=0, aps=[p3:(LT s187 1), p0:(OR (GEQ s3458 1) (LT s812 1)), p2:(GEQ s3248 1), p1:(GEQ s3458 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 104 reset in 999 ms.
Product exploration explored 100000 steps with 103 reset in 1048 ms.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Detected a total of 162/3683 stabilizing places and 280/9840 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p3 p0 (NOT p2) (NOT p1)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p3 (NOT p0) (NOT p2) p1))), (X (AND p3 (NOT p2) (NOT p1))), (X (AND p3 (NOT p2))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p3 (NOT p2) p1))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2))))), (X (X (NOT (AND p3 (NOT p2) p1)))), true, (X (X (NOT (AND p3 (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X (AND p3 (NOT p2) (NOT p1)))), (X (X (NOT (AND p3 (NOT p2) (NOT p1))))), (X (X (AND p3 (NOT p2)))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT p3))), (X (X p3))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 23 factoid took 1572 ms. Reduced automaton from 8 states, 24 edges and 4 AP (stutter sensitive) to 7 states, 21 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p3), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 9 resets, run finished after 279 ms. (steps per millisecond=35 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-12 22:56:09] [INFO ] Invariant cache hit.
[2023-03-12 22:56:09] [INFO ] [Real]Absence check using 40 positive place invariants in 50 ms returned sat
[2023-03-12 22:56:09] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 56 ms returned sat
[2023-03-12 22:56:16] [INFO ] After 5945ms SMT Verify possible using state equation in real domain returned unsat :3 sat :1 real:6
[2023-03-12 22:56:16] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-12 22:56:16] [INFO ] After 790ms SMT Verify possible using 3160 Read/Feed constraints in real domain returned unsat :3 sat :0 real:7
[2023-03-12 22:56:16] [INFO ] After 7858ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:7
[2023-03-12 22:56:17] [INFO ] [Nat]Absence check using 40 positive place invariants in 36 ms returned sat
[2023-03-12 22:56:17] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 47 ms returned sat
[2023-03-12 22:56:23] [INFO ] After 5080ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :7
[2023-03-12 22:56:39] [INFO ] After 15918ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :3 sat :6
[2023-03-12 22:56:42] [INFO ] After 18712ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :6
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-12 22:56:42] [INFO ] After 25167ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :6
Fused 10 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 87 ms.
Support contains 4 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 277 transitions
Trivial Post-agglo rules discarded 277 transitions
Performed 277 trivial Post agglomeration. Transition count delta: 277
Iterating post reduction 0 with 277 rules applied. Total rules applied 277 place count 3683 transition count 9563
Reduce places removed 277 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 278 rules applied. Total rules applied 555 place count 3406 transition count 9562
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 556 place count 3405 transition count 9562
Performed 1557 Post agglomeration using F-continuation condition.Transition count delta: 1557
Deduced a syphon composed of 1557 places in 3 ms
Reduce places removed 1557 places and 0 transitions.
Iterating global reduction 3 with 3114 rules applied. Total rules applied 3670 place count 1848 transition count 8005
Drop transitions removed 1479 transitions
Redundant transition composition rules discarded 1479 transitions
Iterating global reduction 3 with 1479 rules applied. Total rules applied 5149 place count 1848 transition count 6526
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5151 place count 1848 transition count 6524
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 5153 place count 1846 transition count 6524
Partial Free-agglomeration rule applied 1641 times.
Drop transitions removed 1641 transitions
Iterating global reduction 4 with 1641 rules applied. Total rules applied 6794 place count 1846 transition count 6524
Applied a total of 6794 rules in 1725 ms. Remains 1846 /3683 variables (removed 1837) and now considering 6524/9840 (removed 3316) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1725 ms. Remains : 1846/3683 places, 6524/9840 transitions.
Incomplete random walk after 10000 steps, including 53 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 94594 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 94594 steps, saw 25615 distinct states, run finished after 3002 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 6524 rows 1846 cols
[2023-03-12 22:56:47] [INFO ] Computed 42 place invariants in 136 ms
[2023-03-12 22:56:47] [INFO ] [Real]Absence check using 40 positive place invariants in 18 ms returned sat
[2023-03-12 22:56:48] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 21 ms returned sat
[2023-03-12 22:56:49] [INFO ] After 1444ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:6
[2023-03-12 22:56:49] [INFO ] State equation strengthened by 6395 read => feed constraints.
[2023-03-12 22:56:50] [INFO ] After 975ms SMT Verify possible using 6395 Read/Feed constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-12 22:56:50] [INFO ] After 2997ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-12 22:56:50] [INFO ] [Nat]Absence check using 40 positive place invariants in 18 ms returned sat
[2023-03-12 22:56:50] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 22 ms returned sat
[2023-03-12 22:56:53] [INFO ] After 2874ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-12 22:56:56] [INFO ] After 2844ms SMT Verify possible using 6395 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-12 22:56:59] [INFO ] After 5419ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 1697 ms.
[2023-03-12 22:57:01] [INFO ] After 10520ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 72 ms.
Support contains 4 out of 1846 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1846/1846 places, 6524/6524 transitions.
Applied a total of 0 rules in 289 ms. Remains 1846 /1846 variables (removed 0) and now considering 6524/6524 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 290 ms. Remains : 1846/1846 places, 6524/6524 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1846/1846 places, 6524/6524 transitions.
Applied a total of 0 rules in 235 ms. Remains 1846 /1846 variables (removed 0) and now considering 6524/6524 (removed 0) transitions.
[2023-03-12 22:57:01] [INFO ] Invariant cache hit.
[2023-03-12 22:57:03] [INFO ] Implicit Places using invariants in 2113 ms returned []
[2023-03-12 22:57:03] [INFO ] Invariant cache hit.
[2023-03-12 22:57:04] [INFO ] State equation strengthened by 6395 read => feed constraints.
[2023-03-12 22:57:15] [INFO ] Implicit Places using invariants and state equation in 11374 ms returned []
Implicit Place search using SMT with State Equation took 13489 ms to find 0 implicit places.
[2023-03-12 22:57:16] [INFO ] Redundant transitions in 791 ms returned []
[2023-03-12 22:57:16] [INFO ] Invariant cache hit.
[2023-03-12 22:57:18] [INFO ] Dead Transitions using invariants and state equation in 2850 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17394 ms. Remains : 1846/1846 places, 6524/6524 transitions.
Graph (trivial) has 6272 edges and 1846 vertex of which 1679 / 1846 are part of one of the 2 SCC in 5 ms
Free SCC test removed 1677 places
Drop transitions removed 4716 transitions
Ensure Unique test removed 1632 transitions
Reduce isomorphic transitions removed 6348 transitions.
Graph (complete) has 418 edges and 169 vertex of which 49 are kept as prefixes of interest. Removing 120 places using SCC suffix rule.1 ms
Discarding 120 places :
Also discarding 39 output transitions
Drop transitions removed 39 transitions
Drop transitions removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 81 rules applied. Total rules applied 83 place count 49 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 84 place count 48 transition count 56
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 121 place count 11 transition count 19
Iterating global reduction 2 with 37 rules applied. Total rules applied 158 place count 11 transition count 19
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 160 place count 11 transition count 17
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 161 place count 11 transition count 16
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 163 place count 10 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 164 place count 9 transition count 14
Applied a total of 164 rules in 30 ms. Remains 9 /1846 variables (removed 1837) and now considering 14/6524 (removed 6510) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 14 rows 9 cols
[2023-03-12 22:57:18] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-12 22:57:18] [INFO ] After 16ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:6
[2023-03-12 22:57:18] [INFO ] After 18ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:6
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-12 22:57:18] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:6
[2023-03-12 22:57:19] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-12 22:57:19] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-12 22:57:19] [INFO ] After 58ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p3 p0 (NOT p2) (NOT p1)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p3 (NOT p0) (NOT p2) p1))), (X (AND p3 (NOT p2) (NOT p1))), (X (AND p3 (NOT p2))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p3 (NOT p2) p1))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2))))), (X (X (NOT (AND p3 (NOT p2) p1)))), true, (X (X (NOT (AND p3 (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p3) (G (NOT p3)))), (G (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2)))), (G (NOT (AND (NOT p0) p1 (NOT p2)))), (G (NOT (AND (NOT p0) p3 p1 (NOT p2))))]
False Knowledge obtained : [(X (X (AND p3 (NOT p2) (NOT p1)))), (X (X (NOT (AND p3 (NOT p2) (NOT p1))))), (X (X (AND p3 (NOT p2)))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (AND (NOT p3) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT p3))), (X (X p3)), (F (NOT p3)), (F (NOT (AND p3 (NOT p1) (NOT p2)))), (F (AND (NOT p3) (NOT p1) (NOT p2))), (F (NOT (AND p3 (NOT p2)))), (F (AND (NOT p3) (NOT p2)))]
Knowledge based reduction with 26 factoid took 1898 ms. Reduced automaton from 7 states, 21 edges and 4 AP (stutter sensitive) to 6 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2) p3), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 259 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2) p3), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3))]
Support contains 4 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 299 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2023-03-12 22:57:22] [INFO ] Computed 42 place invariants in 513 ms
[2023-03-12 22:57:23] [INFO ] Implicit Places using invariants in 1479 ms returned []
[2023-03-12 22:57:23] [INFO ] Invariant cache hit.
[2023-03-12 22:57:26] [INFO ] Implicit Places using invariants and state equation in 3315 ms returned []
Implicit Place search using SMT with State Equation took 4817 ms to find 0 implicit places.
[2023-03-12 22:57:26] [INFO ] Invariant cache hit.
[2023-03-12 22:57:31] [INFO ] Dead Transitions using invariants and state equation in 4911 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10028 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Detected a total of 162/3683 stabilizing places and 280/9840 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p3 p0), (X (AND (NOT p2) p3)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (AND (NOT p1) (NOT p2) p3)), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X p3), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), true, (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (AND (NOT p1) (NOT p2) p3))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT p3))), (X (X p3))]
Knowledge based reduction with 17 factoid took 980 ms. Reduced automaton from 6 states, 17 edges and 4 AP (stutter sensitive) to 6 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2) p3), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 11 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 11) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-12 22:57:33] [INFO ] Invariant cache hit.
[2023-03-12 22:57:33] [INFO ] [Real]Absence check using 40 positive place invariants in 28 ms returned sat
[2023-03-12 22:57:33] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 38 ms returned sat
[2023-03-12 22:57:39] [INFO ] After 5808ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-12 22:57:39] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2023-03-12 22:57:40] [INFO ] After 839ms SMT Verify possible using 3160 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 22:57:40] [INFO ] After 7359ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 22:57:41] [INFO ] [Nat]Absence check using 40 positive place invariants in 47 ms returned sat
[2023-03-12 22:57:41] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 55 ms returned sat
[2023-03-12 22:57:46] [INFO ] After 4580ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 22:57:55] [INFO ] After 9716ms SMT Verify possible using 3160 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 22:57:58] [INFO ] After 11846ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2338 ms.
[2023-03-12 22:58:00] [INFO ] After 19814ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 41 ms.
Support contains 4 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 277 transitions
Trivial Post-agglo rules discarded 277 transitions
Performed 277 trivial Post agglomeration. Transition count delta: 277
Iterating post reduction 0 with 277 rules applied. Total rules applied 277 place count 3683 transition count 9563
Reduce places removed 277 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 278 rules applied. Total rules applied 555 place count 3406 transition count 9562
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 556 place count 3405 transition count 9562
Performed 1557 Post agglomeration using F-continuation condition.Transition count delta: 1557
Deduced a syphon composed of 1557 places in 4 ms
Reduce places removed 1557 places and 0 transitions.
Iterating global reduction 3 with 3114 rules applied. Total rules applied 3670 place count 1848 transition count 8005
Drop transitions removed 1479 transitions
Redundant transition composition rules discarded 1479 transitions
Iterating global reduction 3 with 1479 rules applied. Total rules applied 5149 place count 1848 transition count 6526
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5151 place count 1848 transition count 6524
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 5153 place count 1846 transition count 6524
Partial Free-agglomeration rule applied 1641 times.
Drop transitions removed 1641 transitions
Iterating global reduction 4 with 1641 rules applied. Total rules applied 6794 place count 1846 transition count 6524
Applied a total of 6794 rules in 1917 ms. Remains 1846 /3683 variables (removed 1837) and now considering 6524/9840 (removed 3316) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1931 ms. Remains : 1846/3683 places, 6524/9840 transitions.
Incomplete random walk after 10000 steps, including 54 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 103365 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 103365 steps, saw 26688 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 6524 rows 1846 cols
[2023-03-12 22:58:05] [INFO ] Computed 42 place invariants in 136 ms
[2023-03-12 22:58:06] [INFO ] [Real]Absence check using 40 positive place invariants in 15 ms returned sat
[2023-03-12 22:58:06] [INFO ] [Real]Absence check using 40 positive and 2 generalized place invariants in 18 ms returned sat
[2023-03-12 22:58:07] [INFO ] After 1353ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-12 22:58:07] [INFO ] State equation strengthened by 6395 read => feed constraints.
[2023-03-12 22:58:08] [INFO ] After 868ms SMT Verify possible using 6395 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 22:58:08] [INFO ] After 2629ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 22:58:08] [INFO ] [Nat]Absence check using 40 positive place invariants in 16 ms returned sat
[2023-03-12 22:58:08] [INFO ] [Nat]Absence check using 40 positive and 2 generalized place invariants in 20 ms returned sat
[2023-03-12 22:58:11] [INFO ] After 2511ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 22:58:13] [INFO ] After 2006ms SMT Verify possible using 6395 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 22:58:14] [INFO ] After 3356ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 831 ms.
[2023-03-12 22:58:15] [INFO ] After 7166ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 1846 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1846/1846 places, 6524/6524 transitions.
Applied a total of 0 rules in 266 ms. Remains 1846 /1846 variables (removed 0) and now considering 6524/6524 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 278 ms. Remains : 1846/1846 places, 6524/6524 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1846/1846 places, 6524/6524 transitions.
Applied a total of 0 rules in 235 ms. Remains 1846 /1846 variables (removed 0) and now considering 6524/6524 (removed 0) transitions.
[2023-03-12 22:58:16] [INFO ] Invariant cache hit.
[2023-03-12 22:58:18] [INFO ] Implicit Places using invariants in 1880 ms returned []
[2023-03-12 22:58:18] [INFO ] Invariant cache hit.
[2023-03-12 22:58:18] [INFO ] State equation strengthened by 6395 read => feed constraints.
[2023-03-12 22:58:29] [INFO ] Implicit Places using invariants and state equation in 11396 ms returned []
Implicit Place search using SMT with State Equation took 13302 ms to find 0 implicit places.
[2023-03-12 22:58:30] [INFO ] Redundant transitions in 653 ms returned []
[2023-03-12 22:58:30] [INFO ] Invariant cache hit.
[2023-03-12 22:58:32] [INFO ] Dead Transitions using invariants and state equation in 2657 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16865 ms. Remains : 1846/1846 places, 6524/6524 transitions.
Graph (trivial) has 6272 edges and 1846 vertex of which 1679 / 1846 are part of one of the 2 SCC in 1 ms
Free SCC test removed 1677 places
Drop transitions removed 4716 transitions
Ensure Unique test removed 1632 transitions
Reduce isomorphic transitions removed 6348 transitions.
Graph (complete) has 418 edges and 169 vertex of which 49 are kept as prefixes of interest. Removing 120 places using SCC suffix rule.1 ms
Discarding 120 places :
Also discarding 39 output transitions
Drop transitions removed 39 transitions
Drop transitions removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 81 rules applied. Total rules applied 83 place count 49 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 84 place count 48 transition count 56
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 121 place count 11 transition count 19
Iterating global reduction 2 with 37 rules applied. Total rules applied 158 place count 11 transition count 19
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 160 place count 11 transition count 17
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 161 place count 11 transition count 16
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 163 place count 10 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 164 place count 9 transition count 14
Applied a total of 164 rules in 11 ms. Remains 9 /1846 variables (removed 1837) and now considering 14/6524 (removed 6510) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 14 rows 9 cols
[2023-03-12 22:58:32] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-12 22:58:32] [INFO ] After 4ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-12 22:58:32] [INFO ] After 6ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:3
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-12 22:58:32] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:3
[2023-03-12 22:58:32] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 22:58:32] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-12 22:58:32] [INFO ] After 59ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p1) (NOT p2) p3 p0), (X (AND (NOT p2) p3)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (AND (NOT p1) (NOT p2) p3)), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X p3), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), true, (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (AND (NOT p1) (NOT p2) p3))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT p3))), (X (X p3)), (F (NOT (AND p3 (NOT p2)))), (F (AND (NOT p3) (NOT p2))), (F (NOT (AND (NOT p1) p3 (NOT p2)))), (F (AND p3 (NOT p2) (NOT p0))), (F (NOT p0)), (F (NOT p3)), (F (AND (NOT p1) (NOT p3) (NOT p2)))]
Knowledge based reduction with 17 factoid took 936 ms. Reduced automaton from 6 states, 17 edges and 4 AP (stutter sensitive) to 6 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2) p3), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 187 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2) p3), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 188 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2) p3), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 100 reset in 840 ms.
Product exploration explored 100000 steps with 103 reset in 921 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 248 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2) p3), (AND (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3))]
Support contains 4 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Performed 199 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 3683 transition count 9840
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 40 Pre rules applied. Total rules applied 199 place count 3683 transition count 9840
Deduced a syphon composed of 239 places in 2 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 239 place count 3683 transition count 9840
Discarding 80 places :
Symmetric choice reduction at 1 with 80 rule applications. Total rules 319 place count 3603 transition count 9760
Deduced a syphon composed of 159 places in 2 ms
Iterating global reduction 1 with 80 rules applied. Total rules applied 399 place count 3603 transition count 9760
Performed 1596 Post agglomeration using F-continuation condition.Transition count delta: -3034
Deduced a syphon composed of 1755 places in 3 ms
Iterating global reduction 1 with 1596 rules applied. Total rules applied 1995 place count 3603 transition count 12794
Discarding 158 places :
Symmetric choice reduction at 1 with 158 rule applications. Total rules 2153 place count 3445 transition count 12636
Deduced a syphon composed of 1597 places in 2 ms
Iterating global reduction 1 with 158 rules applied. Total rules applied 2311 place count 3445 transition count 12636
Deduced a syphon composed of 1597 places in 2 ms
Drop transitions removed 1479 transitions
Redundant transition composition rules discarded 1479 transitions
Iterating global reduction 1 with 1479 rules applied. Total rules applied 3790 place count 3445 transition count 11157
Deduced a syphon composed of 1597 places in 2 ms
Applied a total of 3790 rules in 2563 ms. Remains 3445 /3683 variables (removed 238) and now considering 11157/9840 (removed -1317) transitions.
// Phase 1: matrix 11157 rows 3445 cols
[2023-03-12 22:58:39] [INFO ] Computed 42 place invariants in 534 ms
[2023-03-12 22:58:45] [INFO ] Dead Transitions using invariants and state equation in 6474 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3445/3683 places, 11157/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9043 ms. Remains : 3445/3683 places, 11157/9840 transitions.
Support contains 4 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 230 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2023-03-12 22:58:46] [INFO ] Computed 42 place invariants in 384 ms
[2023-03-12 22:58:48] [INFO ] Implicit Places using invariants in 2247 ms returned []
[2023-03-12 22:58:48] [INFO ] Invariant cache hit.
[2023-03-12 22:58:51] [INFO ] Implicit Places using invariants and state equation in 2894 ms returned []
Implicit Place search using SMT with State Equation took 5152 ms to find 0 implicit places.
[2023-03-12 22:58:51] [INFO ] Invariant cache hit.
[2023-03-12 22:58:55] [INFO ] Dead Transitions using invariants and state equation in 4296 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9679 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-03 finished in 179104 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&&X(X((G(F(p1)) U G(p2))))))))'
Support contains 6 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 228 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2023-03-12 22:58:56] [INFO ] Invariant cache hit.
[2023-03-12 22:58:58] [INFO ] Implicit Places using invariants in 1904 ms returned []
[2023-03-12 22:58:58] [INFO ] Invariant cache hit.
[2023-03-12 22:58:59] [INFO ] Implicit Places using invariants and state equation in 1725 ms returned []
Implicit Place search using SMT with State Equation took 3647 ms to find 0 implicit places.
[2023-03-12 22:58:59] [INFO ] Invariant cache hit.
[2023-03-12 22:59:04] [INFO ] Dead Transitions using invariants and state equation in 5073 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8958 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 358 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) (NOT p2)), false, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p2), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 8}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 9}], [{ cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 8}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 5}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=5 dest: 8}, { cond=(AND p0 p2), acceptance={} source=5 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 8}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=6 dest: 10}], [{ cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 7}, { cond=(AND p0 p2), acceptance={} source=7 dest: 11}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=8 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0} source=8 dest: 10}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=9 dest: 6}, { cond=(NOT p0), acceptance={} source=9 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={} source=9 dest: 10}, { cond=p0, acceptance={} source=9 dest: 11}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=10 dest: 6}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=10 dest: 6}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=10 dest: 10}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=10 dest: 10}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=11 dest: 6}, { cond=(NOT p0), acceptance={} source=11 dest: 7}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=11 dest: 10}, { cond=p0, acceptance={} source=11 dest: 11}]], initial=0, aps=[p0:(OR (GEQ s2302 1) (GEQ s1730 1)), p2:(AND (GEQ s413 1) (GEQ s853 1)), p1:(AND (GEQ s223 1) (GEQ s225 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1003 steps with 0 reset in 8 ms.
FORMULA CANInsertWithFailure-PT-040-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-04 finished in 9391 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(((X(p0)&&F(p1))||(p2&&G(p3)))))'
Support contains 4 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 213 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2023-03-12 22:59:05] [INFO ] Invariant cache hit.
[2023-03-12 22:59:07] [INFO ] Implicit Places using invariants in 1852 ms returned []
[2023-03-12 22:59:07] [INFO ] Invariant cache hit.
[2023-03-12 22:59:10] [INFO ] Implicit Places using invariants and state equation in 2778 ms returned []
Implicit Place search using SMT with State Equation took 4632 ms to find 0 implicit places.
[2023-03-12 22:59:10] [INFO ] Invariant cache hit.
[2023-03-12 22:59:15] [INFO ] Dead Transitions using invariants and state equation in 4904 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9774 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p3) (NOT p0)), true, (NOT p3)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p2) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), acceptance={} source=0 dest: 2}, { cond=(AND p2 p3), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p3 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 4}, { cond=p3, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(GEQ s1444 1), p3:(GEQ s2534 1), p1:(GEQ s1895 1), p0:(GEQ s804 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1199 steps with 0 reset in 16 ms.
FORMULA CANInsertWithFailure-PT-040-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-05 finished in 9994 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&(p1||X((X((F(!p2)||X(G(!p3)))) U (p1&&X((F(!p2)||X(G(!p3)))))))))))'
Support contains 6 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 211 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2023-03-12 22:59:15] [INFO ] Invariant cache hit.
[2023-03-12 22:59:17] [INFO ] Implicit Places using invariants in 1851 ms returned []
[2023-03-12 22:59:17] [INFO ] Invariant cache hit.
[2023-03-12 22:59:20] [INFO ] Implicit Places using invariants and state equation in 2845 ms returned []
Implicit Place search using SMT with State Equation took 4701 ms to find 0 implicit places.
[2023-03-12 22:59:20] [INFO ] Invariant cache hit.
[2023-03-12 22:59:25] [INFO ] Dead Transitions using invariants and state equation in 5050 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9980 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 328 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (AND (NOT p0) p2 p3)), (OR (AND (NOT p0) p2 p3) (AND (NOT p1) p2 p3)), (OR (AND (NOT p0) p2 p3) (AND (NOT p1) p2 p3)), (OR (AND (NOT p0) p2 p3) (AND (NOT p1) p2 p3)), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (OR (AND (NOT p0) p2 p3) (AND (NOT p1) p2)), (OR (AND (NOT p0) p2 p3) (AND (NOT p1) p2 p3))]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p2 p3), acceptance={0} source=3 dest: 5}, { cond=(AND p0 (NOT p1) p2 p3), acceptance={0} source=3 dest: 6}], [{ cond=(AND (NOT p0) p2 p3), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p2 p3), acceptance={0} source=4 dest: 6}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=5 dest: 6}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p0) p2 p3), acceptance={0} source=7 dest: 3}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=7 dest: 4}, { cond=(AND p0 (NOT p1) p2 p3), acceptance={0} source=7 dest: 4}]], initial=0, aps=[p0:(LT s1720 1), p1:(GEQ s1828 1), p2:(AND (GEQ s301 1) (GEQ s404 1)), p3:(AND (GEQ s516 1) (GEQ s539 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 977 steps with 0 reset in 11 ms.
FORMULA CANInsertWithFailure-PT-040-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-06 finished in 10355 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 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 278 transitions
Trivial Post-agglo rules discarded 278 transitions
Performed 278 trivial Post agglomeration. Transition count delta: 278
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 3683 transition count 9562
Reduce places removed 278 places and 0 transitions.
Iterating post reduction 1 with 278 rules applied. Total rules applied 556 place count 3405 transition count 9562
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 556 place count 3405 transition count 9561
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 558 place count 3404 transition count 9561
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 3 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3676 place count 1845 transition count 8002
Drop transitions removed 1482 transitions
Redundant transition composition rules discarded 1482 transitions
Iterating global reduction 2 with 1482 rules applied. Total rules applied 5158 place count 1845 transition count 6520
Applied a total of 5158 rules in 1123 ms. Remains 1845 /3683 variables (removed 1838) and now considering 6520/9840 (removed 3320) transitions.
// Phase 1: matrix 6520 rows 1845 cols
[2023-03-12 22:59:26] [INFO ] Computed 42 place invariants in 190 ms
[2023-03-12 22:59:28] [INFO ] Implicit Places using invariants in 1342 ms returned []
[2023-03-12 22:59:28] [INFO ] Invariant cache hit.
[2023-03-12 22:59:29] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2023-03-12 22:59:31] [INFO ] Implicit Places using invariants and state equation in 3322 ms returned []
Implicit Place search using SMT with State Equation took 4671 ms to find 0 implicit places.
[2023-03-12 22:59:32] [INFO ] Redundant transitions in 594 ms returned []
[2023-03-12 22:59:32] [INFO ] Invariant cache hit.
[2023-03-12 22:59:34] [INFO ] Dead Transitions using invariants and state equation in 2871 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1845/3683 places, 6520/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9282 ms. Remains : 1845/3683 places, 6520/9840 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s114 1) (GEQ s132 1))], 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 233 steps with 0 reset in 2 ms.
FORMULA CANInsertWithFailure-PT-040-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-07 finished in 9337 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 p1))'
Support contains 2 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 206 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2023-03-12 22:59:35] [INFO ] Computed 42 place invariants in 411 ms
[2023-03-12 22:59:36] [INFO ] Implicit Places using invariants in 1267 ms returned []
[2023-03-12 22:59:36] [INFO ] Invariant cache hit.
[2023-03-12 22:59:39] [INFO ] Implicit Places using invariants and state equation in 3304 ms returned []
Implicit Place search using SMT with State Equation took 4587 ms to find 0 implicit places.
[2023-03-12 22:59:39] [INFO ] Invariant cache hit.
[2023-03-12 22:59:45] [INFO ] Dead Transitions using invariants and state equation in 5383 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10181 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(GEQ s2774 1), p0:(GEQ s605 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-040-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-08 finished in 10275 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||(p1 U (G(p1)||(p1&&G(!p2)))))))'
Support contains 4 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 242 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
[2023-03-12 22:59:45] [INFO ] Invariant cache hit.
[2023-03-12 22:59:46] [INFO ] Implicit Places using invariants in 878 ms returned []
[2023-03-12 22:59:46] [INFO ] Invariant cache hit.
[2023-03-12 22:59:48] [INFO ] Implicit Places using invariants and state equation in 1899 ms returned []
Implicit Place search using SMT with State Equation took 2782 ms to find 0 implicit places.
[2023-03-12 22:59:48] [INFO ] Invariant cache hit.
[2023-03-12 22:59:52] [INFO ] Dead Transitions using invariants and state equation in 4087 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7122 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 149 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) p2), p2]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p2 p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=p2, acceptance={} source=5 dest: 0}, { cond=(NOT p2), acceptance={} source=5 dest: 5}]], initial=1, aps=[p1:(LT s3244 1), p2:(AND (GEQ s469 1) (GEQ s2889 1)), p0:(LT s3659 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2513 ms.
Product exploration explored 100000 steps with 50000 reset in 2317 ms.
Computed a total of 162 stabilizing places and 280 stable transitions
Computed a total of 162 stabilizing places and 280 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), true, (X (X (NOT (AND p2 p1)))), (X (X p1)), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 10 factoid took 173 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-040-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-11 finished in 12325 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 4 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3678 place count 1844 transition count 8001
Drop transitions removed 1481 transitions
Redundant transition composition rules discarded 1481 transitions
Iterating global reduction 2 with 1481 rules applied. Total rules applied 5159 place count 1844 transition count 6520
Applied a total of 5159 rules in 1117 ms. Remains 1844 /3683 variables (removed 1839) and now considering 6520/9840 (removed 3320) transitions.
// Phase 1: matrix 6520 rows 1844 cols
[2023-03-12 22:59:58] [INFO ] Computed 42 place invariants in 181 ms
[2023-03-12 23:00:00] [INFO ] Implicit Places using invariants in 1433 ms returned []
[2023-03-12 23:00:00] [INFO ] Invariant cache hit.
[2023-03-12 23:00:02] [INFO ] Implicit Places using invariants and state equation in 2005 ms returned []
Implicit Place search using SMT with State Equation took 3441 ms to find 0 implicit places.
[2023-03-12 23:00:02] [INFO ] Redundant transitions in 477 ms returned []
[2023-03-12 23:00:02] [INFO ] Invariant cache hit.
[2023-03-12 23:00:05] [INFO ] Dead Transitions using invariants and state equation in 2845 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1844/3683 places, 6520/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7888 ms. Remains : 1844/3683 places, 6520/9840 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s671 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 492 reset in 1165 ms.
Stack based approach found an accepted trace after 49794 steps with 244 reset with depth 209 and stack size 208 in 641 ms.
FORMULA CANInsertWithFailure-PT-040-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-12 finished in 9742 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 3683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions removed 278 transitions
Trivial Post-agglo rules discarded 278 transitions
Performed 278 trivial Post agglomeration. Transition count delta: 278
Iterating post reduction 0 with 278 rules applied. Total rules applied 278 place count 3683 transition count 9562
Reduce places removed 278 places and 0 transitions.
Iterating post reduction 1 with 278 rules applied. Total rules applied 556 place count 3405 transition count 9562
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 556 place count 3405 transition count 9561
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 558 place count 3404 transition count 9561
Performed 1559 Post agglomeration using F-continuation condition.Transition count delta: 1559
Deduced a syphon composed of 1559 places in 2 ms
Reduce places removed 1559 places and 0 transitions.
Iterating global reduction 2 with 3118 rules applied. Total rules applied 3676 place count 1845 transition count 8002
Drop transitions removed 1482 transitions
Redundant transition composition rules discarded 1482 transitions
Iterating global reduction 2 with 1482 rules applied. Total rules applied 5158 place count 1845 transition count 6520
Applied a total of 5158 rules in 1021 ms. Remains 1845 /3683 variables (removed 1838) and now considering 6520/9840 (removed 3320) transitions.
// Phase 1: matrix 6520 rows 1845 cols
[2023-03-12 23:00:08] [INFO ] Computed 42 place invariants in 200 ms
[2023-03-12 23:00:09] [INFO ] Implicit Places using invariants in 1434 ms returned []
[2023-03-12 23:00:09] [INFO ] Invariant cache hit.
[2023-03-12 23:00:10] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2023-03-12 23:00:12] [INFO ] Implicit Places using invariants and state equation in 3144 ms returned []
Implicit Place search using SMT with State Equation took 4606 ms to find 0 implicit places.
[2023-03-12 23:00:13] [INFO ] Redundant transitions in 461 ms returned []
[2023-03-12 23:00:13] [INFO ] Invariant cache hit.
[2023-03-12 23:00:16] [INFO ] Dead Transitions using invariants and state equation in 2644 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1845/3683 places, 6520/9840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8744 ms. Remains : 1845/3683 places, 6520/9840 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s156 1) (LT s174 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 512 reset in 915 ms.
Product exploration explored 100000 steps with 517 reset in 1125 ms.
Computed a total of 121 stabilizing places and 200 stable transitions
Computed a total of 121 stabilizing places and 200 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 146 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Finished random walk after 163 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=40 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 190 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1845 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1845/1845 places, 6520/6520 transitions.
Applied a total of 0 rules in 213 ms. Remains 1845 /1845 variables (removed 0) and now considering 6520/6520 (removed 0) transitions.
[2023-03-12 23:00:19] [INFO ] Invariant cache hit.
[2023-03-12 23:00:20] [INFO ] Implicit Places using invariants in 1284 ms returned []
[2023-03-12 23:00:20] [INFO ] Invariant cache hit.
[2023-03-12 23:00:21] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2023-03-12 23:00:23] [INFO ] Implicit Places using invariants and state equation in 3370 ms returned []
Implicit Place search using SMT with State Equation took 4658 ms to find 0 implicit places.
[2023-03-12 23:00:24] [INFO ] Redundant transitions in 549 ms returned []
[2023-03-12 23:00:24] [INFO ] Invariant cache hit.
[2023-03-12 23:00:27] [INFO ] Dead Transitions using invariants and state equation in 2834 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8276 ms. Remains : 1845/1845 places, 6520/6520 transitions.
Computed a total of 121 stabilizing places and 200 stable transitions
Computed a total of 121 stabilizing places and 200 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2193 steps, including 10 resets, run visited all 1 properties in 20 ms. (steps per millisecond=109 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 517 reset in 903 ms.
Product exploration explored 100000 steps with 515 reset in 921 ms.
Support contains 2 out of 1845 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1845/1845 places, 6520/6520 transitions.
Applied a total of 0 rules in 155 ms. Remains 1845 /1845 variables (removed 0) and now considering 6520/6520 (removed 0) transitions.
[2023-03-12 23:00:29] [INFO ] Invariant cache hit.
[2023-03-12 23:00:30] [INFO ] Implicit Places using invariants in 1120 ms returned []
[2023-03-12 23:00:30] [INFO ] Invariant cache hit.
[2023-03-12 23:00:31] [INFO ] State equation strengthened by 4757 read => feed constraints.
[2023-03-12 23:00:33] [INFO ] Implicit Places using invariants and state equation in 3177 ms returned []
Implicit Place search using SMT with State Equation took 4313 ms to find 0 implicit places.
[2023-03-12 23:00:34] [INFO ] Redundant transitions in 446 ms returned []
[2023-03-12 23:00:34] [INFO ] Invariant cache hit.
[2023-03-12 23:00:37] [INFO ] Dead Transitions using invariants and state equation in 2677 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7615 ms. Remains : 1845/1845 places, 6520/6520 transitions.
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-13 finished in 29998 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) U X(X(p1))))'
Support contains 2 out of 3683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 293 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2023-03-12 23:00:38] [INFO ] Computed 42 place invariants in 470 ms
[2023-03-12 23:00:38] [INFO ] Implicit Places using invariants in 1312 ms returned []
[2023-03-12 23:00:39] [INFO ] Invariant cache hit.
[2023-03-12 23:00:40] [INFO ] Implicit Places using invariants and state equation in 1878 ms returned []
Implicit Place search using SMT with State Equation took 3208 ms to find 0 implicit places.
[2023-03-12 23:00:40] [INFO ] Invariant cache hit.
[2023-03-12 23:00:45] [INFO ] Dead Transitions using invariants and state equation in 4423 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7927 ms. Remains : 3683/3683 places, 9840/9840 transitions.
Stuttering acceptance computed with spot in 245 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-040-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(GEQ s2684 1), p1:(GEQ s3383 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, 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 2 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-040-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-040-LTLFireability-14 finished in 8226 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U (X((p1 U p2))||G(p3))))'
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)))'
[2023-03-12 23:00:45] [INFO ] Flatten gal took : 176 ms
[2023-03-12 23:00:45] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-12 23:00:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3683 places, 9840 transitions and 26320 arcs took 37 ms.
Total runtime 358416 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1719/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1719/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : CANInsertWithFailure-PT-040-LTLFireability-03
Could not compute solution for formula : CANInsertWithFailure-PT-040-LTLFireability-13

BK_STOP 1678662057463

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name CANInsertWithFailure-PT-040-LTLFireability-03
ltl formula formula --ltl=/tmp/1719/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 3683 places, 9840 transitions and 26320 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1719/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1719/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.910 real 0.350 user 0.400 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1719/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1719/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x561bcf4673f4]
1: pnml2lts-mc(+0xa2496) [0x561bcf467496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f69a708e140]
3: pnml2lts-mc(+0x405be5) [0x561bcf7cabe5]
4: pnml2lts-mc(+0x16b3f9) [0x561bcf5303f9]
5: pnml2lts-mc(+0x164ac4) [0x561bcf529ac4]
6: pnml2lts-mc(+0x272e0a) [0x561bcf637e0a]
7: pnml2lts-mc(+0xb61f0) [0x561bcf47b1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f69a6ee14d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f69a6ee167a]
10: pnml2lts-mc(+0xa1581) [0x561bcf466581]
11: pnml2lts-mc(+0xa1910) [0x561bcf466910]
12: pnml2lts-mc(+0xa32a2) [0x561bcf4682a2]
13: pnml2lts-mc(+0xa50f4) [0x561bcf46a0f4]
14: pnml2lts-mc(+0xa516b) [0x561bcf46a16b]
15: pnml2lts-mc(+0x3f34b3) [0x561bcf7b84b3]
16: pnml2lts-mc(+0x7c63d) [0x561bcf44163d]
17: pnml2lts-mc(+0x67d86) [0x561bcf42cd86]
18: pnml2lts-mc(+0x60a8a) [0x561bcf425a8a]
19: pnml2lts-mc(+0x5eb15) [0x561bcf423b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f69a6ec9d0a]
21: pnml2lts-mc(+0x6075e) [0x561bcf42575e]
ltl formula name CANInsertWithFailure-PT-040-LTLFireability-13
ltl formula formula --ltl=/tmp/1719/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 3683 places, 9840 transitions and 26320 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 2.200 real 0.370 user 0.480 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1719/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1719/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1719/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1719/ltl_1_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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-040"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is CANInsertWithFailure-PT-040, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r041-tajo-167813695100732"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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