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.r039-tajo-167813692900715.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 lolaxred
Input is CANInsertWithFailure-PT-020, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r039-tajo-167813692900715
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.1M
-rw-r--r-- 1 mcc users 9.6K Feb 26 00:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 00:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 00:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 00:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Feb 26 01:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 173K Feb 26 01:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 00:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 26 00:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 2.6M 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-020-LTLCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-020-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678505695015

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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-020
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 03:34:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 03:34:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 03:34:57] [INFO ] Load time of PNML (sax parser for PT used): 152 ms
[2023-03-11 03:34:57] [INFO ] Transformed 1044 places.
[2023-03-11 03:34:57] [INFO ] Transformed 2520 transitions.
[2023-03-11 03:34:57] [INFO ] Parsed PT model containing 1044 places and 2520 transitions and 6800 arcs in 233 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 1044 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1044/1044 places, 2520/2520 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1043 transition count 2520
Applied a total of 1 rules in 89 ms. Remains 1043 /1044 variables (removed 1) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2023-03-11 03:34:57] [INFO ] Computed 22 place invariants in 95 ms
[2023-03-11 03:34:58] [INFO ] Implicit Places using invariants in 532 ms returned []
[2023-03-11 03:34:58] [INFO ] Invariant cache hit.
[2023-03-11 03:34:58] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-11 03:35:01] [INFO ] Implicit Places using invariants and state equation in 3602 ms returned []
Implicit Place search using SMT with State Equation took 4162 ms to find 0 implicit places.
[2023-03-11 03:35:01] [INFO ] Invariant cache hit.
[2023-03-11 03:35:03] [INFO ] Dead Transitions using invariants and state equation in 1737 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1043/1044 places, 2520/2520 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5992 ms. Remains : 1043/1044 places, 2520/2520 transitions.
Support contains 49 out of 1043 places after structural reductions.
[2023-03-11 03:35:03] [INFO ] Flatten gal took : 159 ms
[2023-03-11 03:35:03] [INFO ] Flatten gal took : 79 ms
[2023-03-11 03:35:04] [INFO ] Input system was already deterministic with 2520 transitions.
Support contains 48 out of 1043 places (down from 49) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 615 ms. (steps per millisecond=16 ) properties (out of 32) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) 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 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-11 03:35:05] [INFO ] Invariant cache hit.
[2023-03-11 03:35:05] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2023-03-11 03:35:05] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 7 ms returned sat
[2023-03-11 03:35:06] [INFO ] After 969ms SMT Verify possible using state equation in real domain returned unsat :4 sat :5 real:4
[2023-03-11 03:35:06] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-11 03:35:07] [INFO ] After 796ms SMT Verify possible using 780 Read/Feed constraints in real domain returned unsat :4 sat :0 real:9
[2023-03-11 03:35:07] [INFO ] After 2246ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:9
[2023-03-11 03:35:07] [INFO ] [Nat]Absence check using 20 positive place invariants in 14 ms returned sat
[2023-03-11 03:35:07] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 11 ms returned sat
[2023-03-11 03:35:09] [INFO ] After 1603ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :8
[2023-03-11 03:35:11] [INFO ] After 2611ms SMT Verify possible using 780 Read/Feed constraints in natural domain returned unsat :5 sat :8
[2023-03-11 03:35:14] [INFO ] After 4778ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :8
Attempting to minimize the solution found.
Minimization took 1709 ms.
[2023-03-11 03:35:15] [INFO ] After 8587ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :8
Fused 13 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 234 ms.
Support contains 9 out of 1043 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions removed 136 transitions
Trivial Post-agglo rules discarded 136 transitions
Performed 136 trivial Post agglomeration. Transition count delta: 136
Iterating post reduction 0 with 136 rules applied. Total rules applied 136 place count 1043 transition count 2384
Reduce places removed 136 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 137 rules applied. Total rules applied 273 place count 907 transition count 2383
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 274 place count 906 transition count 2383
Performed 357 Post agglomeration using F-continuation condition.Transition count delta: 357
Deduced a syphon composed of 357 places in 1 ms
Reduce places removed 357 places and 0 transitions.
Iterating global reduction 3 with 714 rules applied. Total rules applied 988 place count 549 transition count 2026
Drop transitions removed 322 transitions
Redundant transition composition rules discarded 322 transitions
Iterating global reduction 3 with 322 rules applied. Total rules applied 1310 place count 549 transition count 1704
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1312 place count 549 transition count 1702
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1314 place count 547 transition count 1702
Partial Free-agglomeration rule applied 473 times.
Drop transitions removed 473 transitions
Iterating global reduction 4 with 473 rules applied. Total rules applied 1787 place count 547 transition count 1702
Applied a total of 1787 rules in 410 ms. Remains 547 /1043 variables (removed 496) and now considering 1702/2520 (removed 818) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 412 ms. Remains : 547/1043 places, 1702/2520 transitions.
Incomplete random walk after 10000 steps, including 98 resets, run finished after 356 ms. (steps per millisecond=28 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 345757 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :{}
Probabilistic random walk after 345757 steps, saw 49404 distinct states, run finished after 3008 ms. (steps per millisecond=114 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1702 rows 547 cols
[2023-03-11 03:35:20] [INFO ] Computed 22 place invariants in 32 ms
[2023-03-11 03:35:20] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2023-03-11 03:35:20] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-11 03:35:20] [INFO ] After 831ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-11 03:35:21] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2023-03-11 03:35:21] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-11 03:35:21] [INFO ] After 734ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-11 03:35:21] [INFO ] State equation strengthened by 1586 read => feed constraints.
[2023-03-11 03:35:23] [INFO ] After 1076ms SMT Verify possible using 1586 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-11 03:35:24] [INFO ] After 2141ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 689 ms.
[2023-03-11 03:35:24] [INFO ] After 3856ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 103 ms.
Support contains 9 out of 547 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 547/547 places, 1702/1702 transitions.
Applied a total of 0 rules in 35 ms. Remains 547 /547 variables (removed 0) and now considering 1702/1702 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 547/547 places, 1702/1702 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 547/547 places, 1702/1702 transitions.
Applied a total of 0 rules in 36 ms. Remains 547 /547 variables (removed 0) and now considering 1702/1702 (removed 0) transitions.
[2023-03-11 03:35:24] [INFO ] Invariant cache hit.
[2023-03-11 03:35:25] [INFO ] Implicit Places using invariants in 428 ms returned []
[2023-03-11 03:35:25] [INFO ] Invariant cache hit.
[2023-03-11 03:35:25] [INFO ] State equation strengthened by 1586 read => feed constraints.
[2023-03-11 03:35:29] [INFO ] Implicit Places using invariants and state equation in 4568 ms returned []
Implicit Place search using SMT with State Equation took 5004 ms to find 0 implicit places.
[2023-03-11 03:35:30] [INFO ] Redundant transitions in 105 ms returned []
[2023-03-11 03:35:30] [INFO ] Invariant cache hit.
[2023-03-11 03:35:30] [INFO ] Dead Transitions using invariants and state equation in 779 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5947 ms. Remains : 547/547 places, 1702/1702 transitions.
Graph (trivial) has 1519 edges and 547 vertex of which 433 / 547 are part of one of the 2 SCC in 10 ms
Free SCC test removed 431 places
Drop transitions removed 1109 transitions
Ensure Unique test removed 401 transitions
Reduce isomorphic transitions removed 1510 transitions.
Graph (complete) has 316 edges and 116 vertex of which 58 are kept as prefixes of interest. Removing 58 places using SCC suffix rule.1 ms
Discarding 58 places :
Also discarding 18 output transitions
Drop transitions removed 18 transitions
Drop transitions removed 58 transitions
Reduce isomorphic transitions removed 58 transitions.
Iterating post reduction 0 with 58 rules applied. Total rules applied 60 place count 58 transition count 116
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 93 place count 25 transition count 66
Iterating global reduction 1 with 33 rules applied. Total rules applied 126 place count 25 transition count 66
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 143 place count 25 transition count 49
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 145 place count 24 transition count 48
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 147 place count 23 transition count 47
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 148 place count 23 transition count 46
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 151 place count 23 transition count 43
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 152 place count 23 transition count 42
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 154 place count 22 transition count 41
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 155 place count 22 transition count 40
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 157 place count 21 transition count 39
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 159 place count 19 transition count 37
Applied a total of 159 rules in 47 ms. Remains 19 /547 variables (removed 528) and now considering 37/1702 (removed 1665) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 37 rows 19 cols
[2023-03-11 03:35:30] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-11 03:35:30] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 03:35:31] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-11 03:35:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 03:35:31] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-11 03:35:31] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-11 03:35:31] [INFO ] After 81ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 5 atomic propositions for a total of 12 simplifications.
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 82 stabilizing places and 140 stable transitions
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 2 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 71 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2023-03-11 03:35:31] [INFO ] Computed 22 place invariants in 67 ms
[2023-03-11 03:35:32] [INFO ] Implicit Places using invariants in 451 ms returned []
[2023-03-11 03:35:32] [INFO ] Invariant cache hit.
[2023-03-11 03:35:32] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-11 03:35:35] [INFO ] Implicit Places using invariants and state equation in 3439 ms returned []
Implicit Place search using SMT with State Equation took 3896 ms to find 0 implicit places.
[2023-03-11 03:35:35] [INFO ] Invariant cache hit.
[2023-03-11 03:35:36] [INFO ] Dead Transitions using invariants and state equation in 1049 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5018 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 231 ms :[true, p0, p0]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LEQ 3 s252) (LEQ 3 s8))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 216 reset in 521 ms.
Product exploration explored 100000 steps with 216 reset in 448 ms.
Computed a total of 82 stabilizing places and 140 stable transitions
Computed a total of 82 stabilizing places and 140 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 192 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[true, p0, p0]
Incomplete random walk after 10000 steps, including 22 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 268788 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :{}
Probabilistic random walk after 268788 steps, saw 64242 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 03:35:41] [INFO ] Invariant cache hit.
[2023-03-11 03:35:41] [INFO ] [Real]Absence check using 20 positive place invariants in 12 ms returned sat
[2023-03-11 03:35:41] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 10 ms returned sat
[2023-03-11 03:35:42] [INFO ] After 970ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:35:42] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2023-03-11 03:35:42] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 7 ms returned sat
[2023-03-11 03:35:42] [INFO ] After 660ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:35:42] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-11 03:35:43] [INFO ] After 546ms SMT Verify possible using 780 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:35:43] [INFO ] After 700ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 148 ms.
[2023-03-11 03:35:43] [INFO ] After 1723ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 1043 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 1043 transition count 2382
Reduce places removed 138 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 139 rules applied. Total rules applied 277 place count 905 transition count 2381
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 278 place count 904 transition count 2381
Performed 360 Post agglomeration using F-continuation condition.Transition count delta: 360
Deduced a syphon composed of 360 places in 2 ms
Reduce places removed 360 places and 0 transitions.
Iterating global reduction 3 with 720 rules applied. Total rules applied 998 place count 544 transition count 2021
Drop transitions removed 324 transitions
Redundant transition composition rules discarded 324 transitions
Iterating global reduction 3 with 324 rules applied. Total rules applied 1322 place count 544 transition count 1697
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1324 place count 544 transition count 1695
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1326 place count 542 transition count 1695
Partial Free-agglomeration rule applied 459 times.
Drop transitions removed 459 transitions
Iterating global reduction 4 with 459 rules applied. Total rules applied 1785 place count 542 transition count 1695
Applied a total of 1785 rules in 245 ms. Remains 542 /1043 variables (removed 501) and now considering 1695/2520 (removed 825) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 245 ms. Remains : 542/1043 places, 1695/2520 transitions.
Incomplete random walk after 10000 steps, including 99 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 516631 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :{}
Probabilistic random walk after 516631 steps, saw 70340 distinct states, run finished after 3002 ms. (steps per millisecond=172 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1695 rows 542 cols
[2023-03-11 03:35:47] [INFO ] Computed 22 place invariants in 37 ms
[2023-03-11 03:35:47] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2023-03-11 03:35:47] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-11 03:35:47] [INFO ] After 530ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:35:47] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2023-03-11 03:35:47] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2023-03-11 03:35:48] [INFO ] After 450ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:35:48] [INFO ] State equation strengthened by 1594 read => feed constraints.
[2023-03-11 03:35:48] [INFO ] After 247ms SMT Verify possible using 1594 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:35:48] [INFO ] After 431ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 90 ms.
[2023-03-11 03:35:48] [INFO ] After 1142ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 542 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 542/542 places, 1695/1695 transitions.
Applied a total of 0 rules in 60 ms. Remains 542 /542 variables (removed 0) and now considering 1695/1695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 542/542 places, 1695/1695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 542/542 places, 1695/1695 transitions.
Applied a total of 0 rules in 50 ms. Remains 542 /542 variables (removed 0) and now considering 1695/1695 (removed 0) transitions.
[2023-03-11 03:35:49] [INFO ] Invariant cache hit.
[2023-03-11 03:35:49] [INFO ] Implicit Places using invariants in 412 ms returned []
[2023-03-11 03:35:49] [INFO ] Invariant cache hit.
[2023-03-11 03:35:49] [INFO ] State equation strengthened by 1594 read => feed constraints.
[2023-03-11 03:35:53] [INFO ] Implicit Places using invariants and state equation in 4404 ms returned []
Implicit Place search using SMT with State Equation took 4822 ms to find 0 implicit places.
[2023-03-11 03:35:53] [INFO ] Redundant transitions in 59 ms returned []
[2023-03-11 03:35:53] [INFO ] Invariant cache hit.
[2023-03-11 03:35:54] [INFO ] Dead Transitions using invariants and state equation in 757 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5702 ms. Remains : 542/542 places, 1695/1695 transitions.
Graph (trivial) has 1536 edges and 542 vertex of which 437 / 542 are part of one of the 2 SCC in 1 ms
Free SCC test removed 435 places
Drop transitions removed 1121 transitions
Ensure Unique test removed 406 transitions
Reduce isomorphic transitions removed 1527 transitions.
Graph (complete) has 291 edges and 107 vertex of which 49 are kept as prefixes of interest. Removing 58 places using SCC suffix rule.0 ms
Discarding 58 places :
Also discarding 17 output transitions
Drop transitions removed 17 transitions
Drop transitions removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 49 transition count 92
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 95 place count 15 transition count 41
Iterating global reduction 1 with 34 rules applied. Total rules applied 129 place count 15 transition count 41
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 146 place count 15 transition count 24
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 148 place count 14 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 150 place count 13 transition count 22
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 151 place count 13 transition count 21
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 153 place count 13 transition count 19
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 154 place count 13 transition count 18
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 156 place count 12 transition count 17
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 158 place count 10 transition count 15
Applied a total of 158 rules in 14 ms. Remains 10 /542 variables (removed 532) and now considering 15/1695 (removed 1680) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 15 rows 10 cols
[2023-03-11 03:35:54] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 03:35:54] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 03:35:54] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 03:35:54] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:35:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 03:35:54] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 03:35:54] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:35:54] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-11 03:35:54] [INFO ] After 39ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 206 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 126 ms :[true, p0, p0]
Support contains 2 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 28 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2023-03-11 03:35:55] [INFO ] Computed 22 place invariants in 57 ms
[2023-03-11 03:35:55] [INFO ] Implicit Places using invariants in 421 ms returned []
[2023-03-11 03:35:55] [INFO ] Invariant cache hit.
[2023-03-11 03:35:56] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-11 03:35:59] [INFO ] Implicit Places using invariants and state equation in 3545 ms returned []
Implicit Place search using SMT with State Equation took 3971 ms to find 0 implicit places.
[2023-03-11 03:35:59] [INFO ] Invariant cache hit.
[2023-03-11 03:36:00] [INFO ] Dead Transitions using invariants and state equation in 1161 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5165 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Computed a total of 82 stabilizing places and 140 stable transitions
Computed a total of 82 stabilizing places and 140 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 215 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[true, p0, p0]
Incomplete random walk after 10000 steps, including 19 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 211662 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :{}
Probabilistic random walk after 211662 steps, saw 53174 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 03:36:03] [INFO ] Invariant cache hit.
[2023-03-11 03:36:04] [INFO ] [Real]Absence check using 20 positive place invariants in 12 ms returned sat
[2023-03-11 03:36:04] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 10 ms returned sat
[2023-03-11 03:36:04] [INFO ] After 904ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:36:05] [INFO ] [Nat]Absence check using 20 positive place invariants in 13 ms returned sat
[2023-03-11 03:36:05] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 10 ms returned sat
[2023-03-11 03:36:05] [INFO ] After 766ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:36:05] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-11 03:36:06] [INFO ] After 551ms SMT Verify possible using 780 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:36:06] [INFO ] After 691ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 147 ms.
[2023-03-11 03:36:06] [INFO ] After 1864ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 1043 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 1043 transition count 2382
Reduce places removed 138 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 139 rules applied. Total rules applied 277 place count 905 transition count 2381
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 278 place count 904 transition count 2381
Performed 360 Post agglomeration using F-continuation condition.Transition count delta: 360
Deduced a syphon composed of 360 places in 1 ms
Reduce places removed 360 places and 0 transitions.
Iterating global reduction 3 with 720 rules applied. Total rules applied 998 place count 544 transition count 2021
Drop transitions removed 324 transitions
Redundant transition composition rules discarded 324 transitions
Iterating global reduction 3 with 324 rules applied. Total rules applied 1322 place count 544 transition count 1697
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1324 place count 544 transition count 1695
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1326 place count 542 transition count 1695
Partial Free-agglomeration rule applied 459 times.
Drop transitions removed 459 transitions
Iterating global reduction 4 with 459 rules applied. Total rules applied 1785 place count 542 transition count 1695
Applied a total of 1785 rules in 184 ms. Remains 542 /1043 variables (removed 501) and now considering 1695/2520 (removed 825) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 542/1043 places, 1695/2520 transitions.
Incomplete random walk after 10000 steps, including 96 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 427977 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :{}
Probabilistic random walk after 427977 steps, saw 59887 distinct states, run finished after 3001 ms. (steps per millisecond=142 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1695 rows 542 cols
[2023-03-11 03:36:09] [INFO ] Computed 22 place invariants in 33 ms
[2023-03-11 03:36:10] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2023-03-11 03:36:10] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 7 ms returned sat
[2023-03-11 03:36:10] [INFO ] After 542ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:36:10] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2023-03-11 03:36:10] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2023-03-11 03:36:11] [INFO ] After 401ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:36:11] [INFO ] State equation strengthened by 1594 read => feed constraints.
[2023-03-11 03:36:11] [INFO ] After 232ms SMT Verify possible using 1594 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:36:11] [INFO ] After 380ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 85 ms.
[2023-03-11 03:36:11] [INFO ] After 1015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 542 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 542/542 places, 1695/1695 transitions.
Applied a total of 0 rules in 42 ms. Remains 542 /542 variables (removed 0) and now considering 1695/1695 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 542/542 places, 1695/1695 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 542/542 places, 1695/1695 transitions.
Applied a total of 0 rules in 39 ms. Remains 542 /542 variables (removed 0) and now considering 1695/1695 (removed 0) transitions.
[2023-03-11 03:36:11] [INFO ] Invariant cache hit.
[2023-03-11 03:36:12] [INFO ] Implicit Places using invariants in 459 ms returned []
[2023-03-11 03:36:12] [INFO ] Invariant cache hit.
[2023-03-11 03:36:12] [INFO ] State equation strengthened by 1594 read => feed constraints.
[2023-03-11 03:36:16] [INFO ] Implicit Places using invariants and state equation in 3996 ms returned []
Implicit Place search using SMT with State Equation took 4463 ms to find 0 implicit places.
[2023-03-11 03:36:16] [INFO ] Redundant transitions in 45 ms returned []
[2023-03-11 03:36:16] [INFO ] Invariant cache hit.
[2023-03-11 03:36:16] [INFO ] Dead Transitions using invariants and state equation in 737 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5300 ms. Remains : 542/542 places, 1695/1695 transitions.
Graph (trivial) has 1536 edges and 542 vertex of which 437 / 542 are part of one of the 2 SCC in 1 ms
Free SCC test removed 435 places
Drop transitions removed 1121 transitions
Ensure Unique test removed 406 transitions
Reduce isomorphic transitions removed 1527 transitions.
Graph (complete) has 291 edges and 107 vertex of which 49 are kept as prefixes of interest. Removing 58 places using SCC suffix rule.0 ms
Discarding 58 places :
Also discarding 17 output transitions
Drop transitions removed 17 transitions
Drop transitions removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 49 transition count 92
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 95 place count 15 transition count 41
Iterating global reduction 1 with 34 rules applied. Total rules applied 129 place count 15 transition count 41
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 146 place count 15 transition count 24
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 148 place count 14 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 150 place count 13 transition count 22
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 151 place count 13 transition count 21
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 153 place count 13 transition count 19
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 154 place count 13 transition count 18
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 156 place count 12 transition count 17
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 158 place count 10 transition count 15
Applied a total of 158 rules in 12 ms. Remains 10 /542 variables (removed 532) and now considering 15/1695 (removed 1680) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 15 rows 10 cols
[2023-03-11 03:36:16] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-11 03:36:16] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 03:36:16] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 03:36:16] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:36:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 03:36:16] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 03:36:16] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:36:16] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-11 03:36:16] [INFO ] After 40ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 149 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 129 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 122 ms :[true, p0, p0]
Product exploration explored 100000 steps with 213 reset in 468 ms.
Product exploration explored 100000 steps with 214 reset in 440 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 136 ms :[true, p0, p0]
Support contains 2 out of 1043 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 1043 transition count 2520
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 19 Pre rules applied. Total rules applied 99 place count 1043 transition count 2520
Deduced a syphon composed of 118 places in 2 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 118 place count 1043 transition count 2520
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 156 place count 1005 transition count 2482
Deduced a syphon composed of 80 places in 1 ms
Iterating global reduction 1 with 38 rules applied. Total rules applied 194 place count 1005 transition count 2482
Performed 381 Post agglomeration using F-continuation condition.Transition count delta: -682
Deduced a syphon composed of 461 places in 1 ms
Iterating global reduction 1 with 381 rules applied. Total rules applied 575 place count 1005 transition count 3164
Discarding 80 places :
Symmetric choice reduction at 1 with 80 rule applications. Total rules 655 place count 925 transition count 3084
Deduced a syphon composed of 381 places in 0 ms
Iterating global reduction 1 with 80 rules applied. Total rules applied 735 place count 925 transition count 3084
Deduced a syphon composed of 381 places in 1 ms
Drop transitions removed 324 transitions
Redundant transition composition rules discarded 324 transitions
Iterating global reduction 1 with 324 rules applied. Total rules applied 1059 place count 925 transition count 2760
Deduced a syphon composed of 381 places in 0 ms
Applied a total of 1059 rules in 502 ms. Remains 925 /1043 variables (removed 118) and now considering 2760/2520 (removed -240) transitions.
[2023-03-11 03:36:19] [INFO ] Redundant transitions in 65 ms returned []
// Phase 1: matrix 2760 rows 925 cols
[2023-03-11 03:36:19] [INFO ] Computed 22 place invariants in 57 ms
[2023-03-11 03:36:20] [INFO ] Dead Transitions using invariants and state equation in 1335 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 925/1043 places, 2760/2520 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1916 ms. Remains : 925/1043 places, 2760/2520 transitions.
Support contains 2 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 26 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2023-03-11 03:36:20] [INFO ] Computed 22 place invariants in 55 ms
[2023-03-11 03:36:21] [INFO ] Implicit Places using invariants in 460 ms returned []
[2023-03-11 03:36:21] [INFO ] Invariant cache hit.
[2023-03-11 03:36:21] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-11 03:36:24] [INFO ] Implicit Places using invariants and state equation in 3184 ms returned []
Implicit Place search using SMT with State Equation took 3645 ms to find 0 implicit places.
[2023-03-11 03:36:24] [INFO ] Invariant cache hit.
[2023-03-11 03:36:25] [INFO ] Dead Transitions using invariants and state equation in 1012 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4686 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-02 finished in 54134 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)||G(F(p1)))))'
Support contains 3 out of 1043 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 1043 transition count 2380
Reduce places removed 140 places and 0 transitions.
Iterating post reduction 1 with 140 rules applied. Total rules applied 280 place count 903 transition count 2380
Performed 378 Post agglomeration using F-continuation condition.Transition count delta: 378
Deduced a syphon composed of 378 places in 0 ms
Reduce places removed 378 places and 0 transitions.
Iterating global reduction 2 with 756 rules applied. Total rules applied 1036 place count 525 transition count 2002
Drop transitions removed 341 transitions
Redundant transition composition rules discarded 341 transitions
Iterating global reduction 2 with 341 rules applied. Total rules applied 1377 place count 525 transition count 1661
Applied a total of 1377 rules in 136 ms. Remains 525 /1043 variables (removed 518) and now considering 1661/2520 (removed 859) transitions.
// Phase 1: matrix 1661 rows 525 cols
[2023-03-11 03:36:25] [INFO ] Computed 22 place invariants in 31 ms
[2023-03-11 03:36:26] [INFO ] Implicit Places using invariants in 297 ms returned []
[2023-03-11 03:36:26] [INFO ] Invariant cache hit.
[2023-03-11 03:36:26] [INFO ] State equation strengthened by 1175 read => feed constraints.
[2023-03-11 03:36:28] [INFO ] Implicit Places using invariants and state equation in 2027 ms returned []
Implicit Place search using SMT with State Equation took 2328 ms to find 0 implicit places.
[2023-03-11 03:36:28] [INFO ] Redundant transitions in 45 ms returned []
[2023-03-11 03:36:28] [INFO ] Invariant cache hit.
[2023-03-11 03:36:28] [INFO ] Dead Transitions using invariants and state equation in 643 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 525/1043 places, 1661/2520 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3168 ms. Remains : 525/1043 places, 1661/2520 transitions.
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s144 s175), p1:(GT 2 s517)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 965 reset in 470 ms.
Product exploration explored 100000 steps with 963 reset in 601 ms.
Computed a total of 63 stabilizing places and 100 stable transitions
Computed a total of 63 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 229 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 389591 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :{}
Probabilistic random walk after 389591 steps, saw 51222 distinct states, run finished after 3001 ms. (steps per millisecond=129 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 03:36:33] [INFO ] Invariant cache hit.
[2023-03-11 03:36:33] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2023-03-11 03:36:33] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2023-03-11 03:36:34] [INFO ] After 558ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:36:34] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2023-03-11 03:36:34] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-11 03:36:34] [INFO ] After 447ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 03:36:34] [INFO ] State equation strengthened by 1175 read => feed constraints.
[2023-03-11 03:36:34] [INFO ] After 318ms SMT Verify possible using 1175 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 03:36:35] [INFO ] After 467ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 96 ms.
[2023-03-11 03:36:35] [INFO ] After 1177ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 10 ms.
Support contains 3 out of 525 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 525/525 places, 1661/1661 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 525 transition count 1660
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 524 transition count 1660
Partial Free-agglomeration rule applied 420 times.
Drop transitions removed 420 transitions
Iterating global reduction 1 with 420 rules applied. Total rules applied 422 place count 524 transition count 1660
Applied a total of 422 rules in 83 ms. Remains 524 /525 variables (removed 1) and now considering 1660/1661 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 524/525 places, 1660/1661 transitions.
Incomplete random walk after 10000 steps, including 106 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 362878 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :{}
Probabilistic random walk after 362878 steps, saw 48605 distinct states, run finished after 3001 ms. (steps per millisecond=120 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1660 rows 524 cols
[2023-03-11 03:36:38] [INFO ] Computed 22 place invariants in 28 ms
[2023-03-11 03:36:38] [INFO ] [Real]Absence check using 20 positive place invariants in 5 ms returned sat
[2023-03-11 03:36:38] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-11 03:36:38] [INFO ] After 405ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:36:39] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2023-03-11 03:36:39] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2023-03-11 03:36:39] [INFO ] After 384ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 03:36:39] [INFO ] State equation strengthened by 1594 read => feed constraints.
[2023-03-11 03:36:39] [INFO ] After 243ms SMT Verify possible using 1594 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 03:36:39] [INFO ] After 383ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 94 ms.
[2023-03-11 03:36:39] [INFO ] After 1009ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 524 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1660/1660 transitions.
Applied a total of 0 rules in 30 ms. Remains 524 /524 variables (removed 0) and now considering 1660/1660 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 524/524 places, 1660/1660 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1660/1660 transitions.
Applied a total of 0 rules in 29 ms. Remains 524 /524 variables (removed 0) and now considering 1660/1660 (removed 0) transitions.
[2023-03-11 03:36:40] [INFO ] Invariant cache hit.
[2023-03-11 03:36:40] [INFO ] Implicit Places using invariants in 381 ms returned []
[2023-03-11 03:36:40] [INFO ] Invariant cache hit.
[2023-03-11 03:36:40] [INFO ] State equation strengthened by 1594 read => feed constraints.
[2023-03-11 03:36:44] [INFO ] Implicit Places using invariants and state equation in 4157 ms returned []
Implicit Place search using SMT with State Equation took 4560 ms to find 0 implicit places.
[2023-03-11 03:36:44] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-11 03:36:44] [INFO ] Invariant cache hit.
[2023-03-11 03:36:45] [INFO ] Dead Transitions using invariants and state equation in 647 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5273 ms. Remains : 524/524 places, 1660/1660 transitions.
Graph (trivial) has 1529 edges and 524 vertex of which 437 / 524 are part of one of the 2 SCC in 1 ms
Free SCC test removed 435 places
Drop transitions removed 1153 transitions
Ensure Unique test removed 409 transitions
Reduce isomorphic transitions removed 1562 transitions.
Graph (complete) has 220 edges and 89 vertex of which 28 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.0 ms
Discarding 61 places :
Also discarding 19 output transitions
Drop transitions removed 19 transitions
Drop transitions removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 28 transition count 38
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 62 place count 9 transition count 19
Iterating global reduction 1 with 19 rules applied. Total rules applied 81 place count 9 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 83 place count 8 transition count 18
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 86 place count 8 transition count 15
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 8 transition count 14
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 89 place count 7 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 6 transition count 12
Applied a total of 90 rules in 7 ms. Remains 6 /524 variables (removed 518) and now considering 12/1660 (removed 1648) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 12 rows 6 cols
[2023-03-11 03:36:45] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 03:36:45] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:36:45] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 03:36:45] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-11 03:36:45] [INFO ] After 32ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 177 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 525 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 525/525 places, 1661/1661 transitions.
Applied a total of 0 rules in 24 ms. Remains 525 /525 variables (removed 0) and now considering 1661/1661 (removed 0) transitions.
// Phase 1: matrix 1661 rows 525 cols
[2023-03-11 03:36:45] [INFO ] Computed 22 place invariants in 13 ms
[2023-03-11 03:36:45] [INFO ] Implicit Places using invariants in 211 ms returned []
[2023-03-11 03:36:45] [INFO ] Invariant cache hit.
[2023-03-11 03:36:46] [INFO ] State equation strengthened by 1175 read => feed constraints.
[2023-03-11 03:36:47] [INFO ] Implicit Places using invariants and state equation in 1951 ms returned []
Implicit Place search using SMT with State Equation took 2165 ms to find 0 implicit places.
[2023-03-11 03:36:47] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-11 03:36:47] [INFO ] Invariant cache hit.
[2023-03-11 03:36:48] [INFO ] Dead Transitions using invariants and state equation in 701 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2920 ms. Remains : 525/525 places, 1661/1661 transitions.
Computed a total of 63 stabilizing places and 100 stable transitions
Computed a total of 63 stabilizing places and 100 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 242 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 97 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 349285 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :{}
Probabilistic random walk after 349285 steps, saw 46890 distinct states, run finished after 3002 ms. (steps per millisecond=116 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 03:36:52] [INFO ] Invariant cache hit.
[2023-03-11 03:36:52] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2023-03-11 03:36:52] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2023-03-11 03:36:52] [INFO ] After 557ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:36:52] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2023-03-11 03:36:52] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2023-03-11 03:36:53] [INFO ] After 423ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 03:36:53] [INFO ] State equation strengthened by 1175 read => feed constraints.
[2023-03-11 03:36:53] [INFO ] After 305ms SMT Verify possible using 1175 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 03:36:53] [INFO ] After 484ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 99 ms.
[2023-03-11 03:36:53] [INFO ] After 1165ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 17 ms.
Support contains 3 out of 525 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 525/525 places, 1661/1661 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 525 transition count 1660
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 524 transition count 1660
Partial Free-agglomeration rule applied 420 times.
Drop transitions removed 420 transitions
Iterating global reduction 1 with 420 rules applied. Total rules applied 422 place count 524 transition count 1660
Applied a total of 422 rules in 108 ms. Remains 524 /525 variables (removed 1) and now considering 1660/1661 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 524/525 places, 1660/1661 transitions.
Incomplete random walk after 10000 steps, including 107 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 350602 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :{}
Probabilistic random walk after 350602 steps, saw 47366 distinct states, run finished after 3001 ms. (steps per millisecond=116 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1660 rows 524 cols
[2023-03-11 03:36:57] [INFO ] Computed 22 place invariants in 27 ms
[2023-03-11 03:36:57] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2023-03-11 03:36:57] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-11 03:36:57] [INFO ] After 493ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:36:57] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2023-03-11 03:36:57] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2023-03-11 03:36:58] [INFO ] After 428ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 03:36:58] [INFO ] State equation strengthened by 1594 read => feed constraints.
[2023-03-11 03:36:58] [INFO ] After 310ms SMT Verify possible using 1594 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 03:36:58] [INFO ] After 453ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 88 ms.
[2023-03-11 03:36:58] [INFO ] After 1120ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 524 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1660/1660 transitions.
Applied a total of 0 rules in 20 ms. Remains 524 /524 variables (removed 0) and now considering 1660/1660 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 524/524 places, 1660/1660 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1660/1660 transitions.
Applied a total of 0 rules in 19 ms. Remains 524 /524 variables (removed 0) and now considering 1660/1660 (removed 0) transitions.
[2023-03-11 03:36:58] [INFO ] Invariant cache hit.
[2023-03-11 03:36:59] [INFO ] Implicit Places using invariants in 424 ms returned []
[2023-03-11 03:36:59] [INFO ] Invariant cache hit.
[2023-03-11 03:36:59] [INFO ] State equation strengthened by 1594 read => feed constraints.
[2023-03-11 03:37:03] [INFO ] Implicit Places using invariants and state equation in 4360 ms returned []
Implicit Place search using SMT with State Equation took 4785 ms to find 0 implicit places.
[2023-03-11 03:37:03] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-11 03:37:03] [INFO ] Invariant cache hit.
[2023-03-11 03:37:04] [INFO ] Dead Transitions using invariants and state equation in 626 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5480 ms. Remains : 524/524 places, 1660/1660 transitions.
Graph (trivial) has 1529 edges and 524 vertex of which 437 / 524 are part of one of the 2 SCC in 1 ms
Free SCC test removed 435 places
Drop transitions removed 1153 transitions
Ensure Unique test removed 409 transitions
Reduce isomorphic transitions removed 1562 transitions.
Graph (complete) has 220 edges and 89 vertex of which 28 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.0 ms
Discarding 61 places :
Also discarding 19 output transitions
Drop transitions removed 19 transitions
Drop transitions removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 28 transition count 38
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 62 place count 9 transition count 19
Iterating global reduction 1 with 19 rules applied. Total rules applied 81 place count 9 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 83 place count 8 transition count 18
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 86 place count 8 transition count 15
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 8 transition count 14
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 89 place count 7 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 6 transition count 12
Applied a total of 90 rules in 5 ms. Remains 6 /524 variables (removed 518) and now considering 12/1660 (removed 1648) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 12 rows 6 cols
[2023-03-11 03:37:04] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 03:37:04] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:37:04] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 03:37:04] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-11 03:37:04] [INFO ] After 29ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 255 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 968 reset in 513 ms.
Product exploration explored 100000 steps with 968 reset in 581 ms.
Support contains 3 out of 525 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 525/525 places, 1661/1661 transitions.
Applied a total of 0 rules in 24 ms. Remains 525 /525 variables (removed 0) and now considering 1661/1661 (removed 0) transitions.
// Phase 1: matrix 1661 rows 525 cols
[2023-03-11 03:37:06] [INFO ] Computed 22 place invariants in 27 ms
[2023-03-11 03:37:06] [INFO ] Implicit Places using invariants in 301 ms returned []
[2023-03-11 03:37:06] [INFO ] Invariant cache hit.
[2023-03-11 03:37:06] [INFO ] State equation strengthened by 1175 read => feed constraints.
[2023-03-11 03:37:08] [INFO ] Implicit Places using invariants and state equation in 1896 ms returned []
Implicit Place search using SMT with State Equation took 2221 ms to find 0 implicit places.
[2023-03-11 03:37:08] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-11 03:37:08] [INFO ] Invariant cache hit.
[2023-03-11 03:37:09] [INFO ] Dead Transitions using invariants and state equation in 632 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2904 ms. Remains : 525/525 places, 1661/1661 transitions.
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-04 finished in 43555 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||G((p2 U p1))))'
Support contains 5 out of 1043 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 1043 transition count 2382
Reduce places removed 138 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 139 rules applied. Total rules applied 277 place count 905 transition count 2381
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 278 place count 904 transition count 2381
Performed 378 Post agglomeration using F-continuation condition.Transition count delta: 378
Deduced a syphon composed of 378 places in 0 ms
Reduce places removed 378 places and 0 transitions.
Iterating global reduction 3 with 756 rules applied. Total rules applied 1034 place count 526 transition count 2003
Drop transitions removed 340 transitions
Redundant transition composition rules discarded 340 transitions
Iterating global reduction 3 with 340 rules applied. Total rules applied 1374 place count 526 transition count 1663
Applied a total of 1374 rules in 109 ms. Remains 526 /1043 variables (removed 517) and now considering 1663/2520 (removed 857) transitions.
// Phase 1: matrix 1663 rows 526 cols
[2023-03-11 03:37:09] [INFO ] Computed 22 place invariants in 19 ms
[2023-03-11 03:37:09] [INFO ] Implicit Places using invariants in 347 ms returned []
[2023-03-11 03:37:09] [INFO ] Invariant cache hit.
[2023-03-11 03:37:09] [INFO ] State equation strengthened by 1176 read => feed constraints.
[2023-03-11 03:37:11] [INFO ] Implicit Places using invariants and state equation in 1873 ms returned []
Implicit Place search using SMT with State Equation took 2224 ms to find 0 implicit places.
[2023-03-11 03:37:11] [INFO ] Redundant transitions in 44 ms returned []
[2023-03-11 03:37:11] [INFO ] Invariant cache hit.
[2023-03-11 03:37:12] [INFO ] Dead Transitions using invariants and state equation in 709 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 526/1043 places, 1663/2520 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3093 ms. Remains : 526/1043 places, 1663/2520 transitions.
Stuttering acceptance computed with spot in 344 ms :[(NOT p1), true, (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 3}, { cond=(OR p1 p2), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ 3 s213), p0:(LEQ s467 s375), p2:(LEQ s46 s422)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 106 steps with 0 reset in 2 ms.
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-05 finished in 3467 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)&&X(G(p1))))'
Support contains 5 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 30 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2023-03-11 03:37:12] [INFO ] Computed 22 place invariants in 60 ms
[2023-03-11 03:37:13] [INFO ] Implicit Places using invariants in 481 ms returned []
[2023-03-11 03:37:13] [INFO ] Invariant cache hit.
[2023-03-11 03:37:13] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-11 03:37:16] [INFO ] Implicit Places using invariants and state equation in 3229 ms returned []
Implicit Place search using SMT with State Equation took 3712 ms to find 0 implicit places.
[2023-03-11 03:37:16] [INFO ] Invariant cache hit.
[2023-03-11 03:37:17] [INFO ] Dead Transitions using invariants and state equation in 1016 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4765 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (OR (GT s517 s842) (GT 1 s780)) (GT s528 s230)), p0:(LEQ 1 s780)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-07 finished in 4956 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)&&(F(p1)||(p2&&G(p3))))))'
Support contains 6 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 17 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
[2023-03-11 03:37:17] [INFO ] Invariant cache hit.
[2023-03-11 03:37:17] [INFO ] Implicit Places using invariants in 343 ms returned []
[2023-03-11 03:37:17] [INFO ] Invariant cache hit.
[2023-03-11 03:37:18] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-11 03:37:21] [INFO ] Implicit Places using invariants and state equation in 3640 ms returned []
Implicit Place search using SMT with State Equation took 3987 ms to find 0 implicit places.
[2023-03-11 03:37:21] [INFO ] Invariant cache hit.
[2023-03-11 03:37:22] [INFO ] Dead Transitions using invariants and state equation in 1002 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5008 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p3), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s230 s378), p1:(LEQ s7 s94), p2:(LEQ 1 s206), p3:(LEQ 1 s410)], 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 858 ms.
Product exploration explored 100000 steps with 50000 reset in 818 ms.
Computed a total of 82 stabilizing places and 140 stable transitions
Computed a total of 82 stabilizing places and 140 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2) (NOT p3)), (X p0), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p1) (NOT p3)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))))
Knowledge based reduction with 8 factoid took 217 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-08 finished in 7176 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (G(p0)||p1)) U (G((p0 U (p1||G(p0))))||(X(G(p2))&&(p0 U (p1||G(p0)))))))'
Support contains 4 out of 1043 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 1043 transition count 2382
Reduce places removed 138 places and 0 transitions.
Iterating post reduction 1 with 138 rules applied. Total rules applied 276 place count 905 transition count 2382
Performed 379 Post agglomeration using F-continuation condition.Transition count delta: 379
Deduced a syphon composed of 379 places in 1 ms
Reduce places removed 379 places and 0 transitions.
Iterating global reduction 2 with 758 rules applied. Total rules applied 1034 place count 526 transition count 2003
Drop transitions removed 341 transitions
Redundant transition composition rules discarded 341 transitions
Iterating global reduction 2 with 341 rules applied. Total rules applied 1375 place count 526 transition count 1662
Applied a total of 1375 rules in 132 ms. Remains 526 /1043 variables (removed 517) and now considering 1662/2520 (removed 858) transitions.
// Phase 1: matrix 1662 rows 526 cols
[2023-03-11 03:37:24] [INFO ] Computed 22 place invariants in 26 ms
[2023-03-11 03:37:25] [INFO ] Implicit Places using invariants in 346 ms returned []
[2023-03-11 03:37:25] [INFO ] Invariant cache hit.
[2023-03-11 03:37:25] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2023-03-11 03:37:27] [INFO ] Implicit Places using invariants and state equation in 1943 ms returned []
Implicit Place search using SMT with State Equation took 2295 ms to find 0 implicit places.
[2023-03-11 03:37:27] [INFO ] Redundant transitions in 37 ms returned []
[2023-03-11 03:37:27] [INFO ] Invariant cache hit.
[2023-03-11 03:37:27] [INFO ] Dead Transitions using invariants and state equation in 712 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 526/1043 places, 1662/2520 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3190 ms. Remains : 526/1043 places, 1662/2520 transitions.
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=p2, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(OR (AND p0 p2) p1), acceptance={} source=3 dest: 3}]], initial=2, aps=[p2:(LEQ s464 s326), p0:(GT 3 s345), p1:(AND (GT 2 s83) (GT 3 s345))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 960 reset in 500 ms.
Product exploration explored 100000 steps with 963 reset in 472 ms.
Computed a total of 65 stabilizing places and 102 stable transitions
Computed a total of 65 stabilizing places and 102 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X (OR (AND p0 p2) p1)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), true, (X (X (OR (AND p0 p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 809 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 97 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 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 4 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-11 03:37:30] [INFO ] Invariant cache hit.
[2023-03-11 03:37:30] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2023-03-11 03:37:30] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2023-03-11 03:37:30] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-11 03:37:30] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2023-03-11 03:37:30] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-11 03:37:31] [INFO ] After 617ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :5
[2023-03-11 03:37:31] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2023-03-11 03:37:31] [INFO ] After 344ms SMT Verify possible using 1177 Read/Feed constraints in natural domain returned unsat :2 sat :5
[2023-03-11 03:37:32] [INFO ] After 766ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :5
Attempting to minimize the solution found.
Minimization took 300 ms.
[2023-03-11 03:37:32] [INFO ] After 1912ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :5
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 526 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 526/526 places, 1662/1662 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 526 transition count 1661
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 525 transition count 1661
Partial Free-agglomeration rule applied 436 times.
Drop transitions removed 436 transitions
Iterating global reduction 1 with 436 rules applied. Total rules applied 438 place count 525 transition count 1661
Applied a total of 438 rules in 77 ms. Remains 525 /526 variables (removed 1) and now considering 1661/1662 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 525/526 places, 1661/1662 transitions.
Incomplete random walk after 10000 steps, including 106 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 375595 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :{}
Probabilistic random walk after 375595 steps, saw 49052 distinct states, run finished after 3001 ms. (steps per millisecond=125 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1661 rows 525 cols
[2023-03-11 03:37:35] [INFO ] Computed 22 place invariants in 10 ms
[2023-03-11 03:37:35] [INFO ] [Real]Absence check using 20 positive place invariants in 4 ms returned sat
[2023-03-11 03:37:35] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-11 03:37:36] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 03:37:36] [INFO ] [Nat]Absence check using 20 positive place invariants in 4 ms returned sat
[2023-03-11 03:37:36] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-11 03:37:36] [INFO ] After 440ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-11 03:37:36] [INFO ] State equation strengthened by 1594 read => feed constraints.
[2023-03-11 03:37:36] [INFO ] After 383ms SMT Verify possible using 1594 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-11 03:37:37] [INFO ] After 830ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 250 ms.
[2023-03-11 03:37:37] [INFO ] After 1661ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 525 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 525/525 places, 1661/1661 transitions.
Applied a total of 0 rules in 22 ms. Remains 525 /525 variables (removed 0) and now considering 1661/1661 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 525/525 places, 1661/1661 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 525/525 places, 1661/1661 transitions.
Applied a total of 0 rules in 36 ms. Remains 525 /525 variables (removed 0) and now considering 1661/1661 (removed 0) transitions.
[2023-03-11 03:37:37] [INFO ] Invariant cache hit.
[2023-03-11 03:37:38] [INFO ] Implicit Places using invariants in 411 ms returned []
[2023-03-11 03:37:38] [INFO ] Invariant cache hit.
[2023-03-11 03:37:38] [INFO ] State equation strengthened by 1594 read => feed constraints.
[2023-03-11 03:37:42] [INFO ] Implicit Places using invariants and state equation in 4261 ms returned []
Implicit Place search using SMT with State Equation took 4684 ms to find 0 implicit places.
[2023-03-11 03:37:42] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-11 03:37:42] [INFO ] Invariant cache hit.
[2023-03-11 03:37:43] [INFO ] Dead Transitions using invariants and state equation in 740 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5496 ms. Remains : 525/525 places, 1661/1661 transitions.
Graph (trivial) has 1530 edges and 525 vertex of which 437 / 525 are part of one of the 2 SCC in 0 ms
Free SCC test removed 435 places
Drop transitions removed 1154 transitions
Ensure Unique test removed 407 transitions
Reduce isomorphic transitions removed 1561 transitions.
Graph (complete) has 222 edges and 90 vertex of which 29 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.0 ms
Discarding 61 places :
Also discarding 20 output transitions
Drop transitions removed 20 transitions
Drop transitions removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 29 transition count 40
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 60 place count 11 transition count 22
Iterating global reduction 1 with 18 rules applied. Total rules applied 78 place count 11 transition count 22
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 80 place count 10 transition count 21
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 83 place count 10 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 9 transition count 17
Applied a total of 84 rules in 5 ms. Remains 9 /525 variables (removed 516) and now considering 17/1661 (removed 1644) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 17 rows 9 cols
[2023-03-11 03:37:43] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 03:37:43] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 03:37:43] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-11 03:37:43] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-11 03:37:43] [INFO ] After 68ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 p1), (X (OR (AND p0 p2) p1)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), true, (X (X (OR (AND p0 p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (G (NOT (AND (NOT p2) p0 (NOT p1)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 19 factoid took 866 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[true, (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 4 out of 526 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 526/526 places, 1662/1662 transitions.
Applied a total of 0 rules in 23 ms. Remains 526 /526 variables (removed 0) and now considering 1662/1662 (removed 0) transitions.
// Phase 1: matrix 1662 rows 526 cols
[2023-03-11 03:37:44] [INFO ] Computed 22 place invariants in 14 ms
[2023-03-11 03:37:44] [INFO ] Implicit Places using invariants in 294 ms returned []
[2023-03-11 03:37:44] [INFO ] Invariant cache hit.
[2023-03-11 03:37:45] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2023-03-11 03:37:46] [INFO ] Implicit Places using invariants and state equation in 2104 ms returned []
Implicit Place search using SMT with State Equation took 2400 ms to find 0 implicit places.
[2023-03-11 03:37:46] [INFO ] Redundant transitions in 48 ms returned []
[2023-03-11 03:37:46] [INFO ] Invariant cache hit.
[2023-03-11 03:37:47] [INFO ] Dead Transitions using invariants and state equation in 634 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3115 ms. Remains : 526/526 places, 1662/1662 transitions.
Computed a total of 65 stabilizing places and 102 stable transitions
Computed a total of 65 stabilizing places and 102 stable transitions
Knowledge obtained : [(AND p1 p2), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 381 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 96 resets, run finished after 312 ms. (steps per millisecond=32 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 03:37:48] [INFO ] Invariant cache hit.
[2023-03-11 03:37:48] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:37:48] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2023-03-11 03:37:48] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2023-03-11 03:37:49] [INFO ] After 521ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:37:49] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2023-03-11 03:37:49] [INFO ] After 292ms SMT Verify possible using 1177 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 03:37:49] [INFO ] After 496ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 118 ms.
[2023-03-11 03:37:49] [INFO ] After 1288ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 4 out of 526 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 526/526 places, 1662/1662 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 526 transition count 1661
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 525 transition count 1661
Partial Free-agglomeration rule applied 436 times.
Drop transitions removed 436 transitions
Iterating global reduction 1 with 436 rules applied. Total rules applied 438 place count 525 transition count 1661
Applied a total of 438 rules in 96 ms. Remains 525 /526 variables (removed 1) and now considering 1661/1662 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 525/526 places, 1661/1662 transitions.
Incomplete random walk after 10000 steps, including 106 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 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 5 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 4 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 415196 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :{}
Probabilistic random walk after 415196 steps, saw 53854 distinct states, run finished after 3001 ms. (steps per millisecond=138 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1661 rows 525 cols
[2023-03-11 03:37:53] [INFO ] Computed 22 place invariants in 10 ms
[2023-03-11 03:37:53] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:37:53] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2023-03-11 03:37:53] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 7 ms returned sat
[2023-03-11 03:37:53] [INFO ] After 354ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:37:53] [INFO ] State equation strengthened by 1594 read => feed constraints.
[2023-03-11 03:37:54] [INFO ] After 276ms SMT Verify possible using 1594 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 03:37:54] [INFO ] After 507ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 149 ms.
[2023-03-11 03:37:54] [INFO ] After 1176ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 14 ms.
Support contains 4 out of 525 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 525/525 places, 1661/1661 transitions.
Applied a total of 0 rules in 40 ms. Remains 525 /525 variables (removed 0) and now considering 1661/1661 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 525/525 places, 1661/1661 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 525/525 places, 1661/1661 transitions.
Applied a total of 0 rules in 34 ms. Remains 525 /525 variables (removed 0) and now considering 1661/1661 (removed 0) transitions.
[2023-03-11 03:37:54] [INFO ] Invariant cache hit.
[2023-03-11 03:37:55] [INFO ] Implicit Places using invariants in 362 ms returned []
[2023-03-11 03:37:55] [INFO ] Invariant cache hit.
[2023-03-11 03:37:55] [INFO ] State equation strengthened by 1594 read => feed constraints.
[2023-03-11 03:37:59] [INFO ] Implicit Places using invariants and state equation in 4357 ms returned []
Implicit Place search using SMT with State Equation took 4724 ms to find 0 implicit places.
[2023-03-11 03:37:59] [INFO ] Redundant transitions in 45 ms returned []
[2023-03-11 03:37:59] [INFO ] Invariant cache hit.
[2023-03-11 03:38:00] [INFO ] Dead Transitions using invariants and state equation in 808 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5628 ms. Remains : 525/525 places, 1661/1661 transitions.
Graph (trivial) has 1530 edges and 525 vertex of which 437 / 525 are part of one of the 2 SCC in 1 ms
Free SCC test removed 435 places
Drop transitions removed 1154 transitions
Ensure Unique test removed 407 transitions
Reduce isomorphic transitions removed 1561 transitions.
Graph (complete) has 222 edges and 90 vertex of which 29 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.1 ms
Discarding 61 places :
Also discarding 20 output transitions
Drop transitions removed 20 transitions
Drop transitions removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 29 transition count 40
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 60 place count 11 transition count 22
Iterating global reduction 1 with 18 rules applied. Total rules applied 78 place count 11 transition count 22
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 80 place count 10 transition count 21
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 83 place count 10 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 9 transition count 17
Applied a total of 84 rules in 8 ms. Remains 9 /525 variables (removed 516) and now considering 17/1661 (removed 1644) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 17 rows 9 cols
[2023-03-11 03:38:00] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 03:38:00] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:38:00] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:38:00] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-11 03:38:00] [INFO ] After 49ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p1 p2), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 9 factoid took 408 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 156 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 163 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 965 reset in 556 ms.
Product exploration explored 100000 steps with 957 reset in 433 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 186 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Support contains 4 out of 526 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 526/526 places, 1662/1662 transitions.
Applied a total of 0 rules in 37 ms. Remains 526 /526 variables (removed 0) and now considering 1662/1662 (removed 0) transitions.
[2023-03-11 03:38:02] [INFO ] Redundant transitions in 30 ms returned []
// Phase 1: matrix 1662 rows 526 cols
[2023-03-11 03:38:02] [INFO ] Computed 22 place invariants in 15 ms
[2023-03-11 03:38:03] [INFO ] Dead Transitions using invariants and state equation in 844 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 947 ms. Remains : 526/526 places, 1662/1662 transitions.
Support contains 4 out of 526 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 526/526 places, 1662/1662 transitions.
Applied a total of 0 rules in 10 ms. Remains 526 /526 variables (removed 0) and now considering 1662/1662 (removed 0) transitions.
[2023-03-11 03:38:03] [INFO ] Invariant cache hit.
[2023-03-11 03:38:03] [INFO ] Implicit Places using invariants in 269 ms returned []
[2023-03-11 03:38:03] [INFO ] Invariant cache hit.
[2023-03-11 03:38:04] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2023-03-11 03:38:05] [INFO ] Implicit Places using invariants and state equation in 1908 ms returned []
Implicit Place search using SMT with State Equation took 2179 ms to find 0 implicit places.
[2023-03-11 03:38:05] [INFO ] Invariant cache hit.
[2023-03-11 03:38:06] [INFO ] Dead Transitions using invariants and state equation in 600 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2794 ms. Remains : 526/526 places, 1662/1662 transitions.
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-09 finished in 41660 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||G((G(F(p1)) U p2))))'
Support contains 3 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 28 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2023-03-11 03:38:06] [INFO ] Computed 22 place invariants in 57 ms
[2023-03-11 03:38:06] [INFO ] Implicit Places using invariants in 330 ms returned []
[2023-03-11 03:38:06] [INFO ] Invariant cache hit.
[2023-03-11 03:38:07] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-11 03:38:09] [INFO ] Implicit Places using invariants and state equation in 2939 ms returned []
Implicit Place search using SMT with State Equation took 3272 ms to find 0 implicit places.
[2023-03-11 03:38:09] [INFO ] Invariant cache hit.
[2023-03-11 03:38:10] [INFO ] Dead Transitions using invariants and state equation in 1082 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4397 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 361 ms :[(AND (NOT p0) (NOT p2)), (AND p2 (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p2 p0), acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(NOT p0), acceptance={} source=2 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(NOT p2), acceptance={0} source=5 dest: 4}, { cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(NOT p2), acceptance={} source=6 dest: 4}, { cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(LEQ 1 s444), p0:(GT 3 s857), p1:(GT 1 s33)], 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]]
Product exploration explored 100000 steps with 33472 reset in 625 ms.
Product exploration explored 100000 steps with 33234 reset in 616 ms.
Computed a total of 82 stabilizing places and 140 stable transitions
Computed a total of 82 stabilizing places and 140 stable transitions
Detected a total of 82/1043 stabilizing places and 140/2520 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) p0)), (X p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), true, (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Knowledge based reduction with 18 factoid took 1095 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 342 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 22 resets, run finished after 324 ms. (steps per millisecond=30 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) 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.
[2023-03-11 03:38:14] [INFO ] Invariant cache hit.
[2023-03-11 03:38:14] [INFO ] [Real]Absence check using 20 positive place invariants in 12 ms returned sat
[2023-03-11 03:38:14] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 10 ms returned sat
[2023-03-11 03:38:15] [INFO ] After 872ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2023-03-11 03:38:15] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-11 03:38:15] [INFO ] After 447ms SMT Verify possible using 780 Read/Feed constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-11 03:38:15] [INFO ] After 1595ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-11 03:38:16] [INFO ] [Nat]Absence check using 20 positive place invariants in 13 ms returned sat
[2023-03-11 03:38:16] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 11 ms returned sat
[2023-03-11 03:38:16] [INFO ] After 815ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-11 03:38:17] [INFO ] After 659ms SMT Verify possible using 780 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-11 03:38:17] [INFO ] After 983ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 212 ms.
[2023-03-11 03:38:18] [INFO ] After 2279ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 1043 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 1043 transition count 2380
Reduce places removed 140 places and 0 transitions.
Iterating post reduction 1 with 140 rules applied. Total rules applied 280 place count 903 transition count 2380
Performed 379 Post agglomeration using F-continuation condition.Transition count delta: 379
Deduced a syphon composed of 379 places in 0 ms
Reduce places removed 379 places and 0 transitions.
Iterating global reduction 2 with 758 rules applied. Total rules applied 1038 place count 524 transition count 2001
Drop transitions removed 341 transitions
Redundant transition composition rules discarded 341 transitions
Iterating global reduction 2 with 341 rules applied. Total rules applied 1379 place count 524 transition count 1660
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1380 place count 524 transition count 1659
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1381 place count 523 transition count 1659
Partial Free-agglomeration rule applied 420 times.
Drop transitions removed 420 transitions
Iterating global reduction 3 with 420 rules applied. Total rules applied 1801 place count 523 transition count 1659
Applied a total of 1801 rules in 165 ms. Remains 523 /1043 variables (removed 520) and now considering 1659/2520 (removed 861) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 523/1043 places, 1659/2520 transitions.
Incomplete random walk after 10000 steps, including 104 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 407233 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :{}
Probabilistic random walk after 407233 steps, saw 53465 distinct states, run finished after 3001 ms. (steps per millisecond=135 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1659 rows 523 cols
[2023-03-11 03:38:21] [INFO ] Computed 22 place invariants in 9 ms
[2023-03-11 03:38:21] [INFO ] [Real]Absence check using 20 positive place invariants in 4 ms returned sat
[2023-03-11 03:38:21] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-11 03:38:21] [INFO ] After 322ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-11 03:38:21] [INFO ] State equation strengthened by 1596 read => feed constraints.
[2023-03-11 03:38:22] [INFO ] After 218ms SMT Verify possible using 1596 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:38:22] [INFO ] After 637ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:38:22] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2023-03-11 03:38:22] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2023-03-11 03:38:22] [INFO ] After 467ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 03:38:23] [INFO ] After 277ms SMT Verify possible using 1596 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 03:38:23] [INFO ] After 393ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 82 ms.
[2023-03-11 03:38:23] [INFO ] After 1082ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 523 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1659/1659 transitions.
Applied a total of 0 rules in 24 ms. Remains 523 /523 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 523/523 places, 1659/1659 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1659/1659 transitions.
Applied a total of 0 rules in 23 ms. Remains 523 /523 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
[2023-03-11 03:38:23] [INFO ] Invariant cache hit.
[2023-03-11 03:38:23] [INFO ] Implicit Places using invariants in 382 ms returned []
[2023-03-11 03:38:23] [INFO ] Invariant cache hit.
[2023-03-11 03:38:23] [INFO ] State equation strengthened by 1596 read => feed constraints.
[2023-03-11 03:38:28] [INFO ] Implicit Places using invariants and state equation in 4738 ms returned []
Implicit Place search using SMT with State Equation took 5137 ms to find 0 implicit places.
[2023-03-11 03:38:28] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-11 03:38:28] [INFO ] Invariant cache hit.
[2023-03-11 03:38:29] [INFO ] Dead Transitions using invariants and state equation in 673 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5879 ms. Remains : 523/523 places, 1659/1659 transitions.
Graph (trivial) has 1532 edges and 523 vertex of which 438 / 523 are part of one of the 2 SCC in 1 ms
Free SCC test removed 436 places
Drop transitions removed 1155 transitions
Ensure Unique test removed 412 transitions
Reduce isomorphic transitions removed 1567 transitions.
Graph (complete) has 214 edges and 87 vertex of which 26 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.0 ms
Discarding 61 places :
Also discarding 19 output transitions
Drop transitions removed 19 transitions
Drop transitions removed 41 transitions
Reduce isomorphic transitions removed 41 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 42 rules applied. Total rules applied 44 place count 26 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 25 transition count 31
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 63 place count 7 transition count 13
Iterating global reduction 2 with 18 rules applied. Total rules applied 81 place count 7 transition count 13
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 83 place count 7 transition count 11
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 7 transition count 10
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 86 place count 6 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 5 transition count 8
Applied a total of 87 rules in 7 ms. Remains 5 /523 variables (removed 518) and now considering 8/1659 (removed 1651) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 8 rows 5 cols
[2023-03-11 03:38:29] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 03:38:29] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:38:29] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 03:38:29] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-11 03:38:29] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) p0)), (X p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), true, (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (AND (NOT p1) (NOT p2))), (F (NOT p1)), (F p2)]
Knowledge based reduction with 19 factoid took 1241 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 267 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 224 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Support contains 3 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 16 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2023-03-11 03:38:30] [INFO ] Computed 22 place invariants in 31 ms
[2023-03-11 03:38:31] [INFO ] Implicit Places using invariants in 290 ms returned []
[2023-03-11 03:38:31] [INFO ] Invariant cache hit.
[2023-03-11 03:38:31] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-11 03:38:34] [INFO ] Implicit Places using invariants and state equation in 3041 ms returned []
Implicit Place search using SMT with State Equation took 3333 ms to find 0 implicit places.
[2023-03-11 03:38:34] [INFO ] Invariant cache hit.
[2023-03-11 03:38:35] [INFO ] Dead Transitions using invariants and state equation in 960 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4311 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Computed a total of 82 stabilizing places and 140 stable transitions
Computed a total of 82 stabilizing places and 140 stable transitions
Detected a total of 82/1043 stabilizing places and 140/2520 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Knowledge based reduction with 8 factoid took 392 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 21 resets, run finished after 279 ms. (steps per millisecond=35 ) properties (out of 5) seen :1
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
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
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-11 03:38:36] [INFO ] Invariant cache hit.
[2023-03-11 03:38:36] [INFO ] [Real]Absence check using 20 positive place invariants in 11 ms returned sat
[2023-03-11 03:38:36] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 9 ms returned sat
[2023-03-11 03:38:37] [INFO ] After 935ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:1
[2023-03-11 03:38:37] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-11 03:38:38] [INFO ] After 560ms SMT Verify possible using 780 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 03:38:38] [INFO ] After 1763ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 03:38:38] [INFO ] [Nat]Absence check using 20 positive place invariants in 11 ms returned sat
[2023-03-11 03:38:38] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 13 ms returned sat
[2023-03-11 03:38:39] [INFO ] After 847ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 03:38:40] [INFO ] After 1026ms SMT Verify possible using 780 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 03:38:40] [INFO ] After 1768ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 588 ms.
[2023-03-11 03:38:41] [INFO ] After 3467ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 8 ms.
Support contains 2 out of 1043 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 1043 transition count 2380
Reduce places removed 140 places and 0 transitions.
Iterating post reduction 1 with 140 rules applied. Total rules applied 280 place count 903 transition count 2380
Performed 379 Post agglomeration using F-continuation condition.Transition count delta: 379
Deduced a syphon composed of 379 places in 0 ms
Reduce places removed 379 places and 0 transitions.
Iterating global reduction 2 with 758 rules applied. Total rules applied 1038 place count 524 transition count 2001
Drop transitions removed 341 transitions
Redundant transition composition rules discarded 341 transitions
Iterating global reduction 2 with 341 rules applied. Total rules applied 1379 place count 524 transition count 1660
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1380 place count 524 transition count 1659
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1381 place count 523 transition count 1659
Partial Free-agglomeration rule applied 420 times.
Drop transitions removed 420 transitions
Iterating global reduction 3 with 420 rules applied. Total rules applied 1801 place count 523 transition count 1659
Applied a total of 1801 rules in 152 ms. Remains 523 /1043 variables (removed 520) and now considering 1659/2520 (removed 861) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 523/1043 places, 1659/2520 transitions.
Incomplete random walk after 10000 steps, including 103 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 340809 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :{}
Probabilistic random walk after 340809 steps, saw 46077 distinct states, run finished after 3002 ms. (steps per millisecond=113 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1659 rows 523 cols
[2023-03-11 03:38:44] [INFO ] Computed 22 place invariants in 22 ms
[2023-03-11 03:38:44] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2023-03-11 03:38:44] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-11 03:38:45] [INFO ] After 433ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-11 03:38:45] [INFO ] State equation strengthened by 1596 read => feed constraints.
[2023-03-11 03:38:45] [INFO ] After 249ms SMT Verify possible using 1596 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:38:45] [INFO ] After 829ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:38:45] [INFO ] [Nat]Absence check using 20 positive place invariants in 5 ms returned sat
[2023-03-11 03:38:45] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-11 03:38:46] [INFO ] After 370ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 03:38:46] [INFO ] After 242ms SMT Verify possible using 1596 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 03:38:46] [INFO ] After 365ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 88 ms.
[2023-03-11 03:38:46] [INFO ] After 920ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 523 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1659/1659 transitions.
Applied a total of 0 rules in 25 ms. Remains 523 /523 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 523/523 places, 1659/1659 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1659/1659 transitions.
Applied a total of 0 rules in 24 ms. Remains 523 /523 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
[2023-03-11 03:38:46] [INFO ] Invariant cache hit.
[2023-03-11 03:38:46] [INFO ] Implicit Places using invariants in 337 ms returned []
[2023-03-11 03:38:47] [INFO ] Invariant cache hit.
[2023-03-11 03:38:47] [INFO ] State equation strengthened by 1596 read => feed constraints.
[2023-03-11 03:38:51] [INFO ] Implicit Places using invariants and state equation in 4064 ms returned []
Implicit Place search using SMT with State Equation took 4429 ms to find 0 implicit places.
[2023-03-11 03:38:51] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-11 03:38:51] [INFO ] Invariant cache hit.
[2023-03-11 03:38:51] [INFO ] Dead Transitions using invariants and state equation in 691 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5170 ms. Remains : 523/523 places, 1659/1659 transitions.
Graph (trivial) has 1532 edges and 523 vertex of which 438 / 523 are part of one of the 2 SCC in 1 ms
Free SCC test removed 436 places
Drop transitions removed 1155 transitions
Ensure Unique test removed 412 transitions
Reduce isomorphic transitions removed 1567 transitions.
Graph (complete) has 214 edges and 87 vertex of which 26 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.0 ms
Discarding 61 places :
Also discarding 19 output transitions
Drop transitions removed 19 transitions
Drop transitions removed 41 transitions
Reduce isomorphic transitions removed 41 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 42 rules applied. Total rules applied 44 place count 26 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 25 transition count 31
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 63 place count 7 transition count 13
Iterating global reduction 2 with 18 rules applied. Total rules applied 81 place count 7 transition count 13
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 83 place count 7 transition count 11
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 7 transition count 10
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 86 place count 6 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 5 transition count 8
Applied a total of 87 rules in 4 ms. Remains 5 /523 variables (removed 518) and now considering 8/1659 (removed 1651) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 8 rows 5 cols
[2023-03-11 03:38:51] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-11 03:38:51] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:38:51] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 03:38:51] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-11 03:38:51] [INFO ] After 25ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F p2), (F (AND (NOT p1) (NOT p2))), (F (NOT p1))]
Knowledge based reduction with 8 factoid took 579 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 312 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 342 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 271 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 211 reset in 387 ms.
Product exploration explored 100000 steps with 216 reset in 475 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 290 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Support contains 3 out of 1043 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 1043 transition count 2520
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 20 Pre rules applied. Total rules applied 99 place count 1043 transition count 2520
Deduced a syphon composed of 119 places in 1 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 119 place count 1043 transition count 2520
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 159 place count 1003 transition count 2480
Deduced a syphon composed of 79 places in 1 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 199 place count 1003 transition count 2480
Performed 398 Post agglomeration using F-continuation condition.Transition count delta: -718
Deduced a syphon composed of 477 places in 0 ms
Iterating global reduction 1 with 398 rules applied. Total rules applied 597 place count 1003 transition count 3198
Discarding 78 places :
Symmetric choice reduction at 1 with 78 rule applications. Total rules 675 place count 925 transition count 3120
Deduced a syphon composed of 399 places in 1 ms
Iterating global reduction 1 with 78 rules applied. Total rules applied 753 place count 925 transition count 3120
Deduced a syphon composed of 399 places in 1 ms
Drop transitions removed 341 transitions
Redundant transition composition rules discarded 341 transitions
Iterating global reduction 1 with 341 rules applied. Total rules applied 1094 place count 925 transition count 2779
Deduced a syphon composed of 399 places in 1 ms
Applied a total of 1094 rules in 231 ms. Remains 925 /1043 variables (removed 118) and now considering 2779/2520 (removed -259) transitions.
[2023-03-11 03:38:54] [INFO ] Redundant transitions in 82 ms returned []
// Phase 1: matrix 2779 rows 925 cols
[2023-03-11 03:38:55] [INFO ] Computed 22 place invariants in 43 ms
[2023-03-11 03:38:56] [INFO ] Dead Transitions using invariants and state equation in 1198 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 925/1043 places, 2779/2520 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1522 ms. Remains : 925/1043 places, 2779/2520 transitions.
Support contains 3 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 15 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
// Phase 1: matrix 2520 rows 1043 cols
[2023-03-11 03:38:56] [INFO ] Computed 22 place invariants in 28 ms
[2023-03-11 03:38:56] [INFO ] Implicit Places using invariants in 320 ms returned []
[2023-03-11 03:38:56] [INFO ] Invariant cache hit.
[2023-03-11 03:38:57] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-11 03:38:59] [INFO ] Implicit Places using invariants and state equation in 3178 ms returned []
Implicit Place search using SMT with State Equation took 3504 ms to find 0 implicit places.
[2023-03-11 03:38:59] [INFO ] Invariant cache hit.
[2023-03-11 03:39:00] [INFO ] Dead Transitions using invariants and state equation in 1036 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4556 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-11 finished in 54429 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(p0)))||G(p1)))'
Support contains 3 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 18 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
[2023-03-11 03:39:00] [INFO ] Invariant cache hit.
[2023-03-11 03:39:01] [INFO ] Implicit Places using invariants in 289 ms returned []
[2023-03-11 03:39:01] [INFO ] Invariant cache hit.
[2023-03-11 03:39:01] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-11 03:39:03] [INFO ] Implicit Places using invariants and state equation in 2546 ms returned []
Implicit Place search using SMT with State Equation took 2854 ms to find 0 implicit places.
[2023-03-11 03:39:03] [INFO ] Invariant cache hit.
[2023-03-11 03:39:04] [INFO ] Dead Transitions using invariants and state equation in 989 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3874 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 308 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 5}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=p1, acceptance={} source=4 dest: 1}, { cond=(NOT p1), acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 3}], [{ cond=p1, acceptance={} source=7 dest: 4}, { cond=(NOT p1), acceptance={} source=7 dest: 6}], [{ cond=(NOT p1), acceptance={} source=8 dest: 5}, { cond=p1, acceptance={} source=8 dest: 8}]], initial=7, aps=[p0:(GT s787 s724), p1:(OR (GT s787 s724) (GT 1 s709))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 12021 steps with 25 reset in 38 ms.
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-12 finished in 4236 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Applied a total of 0 rules in 16 ms. Remains 1043 /1043 variables (removed 0) and now considering 2520/2520 (removed 0) transitions.
[2023-03-11 03:39:05] [INFO ] Invariant cache hit.
[2023-03-11 03:39:05] [INFO ] Implicit Places using invariants in 387 ms returned []
[2023-03-11 03:39:05] [INFO ] Invariant cache hit.
[2023-03-11 03:39:06] [INFO ] State equation strengthened by 780 read => feed constraints.
[2023-03-11 03:39:08] [INFO ] Implicit Places using invariants and state equation in 3452 ms returned []
Implicit Place search using SMT with State Equation took 3847 ms to find 0 implicit places.
[2023-03-11 03:39:08] [INFO ] Invariant cache hit.
[2023-03-11 03:39:09] [INFO ] Dead Transitions using invariants and state equation in 977 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4841 ms. Remains : 1043/1043 places, 2520/2520 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-13 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: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(LEQ 2 s716)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 454 steps with 0 reset in 3 ms.
FORMULA CANInsertWithFailure-PT-020-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-13 finished in 5023 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Found a Lengthening insensitive property : CANInsertWithFailure-PT-020-LTLCardinality-02
Stuttering acceptance computed with spot in 109 ms :[true, p0, p0]
Support contains 2 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 1043 transition count 2382
Reduce places removed 138 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 139 rules applied. Total rules applied 277 place count 905 transition count 2381
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 278 place count 904 transition count 2381
Performed 360 Post agglomeration using F-continuation condition.Transition count delta: 360
Deduced a syphon composed of 360 places in 0 ms
Reduce places removed 360 places and 0 transitions.
Iterating global reduction 3 with 720 rules applied. Total rules applied 998 place count 544 transition count 2021
Drop transitions removed 324 transitions
Redundant transition composition rules discarded 324 transitions
Iterating global reduction 3 with 324 rules applied. Total rules applied 1322 place count 544 transition count 1697
Partial Post-agglomeration rule applied 38 times.
Drop transitions removed 38 transitions
Iterating global reduction 3 with 38 rules applied. Total rules applied 1360 place count 544 transition count 1697
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 1378 place count 526 transition count 1679
Iterating global reduction 3 with 18 rules applied. Total rules applied 1396 place count 526 transition count 1679
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 3 with 18 rules applied. Total rules applied 1414 place count 526 transition count 1661
Applied a total of 1414 rules in 186 ms. Remains 526 /1043 variables (removed 517) and now considering 1661/2520 (removed 859) transitions.
// Phase 1: matrix 1661 rows 526 cols
[2023-03-11 03:39:10] [INFO ] Computed 22 place invariants in 14 ms
[2023-03-11 03:39:10] [INFO ] Implicit Places using invariants in 257 ms returned []
[2023-03-11 03:39:10] [INFO ] Invariant cache hit.
[2023-03-11 03:39:11] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2023-03-11 03:39:12] [INFO ] Implicit Places using invariants and state equation in 1837 ms returned []
Implicit Place search using SMT with State Equation took 2100 ms to find 0 implicit places.
[2023-03-11 03:39:12] [INFO ] Invariant cache hit.
[2023-03-11 03:39:13] [INFO ] Dead Transitions using invariants and state equation in 720 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 526/1043 places, 1661/2520 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3008 ms. Remains : 526/1043 places, 1661/2520 transitions.
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LEQ 3 s111) (LEQ 3 s5))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 948 reset in 413 ms.
Product exploration explored 100000 steps with 944 reset in 391 ms.
Computed a total of 60 stabilizing places and 99 stable transitions
Computed a total of 60 stabilizing places and 99 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 576 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[true, p0, p0]
Incomplete random walk after 10000 steps, including 95 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 400993 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :{}
Probabilistic random walk after 400993 steps, saw 59010 distinct states, run finished after 3001 ms. (steps per millisecond=133 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 03:39:17] [INFO ] Invariant cache hit.
[2023-03-11 03:39:17] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2023-03-11 03:39:17] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 7 ms returned sat
[2023-03-11 03:39:18] [INFO ] After 495ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:39:18] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2023-03-11 03:39:18] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 7 ms returned sat
[2023-03-11 03:39:18] [INFO ] After 334ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:39:18] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2023-03-11 03:39:18] [INFO ] After 230ms SMT Verify possible using 1177 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:39:19] [INFO ] After 348ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 81 ms.
[2023-03-11 03:39:19] [INFO ] After 883ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 526 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 526/526 places, 1661/1661 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 526 transition count 1659
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 524 transition count 1659
Partial Free-agglomeration rule applied 421 times.
Drop transitions removed 421 transitions
Iterating global reduction 1 with 421 rules applied. Total rules applied 425 place count 524 transition count 1659
Applied a total of 425 rules in 93 ms. Remains 524 /526 variables (removed 2) and now considering 1659/1661 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 524/526 places, 1659/1661 transitions.
Incomplete random walk after 10000 steps, including 102 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 406892 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :{}
Probabilistic random walk after 406892 steps, saw 57241 distinct states, run finished after 3001 ms. (steps per millisecond=135 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1659 rows 524 cols
[2023-03-11 03:39:22] [INFO ] Computed 22 place invariants in 25 ms
[2023-03-11 03:39:22] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2023-03-11 03:39:22] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 16 ms returned sat
[2023-03-11 03:39:22] [INFO ] After 450ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:39:22] [INFO ] [Nat]Absence check using 20 positive place invariants in 5 ms returned sat
[2023-03-11 03:39:22] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-11 03:39:23] [INFO ] After 278ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:39:23] [INFO ] State equation strengthened by 1577 read => feed constraints.
[2023-03-11 03:39:23] [INFO ] After 207ms SMT Verify possible using 1577 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:39:23] [INFO ] After 305ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 62 ms.
[2023-03-11 03:39:23] [INFO ] After 754ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 524 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1659/1659 transitions.
Applied a total of 0 rules in 30 ms. Remains 524 /524 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 524/524 places, 1659/1659 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1659/1659 transitions.
Applied a total of 0 rules in 36 ms. Remains 524 /524 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
[2023-03-11 03:39:23] [INFO ] Invariant cache hit.
[2023-03-11 03:39:23] [INFO ] Implicit Places using invariants in 299 ms returned []
[2023-03-11 03:39:23] [INFO ] Invariant cache hit.
[2023-03-11 03:39:24] [INFO ] State equation strengthened by 1577 read => feed constraints.
[2023-03-11 03:39:28] [INFO ] Implicit Places using invariants and state equation in 4898 ms returned []
Implicit Place search using SMT with State Equation took 5235 ms to find 0 implicit places.
[2023-03-11 03:39:28] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-11 03:39:28] [INFO ] Invariant cache hit.
[2023-03-11 03:39:29] [INFO ] Dead Transitions using invariants and state equation in 652 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5976 ms. Remains : 524/524 places, 1659/1659 transitions.
Graph (trivial) has 1519 edges and 524 vertex of which 418 / 524 are part of one of the 2 SCC in 0 ms
Free SCC test removed 416 places
Drop transitions removed 1084 transitions
Ensure Unique test removed 408 transitions
Reduce isomorphic transitions removed 1492 transitions.
Graph (complete) has 291 edges and 108 vertex of which 50 are kept as prefixes of interest. Removing 58 places using SCC suffix rule.0 ms
Discarding 58 places :
Also discarding 17 output transitions
Drop transitions removed 17 transitions
Drop transitions removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 50 transition count 91
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 95 place count 16 transition count 40
Iterating global reduction 1 with 34 rules applied. Total rules applied 129 place count 16 transition count 40
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 146 place count 16 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 148 place count 15 transition count 22
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 150 place count 14 transition count 21
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 152 place count 14 transition count 19
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 153 place count 14 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 154 place count 13 transition count 18
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 155 place count 13 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 156 place count 12 transition count 17
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 158 place count 10 transition count 15
Applied a total of 158 rules in 5 ms. Remains 10 /524 variables (removed 514) and now considering 15/1659 (removed 1644) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 15 rows 10 cols
[2023-03-11 03:39:29] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-11 03:39:29] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 03:39:29] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 03:39:29] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:39:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 03:39:29] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 6 ms returned sat
[2023-03-11 03:39:29] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:39:29] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-11 03:39:29] [INFO ] After 39ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 110 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 56 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 58 ms :[true, p0, p0]
Support contains 2 out of 526 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 526/526 places, 1661/1661 transitions.
Applied a total of 0 rules in 12 ms. Remains 526 /526 variables (removed 0) and now considering 1661/1661 (removed 0) transitions.
// Phase 1: matrix 1661 rows 526 cols
[2023-03-11 03:39:29] [INFO ] Computed 22 place invariants in 11 ms
[2023-03-11 03:39:30] [INFO ] Implicit Places using invariants in 190 ms returned []
[2023-03-11 03:39:30] [INFO ] Invariant cache hit.
[2023-03-11 03:39:30] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2023-03-11 03:39:31] [INFO ] Implicit Places using invariants and state equation in 1838 ms returned []
Implicit Place search using SMT with State Equation took 2043 ms to find 0 implicit places.
[2023-03-11 03:39:31] [INFO ] Invariant cache hit.
[2023-03-11 03:39:32] [INFO ] Dead Transitions using invariants and state equation in 698 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2758 ms. Remains : 526/526 places, 1661/1661 transitions.
Computed a total of 60 stabilizing places and 99 stable transitions
Computed a total of 60 stabilizing places and 99 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 127 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[true, p0, p0]
Incomplete random walk after 10000 steps, including 96 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 363528 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :{}
Probabilistic random walk after 363528 steps, saw 53944 distinct states, run finished after 3002 ms. (steps per millisecond=121 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 03:39:35] [INFO ] Invariant cache hit.
[2023-03-11 03:39:36] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2023-03-11 03:39:36] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2023-03-11 03:39:36] [INFO ] After 440ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:39:36] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2023-03-11 03:39:36] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-11 03:39:36] [INFO ] After 289ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:39:36] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2023-03-11 03:39:36] [INFO ] After 186ms SMT Verify possible using 1177 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:39:37] [INFO ] After 247ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-11 03:39:37] [INFO ] After 693ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 526 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 526/526 places, 1661/1661 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 526 transition count 1659
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 524 transition count 1659
Partial Free-agglomeration rule applied 421 times.
Drop transitions removed 421 transitions
Iterating global reduction 1 with 421 rules applied. Total rules applied 425 place count 524 transition count 1659
Applied a total of 425 rules in 94 ms. Remains 524 /526 variables (removed 2) and now considering 1659/1661 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 524/526 places, 1659/1661 transitions.
Incomplete random walk after 10000 steps, including 104 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 413225 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :{}
Probabilistic random walk after 413225 steps, saw 57920 distinct states, run finished after 3001 ms. (steps per millisecond=137 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1659 rows 524 cols
[2023-03-11 03:39:40] [INFO ] Computed 22 place invariants in 24 ms
[2023-03-11 03:39:40] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2023-03-11 03:39:40] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2023-03-11 03:39:40] [INFO ] After 537ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:39:40] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2023-03-11 03:39:40] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2023-03-11 03:39:41] [INFO ] After 339ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:39:41] [INFO ] State equation strengthened by 1577 read => feed constraints.
[2023-03-11 03:39:41] [INFO ] After 215ms SMT Verify possible using 1577 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:39:41] [INFO ] After 294ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-11 03:39:41] [INFO ] After 853ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 524 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1659/1659 transitions.
Applied a total of 0 rules in 28 ms. Remains 524 /524 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 524/524 places, 1659/1659 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 1659/1659 transitions.
Applied a total of 0 rules in 25 ms. Remains 524 /524 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
[2023-03-11 03:39:41] [INFO ] Invariant cache hit.
[2023-03-11 03:39:42] [INFO ] Implicit Places using invariants in 410 ms returned []
[2023-03-11 03:39:42] [INFO ] Invariant cache hit.
[2023-03-11 03:39:42] [INFO ] State equation strengthened by 1577 read => feed constraints.
[2023-03-11 03:39:46] [INFO ] Implicit Places using invariants and state equation in 4310 ms returned []
Implicit Place search using SMT with State Equation took 4727 ms to find 0 implicit places.
[2023-03-11 03:39:46] [INFO ] Redundant transitions in 47 ms returned []
[2023-03-11 03:39:46] [INFO ] Invariant cache hit.
[2023-03-11 03:39:47] [INFO ] Dead Transitions using invariants and state equation in 764 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5575 ms. Remains : 524/524 places, 1659/1659 transitions.
Graph (trivial) has 1519 edges and 524 vertex of which 418 / 524 are part of one of the 2 SCC in 1 ms
Free SCC test removed 416 places
Drop transitions removed 1084 transitions
Ensure Unique test removed 408 transitions
Reduce isomorphic transitions removed 1492 transitions.
Graph (complete) has 291 edges and 108 vertex of which 50 are kept as prefixes of interest. Removing 58 places using SCC suffix rule.1 ms
Discarding 58 places :
Also discarding 17 output transitions
Drop transitions removed 17 transitions
Drop transitions removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 50 transition count 91
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 95 place count 16 transition count 40
Iterating global reduction 1 with 34 rules applied. Total rules applied 129 place count 16 transition count 40
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 146 place count 16 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 148 place count 15 transition count 22
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 150 place count 14 transition count 21
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 152 place count 14 transition count 19
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 153 place count 14 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 154 place count 13 transition count 18
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 155 place count 13 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 156 place count 12 transition count 17
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 158 place count 10 transition count 15
Applied a total of 158 rules in 18 ms. Remains 10 /524 variables (removed 514) and now considering 15/1659 (removed 1644) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 15 rows 10 cols
[2023-03-11 03:39:47] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-11 03:39:47] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 03:39:47] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 03:39:47] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:39:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 03:39:47] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 03:39:47] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:39:47] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-11 03:39:47] [INFO ] After 46ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 124 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 122 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 124 ms :[true, p0, p0]
Product exploration explored 100000 steps with 939 reset in 526 ms.
Product exploration explored 100000 steps with 946 reset in 568 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 100 ms :[true, p0, p0]
Support contains 2 out of 526 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 526/526 places, 1661/1661 transitions.
Applied a total of 0 rules in 36 ms. Remains 526 /526 variables (removed 0) and now considering 1661/1661 (removed 0) transitions.
[2023-03-11 03:39:49] [INFO ] Redundant transitions in 33 ms returned []
// Phase 1: matrix 1661 rows 526 cols
[2023-03-11 03:39:49] [INFO ] Computed 22 place invariants in 18 ms
[2023-03-11 03:39:49] [INFO ] Dead Transitions using invariants and state equation in 662 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 752 ms. Remains : 526/526 places, 1661/1661 transitions.
Support contains 2 out of 526 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 526/526 places, 1661/1661 transitions.
Applied a total of 0 rules in 12 ms. Remains 526 /526 variables (removed 0) and now considering 1661/1661 (removed 0) transitions.
[2023-03-11 03:39:49] [INFO ] Invariant cache hit.
[2023-03-11 03:39:50] [INFO ] Implicit Places using invariants in 198 ms returned []
[2023-03-11 03:39:50] [INFO ] Invariant cache hit.
[2023-03-11 03:39:50] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2023-03-11 03:39:51] [INFO ] Implicit Places using invariants and state equation in 1683 ms returned []
Implicit Place search using SMT with State Equation took 1907 ms to find 0 implicit places.
[2023-03-11 03:39:51] [INFO ] Invariant cache hit.
[2023-03-11 03:39:52] [INFO ] Dead Transitions using invariants and state equation in 762 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2682 ms. Remains : 526/526 places, 1661/1661 transitions.
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-02 finished in 42644 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)||G(F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (G(p0)||p1)) U (G((p0 U (p1||G(p0))))||(X(G(p2))&&(p0 U (p1||G(p0)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||G((G(F(p1)) U p2))))'
Found a Lengthening insensitive property : CANInsertWithFailure-PT-020-LTLCardinality-11
Stuttering acceptance computed with spot in 382 ms :[(AND (NOT p0) (NOT p2)), (AND p2 (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Support contains 3 out of 1043 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1043/1043 places, 2520/2520 transitions.
Drop transitions removed 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 0 with 137 rules applied. Total rules applied 137 place count 1043 transition count 2383
Reduce places removed 137 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 138 rules applied. Total rules applied 275 place count 906 transition count 2382
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 276 place count 905 transition count 2382
Performed 379 Post agglomeration using F-continuation condition.Transition count delta: 379
Deduced a syphon composed of 379 places in 1 ms
Reduce places removed 379 places and 0 transitions.
Iterating global reduction 3 with 758 rules applied. Total rules applied 1034 place count 526 transition count 2003
Drop transitions removed 341 transitions
Redundant transition composition rules discarded 341 transitions
Iterating global reduction 3 with 341 rules applied. Total rules applied 1375 place count 526 transition count 1662
Applied a total of 1375 rules in 118 ms. Remains 526 /1043 variables (removed 517) and now considering 1662/2520 (removed 858) transitions.
// Phase 1: matrix 1662 rows 526 cols
[2023-03-11 03:39:53] [INFO ] Computed 22 place invariants in 23 ms
[2023-03-11 03:39:53] [INFO ] Implicit Places using invariants in 265 ms returned []
[2023-03-11 03:39:53] [INFO ] Invariant cache hit.
[2023-03-11 03:39:54] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2023-03-11 03:39:55] [INFO ] Implicit Places using invariants and state equation in 1922 ms returned []
Implicit Place search using SMT with State Equation took 2199 ms to find 0 implicit places.
[2023-03-11 03:39:55] [INFO ] Invariant cache hit.
[2023-03-11 03:39:56] [INFO ] Dead Transitions using invariants and state equation in 644 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 526/1043 places, 1662/2520 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2978 ms. Remains : 526/1043 places, 1662/2520 transitions.
Running random walk in product with property : CANInsertWithFailure-PT-020-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p2 p0), acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(NOT p0), acceptance={} source=2 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(NOT p2), acceptance={0} source=5 dest: 4}, { cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(NOT p2), acceptance={} source=6 dest: 4}, { cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(LEQ 1 s210), p0:(GT 3 s428), p1:(GT 1 s17)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33181 reset in 708 ms.
Product exploration explored 100000 steps with 33578 reset in 610 ms.
Computed a total of 65 stabilizing places and 102 stable transitions
Computed a total of 65 stabilizing places and 102 stable transitions
Detected a total of 65/526 stabilizing places and 102/1662 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) p0)), (X p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), true, (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Knowledge based reduction with 18 factoid took 972 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 284 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 98 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 03:39:59] [INFO ] Invariant cache hit.
[2023-03-11 03:39:59] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2023-03-11 03:39:59] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2023-03-11 03:39:59] [INFO ] After 447ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2023-03-11 03:39:59] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2023-03-11 03:40:00] [INFO ] After 236ms SMT Verify possible using 1177 Read/Feed constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-11 03:40:00] [INFO ] After 868ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-11 03:40:00] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned sat
[2023-03-11 03:40:00] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2023-03-11 03:40:00] [INFO ] After 455ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-11 03:40:00] [INFO ] After 310ms SMT Verify possible using 1177 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-11 03:40:01] [INFO ] After 482ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 119 ms.
[2023-03-11 03:40:01] [INFO ] After 1219ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 526 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 526/526 places, 1662/1662 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 526 transition count 1660
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 524 transition count 1660
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 524 transition count 1659
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 523 transition count 1659
Partial Free-agglomeration rule applied 420 times.
Drop transitions removed 420 transitions
Iterating global reduction 3 with 420 rules applied. Total rules applied 426 place count 523 transition count 1659
Applied a total of 426 rules in 76 ms. Remains 523 /526 variables (removed 3) and now considering 1659/1662 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 523/526 places, 1659/1662 transitions.
Incomplete random walk after 10000 steps, including 104 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 395625 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :{}
Probabilistic random walk after 395625 steps, saw 52047 distinct states, run finished after 3001 ms. (steps per millisecond=131 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1659 rows 523 cols
[2023-03-11 03:40:04] [INFO ] Computed 22 place invariants in 21 ms
[2023-03-11 03:40:04] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2023-03-11 03:40:04] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-11 03:40:05] [INFO ] After 465ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-11 03:40:05] [INFO ] State equation strengthened by 1596 read => feed constraints.
[2023-03-11 03:40:05] [INFO ] After 321ms SMT Verify possible using 1596 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:40:05] [INFO ] After 931ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:40:05] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2023-03-11 03:40:05] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2023-03-11 03:40:06] [INFO ] After 528ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 03:40:06] [INFO ] After 321ms SMT Verify possible using 1596 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 03:40:06] [INFO ] After 482ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 110 ms.
[2023-03-11 03:40:06] [INFO ] After 1278ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 523 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1659/1659 transitions.
Applied a total of 0 rules in 35 ms. Remains 523 /523 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 523/523 places, 1659/1659 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1659/1659 transitions.
Applied a total of 0 rules in 31 ms. Remains 523 /523 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
[2023-03-11 03:40:06] [INFO ] Invariant cache hit.
[2023-03-11 03:40:07] [INFO ] Implicit Places using invariants in 462 ms returned []
[2023-03-11 03:40:07] [INFO ] Invariant cache hit.
[2023-03-11 03:40:07] [INFO ] State equation strengthened by 1596 read => feed constraints.
[2023-03-11 03:40:11] [INFO ] Implicit Places using invariants and state equation in 3795 ms returned []
Implicit Place search using SMT with State Equation took 4262 ms to find 0 implicit places.
[2023-03-11 03:40:11] [INFO ] Redundant transitions in 51 ms returned []
[2023-03-11 03:40:11] [INFO ] Invariant cache hit.
[2023-03-11 03:40:11] [INFO ] Dead Transitions using invariants and state equation in 638 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4991 ms. Remains : 523/523 places, 1659/1659 transitions.
Graph (trivial) has 1532 edges and 523 vertex of which 438 / 523 are part of one of the 2 SCC in 0 ms
Free SCC test removed 436 places
Drop transitions removed 1155 transitions
Ensure Unique test removed 412 transitions
Reduce isomorphic transitions removed 1567 transitions.
Graph (complete) has 214 edges and 87 vertex of which 26 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.0 ms
Discarding 61 places :
Also discarding 19 output transitions
Drop transitions removed 19 transitions
Drop transitions removed 41 transitions
Reduce isomorphic transitions removed 41 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 42 rules applied. Total rules applied 44 place count 26 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 25 transition count 31
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 63 place count 7 transition count 13
Iterating global reduction 2 with 18 rules applied. Total rules applied 81 place count 7 transition count 13
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 83 place count 7 transition count 11
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 7 transition count 10
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 86 place count 6 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 5 transition count 8
Applied a total of 87 rules in 9 ms. Remains 5 /523 variables (removed 518) and now considering 8/1659 (removed 1651) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 8 rows 5 cols
[2023-03-11 03:40:11] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 03:40:11] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:40:11] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 03:40:11] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-11 03:40:11] [INFO ] After 31ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) p0)), (X p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), true, (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (AND (NOT p1) (NOT p2))), (F (NOT p1)), (F p2)]
Knowledge based reduction with 19 factoid took 1133 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 314 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 280 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Support contains 3 out of 526 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 526/526 places, 1662/1662 transitions.
Applied a total of 0 rules in 20 ms. Remains 526 /526 variables (removed 0) and now considering 1662/1662 (removed 0) transitions.
// Phase 1: matrix 1662 rows 526 cols
[2023-03-11 03:40:13] [INFO ] Computed 22 place invariants in 22 ms
[2023-03-11 03:40:13] [INFO ] Implicit Places using invariants in 296 ms returned []
[2023-03-11 03:40:13] [INFO ] Invariant cache hit.
[2023-03-11 03:40:14] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2023-03-11 03:40:15] [INFO ] Implicit Places using invariants and state equation in 2052 ms returned []
Implicit Place search using SMT with State Equation took 2353 ms to find 0 implicit places.
[2023-03-11 03:40:15] [INFO ] Invariant cache hit.
[2023-03-11 03:40:16] [INFO ] Dead Transitions using invariants and state equation in 560 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2934 ms. Remains : 526/526 places, 1662/1662 transitions.
Computed a total of 65 stabilizing places and 102 stable transitions
Computed a total of 65 stabilizing places and 102 stable transitions
Detected a total of 65/526 stabilizing places and 102/1662 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Knowledge based reduction with 8 factoid took 469 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 95 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 03:40:17] [INFO ] Invariant cache hit.
[2023-03-11 03:40:17] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2023-03-11 03:40:17] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 10 ms returned sat
[2023-03-11 03:40:17] [INFO ] After 352ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2023-03-11 03:40:17] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2023-03-11 03:40:18] [INFO ] After 198ms SMT Verify possible using 1177 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:40:18] [INFO ] After 700ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:40:18] [INFO ] [Nat]Absence check using 20 positive place invariants in 4 ms returned sat
[2023-03-11 03:40:18] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-11 03:40:18] [INFO ] After 321ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:40:18] [INFO ] After 256ms SMT Verify possible using 1177 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 03:40:19] [INFO ] After 449ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 112 ms.
[2023-03-11 03:40:19] [INFO ] After 1018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 3 ms.
Support contains 2 out of 526 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 526/526 places, 1662/1662 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 526 transition count 1660
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 524 transition count 1660
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 524 transition count 1659
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 523 transition count 1659
Partial Free-agglomeration rule applied 420 times.
Drop transitions removed 420 transitions
Iterating global reduction 3 with 420 rules applied. Total rules applied 426 place count 523 transition count 1659
Applied a total of 426 rules in 66 ms. Remains 523 /526 variables (removed 3) and now considering 1659/1662 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 523/526 places, 1659/1662 transitions.
Incomplete random walk after 10000 steps, including 105 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 399144 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :{}
Probabilistic random walk after 399144 steps, saw 52511 distinct states, run finished after 3001 ms. (steps per millisecond=133 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1659 rows 523 cols
[2023-03-11 03:40:22] [INFO ] Computed 22 place invariants in 23 ms
[2023-03-11 03:40:22] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2023-03-11 03:40:22] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 6 ms returned sat
[2023-03-11 03:40:23] [INFO ] After 469ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-11 03:40:23] [INFO ] State equation strengthened by 1596 read => feed constraints.
[2023-03-11 03:40:23] [INFO ] After 265ms SMT Verify possible using 1596 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:40:23] [INFO ] After 948ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:40:23] [INFO ] [Nat]Absence check using 20 positive place invariants in 5 ms returned sat
[2023-03-11 03:40:23] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-11 03:40:23] [INFO ] After 384ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 03:40:24] [INFO ] After 261ms SMT Verify possible using 1596 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 03:40:24] [INFO ] After 414ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 94 ms.
[2023-03-11 03:40:24] [INFO ] After 1015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 523 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1659/1659 transitions.
Applied a total of 0 rules in 20 ms. Remains 523 /523 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 523/523 places, 1659/1659 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 1659/1659 transitions.
Applied a total of 0 rules in 20 ms. Remains 523 /523 variables (removed 0) and now considering 1659/1659 (removed 0) transitions.
[2023-03-11 03:40:24] [INFO ] Invariant cache hit.
[2023-03-11 03:40:24] [INFO ] Implicit Places using invariants in 470 ms returned []
[2023-03-11 03:40:24] [INFO ] Invariant cache hit.
[2023-03-11 03:40:25] [INFO ] State equation strengthened by 1596 read => feed constraints.
[2023-03-11 03:40:29] [INFO ] Implicit Places using invariants and state equation in 5066 ms returned []
Implicit Place search using SMT with State Equation took 5538 ms to find 0 implicit places.
[2023-03-11 03:40:29] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-11 03:40:29] [INFO ] Invariant cache hit.
[2023-03-11 03:40:30] [INFO ] Dead Transitions using invariants and state equation in 597 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6210 ms. Remains : 523/523 places, 1659/1659 transitions.
Graph (trivial) has 1532 edges and 523 vertex of which 438 / 523 are part of one of the 2 SCC in 0 ms
Free SCC test removed 436 places
Drop transitions removed 1155 transitions
Ensure Unique test removed 412 transitions
Reduce isomorphic transitions removed 1567 transitions.
Graph (complete) has 214 edges and 87 vertex of which 26 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.0 ms
Discarding 61 places :
Also discarding 19 output transitions
Drop transitions removed 19 transitions
Drop transitions removed 41 transitions
Reduce isomorphic transitions removed 41 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 42 rules applied. Total rules applied 44 place count 26 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 25 transition count 31
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 63 place count 7 transition count 13
Iterating global reduction 2 with 18 rules applied. Total rules applied 81 place count 7 transition count 13
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 83 place count 7 transition count 11
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 7 transition count 10
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 86 place count 6 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 5 transition count 8
Applied a total of 87 rules in 4 ms. Remains 5 /523 variables (removed 518) and now considering 8/1659 (removed 1651) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 8 rows 5 cols
[2023-03-11 03:40:30] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 03:40:30] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:40:30] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 03:40:30] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-11 03:40:30] [INFO ] After 37ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F p2), (F (AND (NOT p1) (NOT p2))), (F (NOT p1))]
Knowledge based reduction with 8 factoid took 591 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 175 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 176 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 963 reset in 385 ms.
Product exploration explored 100000 steps with 968 reset in 679 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 339 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (NOT p2)]
Support contains 3 out of 526 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 526/526 places, 1662/1662 transitions.
Applied a total of 0 rules in 42 ms. Remains 526 /526 variables (removed 0) and now considering 1662/1662 (removed 0) transitions.
[2023-03-11 03:40:33] [INFO ] Redundant transitions in 36 ms returned []
// Phase 1: matrix 1662 rows 526 cols
[2023-03-11 03:40:33] [INFO ] Computed 22 place invariants in 29 ms
[2023-03-11 03:40:34] [INFO ] Dead Transitions using invariants and state equation in 750 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 842 ms. Remains : 526/526 places, 1662/1662 transitions.
Support contains 3 out of 526 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 526/526 places, 1662/1662 transitions.
Applied a total of 0 rules in 11 ms. Remains 526 /526 variables (removed 0) and now considering 1662/1662 (removed 0) transitions.
[2023-03-11 03:40:34] [INFO ] Invariant cache hit.
[2023-03-11 03:40:34] [INFO ] Implicit Places using invariants in 228 ms returned []
[2023-03-11 03:40:34] [INFO ] Invariant cache hit.
[2023-03-11 03:40:34] [INFO ] State equation strengthened by 1177 read => feed constraints.
[2023-03-11 03:40:36] [INFO ] Implicit Places using invariants and state equation in 1691 ms returned []
Implicit Place search using SMT with State Equation took 1920 ms to find 0 implicit places.
[2023-03-11 03:40:36] [INFO ] Invariant cache hit.
[2023-03-11 03:40:36] [INFO ] Dead Transitions using invariants and state equation in 646 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2579 ms. Remains : 526/526 places, 1662/1662 transitions.
Treatment of property CANInsertWithFailure-PT-020-LTLCardinality-11 finished in 43991 ms.
[2023-03-11 03:40:37] [INFO ] Flatten gal took : 110 ms
[2023-03-11 03:40:37] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-11 03:40:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1043 places, 2520 transitions and 6760 arcs took 29 ms.
Total runtime 340065 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT CANInsertWithFailure-PT-020
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLCardinality

