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-167813692900739.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-050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r039-tajo-167813692900739
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.8K Feb 26 00:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 00:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 00:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 00:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 01:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 26 01:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 26 00:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 00:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16M 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-050-LTLCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-050-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678507334376

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-050
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 04:02:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 04:02:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 04:02:17] [INFO ] Load time of PNML (sax parser for PT used): 666 ms
[2023-03-11 04:02:17] [INFO ] Transformed 5604 places.
[2023-03-11 04:02:17] [INFO ] Transformed 15300 transitions.
[2023-03-11 04:02:17] [INFO ] Parsed PT model containing 5604 places and 15300 transitions and 41000 arcs in 879 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 5604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5604/5604 places, 15300/15300 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 5603 transition count 15300
Applied a total of 1 rules in 1151 ms. Remains 5603 /5604 variables (removed 1) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2023-03-11 04:02:20] [INFO ] Computed 52 place invariants in 1669 ms
[2023-03-11 04:02:22] [INFO ] Implicit Places using invariants in 2999 ms returned []
Implicit Place search using SMT only with invariants took 3035 ms to find 0 implicit places.
[2023-03-11 04:02:22] [INFO ] Invariant cache hit.
[2023-03-11 04:02:30] [INFO ] Dead Transitions using invariants and state equation in 8018 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5603/5604 places, 15300/15300 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12214 ms. Remains : 5603/5604 places, 15300/15300 transitions.
Support contains 33 out of 5603 places after structural reductions.
[2023-03-11 04:02:31] [INFO ] Flatten gal took : 540 ms
[2023-03-11 04:02:31] [INFO ] Flatten gal took : 354 ms
[2023-03-11 04:02:32] [INFO ] Input system was already deterministic with 15300 transitions.
Support contains 30 out of 5603 places (down from 33) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 595 ms. (steps per millisecond=16 ) properties (out of 18) seen :5
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 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 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 20 ms. (steps per millisecond=500 ) 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 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 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 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 17 ms. (steps per millisecond=588 ) 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 16 ms. (steps per millisecond=625 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-11 04:02:33] [INFO ] Invariant cache hit.
[2023-03-11 04:02:35] [INFO ] [Real]Absence check using 50 positive place invariants in 86 ms returned sat
[2023-03-11 04:02:35] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 95 ms returned sat
[2023-03-11 04:02:35] [INFO ] After 2151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-11 04:02:37] [INFO ] [Nat]Absence check using 50 positive place invariants in 94 ms returned sat
[2023-03-11 04:02:37] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 99 ms returned sat
[2023-03-11 04:02:56] [INFO ] After 17715ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-11 04:02:56] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2023-03-11 04:03:00] [INFO ] After 3794ms SMT Verify possible using 4950 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-03-11 04:03:00] [INFO ] After 3795ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-11 04:03:00] [INFO ] After 25069ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 13 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 917 ms.
Support contains 21 out of 5603 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 348 transitions
Trivial Post-agglo rules discarded 348 transitions
Performed 348 trivial Post agglomeration. Transition count delta: 348
Iterating post reduction 0 with 348 rules applied. Total rules applied 348 place count 5603 transition count 14952
Reduce places removed 348 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 349 rules applied. Total rules applied 697 place count 5255 transition count 14951
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 698 place count 5254 transition count 14951
Performed 2391 Post agglomeration using F-continuation condition.Transition count delta: 2391
Deduced a syphon composed of 2391 places in 4 ms
Reduce places removed 2391 places and 0 transitions.
Iterating global reduction 3 with 4782 rules applied. Total rules applied 5480 place count 2863 transition count 12560
Drop transitions removed 2294 transitions
Redundant transition composition rules discarded 2294 transitions
Iterating global reduction 3 with 2294 rules applied. Total rules applied 7774 place count 2863 transition count 10266
Partial Free-agglomeration rule applied 2687 times.
Drop transitions removed 2687 transitions
Iterating global reduction 3 with 2687 rules applied. Total rules applied 10461 place count 2863 transition count 10266
Applied a total of 10461 rules in 2839 ms. Remains 2863 /5603 variables (removed 2740) and now considering 10266/15300 (removed 5034) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2841 ms. Remains : 2863/5603 places, 10266/15300 transitions.
Incomplete random walk after 10000 steps, including 41 resets, run finished after 345 ms. (steps per millisecond=28 ) properties (out of 13) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 11) 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 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) 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 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 10266 rows 2863 cols
[2023-03-11 04:03:05] [INFO ] Computed 52 place invariants in 464 ms
[2023-03-11 04:03:06] [INFO ] [Real]Absence check using 51 positive place invariants in 15 ms returned sat
[2023-03-11 04:03:06] [INFO ] [Real]Absence check using 51 positive and 1 generalized place invariants in 26 ms returned sat
[2023-03-11 04:03:08] [INFO ] After 2459ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:8
[2023-03-11 04:03:08] [INFO ] State equation strengthened by 10026 read => feed constraints.
[2023-03-11 04:03:10] [INFO ] After 1620ms SMT Verify possible using 10026 Read/Feed constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-11 04:03:10] [INFO ] After 4961ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-11 04:03:11] [INFO ] [Nat]Absence check using 51 positive place invariants in 12 ms returned sat
[2023-03-11 04:03:11] [INFO ] [Nat]Absence check using 51 positive and 1 generalized place invariants in 18 ms returned sat
[2023-03-11 04:03:17] [INFO ] After 6026ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-11 04:03:24] [INFO ] After 7051ms SMT Verify possible using 10026 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-11 04:03:30] [INFO ] After 13459ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 4137 ms.
[2023-03-11 04:03:35] [INFO ] After 24650ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 1 properties in 290 ms.
Support contains 14 out of 2863 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2863/2863 places, 10266/10266 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2861 transition count 10264
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 9 place count 2861 transition count 10264
Applied a total of 9 rules in 1254 ms. Remains 2861 /2863 variables (removed 2) and now considering 10264/10266 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1254 ms. Remains : 2861/2863 places, 10264/10266 transitions.
Incomplete random walk after 10000 steps, including 41 resets, run finished after 426 ms. (steps per millisecond=23 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) 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 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 85188 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 85188 steps, saw 30372 distinct states, run finished after 3003 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 10264 rows 2861 cols
[2023-03-11 04:03:40] [INFO ] Computed 52 place invariants in 388 ms
[2023-03-11 04:03:41] [INFO ] [Real]Absence check using 51 positive place invariants in 21 ms returned sat
[2023-03-11 04:03:41] [INFO ] [Real]Absence check using 51 positive and 1 generalized place invariants in 32 ms returned sat
[2023-03-11 04:03:44] [INFO ] After 3257ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:7
[2023-03-11 04:03:44] [INFO ] State equation strengthened by 10035 read => feed constraints.
[2023-03-11 04:03:46] [INFO ] After 1480ms SMT Verify possible using 10035 Read/Feed constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-11 04:03:46] [INFO ] After 5644ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-11 04:03:46] [INFO ] [Nat]Absence check using 51 positive place invariants in 21 ms returned sat
[2023-03-11 04:03:46] [INFO ] [Nat]Absence check using 51 positive and 1 generalized place invariants in 12 ms returned sat
[2023-03-11 04:03:52] [INFO ] After 5425ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-11 04:03:57] [INFO ] After 5404ms SMT Verify possible using 10035 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-11 04:04:03] [INFO ] After 11256ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 3470 ms.
[2023-03-11 04:04:07] [INFO ] After 20962ms 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 198 ms.
Support contains 14 out of 2861 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2861/2861 places, 10264/10264 transitions.
Applied a total of 0 rules in 483 ms. Remains 2861 /2861 variables (removed 0) and now considering 10264/10264 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 483 ms. Remains : 2861/2861 places, 10264/10264 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2861/2861 places, 10264/10264 transitions.
Applied a total of 0 rules in 468 ms. Remains 2861 /2861 variables (removed 0) and now considering 10264/10264 (removed 0) transitions.
[2023-03-11 04:04:08] [INFO ] Invariant cache hit.
[2023-03-11 04:04:11] [INFO ] Implicit Places using invariants in 3281 ms returned []
Implicit Place search using SMT only with invariants took 3283 ms to find 0 implicit places.
[2023-03-11 04:04:11] [INFO ] Invariant cache hit.
[2023-03-11 04:04:15] [INFO ] Dead Transitions using invariants and state equation in 4251 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8008 ms. Remains : 2861/2861 places, 10264/10264 transitions.
Computed a total of 202 stabilizing places and 350 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 5603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5253 transition count 14950
Performed 2449 Post agglomeration using F-continuation condition.Transition count delta: 2449
Deduced a syphon composed of 2449 places in 3 ms
Reduce places removed 2449 places and 0 transitions.
Iterating global reduction 2 with 4898 rules applied. Total rules applied 5598 place count 2804 transition count 12501
Drop transitions removed 2351 transitions
Redundant transition composition rules discarded 2351 transitions
Iterating global reduction 2 with 2351 rules applied. Total rules applied 7949 place count 2804 transition count 10150
Applied a total of 7949 rules in 1879 ms. Remains 2804 /5603 variables (removed 2799) and now considering 10150/15300 (removed 5150) transitions.
// Phase 1: matrix 10150 rows 2804 cols
[2023-03-11 04:04:18] [INFO ] Computed 52 place invariants in 327 ms
[2023-03-11 04:04:20] [INFO ] Implicit Places using invariants in 1967 ms returned []
Implicit Place search using SMT only with invariants took 1968 ms to find 0 implicit places.
[2023-03-11 04:04:20] [INFO ] Invariant cache hit.
[2023-03-11 04:04:24] [INFO ] Dead Transitions using invariants and state equation in 4670 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2804/5603 places, 10150/15300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8520 ms. Remains : 2804/5603 places, 10150/15300 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LEQ 3 s2276) (LEQ 2 s2062))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 222 steps with 0 reset in 9 ms.
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLCardinality-01 finished in 8734 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||F(p1))))'
Support contains 3 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 488 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2023-03-11 04:04:26] [INFO ] Computed 52 place invariants in 1094 ms
[2023-03-11 04:04:27] [INFO ] Implicit Places using invariants in 2176 ms returned []
Implicit Place search using SMT only with invariants took 2178 ms to find 0 implicit places.
[2023-03-11 04:04:27] [INFO ] Invariant cache hit.
[2023-03-11 04:04:34] [INFO ] Dead Transitions using invariants and state equation in 6984 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9666 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s1064 s3496), p0:(LEQ 1 s4729)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 84 reset in 1446 ms.
Product exploration explored 100000 steps with 85 reset in 1309 ms.
Computed a total of 202 stabilizing places and 350 stable transitions
Computed a total of 202 stabilizing places and 350 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 198 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 337 steps, including 0 resets, run visited all 2 properties in 9 ms. (steps per millisecond=37 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 150 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 462 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
[2023-03-11 04:04:38] [INFO ] Invariant cache hit.
[2023-03-11 04:04:39] [INFO ] Implicit Places using invariants in 1017 ms returned []
Implicit Place search using SMT only with invariants took 1032 ms to find 0 implicit places.
[2023-03-11 04:04:39] [INFO ] Invariant cache hit.
[2023-03-11 04:04:47] [INFO ] Dead Transitions using invariants and state equation in 7414 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8911 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Computed a total of 202 stabilizing places and 350 stable transitions
Computed a total of 202 stabilizing places and 350 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 176 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 4311 steps, including 3 resets, run visited all 2 properties in 128 ms. (steps per millisecond=33 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 82 reset in 1037 ms.
Product exploration explored 100000 steps with 82 reset in 1482 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 5603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Performed 250 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 250 rules applied. Total rules applied 250 place count 5603 transition count 15300
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 50 Pre rules applied. Total rules applied 250 place count 5603 transition count 15300
Deduced a syphon composed of 300 places in 4 ms
Iterating global reduction 1 with 50 rules applied. Total rules applied 300 place count 5603 transition count 15300
Discarding 100 places :
Symmetric choice reduction at 1 with 100 rule applications. Total rules 400 place count 5503 transition count 15200
Deduced a syphon composed of 200 places in 3 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 500 place count 5503 transition count 15200
Performed 2498 Post agglomeration using F-continuation condition.Transition count delta: -4796
Deduced a syphon composed of 2698 places in 4 ms
Iterating global reduction 1 with 2498 rules applied. Total rules applied 2998 place count 5503 transition count 19996
Discarding 200 places :
Symmetric choice reduction at 1 with 200 rule applications. Total rules 3198 place count 5303 transition count 19796
Deduced a syphon composed of 2498 places in 2 ms
Iterating global reduction 1 with 200 rules applied. Total rules applied 3398 place count 5303 transition count 19796
Deduced a syphon composed of 2498 places in 3 ms
Drop transitions removed 2350 transitions
Redundant transition composition rules discarded 2350 transitions
Iterating global reduction 1 with 2350 rules applied. Total rules applied 5748 place count 5303 transition count 17446
Deduced a syphon composed of 2498 places in 3 ms
Applied a total of 5748 rules in 5207 ms. Remains 5303 /5603 variables (removed 300) and now considering 17446/15300 (removed -2146) transitions.
// Phase 1: matrix 17446 rows 5303 cols
[2023-03-11 04:04:57] [INFO ] Computed 52 place invariants in 1197 ms
[2023-03-11 04:05:05] [INFO ] Dead Transitions using invariants and state equation in 9698 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5303/5603 places, 17446/15300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14910 ms. Remains : 5303/5603 places, 17446/15300 transitions.
Support contains 3 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 535 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2023-03-11 04:05:07] [INFO ] Computed 52 place invariants in 1268 ms
[2023-03-11 04:05:08] [INFO ] Implicit Places using invariants in 2217 ms returned []
Implicit Place search using SMT only with invariants took 2231 ms to find 0 implicit places.
[2023-03-11 04:05:08] [INFO ] Invariant cache hit.
[2023-03-11 04:05:15] [INFO ] Dead Transitions using invariants and state equation in 7002 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9769 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Treatment of property CANInsertWithFailure-PT-050-LTLCardinality-03 finished in 51346 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 5603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5253 transition count 14950
Performed 2450 Post agglomeration using F-continuation condition.Transition count delta: 2450
Deduced a syphon composed of 2450 places in 3 ms
Reduce places removed 2450 places and 0 transitions.
Iterating global reduction 2 with 4900 rules applied. Total rules applied 5600 place count 2803 transition count 12500
Drop transitions removed 2352 transitions
Redundant transition composition rules discarded 2352 transitions
Iterating global reduction 2 with 2352 rules applied. Total rules applied 7952 place count 2803 transition count 10148
Applied a total of 7952 rules in 2097 ms. Remains 2803 /5603 variables (removed 2800) and now considering 10148/15300 (removed 5152) transitions.
// Phase 1: matrix 10148 rows 2803 cols
[2023-03-11 04:05:18] [INFO ] Computed 52 place invariants in 417 ms
[2023-03-11 04:05:20] [INFO ] Implicit Places using invariants in 2132 ms returned []
Implicit Place search using SMT only with invariants took 2134 ms to find 0 implicit places.
[2023-03-11 04:05:20] [INFO ] Invariant cache hit.
[2023-03-11 04:05:25] [INFO ] Dead Transitions using invariants and state equation in 4677 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2803/5603 places, 10148/15300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8926 ms. Remains : 2803/5603 places, 10148/15300 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s1984 s867)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 261 steps with 0 reset in 3 ms.
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLCardinality-04 finished in 9000 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) U G(p1)))'
Support contains 5 out of 5603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 347 transitions
Trivial Post-agglo rules discarded 347 transitions
Performed 347 trivial Post agglomeration. Transition count delta: 347
Iterating post reduction 0 with 347 rules applied. Total rules applied 347 place count 5603 transition count 14953
Reduce places removed 347 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 348 rules applied. Total rules applied 695 place count 5256 transition count 14952
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 696 place count 5255 transition count 14952
Performed 2447 Post agglomeration using F-continuation condition.Transition count delta: 2447
Deduced a syphon composed of 2447 places in 3 ms
Reduce places removed 2447 places and 0 transitions.
Iterating global reduction 3 with 4894 rules applied. Total rules applied 5590 place count 2808 transition count 12505
Drop transitions removed 2349 transitions
Redundant transition composition rules discarded 2349 transitions
Iterating global reduction 3 with 2349 rules applied. Total rules applied 7939 place count 2808 transition count 10156
Applied a total of 7939 rules in 2044 ms. Remains 2808 /5603 variables (removed 2795) and now considering 10156/15300 (removed 5144) transitions.
// Phase 1: matrix 10156 rows 2808 cols
[2023-03-11 04:05:27] [INFO ] Computed 52 place invariants in 253 ms
[2023-03-11 04:05:29] [INFO ] Implicit Places using invariants in 2426 ms returned []
Implicit Place search using SMT only with invariants took 2434 ms to find 0 implicit places.
[2023-03-11 04:05:29] [INFO ] Invariant cache hit.
[2023-03-11 04:05:34] [INFO ] Dead Transitions using invariants and state equation in 4681 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2808/5603 places, 10156/15300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9161 ms. Remains : 2808/5603 places, 10156/15300 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (LEQ 1 s1359) (LEQ s2505 s867)), p0:(LEQ s2515 s71)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 264 steps with 0 reset in 7 ms.
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLCardinality-07 finished in 9279 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 603 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2023-03-11 04:05:36] [INFO ] Computed 52 place invariants in 1084 ms
[2023-03-11 04:05:37] [INFO ] Implicit Places using invariants in 2017 ms returned []
Implicit Place search using SMT only with invariants took 2026 ms to find 0 implicit places.
[2023-03-11 04:05:37] [INFO ] Invariant cache hit.
[2023-03-11 04:05:44] [INFO ] Dead Transitions using invariants and state equation in 7250 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9879 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GT s366 s4437)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLCardinality-08 finished in 10033 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(!p0)) U (p1||G((p2||G(p3))))))'
Support contains 4 out of 5603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5253 transition count 14950
Performed 2450 Post agglomeration using F-continuation condition.Transition count delta: 2450
Deduced a syphon composed of 2450 places in 5 ms
Reduce places removed 2450 places and 0 transitions.
Iterating global reduction 2 with 4900 rules applied. Total rules applied 5600 place count 2803 transition count 12500
Drop transitions removed 2352 transitions
Redundant transition composition rules discarded 2352 transitions
Iterating global reduction 2 with 2352 rules applied. Total rules applied 7952 place count 2803 transition count 10148
Applied a total of 7952 rules in 1997 ms. Remains 2803 /5603 variables (removed 2800) and now considering 10148/15300 (removed 5152) transitions.
// Phase 1: matrix 10148 rows 2803 cols
[2023-03-11 04:05:46] [INFO ] Computed 52 place invariants in 381 ms
[2023-03-11 04:05:49] [INFO ] Implicit Places using invariants in 2573 ms returned []
Implicit Place search using SMT only with invariants took 2575 ms to find 0 implicit places.
[2023-03-11 04:05:49] [INFO ] Invariant cache hit.
[2023-03-11 04:05:53] [INFO ] Dead Transitions using invariants and state equation in 4675 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2803/5603 places, 10148/15300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9248 ms. Remains : 2803/5603 places, 10148/15300 transitions.
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), p0, p0, (AND p0 (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND p0 (NOT p3) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p1) p2) (AND (NOT p1) p3)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p3) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={1} source=0 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 5}], [{ cond=p0, acceptance={0, 1} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p3) p0), acceptance={} source=3 dest: 1}, { cond=(NOT p3), acceptance={} source=3 dest: 2}, { cond=p3, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) p2 (NOT p3)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p3) p0), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={1} source=4 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3) p0), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={} source=5 dest: 3}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ 3 s752), p2:(LEQ 1 s390), p3:(LEQ s1032 s1038), p0:(OR (LEQ 3 s752) (LEQ s1032 s1038))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 7879 steps with 30 reset in 111 ms.
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLCardinality-09 finished in 9646 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (p1||G(p0))))))'
Support contains 3 out of 5603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 348 transitions
Trivial Post-agglo rules discarded 348 transitions
Performed 348 trivial Post agglomeration. Transition count delta: 348
Iterating post reduction 0 with 348 rules applied. Total rules applied 348 place count 5603 transition count 14952
Reduce places removed 348 places and 0 transitions.
Iterating post reduction 1 with 348 rules applied. Total rules applied 696 place count 5255 transition count 14952
Performed 2450 Post agglomeration using F-continuation condition.Transition count delta: 2450
Deduced a syphon composed of 2450 places in 4 ms
Reduce places removed 2450 places and 0 transitions.
Iterating global reduction 2 with 4900 rules applied. Total rules applied 5596 place count 2805 transition count 12502
Drop transitions removed 2352 transitions
Redundant transition composition rules discarded 2352 transitions
Iterating global reduction 2 with 2352 rules applied. Total rules applied 7948 place count 2805 transition count 10150
Applied a total of 7948 rules in 2017 ms. Remains 2805 /5603 variables (removed 2798) and now considering 10150/15300 (removed 5150) transitions.
// Phase 1: matrix 10150 rows 2805 cols
[2023-03-11 04:05:56] [INFO ] Computed 52 place invariants in 391 ms
[2023-03-11 04:05:58] [INFO ] Implicit Places using invariants in 2355 ms returned []
Implicit Place search using SMT only with invariants took 2369 ms to find 0 implicit places.
[2023-03-11 04:05:58] [INFO ] Invariant cache hit.
[2023-03-11 04:06:03] [INFO ] Dead Transitions using invariants and state equation in 4531 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2805/5603 places, 10150/15300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8920 ms. Remains : 2805/5603 places, 10150/15300 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GT 3 s1662) (GT s2368 s119)), p0:(GT s2368 s119)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 284 steps with 0 reset in 4 ms.
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLCardinality-10 finished in 9047 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(((p1&&X((p1 U (p2||G(p1)))))||p0)))))'
Support contains 4 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 513 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2023-03-11 04:06:04] [INFO ] Computed 52 place invariants in 1085 ms
[2023-03-11 04:06:05] [INFO ] Implicit Places using invariants in 2195 ms returned []
Implicit Place search using SMT only with invariants took 2210 ms to find 0 implicit places.
[2023-03-11 04:06:06] [INFO ] Invariant cache hit.
[2023-03-11 04:06:13] [INFO ] Dead Transitions using invariants and state equation in 7533 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10258 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Stuttering acceptance computed with spot in 145 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={} source=2 dest: 0}, { cond=(AND p0 p2), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(OR (GT s336 s4662) (GT 2 s1128)), p1:(GT 3 s3110), p2:(GT 2 s1128)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 80 reset in 1064 ms.
Product exploration explored 100000 steps with 81 reset in 1684 ms.
Computed a total of 202 stabilizing places and 350 stable transitions
Computed a total of 202 stabilizing places and 350 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 242 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 8 resets, run finished after 354 ms. (steps per millisecond=28 ) properties (out of 6) 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 6) 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 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) 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 6) seen :0
Interrupted probabilistic random walk after 67376 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 67376 steps, saw 59144 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-11 04:06:20] [INFO ] Invariant cache hit.
[2023-03-11 04:06:21] [INFO ] [Real]Absence check using 50 positive place invariants in 42 ms returned sat
[2023-03-11 04:06:21] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 61 ms returned sat
[2023-03-11 04:06:29] [INFO ] After 9114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 04:06:30] [INFO ] [Nat]Absence check using 50 positive place invariants in 50 ms returned sat
[2023-03-11 04:06:30] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 82 ms returned sat
[2023-03-11 04:06:43] [INFO ] After 11975ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 04:06:43] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2023-03-11 04:06:54] [INFO ] After 11359ms SMT Verify possible using 4950 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 04:06:54] [INFO ] After 11360ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-11 04:06:54] [INFO ] After 25146ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 252 ms.
Support contains 4 out of 5603 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5253 transition count 14950
Performed 2398 Post agglomeration using F-continuation condition.Transition count delta: 2398
Deduced a syphon composed of 2398 places in 6 ms
Reduce places removed 2398 places and 0 transitions.
Iterating global reduction 2 with 4796 rules applied. Total rules applied 5496 place count 2855 transition count 12552
Drop transitions removed 2301 transitions
Redundant transition composition rules discarded 2301 transitions
Iterating global reduction 2 with 2301 rules applied. Total rules applied 7797 place count 2855 transition count 10251
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7798 place count 2855 transition count 10250
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7799 place count 2854 transition count 10250
Partial Free-agglomeration rule applied 2649 times.
Drop transitions removed 2649 transitions
Iterating global reduction 3 with 2649 rules applied. Total rules applied 10448 place count 2854 transition count 10250
Applied a total of 10448 rules in 3277 ms. Remains 2854 /5603 variables (removed 2749) and now considering 10250/15300 (removed 5050) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3277 ms. Remains : 2854/5603 places, 10250/15300 transitions.
Incomplete random walk after 10000 steps, including 42 resets, run finished after 449 ms. (steps per millisecond=22 ) properties (out of 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) 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 6) seen :0
Interrupted probabilistic random walk after 80435 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 80435 steps, saw 29785 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 10250 rows 2854 cols
[2023-03-11 04:07:02] [INFO ] Computed 52 place invariants in 351 ms
[2023-03-11 04:07:02] [INFO ] [Real]Absence check using 50 positive place invariants in 32 ms returned sat
[2023-03-11 04:07:02] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 41 ms returned sat
[2023-03-11 04:07:05] [INFO ] After 3751ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 04:07:06] [INFO ] [Nat]Absence check using 50 positive place invariants in 26 ms returned sat
[2023-03-11 04:07:06] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 35 ms returned sat
[2023-03-11 04:07:10] [INFO ] After 4194ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 04:07:11] [INFO ] State equation strengthened by 10043 read => feed constraints.
[2023-03-11 04:07:15] [INFO ] After 4676ms SMT Verify possible using 10043 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-11 04:07:19] [INFO ] After 8015ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2472 ms.
[2023-03-11 04:07:21] [INFO ] After 15642ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 62 ms.
Support contains 4 out of 2854 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2854/2854 places, 10250/10250 transitions.
Applied a total of 0 rules in 510 ms. Remains 2854 /2854 variables (removed 0) and now considering 10250/10250 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 511 ms. Remains : 2854/2854 places, 10250/10250 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2854/2854 places, 10250/10250 transitions.
Applied a total of 0 rules in 410 ms. Remains 2854 /2854 variables (removed 0) and now considering 10250/10250 (removed 0) transitions.
[2023-03-11 04:07:22] [INFO ] Invariant cache hit.
[2023-03-11 04:07:26] [INFO ] Implicit Places using invariants in 3897 ms returned []
Implicit Place search using SMT only with invariants took 3918 ms to find 0 implicit places.
[2023-03-11 04:07:26] [INFO ] Invariant cache hit.
[2023-03-11 04:07:30] [INFO ] Dead Transitions using invariants and state equation in 4170 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8500 ms. Remains : 2854/2854 places, 10250/10250 transitions.
Graph (trivial) has 9890 edges and 2854 vertex of which 2648 / 2854 are part of one of the 2 SCC in 5 ms
Free SCC test removed 2646 places
Drop transitions removed 7493 transitions
Ensure Unique test removed 2541 transitions
Reduce isomorphic transitions removed 10034 transitions.
Graph (complete) has 517 edges and 208 vertex of which 59 are kept as prefixes of interest. Removing 149 places using SCC suffix rule.1 ms
Discarding 149 places :
Also discarding 48 output transitions
Drop transitions removed 48 transitions
Drop transitions removed 100 transitions
Reduce isomorphic transitions removed 100 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 101 rules applied. Total rules applied 103 place count 59 transition count 67
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 105 place count 58 transition count 66
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 152 place count 11 transition count 19
Iterating global reduction 2 with 47 rules applied. Total rules applied 199 place count 11 transition count 19
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 201 place count 11 transition count 17
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 202 place count 11 transition count 16
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 204 place count 10 transition count 15
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 206 place count 8 transition count 13
Applied a total of 206 rules in 38 ms. Remains 8 /2854 variables (removed 2846) and now considering 13/10250 (removed 10237) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 13 rows 8 cols
[2023-03-11 04:07:30] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 04:07:30] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 04:07:30] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 04:07:30] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-11 04:07:30] [INFO ] After 143ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND p0 p1 p2), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 148 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 192 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 636 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2023-03-11 04:07:32] [INFO ] Computed 52 place invariants in 819 ms
[2023-03-11 04:07:34] [INFO ] Implicit Places using invariants in 1973 ms returned []
Implicit Place search using SMT only with invariants took 1975 ms to find 0 implicit places.
[2023-03-11 04:07:34] [INFO ] Invariant cache hit.
[2023-03-11 04:07:41] [INFO ] Dead Transitions using invariants and state equation in 7213 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9839 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Computed a total of 202 stabilizing places and 350 stable transitions
Computed a total of 202 stabilizing places and 350 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 152 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 8 resets, run finished after 519 ms. (steps per millisecond=19 ) properties (out of 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) 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 6) seen :0
Interrupted probabilistic random walk after 73731 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 73731 steps, saw 61155 distinct states, run finished after 3002 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-11 04:07:45] [INFO ] Invariant cache hit.
[2023-03-11 04:07:46] [INFO ] [Real]Absence check using 50 positive place invariants in 43 ms returned sat
[2023-03-11 04:07:46] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 61 ms returned sat
[2023-03-11 04:07:54] [INFO ] After 9042ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 04:07:55] [INFO ] [Nat]Absence check using 50 positive place invariants in 83 ms returned sat
[2023-03-11 04:07:55] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 94 ms returned sat
[2023-03-11 04:08:07] [INFO ] After 11203ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 04:08:07] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2023-03-11 04:08:19] [INFO ] After 11999ms SMT Verify possible using 4950 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 04:08:19] [INFO ] After 12000ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-11 04:08:19] [INFO ] After 25085ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 116 ms.
Support contains 4 out of 5603 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5253 transition count 14950
Performed 2398 Post agglomeration using F-continuation condition.Transition count delta: 2398
Deduced a syphon composed of 2398 places in 4 ms
Reduce places removed 2398 places and 0 transitions.
Iterating global reduction 2 with 4796 rules applied. Total rules applied 5496 place count 2855 transition count 12552
Drop transitions removed 2301 transitions
Redundant transition composition rules discarded 2301 transitions
Iterating global reduction 2 with 2301 rules applied. Total rules applied 7797 place count 2855 transition count 10251
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7798 place count 2855 transition count 10250
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7799 place count 2854 transition count 10250
Partial Free-agglomeration rule applied 2649 times.
Drop transitions removed 2649 transitions
Iterating global reduction 3 with 2649 rules applied. Total rules applied 10448 place count 2854 transition count 10250
Applied a total of 10448 rules in 3424 ms. Remains 2854 /5603 variables (removed 2749) and now considering 10250/15300 (removed 5050) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3424 ms. Remains : 2854/5603 places, 10250/15300 transitions.
Incomplete random walk after 10000 steps, including 42 resets, run finished after 495 ms. (steps per millisecond=20 ) properties (out of 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 86889 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 86889 steps, saw 30610 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 10250 rows 2854 cols
[2023-03-11 04:08:26] [INFO ] Computed 52 place invariants in 350 ms
[2023-03-11 04:08:27] [INFO ] [Real]Absence check using 50 positive place invariants in 23 ms returned sat
[2023-03-11 04:08:27] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 26 ms returned sat
[2023-03-11 04:08:30] [INFO ] After 3518ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 04:08:31] [INFO ] [Nat]Absence check using 50 positive place invariants in 26 ms returned sat
[2023-03-11 04:08:31] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 55 ms returned sat
[2023-03-11 04:08:35] [INFO ] After 4391ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 04:08:35] [INFO ] State equation strengthened by 10043 read => feed constraints.
[2023-03-11 04:08:40] [INFO ] After 4307ms SMT Verify possible using 10043 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-11 04:08:43] [INFO ] After 7750ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2612 ms.
[2023-03-11 04:08:46] [INFO ] After 15791ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 49 ms.
Support contains 4 out of 2854 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2854/2854 places, 10250/10250 transitions.
Applied a total of 0 rules in 497 ms. Remains 2854 /2854 variables (removed 0) and now considering 10250/10250 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 497 ms. Remains : 2854/2854 places, 10250/10250 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2854/2854 places, 10250/10250 transitions.
Applied a total of 0 rules in 406 ms. Remains 2854 /2854 variables (removed 0) and now considering 10250/10250 (removed 0) transitions.
[2023-03-11 04:08:47] [INFO ] Invariant cache hit.
[2023-03-11 04:08:50] [INFO ] Implicit Places using invariants in 3577 ms returned []
Implicit Place search using SMT only with invariants took 3591 ms to find 0 implicit places.
[2023-03-11 04:08:50] [INFO ] Invariant cache hit.
[2023-03-11 04:08:55] [INFO ] Dead Transitions using invariants and state equation in 4402 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8401 ms. Remains : 2854/2854 places, 10250/10250 transitions.
Graph (trivial) has 9890 edges and 2854 vertex of which 2648 / 2854 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2646 places
Drop transitions removed 7493 transitions
Ensure Unique test removed 2541 transitions
Reduce isomorphic transitions removed 10034 transitions.
Graph (complete) has 517 edges and 208 vertex of which 59 are kept as prefixes of interest. Removing 149 places using SCC suffix rule.0 ms
Discarding 149 places :
Also discarding 48 output transitions
Drop transitions removed 48 transitions
Drop transitions removed 100 transitions
Reduce isomorphic transitions removed 100 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 101 rules applied. Total rules applied 103 place count 59 transition count 67
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 105 place count 58 transition count 66
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 152 place count 11 transition count 19
Iterating global reduction 2 with 47 rules applied. Total rules applied 199 place count 11 transition count 19
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 201 place count 11 transition count 17
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 202 place count 11 transition count 16
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 204 place count 10 transition count 15
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 206 place count 8 transition count 13
Applied a total of 206 rules in 19 ms. Remains 8 /2854 variables (removed 2846) and now considering 13/10250 (removed 10237) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 13 rows 8 cols
[2023-03-11 04:08:55] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 04:08:55] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 04:08:55] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 04:08:55] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-11 04:08:55] [INFO ] After 56ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND p0 p1 p2), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 124 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 119 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 118 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 80 reset in 980 ms.
Product exploration explored 100000 steps with 84 reset in 996 ms.
Applying partial POR strategy [true, true, true, false, false]
Stuttering acceptance computed with spot in 176 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 5603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Performed 250 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 250 rules applied. Total rules applied 250 place count 5603 transition count 15300
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 50 Pre rules applied. Total rules applied 250 place count 5603 transition count 15300
Deduced a syphon composed of 300 places in 3 ms
Iterating global reduction 1 with 50 rules applied. Total rules applied 300 place count 5603 transition count 15300
Discarding 100 places :
Symmetric choice reduction at 1 with 100 rule applications. Total rules 400 place count 5503 transition count 15200
Deduced a syphon composed of 200 places in 4 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 500 place count 5503 transition count 15200
Performed 2448 Post agglomeration using F-continuation condition.Transition count delta: -4696
Deduced a syphon composed of 2648 places in 4 ms
Iterating global reduction 1 with 2448 rules applied. Total rules applied 2948 place count 5503 transition count 19896
Discarding 200 places :
Symmetric choice reduction at 1 with 200 rule applications. Total rules 3148 place count 5303 transition count 19696
Deduced a syphon composed of 2448 places in 3 ms
Iterating global reduction 1 with 200 rules applied. Total rules applied 3348 place count 5303 transition count 19696
Deduced a syphon composed of 2448 places in 2 ms
Drop transitions removed 2301 transitions
Redundant transition composition rules discarded 2301 transitions
Iterating global reduction 1 with 2301 rules applied. Total rules applied 5649 place count 5303 transition count 17395
Deduced a syphon composed of 2448 places in 3 ms
Applied a total of 5649 rules in 4336 ms. Remains 5303 /5603 variables (removed 300) and now considering 17395/15300 (removed -2095) transitions.
// Phase 1: matrix 17395 rows 5303 cols
[2023-03-11 04:09:03] [INFO ] Computed 52 place invariants in 1241 ms
[2023-03-11 04:09:11] [INFO ] Dead Transitions using invariants and state equation in 8656 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5303/5603 places, 17395/15300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12994 ms. Remains : 5303/5603 places, 17395/15300 transitions.
Support contains 4 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 454 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2023-03-11 04:09:12] [INFO ] Computed 52 place invariants in 1104 ms
[2023-03-11 04:09:13] [INFO ] Implicit Places using invariants in 2062 ms returned []
Implicit Place search using SMT only with invariants took 2076 ms to find 0 implicit places.
[2023-03-11 04:09:13] [INFO ] Invariant cache hit.
[2023-03-11 04:09:20] [INFO ] Dead Transitions using invariants and state equation in 7096 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9627 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Treatment of property CANInsertWithFailure-PT-050-LTLCardinality-11 finished in 197808 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(G(p0)))))'
Support contains 4 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 456 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
[2023-03-11 04:09:21] [INFO ] Invariant cache hit.
[2023-03-11 04:09:22] [INFO ] Implicit Places using invariants in 985 ms returned []
Implicit Place search using SMT only with invariants took 986 ms to find 0 implicit places.
[2023-03-11 04:09:22] [INFO ] Invariant cache hit.
[2023-03-11 04:09:30] [INFO ] Dead Transitions using invariants and state equation in 7511 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8954 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (GT s5108 s3069) (GT s3115 s186))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLCardinality-12 finished in 9098 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 5603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5253 transition count 14950
Performed 2449 Post agglomeration using F-continuation condition.Transition count delta: 2449
Deduced a syphon composed of 2449 places in 4 ms
Reduce places removed 2449 places and 0 transitions.
Iterating global reduction 2 with 4898 rules applied. Total rules applied 5598 place count 2804 transition count 12501
Drop transitions removed 2351 transitions
Redundant transition composition rules discarded 2351 transitions
Iterating global reduction 2 with 2351 rules applied. Total rules applied 7949 place count 2804 transition count 10150
Applied a total of 7949 rules in 1808 ms. Remains 2804 /5603 variables (removed 2799) and now considering 10150/15300 (removed 5150) transitions.
// Phase 1: matrix 10150 rows 2804 cols
[2023-03-11 04:09:32] [INFO ] Computed 52 place invariants in 388 ms
[2023-03-11 04:09:33] [INFO ] Implicit Places using invariants in 2008 ms returned []
Implicit Place search using SMT only with invariants took 2008 ms to find 0 implicit places.
[2023-03-11 04:09:34] [INFO ] Invariant cache hit.
[2023-03-11 04:09:38] [INFO ] Dead Transitions using invariants and state equation in 4793 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2804/5603 places, 10150/15300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8610 ms. Remains : 2804/5603 places, 10150/15300 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 s768)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 255 steps with 0 reset in 4 ms.
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLCardinality-15 finished in 8709 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||F(p1))))'
Found a Lengthening insensitive property : CANInsertWithFailure-PT-050-LTLCardinality-03
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5253 transition count 14950
Performed 2448 Post agglomeration using F-continuation condition.Transition count delta: 2448
Deduced a syphon composed of 2448 places in 4 ms
Reduce places removed 2448 places and 0 transitions.
Iterating global reduction 2 with 4896 rules applied. Total rules applied 5596 place count 2805 transition count 12502
Drop transitions removed 2350 transitions
Redundant transition composition rules discarded 2350 transitions
Iterating global reduction 2 with 2350 rules applied. Total rules applied 7946 place count 2805 transition count 10152
Applied a total of 7946 rules in 1853 ms. Remains 2805 /5603 variables (removed 2798) and now considering 10152/15300 (removed 5148) transitions.
// Phase 1: matrix 10152 rows 2805 cols
[2023-03-11 04:09:41] [INFO ] Computed 52 place invariants in 374 ms
[2023-03-11 04:09:43] [INFO ] Implicit Places using invariants in 2649 ms returned []
Implicit Place search using SMT only with invariants took 2651 ms to find 0 implicit places.
[2023-03-11 04:09:43] [INFO ] Invariant cache hit.
[2023-03-11 04:09:48] [INFO ] Dead Transitions using invariants and state equation in 4594 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 2805/5603 places, 10152/15300 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 9100 ms. Remains : 2805/5603 places, 10152/15300 transitions.
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s487 s1729), p0:(LEQ 1 s2359)], 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][false, false, false]]
Product exploration explored 100000 steps with 397 reset in 1132 ms.
Product exploration explored 100000 steps with 394 reset in 1164 ms.
Computed a total of 153 stabilizing places and 250 stable transitions
Computed a total of 153 stabilizing places and 250 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 159 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 39 resets, run finished after 291 ms. (steps per millisecond=34 ) properties (out of 2) 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 2) 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 2) seen :0
Interrupted probabilistic random walk after 80005 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 80005 steps, saw 30798 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 04:09:54] [INFO ] Invariant cache hit.
[2023-03-11 04:09:54] [INFO ] After 463ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 04:09:55] [INFO ] [Nat]Absence check using 50 positive place invariants in 28 ms returned sat
[2023-03-11 04:09:55] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 36 ms returned sat
[2023-03-11 04:09:58] [INFO ] After 3219ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 04:09:58] [INFO ] State equation strengthened by 7446 read => feed constraints.
[2023-03-11 04:10:02] [INFO ] After 4390ms SMT Verify possible using 7446 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 04:10:03] [INFO ] After 5417ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 730 ms.
[2023-03-11 04:10:04] [INFO ] After 10009ms 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 2805 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2805/2805 places, 10152/10152 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2805 transition count 10151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2804 transition count 10151
Partial Free-agglomeration rule applied 2550 times.
Drop transitions removed 2550 transitions
Iterating global reduction 1 with 2550 rules applied. Total rules applied 2552 place count 2804 transition count 10151
Applied a total of 2552 rules in 1179 ms. Remains 2804 /2805 variables (removed 1) and now considering 10151/10152 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1179 ms. Remains : 2804/2805 places, 10151/10152 transitions.
Finished random walk after 2466 steps, including 10 resets, run visited all 2 properties in 51 ms. (steps per millisecond=48 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 197 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 2805 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2805/2805 places, 10152/10152 transitions.
Applied a total of 0 rules in 297 ms. Remains 2805 /2805 variables (removed 0) and now considering 10152/10152 (removed 0) transitions.
[2023-03-11 04:10:06] [INFO ] Invariant cache hit.
[2023-03-11 04:10:08] [INFO ] Implicit Places using invariants in 2194 ms returned []
Implicit Place search using SMT only with invariants took 2195 ms to find 0 implicit places.
[2023-03-11 04:10:08] [INFO ] Invariant cache hit.
[2023-03-11 04:10:13] [INFO ] Dead Transitions using invariants and state equation in 4357 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6863 ms. Remains : 2805/2805 places, 10152/10152 transitions.
Computed a total of 153 stabilizing places and 250 stable transitions
Computed a total of 153 stabilizing places and 250 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 39 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 2) 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 2) 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 2) seen :0
Interrupted probabilistic random walk after 82652 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 82652 steps, saw 31080 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 04:10:16] [INFO ] Invariant cache hit.
[2023-03-11 04:10:17] [INFO ] After 332ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 04:10:17] [INFO ] [Nat]Absence check using 50 positive place invariants in 26 ms returned sat
[2023-03-11 04:10:17] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 35 ms returned sat
[2023-03-11 04:10:20] [INFO ] After 2738ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 04:10:20] [INFO ] State equation strengthened by 7446 read => feed constraints.
[2023-03-11 04:10:24] [INFO ] After 3908ms SMT Verify possible using 7446 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 04:10:25] [INFO ] After 4910ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 686 ms.
[2023-03-11 04:10:25] [INFO ] After 8834ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 ms.
Support contains 3 out of 2805 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2805/2805 places, 10152/10152 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2805 transition count 10151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2804 transition count 10151
Partial Free-agglomeration rule applied 2550 times.
Drop transitions removed 2550 transitions
Iterating global reduction 1 with 2550 rules applied. Total rules applied 2552 place count 2804 transition count 10151
Applied a total of 2552 rules in 1378 ms. Remains 2804 /2805 variables (removed 1) and now considering 10151/10152 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1378 ms. Remains : 2804/2805 places, 10151/10152 transitions.
Incomplete random walk after 10000 steps, including 44 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 79384 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 79384 steps, saw 28460 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 10151 rows 2804 cols
[2023-03-11 04:10:30] [INFO ] Computed 52 place invariants in 431 ms
[2023-03-11 04:10:31] [INFO ] After 447ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 04:10:31] [INFO ] [Nat]Absence check using 50 positive place invariants in 26 ms returned sat
[2023-03-11 04:10:31] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 30 ms returned sat
[2023-03-11 04:10:35] [INFO ] After 4004ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 04:10:36] [INFO ] State equation strengthened by 9995 read => feed constraints.
[2023-03-11 04:10:38] [INFO ] After 2482ms SMT Verify possible using 9995 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 04:10:39] [INFO ] After 3590ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 720 ms.
[2023-03-11 04:10:40] [INFO ] After 8939ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 26 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=8 )
Parikh walk visited 2 properties in 3 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 190 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 397 reset in 1391 ms.
Stack based approach found an accepted trace after 58355 steps with 233 reset with depth 159 and stack size 159 in 923 ms.
Treatment of property CANInsertWithFailure-PT-050-LTLCardinality-03 finished in 64457 ms.
FORMULA CANInsertWithFailure-PT-050-LTLCardinality-03 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(((p1&&X((p1 U (p2||G(p1)))))||p0)))))'
Found a Lengthening insensitive property : CANInsertWithFailure-PT-050-LTLCardinality-11
Stuttering acceptance computed with spot in 147 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5253 transition count 14950
Performed 2398 Post agglomeration using F-continuation condition.Transition count delta: 2398
Deduced a syphon composed of 2398 places in 4 ms
Reduce places removed 2398 places and 0 transitions.
Iterating global reduction 2 with 4796 rules applied. Total rules applied 5496 place count 2855 transition count 12552
Drop transitions removed 2301 transitions
Redundant transition composition rules discarded 2301 transitions
Iterating global reduction 2 with 2301 rules applied. Total rules applied 7797 place count 2855 transition count 10251
Partial Post-agglomeration rule applied 98 times.
Drop transitions removed 98 transitions
Iterating global reduction 2 with 98 rules applied. Total rules applied 7895 place count 2855 transition count 10251
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 7943 place count 2807 transition count 10203
Iterating global reduction 2 with 48 rules applied. Total rules applied 7991 place count 2807 transition count 10203
Drop transitions removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 2 with 48 rules applied. Total rules applied 8039 place count 2807 transition count 10155
Applied a total of 8039 rules in 2759 ms. Remains 2807 /5603 variables (removed 2796) and now considering 10155/15300 (removed 5145) transitions.
// Phase 1: matrix 10155 rows 2807 cols
[2023-03-11 04:10:46] [INFO ] Computed 52 place invariants in 379 ms
[2023-03-11 04:10:48] [INFO ] Implicit Places using invariants in 2419 ms returned []
Implicit Place search using SMT only with invariants took 2435 ms to find 0 implicit places.
[2023-03-11 04:10:48] [INFO ] Invariant cache hit.
[2023-03-11 04:10:53] [INFO ] Dead Transitions using invariants and state equation in 4396 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 2807/5603 places, 10155/15300 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 9592 ms. Remains : 2807/5603 places, 10155/15300 transitions.
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={} source=2 dest: 0}, { cond=(AND p0 p2), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(OR (GT s145 s2326) (GT 2 s521)), p1:(GT 3 s1533), p2:(GT 2 s521)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 393 reset in 1366 ms.
Product exploration explored 100000 steps with 391 reset in 1206 ms.
Computed a total of 153 stabilizing places and 250 stable transitions
Computed a total of 153 stabilizing places and 250 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 232 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 40 resets, run finished after 440 ms. (steps per millisecond=22 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 78609 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 78609 steps, saw 30512 distinct states, run finished after 3005 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-11 04:10:59] [INFO ] Invariant cache hit.
[2023-03-11 04:11:00] [INFO ] [Real]Absence check using 50 positive place invariants in 18 ms returned sat
[2023-03-11 04:11:00] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 24 ms returned sat
[2023-03-11 04:11:02] [INFO ] After 2965ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 04:11:03] [INFO ] [Nat]Absence check using 50 positive place invariants in 23 ms returned sat
[2023-03-11 04:11:03] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 25 ms returned sat
[2023-03-11 04:11:07] [INFO ] After 3803ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 04:11:07] [INFO ] State equation strengthened by 7445 read => feed constraints.
[2023-03-11 04:11:12] [INFO ] After 4700ms SMT Verify possible using 7445 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-11 04:11:15] [INFO ] After 7646ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1795 ms.
[2023-03-11 04:11:16] [INFO ] After 14021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 2807 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2807/2807 places, 10155/10155 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2807 transition count 10154
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2806 transition count 10154
Partial Free-agglomeration rule applied 2551 times.
Drop transitions removed 2551 transitions
Iterating global reduction 1 with 2551 rules applied. Total rules applied 2553 place count 2806 transition count 10154
Applied a total of 2553 rules in 1387 ms. Remains 2806 /2807 variables (removed 1) and now considering 10154/10155 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1388 ms. Remains : 2806/2807 places, 10154/10155 transitions.
Incomplete random walk after 10000 steps, including 43 resets, run finished after 646 ms. (steps per millisecond=15 ) properties (out of 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 73400 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 73400 steps, saw 27684 distinct states, run finished after 3001 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 10154 rows 2806 cols
[2023-03-11 04:11:22] [INFO ] Computed 52 place invariants in 263 ms
[2023-03-11 04:11:22] [INFO ] [Real]Absence check using 50 positive place invariants in 26 ms returned sat
[2023-03-11 04:11:22] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 32 ms returned sat
[2023-03-11 04:11:25] [INFO ] After 3678ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 04:11:26] [INFO ] [Nat]Absence check using 50 positive place invariants in 26 ms returned sat
[2023-03-11 04:11:26] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 35 ms returned sat
[2023-03-11 04:11:31] [INFO ] After 4377ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 04:11:31] [INFO ] State equation strengthened by 9995 read => feed constraints.
[2023-03-11 04:11:34] [INFO ] After 3475ms SMT Verify possible using 9995 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-11 04:11:37] [INFO ] After 6558ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2225 ms.
[2023-03-11 04:11:39] [INFO ] After 14023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 29 ms.
Support contains 4 out of 2806 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2806/2806 places, 10154/10154 transitions.
Applied a total of 0 rules in 622 ms. Remains 2806 /2806 variables (removed 0) and now considering 10154/10154 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 623 ms. Remains : 2806/2806 places, 10154/10154 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2806/2806 places, 10154/10154 transitions.
Applied a total of 0 rules in 554 ms. Remains 2806 /2806 variables (removed 0) and now considering 10154/10154 (removed 0) transitions.
[2023-03-11 04:11:41] [INFO ] Invariant cache hit.
[2023-03-11 04:11:44] [INFO ] Implicit Places using invariants in 3141 ms returned []
Implicit Place search using SMT only with invariants took 3155 ms to find 0 implicit places.
[2023-03-11 04:11:44] [INFO ] Invariant cache hit.
[2023-03-11 04:11:48] [INFO ] Dead Transitions using invariants and state equation in 4443 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8154 ms. Remains : 2806/2806 places, 10154/10154 transitions.
Graph (trivial) has 9842 edges and 2806 vertex of which 2599 / 2806 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2597 places
Drop transitions removed 7396 transitions
Ensure Unique test removed 2542 transitions
Reduce isomorphic transitions removed 9938 transitions.
Graph (complete) has 518 edges and 209 vertex of which 60 are kept as prefixes of interest. Removing 149 places using SCC suffix rule.0 ms
Discarding 149 places :
Also discarding 48 output transitions
Drop transitions removed 48 transitions
Drop transitions removed 100 transitions
Reduce isomorphic transitions removed 100 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 101 rules applied. Total rules applied 103 place count 60 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 104 place count 59 transition count 67
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 151 place count 12 transition count 20
Iterating global reduction 2 with 47 rules applied. Total rules applied 198 place count 12 transition count 20
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 200 place count 12 transition count 18
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 201 place count 12 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 202 place count 11 transition count 17
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 203 place count 11 transition count 16
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 205 place count 10 transition count 15
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 207 place count 8 transition count 13
Applied a total of 207 rules in 20 ms. Remains 8 /2806 variables (removed 2798) and now considering 13/10154 (removed 10141) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 13 rows 8 cols
[2023-03-11 04:11:48] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 04:11:48] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 04:11:48] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 04:11:48] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-11 04:11:48] [INFO ] After 49ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND p0 p1 p2), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 123 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 117 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 2807 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2807/2807 places, 10155/10155 transitions.
Applied a total of 0 rules in 322 ms. Remains 2807 /2807 variables (removed 0) and now considering 10155/10155 (removed 0) transitions.
// Phase 1: matrix 10155 rows 2807 cols
[2023-03-11 04:11:49] [INFO ] Computed 52 place invariants in 373 ms
[2023-03-11 04:11:51] [INFO ] Implicit Places using invariants in 2296 ms returned []
Implicit Place search using SMT only with invariants took 2297 ms to find 0 implicit places.
[2023-03-11 04:11:51] [INFO ] Invariant cache hit.
[2023-03-11 04:11:56] [INFO ] Dead Transitions using invariants and state equation in 4374 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6994 ms. Remains : 2807/2807 places, 10155/10155 transitions.
Computed a total of 153 stabilizing places and 250 stable transitions
Computed a total of 153 stabilizing places and 250 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 100 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 38 resets, run finished after 416 ms. (steps per millisecond=24 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 87286 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 87286 steps, saw 31569 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-11 04:12:00] [INFO ] Invariant cache hit.
[2023-03-11 04:12:00] [INFO ] [Real]Absence check using 50 positive place invariants in 19 ms returned sat
[2023-03-11 04:12:00] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 25 ms returned sat
[2023-03-11 04:12:03] [INFO ] After 2981ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 04:12:03] [INFO ] [Nat]Absence check using 50 positive place invariants in 29 ms returned sat
[2023-03-11 04:12:03] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 48 ms returned sat
[2023-03-11 04:12:07] [INFO ] After 3835ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 04:12:07] [INFO ] State equation strengthened by 7445 read => feed constraints.
[2023-03-11 04:12:12] [INFO ] After 4495ms SMT Verify possible using 7445 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-11 04:12:15] [INFO ] After 7440ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1802 ms.
[2023-03-11 04:12:17] [INFO ] After 14083ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 2807 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2807/2807 places, 10155/10155 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2807 transition count 10154
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2806 transition count 10154
Partial Free-agglomeration rule applied 2551 times.
Drop transitions removed 2551 transitions
Iterating global reduction 1 with 2551 rules applied. Total rules applied 2553 place count 2806 transition count 10154
Applied a total of 2553 rules in 1679 ms. Remains 2806 /2807 variables (removed 1) and now considering 10154/10155 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1679 ms. Remains : 2806/2807 places, 10154/10155 transitions.
Incomplete random walk after 10000 steps, including 42 resets, run finished after 456 ms. (steps per millisecond=21 ) properties (out of 6) 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 6) 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 6) 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 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 76912 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 76912 steps, saw 28085 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 10154 rows 2806 cols
[2023-03-11 04:12:22] [INFO ] Computed 52 place invariants in 263 ms
[2023-03-11 04:12:23] [INFO ] [Real]Absence check using 50 positive place invariants in 20 ms returned sat
[2023-03-11 04:12:23] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 26 ms returned sat
[2023-03-11 04:12:26] [INFO ] After 3694ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 04:12:26] [INFO ] [Nat]Absence check using 50 positive place invariants in 20 ms returned sat
[2023-03-11 04:12:26] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 24 ms returned sat
[2023-03-11 04:12:31] [INFO ] After 4351ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 04:12:31] [INFO ] State equation strengthened by 9995 read => feed constraints.
[2023-03-11 04:12:35] [INFO ] After 3859ms SMT Verify possible using 9995 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-11 04:12:38] [INFO ] After 7081ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2308 ms.
[2023-03-11 04:12:40] [INFO ] After 14484ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 52 ms.
Support contains 4 out of 2806 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2806/2806 places, 10154/10154 transitions.
Applied a total of 0 rules in 628 ms. Remains 2806 /2806 variables (removed 0) and now considering 10154/10154 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 629 ms. Remains : 2806/2806 places, 10154/10154 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2806/2806 places, 10154/10154 transitions.
Applied a total of 0 rules in 517 ms. Remains 2806 /2806 variables (removed 0) and now considering 10154/10154 (removed 0) transitions.
[2023-03-11 04:12:42] [INFO ] Invariant cache hit.
[2023-03-11 04:12:45] [INFO ] Implicit Places using invariants in 3519 ms returned []
Implicit Place search using SMT only with invariants took 3528 ms to find 0 implicit places.
[2023-03-11 04:12:45] [INFO ] Invariant cache hit.
[2023-03-11 04:12:49] [INFO ] Dead Transitions using invariants and state equation in 4286 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8336 ms. Remains : 2806/2806 places, 10154/10154 transitions.
Graph (trivial) has 9842 edges and 2806 vertex of which 2599 / 2806 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2597 places
Drop transitions removed 7396 transitions
Ensure Unique test removed 2542 transitions
Reduce isomorphic transitions removed 9938 transitions.
Graph (complete) has 518 edges and 209 vertex of which 60 are kept as prefixes of interest. Removing 149 places using SCC suffix rule.0 ms
Discarding 149 places :
Also discarding 48 output transitions
Drop transitions removed 48 transitions
Drop transitions removed 100 transitions
Reduce isomorphic transitions removed 100 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 101 rules applied. Total rules applied 103 place count 60 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 104 place count 59 transition count 67
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 151 place count 12 transition count 20
Iterating global reduction 2 with 47 rules applied. Total rules applied 198 place count 12 transition count 20
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 200 place count 12 transition count 18
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 201 place count 12 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 202 place count 11 transition count 17
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 203 place count 11 transition count 16
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 205 place count 10 transition count 15
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 207 place count 8 transition count 13
Applied a total of 207 rules in 27 ms. Remains 8 /2806 variables (removed 2798) and now considering 13/10154 (removed 10141) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 13 rows 8 cols
[2023-03-11 04:12:49] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 04:12:49] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 04:12:49] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 04:12:49] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-11 04:12:50] [INFO ] After 63ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND p0 p1 p2), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 148 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 105 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 117 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 393 reset in 1198 ms.
Product exploration explored 100000 steps with 396 reset in 1206 ms.
Applying partial POR strategy [true, true, true, false, false]
Stuttering acceptance computed with spot in 189 ms :[true, (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 2807 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2807/2807 places, 10155/10155 transitions.
Applied a total of 0 rules in 436 ms. Remains 2807 /2807 variables (removed 0) and now considering 10155/10155 (removed 0) transitions.
// Phase 1: matrix 10155 rows 2807 cols
[2023-03-11 04:12:54] [INFO ] Computed 52 place invariants in 358 ms
[2023-03-11 04:12:58] [INFO ] Dead Transitions using invariants and state equation in 5004 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5443 ms. Remains : 2807/2807 places, 10155/10155 transitions.
Support contains 4 out of 2807 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2807/2807 places, 10155/10155 transitions.
Applied a total of 0 rules in 294 ms. Remains 2807 /2807 variables (removed 0) and now considering 10155/10155 (removed 0) transitions.
[2023-03-11 04:12:58] [INFO ] Invariant cache hit.
[2023-03-11 04:13:00] [INFO ] Implicit Places using invariants in 1839 ms returned []
Implicit Place search using SMT only with invariants took 1852 ms to find 0 implicit places.
[2023-03-11 04:13:00] [INFO ] Invariant cache hit.
[2023-03-11 04:13:05] [INFO ] Dead Transitions using invariants and state equation in 4633 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6782 ms. Remains : 2807/2807 places, 10155/10155 transitions.
Treatment of property CANInsertWithFailure-PT-050-LTLCardinality-11 finished in 142368 ms.
[2023-03-11 04:13:05] [INFO ] Flatten gal took : 247 ms
[2023-03-11 04:13:05] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-11 04:13:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5603 places, 15300 transitions and 40900 arcs took 49 ms.
Total runtime 649257 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT CANInsertWithFailure-PT-050
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLCardinality

BK_STOP 1678508069651

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-050-LTLCardinality-03: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-050-LTLCardinality-11: LTL 0 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-050-LTLCardinality-03: LTL 0 0 0 0 1 0 0 0
CANInsertWithFailure-PT-050-LTLCardinality-11: LTL 0 0 0 0 1 0 0 0

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

Time elapsed: 13 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 2
lola: LAUNCH task # 4 (type EXCL) for 3 CANInsertWithFailure-PT-050-LTLCardinality-11
lola: time limit : 1793 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-050-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-050-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1793 6/32 CANInsertWithFailure-PT-050-LTLCardinality-11 87005 m, 17401 m/sec, 170073 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-050-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-050-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1793 11/32 CANInsertWithFailure-PT-050-LTLCardinality-11 172593 m, 17117 m/sec, 350064 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-050-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-050-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/1793 16/32 CANInsertWithFailure-PT-050-LTLCardinality-11 247920 m, 15065 m/sec, 513983 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-050-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-050-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/1793 20/32 CANInsertWithFailure-PT-050-LTLCardinality-11 324627 m, 15341 m/sec, 676350 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-050-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-050-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/1793 25/32 CANInsertWithFailure-PT-050-LTLCardinality-11 407060 m, 16486 m/sec, 850305 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-050-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-050-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/1793 30/32 CANInsertWithFailure-PT-050-LTLCardinality-11 490531 m, 16694 m/sec, 1015627 t fired, .

Time elapsed: 43 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for CANInsertWithFailure-PT-050-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-050-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
CANInsertWithFailure-PT-050-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 48 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 1 (type EXCL) for 0 CANInsertWithFailure-PT-050-LTLCardinality-03
lola: time limit : 3552 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-050-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-050-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/3552 5/32 CANInsertWithFailure-PT-050-LTLCardinality-03 81810 m, 16362 m/sec, 159861 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-050-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-050-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/3552 11/32 CANInsertWithFailure-PT-050-LTLCardinality-03 167781 m, 17194 m/sec, 340065 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-050-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-050-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/3552 16/32 CANInsertWithFailure-PT-050-LTLCardinality-03 250013 m, 16446 m/sec, 518298 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-050-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-050-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/3552 21/32 CANInsertWithFailure-PT-050-LTLCardinality-03 335387 m, 17074 m/sec, 699066 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-050-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-050-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/3552 26/32 CANInsertWithFailure-PT-050-LTLCardinality-03 421965 m, 17315 m/sec, 880018 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-050-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
CANInsertWithFailure-PT-050-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/3552 32/32 CANInsertWithFailure-PT-050-LTLCardinality-03 511850 m, 17977 m/sec, 1059907 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANInsertWithFailure-PT-050-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0
CANInsertWithFailure-PT-050-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANInsertWithFailure-PT-050-LTLCardinality-03: LTL unknown AGGR
CANInsertWithFailure-PT-050-LTLCardinality-11: LTL unknown AGGR


Time elapsed: 83 secs. Pages in use: 32

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-050"
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-050, 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-167813692900739"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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