BK_STOP 1678506453233

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 12 (type SKEL/SRCH) for 0 CANInsertWithFailure-PT-020-LTLCardinality-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 4 (type EXCL) for 3 CANInsertWithFailure-PT-020-LTLCardinality-04
lola: time limit : 899 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 1 0 0 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 4/899 3/32 CANInsertWithFailure-PT-020-LTLCardinality-04 123843 m, 24768 m/sec, 358179 t fired, .
12 LTL SRCH 5/3600 1/5 CANInsertWithFailure-PT-020-LTLCardinality-02 636582 m, 127316 m/sec, 4360278 t fired, .

Time elapsed: 5 secs. Pages in use: 4
# running tasks: 2 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 1 0 0 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 9/899 5/32 CANInsertWithFailure-PT-020-LTLCardinality-04 274537 m, 30138 m/sec, 808766 t fired, .
12 LTL SRCH 10/3600 1/5 CANInsertWithFailure-PT-020-LTLCardinality-02 1269882 m, 126660 m/sec, 8814490 t fired, .

Time elapsed: 10 secs. Pages in use: 6
# running tasks: 2 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 1 0 0 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 14/899 7/32 CANInsertWithFailure-PT-020-LTLCardinality-04 423902 m, 29873 m/sec, 1244892 t fired, .
12 LTL SRCH 15/3600 1/5 CANInsertWithFailure-PT-020-LTLCardinality-02 1772911 m, 100605 m/sec, 13197031 t fired, .

Time elapsed: 15 secs. Pages in use: 8
# running tasks: 2 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 1 0 0 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 19/899 10/32 CANInsertWithFailure-PT-020-LTLCardinality-04 560271 m, 27273 m/sec, 1646914 t fired, .
12 LTL SRCH 20/3600 1/5 CANInsertWithFailure-PT-020-LTLCardinality-02 2320304 m, 109478 m/sec, 17170475 t fired, .

Time elapsed: 20 secs. Pages in use: 11
# running tasks: 2 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 1 0 0 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 24/899 12/32 CANInsertWithFailure-PT-020-LTLCardinality-04 700666 m, 28079 m/sec, 2073158 t fired, .
12 LTL SRCH 25/3600 1/5 CANInsertWithFailure-PT-020-LTLCardinality-02 2810953 m, 98129 m/sec, 21647802 t fired, .

Time elapsed: 25 secs. Pages in use: 13
# running tasks: 2 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 1 0 0 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 29/899 14/32 CANInsertWithFailure-PT-020-LTLCardinality-04 841274 m, 28121 m/sec, 2507196 t fired, .
12 LTL SRCH 30/3600 1/5 CANInsertWithFailure-PT-020-LTLCardinality-02 3288023 m, 95414 m/sec, 25630554 t fired, .

Time elapsed: 30 secs. Pages in use: 15
# running tasks: 2 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 1 0 0 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 34/899 16/32 CANInsertWithFailure-PT-020-LTLCardinality-04 973838 m, 26512 m/sec, 2925239 t fired, .
12 LTL SRCH 35/3600 1/5 CANInsertWithFailure-PT-020-LTLCardinality-02 3705794 m, 83554 m/sec, 29510277 t fired, .

Time elapsed: 35 secs. Pages in use: 17
# running tasks: 2 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 1 0 0 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 39/899 18/32 CANInsertWithFailure-PT-020-LTLCardinality-04 1105712 m, 26374 m/sec, 3337627 t fired, .
12 LTL SRCH 40/3600 1/5 CANInsertWithFailure-PT-020-LTLCardinality-02 4156277 m, 90096 m/sec, 33296488 t fired, .

Time elapsed: 40 secs. Pages in use: 19
# running tasks: 2 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 1 0 0 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 44/899 20/32 CANInsertWithFailure-PT-020-LTLCardinality-04 1239005 m, 26658 m/sec, 3746974 t fired, .
12 LTL SRCH 45/3600 1/5 CANInsertWithFailure-PT-020-LTLCardinality-02 4587751 m, 86294 m/sec, 37031857 t fired, .

Time elapsed: 45 secs. Pages in use: 21
# running tasks: 2 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 1 0 0 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 49/899 22/32 CANInsertWithFailure-PT-020-LTLCardinality-04 1380056 m, 28210 m/sec, 4178537 t fired, .
12 LTL SRCH 50/3600 1/5 CANInsertWithFailure-PT-020-LTLCardinality-02 5103766 m, 103203 m/sec, 40244918 t fired, .

Time elapsed: 50 secs. Pages in use: 23
# running tasks: 2 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 1 0 0 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 54/899 25/32 CANInsertWithFailure-PT-020-LTLCardinality-04 1528921 m, 29773 m/sec, 4634469 t fired, .
12 LTL SRCH 55/3600 1/5 CANInsertWithFailure-PT-020-LTLCardinality-02 5257412 m, 30729 m/sec, 43459274 t fired, .

Time elapsed: 55 secs. Pages in use: 26
# running tasks: 2 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 1 0 0 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 59/899 27/32 CANInsertWithFailure-PT-020-LTLCardinality-04 1686991 m, 31614 m/sec, 5123709 t fired, .
12 LTL SRCH 60/3600 1/5 CANInsertWithFailure-PT-020-LTLCardinality-02 5748199 m, 98157 m/sec, 47766244 t fired, .

Time elapsed: 60 secs. Pages in use: 28
# running tasks: 2 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 1 0 0 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 64/899 29/32 CANInsertWithFailure-PT-020-LTLCardinality-04 1833089 m, 29219 m/sec, 5578934 t fired, .
12 LTL SRCH 65/3600 1/5 CANInsertWithFailure-PT-020-LTLCardinality-02 6228723 m, 96104 m/sec, 51654345 t fired, .

Time elapsed: 65 secs. Pages in use: 30
# running tasks: 2 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 1 0 0 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 69/899 32/32 CANInsertWithFailure-PT-020-LTLCardinality-04 1983148 m, 30011 m/sec, 6057645 t fired, .
12 LTL SRCH 70/3600 1/5 CANInsertWithFailure-PT-020-LTLCardinality-02 6639219 m, 82099 m/sec, 55915743 t fired, .

Time elapsed: 70 secs. Pages in use: 33
# running tasks: 2 of 4 Visible: 4
lola: CANCELED task # 4 (type EXCL) for CANInsertWithFailure-PT-020-LTLCardinality-04 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 1 0 0 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
12 LTL SRCH 75/3600 1/5 CANInsertWithFailure-PT-020-LTLCardinality-02 7131513 m, 98458 m/sec, 59986950 t fired, .

Time elapsed: 75 secs. Pages in use: 33
# running tasks: 2 of 4 Visible: 4
lola: LAUNCH task # 10 (type EXCL) for 9 CANInsertWithFailure-PT-020-LTLCardinality-11
lola: time limit : 1175 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 1 0 0 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 5/1175 3/32 CANInsertWithFailure-PT-020-LTLCardinality-11 157376 m, 31475 m/sec, 774684 t fired, .
12 LTL SRCH 80/3600 1/5 CANInsertWithFailure-PT-020-LTLCardinality-02 7564814 m, 86660 m/sec, 63919457 t fired, .

Time elapsed: 80 secs. Pages in use: 33
# running tasks: 2 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 1 0 0 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 10/1175 4/32 CANInsertWithFailure-PT-020-LTLCardinality-11 279910 m, 24506 m/sec, 1586152 t fired, .
12 LTL SRCH 85/3600 4/5 CANInsertWithFailure-PT-020-LTLCardinality-02 8038580 m, 94753 m/sec, 67456701 t fired, .

Time elapsed: 85 secs. Pages in use: 33
# running tasks: 2 of 4 Visible: 4
lola: CANCELED task # 12 (type SRCH) for CANInsertWithFailure-PT-020-LTLCardinality-02 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 0 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 15/1175 6/32 CANInsertWithFailure-PT-020-LTLCardinality-11 399744 m, 23966 m/sec, 2408949 t fired, .

Time elapsed: 90 secs. Pages in use: 33
# running tasks: 2 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 0 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 20/1175 8/32 CANInsertWithFailure-PT-020-LTLCardinality-11 552104 m, 30472 m/sec, 3302129 t fired, .

Time elapsed: 95 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 0 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 25/1175 10/32 CANInsertWithFailure-PT-020-LTLCardinality-11 705174 m, 30614 m/sec, 4201741 t fired, .

Time elapsed: 100 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 0 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 30/1175 11/32 CANInsertWithFailure-PT-020-LTLCardinality-11 846485 m, 28262 m/sec, 4933322 t fired, .

Time elapsed: 105 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 0 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 35/1175 13/32 CANInsertWithFailure-PT-020-LTLCardinality-11 953491 m, 21401 m/sec, 5661354 t fired, .

Time elapsed: 110 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 0 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 40/1175 14/32 CANInsertWithFailure-PT-020-LTLCardinality-11 1044596 m, 18221 m/sec, 6357782 t fired, .

Time elapsed: 115 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 0 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 45/1175 15/32 CANInsertWithFailure-PT-020-LTLCardinality-11 1167489 m, 24578 m/sec, 7124038 t fired, .

Time elapsed: 120 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 0 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 50/1175 17/32 CANInsertWithFailure-PT-020-LTLCardinality-11 1300740 m, 26650 m/sec, 7925168 t fired, .

Time elapsed: 125 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 0 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 55/1175 18/32 CANInsertWithFailure-PT-020-LTLCardinality-11 1436941 m, 27240 m/sec, 8637876 t fired, .

Time elapsed: 130 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 0 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 60/1175 19/32 CANInsertWithFailure-PT-020-LTLCardinality-11 1545505 m, 21712 m/sec, 9384058 t fired, .

Time elapsed: 135 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 0 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 65/1175 21/32 CANInsertWithFailure-PT-020-LTLCardinality-11 1651791 m, 21257 m/sec, 10169446 t fired, .

Time elapsed: 140 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 0 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 70/1175 22/32 CANInsertWithFailure-PT-020-LTLCardinality-11 1773337 m, 24309 m/sec, 10947123 t fired, .

Time elapsed: 145 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 0 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 75/1175 24/32 CANInsertWithFailure-PT-020-LTLCardinality-11 1889762 m, 23285 m/sec, 11747973 t fired, .

Time elapsed: 150 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 0 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 80/1175 25/32 CANInsertWithFailure-PT-020-LTLCardinality-11 2038227 m, 29693 m/sec, 12629327 t fired, .

Time elapsed: 155 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 0 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 85/1175 27/32 CANInsertWithFailure-PT-020-LTLCardinality-11 2158399 m, 24034 m/sec, 13462779 t fired, .

Time elapsed: 160 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 0 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 90/1175 28/32 CANInsertWithFailure-PT-020-LTLCardinality-11 2254357 m, 19191 m/sec, 14281240 t fired, .

Time elapsed: 165 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 0 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 95/1175 29/32 CANInsertWithFailure-PT-020-LTLCardinality-11 2383235 m, 25775 m/sec, 15114455 t fired, .

Time elapsed: 170 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 0 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 100/1175 31/32 CANInsertWithFailure-PT-020-LTLCardinality-11 2498259 m, 23004 m/sec, 15961410 t fired, .

Time elapsed: 175 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 0 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 105/1175 32/32 CANInsertWithFailure-PT-020-LTLCardinality-11 2626440 m, 25636 m/sec, 16774694 t fired, .

Time elapsed: 180 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 10 (type EXCL) for CANInsertWithFailure-PT-020-LTLCardinality-11 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 0 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 185 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 7 (type EXCL) for 6 CANInsertWithFailure-PT-020-LTLCardinality-09
lola: time limit : 1707 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 0 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 6/1707 2/32 CANInsertWithFailure-PT-020-LTLCardinality-09 129649 m, 25929 m/sec, 614440 t fired, .

Time elapsed: 191 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 0 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 11/1707 3/32 CANInsertWithFailure-PT-020-LTLCardinality-09 222367 m, 18543 m/sec, 1259382 t fired, .

Time elapsed: 196 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 0 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 16/1707 5/32 CANInsertWithFailure-PT-020-LTLCardinality-09 336192 m, 22765 m/sec, 1950753 t fired, .

Time elapsed: 201 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 0 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 21/1707 6/32 CANInsertWithFailure-PT-020-LTLCardinality-09 451381 m, 23037 m/sec, 2652301 t fired, .

Time elapsed: 206 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 0 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 26/1707 8/32 CANInsertWithFailure-PT-020-LTLCardinality-09 560563 m, 21836 m/sec, 3341159 t fired, .

Time elapsed: 211 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 0 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 31/1707 9/32 CANInsertWithFailure-PT-020-LTLCardinality-09 683370 m, 24561 m/sec, 4007479 t fired, .

Time elapsed: 216 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 0 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 36/1707 11/32 CANInsertWithFailure-PT-020-LTLCardinality-09 798945 m, 23115 m/sec, 4657105 t fired, .

Time elapsed: 221 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 0 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 41/1707 12/32 CANInsertWithFailure-PT-020-LTLCardinality-09 891957 m, 18602 m/sec, 5314547 t fired, .

Time elapsed: 226 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 0 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 46/1707 13/32 CANInsertWithFailure-PT-020-LTLCardinality-09 1000003 m, 21609 m/sec, 5963466 t fired, .

Time elapsed: 231 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 0 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 51/1707 14/32 CANInsertWithFailure-PT-020-LTLCardinality-09 1099943 m, 19988 m/sec, 6644063 t fired, .

Time elapsed: 236 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 0 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 56/1707 16/32 CANInsertWithFailure-PT-020-LTLCardinality-09 1208968 m, 21805 m/sec, 7315948 t fired, .

Time elapsed: 241 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 0 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 61/1707 17/32 CANInsertWithFailure-PT-020-LTLCardinality-09 1314753 m, 21157 m/sec, 8000764 t fired, .

Time elapsed: 246 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 0 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 66/1707 18/32 CANInsertWithFailure-PT-020-LTLCardinality-09 1433073 m, 23664 m/sec, 8615254 t fired, .

Time elapsed: 251 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 0 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 71/1707 19/32 CANInsertWithFailure-PT-020-LTLCardinality-09 1527889 m, 18963 m/sec, 9278236 t fired, .

Time elapsed: 256 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 0 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 76/1707 20/32 CANInsertWithFailure-PT-020-LTLCardinality-09 1614040 m, 17230 m/sec, 9945358 t fired, .

Time elapsed: 261 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 0 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 81/1707 21/32 CANInsertWithFailure-PT-020-LTLCardinality-09 1710049 m, 19201 m/sec, 10611116 t fired, .

Time elapsed: 266 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 0 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 86/1707 23/32 CANInsertWithFailure-PT-020-LTLCardinality-09 1814907 m, 20971 m/sec, 11269272 t fired, .

Time elapsed: 271 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 0 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 91/1707 24/32 CANInsertWithFailure-PT-020-LTLCardinality-09 1909684 m, 18955 m/sec, 11934575 t fired, .

Time elapsed: 276 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 0 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 96/1707 25/32 CANInsertWithFailure-PT-020-LTLCardinality-09 2035553 m, 25173 m/sec, 12609441 t fired, .

Time elapsed: 281 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 0 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 101/1707 26/32 CANInsertWithFailure-PT-020-LTLCardinality-09 2126342 m, 18157 m/sec, 13250649 t fired, .

Time elapsed: 286 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 0 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 106/1707 27/32 CANInsertWithFailure-PT-020-LTLCardinality-09 2201222 m, 14976 m/sec, 13853844 t fired, .

Time elapsed: 291 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 0 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 111/1707 28/32 CANInsertWithFailure-PT-020-LTLCardinality-09 2282152 m, 16186 m/sec, 14448381 t fired, .

Time elapsed: 296 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 0 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 116/1707 29/32 CANInsertWithFailure-PT-020-LTLCardinality-09 2373065 m, 18182 m/sec, 15057137 t fired, .

Time elapsed: 301 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 0 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 121/1707 30/32 CANInsertWithFailure-PT-020-LTLCardinality-09 2464627 m, 18312 m/sec, 15689795 t fired, .

Time elapsed: 306 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 0 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 126/1707 31/32 CANInsertWithFailure-PT-020-LTLCardinality-09 2547870 m, 16648 m/sec, 16311956 t fired, .

Time elapsed: 311 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 0 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 131/1707 32/32 CANInsertWithFailure-PT-020-LTLCardinality-09 2650543 m, 20534 m/sec, 16911557 t fired, .

Time elapsed: 316 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 7 (type EXCL) for CANInsertWithFailure-PT-020-LTLCardinality-09 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 1 0 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 321 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 1 (type EXCL) for 0 CANInsertWithFailure-PT-020-LTLCardinality-02
lola: time limit : 3279 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 0 1 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3279 3/32 CANInsertWithFailure-PT-020-LTLCardinality-02 174094 m, 34818 m/sec, 879725 t fired, .

Time elapsed: 326 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 0 1 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3279 5/32 CANInsertWithFailure-PT-020-LTLCardinality-02 317493 m, 28679 m/sec, 1821937 t fired, .

Time elapsed: 331 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 0 1 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3279 7/32 CANInsertWithFailure-PT-020-LTLCardinality-02 472111 m, 30923 m/sec, 2764917 t fired, .

Time elapsed: 336 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 0 1 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3279 9/32 CANInsertWithFailure-PT-020-LTLCardinality-02 636532 m, 32884 m/sec, 3714920 t fired, .

Time elapsed: 341 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 0 1 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3279 11/32 CANInsertWithFailure-PT-020-LTLCardinality-02 795277 m, 31749 m/sec, 4637507 t fired, .

Time elapsed: 346 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 0 1 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3279 12/32 CANInsertWithFailure-PT-020-LTLCardinality-02 928349 m, 26614 m/sec, 5514127 t fired, .

Time elapsed: 351 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 0 1 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3279 14/32 CANInsertWithFailure-PT-020-LTLCardinality-02 1052973 m, 24924 m/sec, 6396015 t fired, .

Time elapsed: 356 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 0 1 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3279 16/32 CANInsertWithFailure-PT-020-LTLCardinality-02 1207224 m, 30850 m/sec, 7306536 t fired, .

Time elapsed: 361 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 0 1 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3279 17/32 CANInsertWithFailure-PT-020-LTLCardinality-02 1362002 m, 30955 m/sec, 8222843 t fired, .

Time elapsed: 366 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 0 1 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3279 19/32 CANInsertWithFailure-PT-020-LTLCardinality-02 1494466 m, 26492 m/sec, 9088302 t fired, .

Time elapsed: 371 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 0 1 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/3279 20/32 CANInsertWithFailure-PT-020-LTLCardinality-02 1614051 m, 23917 m/sec, 9948040 t fired, .

Time elapsed: 376 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 0 1 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/3279 22/32 CANInsertWithFailure-PT-020-LTLCardinality-02 1753835 m, 27956 m/sec, 10836910 t fired, .

Time elapsed: 381 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 0 1 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 65/3279 23/32 CANInsertWithFailure-PT-020-LTLCardinality-02 1887144 m, 26661 m/sec, 11728013 t fired, .

Time elapsed: 386 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 0 1 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 70/3279 25/32 CANInsertWithFailure-PT-020-LTLCardinality-02 2041680 m, 30907 m/sec, 12651115 t fired, .

Time elapsed: 391 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 0 1 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 75/3279 27/32 CANInsertWithFailure-PT-020-LTLCardinality-02 2168622 m, 25388 m/sec, 13537158 t fired, .

Time elapsed: 396 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 0 1 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 80/3279 28/32 CANInsertWithFailure-PT-020-LTLCardinality-02 2277054 m, 21686 m/sec, 14415447 t fired, .

Time elapsed: 401 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 0 1 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 85/3279 29/32 CANInsertWithFailure-PT-020-LTLCardinality-02 2412485 m, 27086 m/sec, 15322478 t fired, .

Time elapsed: 406 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 0 1 0 0 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 90/3279 31/32 CANInsertWithFailure-PT-020-LTLCardinality-02 2533962 m, 24295 m/sec, 16208803 t fired, .

Time elapsed: 411 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 1 (type EXCL) for CANInsertWithFailure-PT-020-LTLCardinality-02 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL 0 0 0 0 0 0 2 0
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 416 secs. Pages in use: 33
# running tasks: 1 of 4 Visible: 4
lola: Portfolio finished: no open tasks 4

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-020-LTLCardinality-02: LTL unknown AGGR
CANInsertWithFailure-PT-020-LTLCardinality-04: LTL unknown AGGR
CANInsertWithFailure-PT-020-LTLCardinality-09: LTL unknown AGGR
CANInsertWithFailure-PT-020-LTLCardinality-11: LTL unknown AGGR


Time elapsed: 416 secs. Pages in use: 33

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-020"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is CANInsertWithFailure-PT-020, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r039-tajo-167813692900715"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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