About the Execution of LoLa+red for Anderson-PT-08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 605.560 | 46480.00 | 70031.00 | 802.80 | FTFFFTTFFFFFFFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r519-tall-167987244700035.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is Anderson-PT-08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r519-tall-167987244700035
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 5.5K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 17K Mar 23 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 170K Mar 23 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Mar 23 15:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 23 15:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 667K Mar 31 16:48 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 Anderson-PT-08-LTLCardinality-00
FORMULA_NAME Anderson-PT-08-LTLCardinality-01
FORMULA_NAME Anderson-PT-08-LTLCardinality-02
FORMULA_NAME Anderson-PT-08-LTLCardinality-03
FORMULA_NAME Anderson-PT-08-LTLCardinality-04
FORMULA_NAME Anderson-PT-08-LTLCardinality-05
FORMULA_NAME Anderson-PT-08-LTLCardinality-06
FORMULA_NAME Anderson-PT-08-LTLCardinality-07
FORMULA_NAME Anderson-PT-08-LTLCardinality-08
FORMULA_NAME Anderson-PT-08-LTLCardinality-09
FORMULA_NAME Anderson-PT-08-LTLCardinality-10
FORMULA_NAME Anderson-PT-08-LTLCardinality-11
FORMULA_NAME Anderson-PT-08-LTLCardinality-12
FORMULA_NAME Anderson-PT-08-LTLCardinality-13
FORMULA_NAME Anderson-PT-08-LTLCardinality-14
FORMULA_NAME Anderson-PT-08-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1680828708503
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=Anderson-PT-08
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2023-04-07 00:51:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 00:51:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 00:51:50] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2023-04-07 00:51:50] [INFO ] Transformed 401 places.
[2023-04-07 00:51:50] [INFO ] Transformed 1328 transitions.
[2023-04-07 00:51:50] [INFO ] Found NUPN structural information;
[2023-04-07 00:51:50] [INFO ] Parsed PT model containing 401 places and 1328 transitions and 5088 arcs in 181 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 5 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA Anderson-PT-08-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 401/401 places, 1328/1328 transitions.
Discarding 105 places :
Symmetric choice reduction at 0 with 105 rule applications. Total rules 105 place count 296 transition count 481
Iterating global reduction 0 with 105 rules applied. Total rules applied 210 place count 296 transition count 481
Applied a total of 210 rules in 68 ms. Remains 296 /401 variables (removed 105) and now considering 481/1328 (removed 847) transitions.
// Phase 1: matrix 481 rows 296 cols
[2023-04-07 00:51:50] [INFO ] Computed 19 invariants in 22 ms
[2023-04-07 00:51:50] [INFO ] Implicit Places using invariants in 403 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 427 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 295/401 places, 481/1328 transitions.
Applied a total of 0 rules in 7 ms. Remains 295 /295 variables (removed 0) and now considering 481/481 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 504 ms. Remains : 295/401 places, 481/1328 transitions.
Support contains 21 out of 295 places after structural reductions.
[2023-04-07 00:51:51] [INFO ] Flatten gal took : 63 ms
[2023-04-07 00:51:51] [INFO ] Flatten gal took : 32 ms
[2023-04-07 00:51:51] [INFO ] Input system was already deterministic with 481 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 375 ms. (steps per millisecond=26 ) properties (out of 13) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 481 rows 295 cols
[2023-04-07 00:51:51] [INFO ] Computed 18 invariants in 13 ms
[2023-04-07 00:51:51] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-04-07 00:51:51] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 13 ms returned sat
[2023-04-07 00:51:51] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 00:51:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2023-04-07 00:51:51] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 14 ms returned sat
[2023-04-07 00:51:52] [INFO ] After 241ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 00:51:52] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 00:51:52] [INFO ] After 133ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 00:51:52] [INFO ] After 254ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 90 ms.
[2023-04-07 00:51:52] [INFO ] After 701ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 295 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 295/295 places, 481/481 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 295 transition count 434
Reduce places removed 47 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 56 rules applied. Total rules applied 103 place count 248 transition count 425
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 112 place count 239 transition count 425
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 112 place count 239 transition count 371
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 220 place count 185 transition count 371
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 225 place count 180 transition count 324
Iterating global reduction 3 with 5 rules applied. Total rules applied 230 place count 180 transition count 324
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 234 place count 178 transition count 322
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 242 place count 178 transition count 314
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 250 place count 170 transition count 314
Applied a total of 250 rules in 58 ms. Remains 170 /295 variables (removed 125) and now considering 314/481 (removed 167) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 170/295 places, 314/481 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 314 rows 170 cols
[2023-04-07 00:51:52] [INFO ] Computed 18 invariants in 7 ms
[2023-04-07 00:51:52] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 00:51:52] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-04-07 00:51:52] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 11 ms returned sat
[2023-04-07 00:51:52] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 00:51:52] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 00:51:52] [INFO ] After 53ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 00:51:53] [INFO ] After 94ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-04-07 00:51:53] [INFO ] After 339ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 314/314 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 169 transition count 313
Applied a total of 2 rules in 17 ms. Remains 169 /170 variables (removed 1) and now considering 313/314 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 169/170 places, 313/314 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 7426 steps, run visited all 1 properties in 44 ms. (steps per millisecond=168 )
Probabilistic random walk after 7426 steps, saw 5647 distinct states, run finished after 44 ms. (steps per millisecond=168 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 295 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 295/295 places, 481/481 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 295 transition count 418
Reduce places removed 63 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 64 rules applied. Total rules applied 127 place count 232 transition count 417
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 128 place count 231 transition count 417
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 55 Pre rules applied. Total rules applied 128 place count 231 transition count 362
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 238 place count 176 transition count 362
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 244 place count 170 transition count 314
Iterating global reduction 3 with 6 rules applied. Total rules applied 250 place count 170 transition count 314
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 252 place count 169 transition count 313
Applied a total of 252 rules in 34 ms. Remains 169 /295 variables (removed 126) and now considering 313/481 (removed 168) transitions.
// Phase 1: matrix 313 rows 169 cols
[2023-04-07 00:51:53] [INFO ] Computed 18 invariants in 2 ms
[2023-04-07 00:51:53] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-04-07 00:51:53] [INFO ] Invariant cache hit.
[2023-04-07 00:51:53] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 00:51:53] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
[2023-04-07 00:51:53] [INFO ] Redundant transitions in 16 ms returned []
[2023-04-07 00:51:53] [INFO ] Invariant cache hit.
[2023-04-07 00:51:54] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 169/295 places, 313/481 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 708 ms. Remains : 169/295 places, 313/481 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-08-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s35 0) (EQ s111 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 131 reset in 276 ms.
Stack based approach found an accepted trace after 120 steps with 2 reset with depth 64 and stack size 64 in 1 ms.
FORMULA Anderson-PT-08-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-08-LTLCardinality-03 finished in 1227 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 295 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 295/295 places, 481/481 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 295 transition count 418
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 126 place count 232 transition count 418
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 55 Pre rules applied. Total rules applied 126 place count 232 transition count 363
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 2 with 110 rules applied. Total rules applied 236 place count 177 transition count 363
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 243 place count 170 transition count 314
Iterating global reduction 2 with 7 rules applied. Total rules applied 250 place count 170 transition count 314
Applied a total of 250 rules in 28 ms. Remains 170 /295 variables (removed 125) and now considering 314/481 (removed 167) transitions.
// Phase 1: matrix 314 rows 170 cols
[2023-04-07 00:51:54] [INFO ] Computed 18 invariants in 6 ms
[2023-04-07 00:51:54] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-04-07 00:51:54] [INFO ] Invariant cache hit.
[2023-04-07 00:51:54] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 00:51:55] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
[2023-04-07 00:51:55] [INFO ] Redundant transitions in 4 ms returned []
[2023-04-07 00:51:55] [INFO ] Invariant cache hit.
[2023-04-07 00:51:55] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 170/295 places, 314/481 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 718 ms. Remains : 170/295 places, 314/481 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-08-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s169 0) (EQ s103 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 171 ms.
Stack based approach found an accepted trace after 1371 steps with 0 reset with depth 1372 and stack size 992 in 3 ms.
FORMULA Anderson-PT-08-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-08-LTLCardinality-07 finished in 946 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 295 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 295/295 places, 481/481 transitions.
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 295 transition count 419
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 124 place count 233 transition count 419
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 124 place count 233 transition count 363
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 236 place count 177 transition count 363
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 241 place count 172 transition count 344
Iterating global reduction 2 with 5 rules applied. Total rules applied 246 place count 172 transition count 344
Applied a total of 246 rules in 23 ms. Remains 172 /295 variables (removed 123) and now considering 344/481 (removed 137) transitions.
// Phase 1: matrix 344 rows 172 cols
[2023-04-07 00:51:55] [INFO ] Computed 18 invariants in 5 ms
[2023-04-07 00:51:55] [INFO ] Implicit Places using invariants in 139 ms returned []
[2023-04-07 00:51:55] [INFO ] Invariant cache hit.
[2023-04-07 00:51:55] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 00:51:56] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 504 ms to find 0 implicit places.
[2023-04-07 00:51:56] [INFO ] Redundant transitions in 4 ms returned []
[2023-04-07 00:51:56] [INFO ] Invariant cache hit.
[2023-04-07 00:51:56] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 172/295 places, 344/481 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 717 ms. Remains : 172/295 places, 344/481 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-08-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s29 0) (EQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 110 reset in 159 ms.
Stack based approach found an accepted trace after 59 steps with 0 reset with depth 60 and stack size 60 in 0 ms.
FORMULA Anderson-PT-08-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-08-LTLCardinality-08 finished in 928 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(F(X(p0)) U !(X(p2)||p1))))'
Support contains 5 out of 295 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 295/295 places, 481/481 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 289 transition count 433
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 289 transition count 433
Applied a total of 12 rules in 20 ms. Remains 289 /295 variables (removed 6) and now considering 433/481 (removed 48) transitions.
// Phase 1: matrix 433 rows 289 cols
[2023-04-07 00:51:56] [INFO ] Computed 18 invariants in 3 ms
[2023-04-07 00:51:56] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-04-07 00:51:56] [INFO ] Invariant cache hit.
[2023-04-07 00:51:56] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 00:51:57] [INFO ] Implicit Places using invariants and state equation in 711 ms returned []
Implicit Place search using SMT with State Equation took 875 ms to find 0 implicit places.
[2023-04-07 00:51:57] [INFO ] Invariant cache hit.
[2023-04-07 00:51:57] [INFO ] Dead Transitions using invariants and state equation in 289 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 289/295 places, 433/481 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1189 ms. Remains : 289/295 places, 433/481 transitions.
Stuttering acceptance computed with spot in 280 ms :[true, (NOT p2), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), p0]
Running random walk in product with property : Anderson-PT-08-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=1 dest: 2}, { cond=(AND p1 p2), acceptance={} source=1 dest: 5}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=p0, acceptance={} source=6 dest: 0}, { cond=(NOT p0), acceptance={} source=6 dest: 6}]], initial=3, aps=[p2:(OR (EQ s122 0) (EQ s23 1)), p1:(OR (EQ s122 0) (EQ s23 1) (EQ s246 0) (EQ s89 1)), p0:(EQ s232 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 33532 steps with 0 reset in 51 ms.
FORMULA Anderson-PT-08-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-08-LTLCardinality-10 finished in 1552 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G((G(p0)&&p1)) U X((!F(p1) U p2))) U !p0))'
Support contains 5 out of 295 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 295/295 places, 481/481 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 291 transition count 449
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 291 transition count 449
Applied a total of 8 rules in 7 ms. Remains 291 /295 variables (removed 4) and now considering 449/481 (removed 32) transitions.
// Phase 1: matrix 449 rows 291 cols
[2023-04-07 00:51:58] [INFO ] Computed 18 invariants in 8 ms
[2023-04-07 00:51:58] [INFO ] Implicit Places using invariants in 169 ms returned []
[2023-04-07 00:51:58] [INFO ] Invariant cache hit.
[2023-04-07 00:51:58] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 00:51:59] [INFO ] Implicit Places using invariants and state equation in 825 ms returned []
Implicit Place search using SMT with State Equation took 1016 ms to find 0 implicit places.
[2023-04-07 00:51:59] [INFO ] Invariant cache hit.
[2023-04-07 00:51:59] [INFO ] Dead Transitions using invariants and state equation in 278 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 291/295 places, 449/481 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1315 ms. Remains : 291/295 places, 449/481 transitions.
Stuttering acceptance computed with spot in 234 ms :[p1, p0, (OR (NOT p2) p1), (OR (NOT p2) p0 p1), true, (OR (NOT p2) p0)]
Running random walk in product with property : Anderson-PT-08-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND p0 p2), acceptance={0} source=5 dest: 5}]], initial=1, aps=[p1:(EQ s73 1), p0:(OR (EQ s261 0) (EQ s91 1)), p2:(OR (EQ s111 0) (EQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 132 ms.
Product exploration explored 100000 steps with 0 reset in 265 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (AND p0 p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), true, (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 164 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 9 states, 34 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 382 ms :[true, (OR (NOT p2) p0), (OR (NOT p2) p0), (OR (NOT p2) p0), (OR (NOT p2) p0), p1, (OR (NOT p2) p0 p1), (OR (NOT p2) p1), (OR (NOT p2) p0 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 10) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-04-07 00:52:00] [INFO ] Invariant cache hit.
[2023-04-07 00:52:01] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 00:52:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-04-07 00:52:01] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 12 ms returned sat
[2023-04-07 00:52:01] [INFO ] After 152ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-04-07 00:52:01] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 00:52:01] [INFO ] After 113ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-04-07 00:52:01] [INFO ] After 192ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-04-07 00:52:01] [INFO ] After 473ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 291 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 291/291 places, 449/449 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 291 transition count 386
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 126 place count 228 transition count 386
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 54 Pre rules applied. Total rules applied 126 place count 228 transition count 332
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 234 place count 174 transition count 332
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 235 place count 173 transition count 331
Iterating global reduction 2 with 1 rules applied. Total rules applied 236 place count 173 transition count 331
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 238 place count 172 transition count 330
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 239 place count 172 transition count 329
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 240 place count 171 transition count 329
Applied a total of 240 rules in 27 ms. Remains 171 /291 variables (removed 120) and now considering 329/449 (removed 120) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 171/291 places, 329/449 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Finished probabilistic random walk after 49842 steps, run visited all 2 properties in 222 ms. (steps per millisecond=224 )
Probabilistic random walk after 49842 steps, saw 35109 distinct states, run finished after 222 ms. (steps per millisecond=224 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (AND p0 p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), true, (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1))), (G (NOT (AND (NOT p0) p2 p1)))]
False Knowledge obtained : [(F (AND (NOT p0) p2 (NOT p1))), (F (AND p0 (NOT p2) (NOT p1))), (F p1), (F (AND (NOT p2) p1)), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (NOT (AND p0 p2))), (F (NOT (AND p2 (NOT p1)))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 16 factoid took 665 ms. Reduced automaton from 9 states, 34 edges and 3 AP (stutter insensitive) to 9 states, 34 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 354 ms :[true, (OR (NOT p2) p0), (OR (NOT p2) p0), (OR (NOT p2) p0), (OR (NOT p2) p0), p1, (OR (NOT p2) p0 p1), (OR (NOT p2) p1), (OR (NOT p2) p0 p1)]
Stuttering acceptance computed with spot in 363 ms :[true, (OR (NOT p2) p0), (OR (NOT p2) p0), (OR (NOT p2) p0), (OR (NOT p2) p0), p1, (OR (NOT p2) p0 p1), (OR (NOT p2) p1), (OR (NOT p2) p0 p1)]
[2023-04-07 00:52:03] [INFO ] Invariant cache hit.
[2023-04-07 00:52:03] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2023-04-07 00:52:03] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 77 ms returned sat
[2023-04-07 00:52:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 00:52:03] [INFO ] [Real]Absence check using state equation in 403 ms returned sat
[2023-04-07 00:52:04] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 00:52:04] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2023-04-07 00:52:04] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 22 ms returned sat
[2023-04-07 00:52:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 00:52:04] [INFO ] [Nat]Absence check using state equation in 471 ms returned sat
[2023-04-07 00:52:04] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 00:52:04] [INFO ] [Nat]Added 56 Read/Feed constraints in 82 ms returned sat
[2023-04-07 00:52:04] [INFO ] Deduced a trap composed of 142 places in 129 ms of which 4 ms to minimize.
[2023-04-07 00:52:05] [INFO ] Deduced a trap composed of 167 places in 142 ms of which 1 ms to minimize.
[2023-04-07 00:52:05] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 0 ms to minimize.
[2023-04-07 00:52:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 510 ms
[2023-04-07 00:52:05] [INFO ] Computed and/alt/rep : 297/1629/297 causal constraints (skipped 144 transitions) in 24 ms.
[2023-04-07 00:52:06] [INFO ] Added : 152 causal constraints over 31 iterations in 1487 ms. Result :sat
Could not prove EG p0
Support contains 5 out of 291 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 291/291 places, 449/449 transitions.
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 291 transition count 387
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 124 place count 229 transition count 387
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 53 Pre rules applied. Total rules applied 124 place count 229 transition count 334
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 106 rules applied. Total rules applied 230 place count 176 transition count 334
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 234 place count 174 transition count 332
Applied a total of 234 rules in 21 ms. Remains 174 /291 variables (removed 117) and now considering 332/449 (removed 117) transitions.
// Phase 1: matrix 332 rows 174 cols
[2023-04-07 00:52:06] [INFO ] Computed 18 invariants in 5 ms
[2023-04-07 00:52:06] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-04-07 00:52:06] [INFO ] Invariant cache hit.
[2023-04-07 00:52:07] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 00:52:07] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 546 ms to find 0 implicit places.
[2023-04-07 00:52:07] [INFO ] Redundant transitions in 2 ms returned []
[2023-04-07 00:52:07] [INFO ] Invariant cache hit.
[2023-04-07 00:52:07] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 174/291 places, 332/449 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 751 ms. Remains : 174/291 places, 332/449 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND p0 p2)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p1))))), true, (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p1))), (X (X (AND p2 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 225 ms. Reduced automaton from 9 states, 34 edges and 3 AP (stutter insensitive) to 9 states, 34 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 348 ms :[true, (OR (NOT p2) p0), (OR (NOT p2) p0), (OR (NOT p2) p0), (OR (NOT p2) p0), p1, (OR (NOT p2) p0 p1), (OR (NOT p2) p1), (OR (NOT p2) p0 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 10) seen :7
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2023-04-07 00:52:08] [INFO ] Invariant cache hit.
[2023-04-07 00:52:08] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 00:52:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-04-07 00:52:08] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2023-04-07 00:52:08] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-04-07 00:52:08] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 00:52:08] [INFO ] After 20ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-04-07 00:52:08] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-04-07 00:52:08] [INFO ] After 239ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 332/332 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 1 rules applied. Total rules applied 1 place count 174 transition count 331
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 173 transition count 331
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 172 transition count 330
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 172 transition count 329
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 171 transition count 329
Applied a total of 6 rules in 26 ms. Remains 171 /174 variables (removed 3) and now considering 329/332 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 171/174 places, 329/332 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 60649 steps, run visited all 1 properties in 142 ms. (steps per millisecond=427 )
Probabilistic random walk after 60649 steps, saw 42210 distinct states, run finished after 143 ms. (steps per millisecond=424 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND p0 p2)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p1))))), true, (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p1))), (X (X (AND p2 (NOT p1)))), (G (NOT (AND (NOT p0) p2 p1)))]
False Knowledge obtained : [(F (AND (NOT p0) p2 (NOT p1))), (F (AND p0 (NOT p2) (NOT p1))), (F p1), (F (AND (NOT p2) p1)), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (NOT (AND p0 p2))), (F (NOT (AND p2 (NOT p1)))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 21 factoid took 786 ms. Reduced automaton from 9 states, 34 edges and 3 AP (stutter insensitive) to 9 states, 34 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 336 ms :[true, (OR (NOT p2) p0), (OR (NOT p2) p0), (OR (NOT p2) p0), (OR (NOT p2) p0), p1, (OR (NOT p2) p0 p1), (OR (NOT p2) p1), (OR (NOT p2) p0 p1)]
Stuttering acceptance computed with spot in 340 ms :[true, (OR (NOT p2) p0), (OR (NOT p2) p0), (OR (NOT p2) p0), (OR (NOT p2) p0), p1, (OR (NOT p2) p0 p1), (OR (NOT p2) p1), (OR (NOT p2) p0 p1)]
[2023-04-07 00:52:10] [INFO ] Invariant cache hit.
[2023-04-07 00:52:10] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-04-07 00:52:10] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 54 ms returned sat
[2023-04-07 00:52:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 00:52:10] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2023-04-07 00:52:10] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 00:52:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-04-07 00:52:10] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2023-04-07 00:52:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 00:52:10] [INFO ] [Nat]Absence check using state equation in 216 ms returned sat
[2023-04-07 00:52:10] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 00:52:10] [INFO ] [Nat]Added 56 Read/Feed constraints in 34 ms returned sat
[2023-04-07 00:52:11] [INFO ] Computed and/alt/rep : 135/1050/135 causal constraints (skipped 189 transitions) in 22 ms.
[2023-04-07 00:52:11] [INFO ] Added : 42 causal constraints over 9 iterations in 356 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 346 ms :[true, (OR (NOT p2) p0), (OR (NOT p2) p0), (OR (NOT p2) p0), (OR (NOT p2) p0), p1, (OR (NOT p2) p0 p1), (OR (NOT p2) p1), (OR (NOT p2) p0 p1)]
Product exploration explored 100000 steps with 0 reset in 122 ms.
Stack based approach found an accepted trace after 38 steps with 0 reset with depth 39 and stack size 39 in 0 ms.
FORMULA Anderson-PT-08-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-08-LTLCardinality-12 finished in 13839 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&X(F((G(F(p2))||p1))))))'
Support contains 5 out of 295 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 295/295 places, 481/481 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 289 transition count 433
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 289 transition count 433
Applied a total of 12 rules in 10 ms. Remains 289 /295 variables (removed 6) and now considering 433/481 (removed 48) transitions.
// Phase 1: matrix 433 rows 289 cols
[2023-04-07 00:52:11] [INFO ] Computed 18 invariants in 3 ms
[2023-04-07 00:52:12] [INFO ] Implicit Places using invariants in 240 ms returned []
[2023-04-07 00:52:12] [INFO ] Invariant cache hit.
[2023-04-07 00:52:12] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 00:52:12] [INFO ] Implicit Places using invariants and state equation in 831 ms returned []
Implicit Place search using SMT with State Equation took 1076 ms to find 0 implicit places.
[2023-04-07 00:52:12] [INFO ] Invariant cache hit.
[2023-04-07 00:52:13] [INFO ] Dead Transitions using invariants and state equation in 281 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 289/295 places, 433/481 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1368 ms. Remains : 289/295 places, 433/481 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Anderson-PT-08-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s213 1) (EQ s48 0) (EQ s5 1)), p1:(OR (EQ s161 0) (EQ s158 1)), p2:(EQ s213 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 140 ms.
Product exploration explored 100000 steps with 0 reset in 192 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), (X p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 93 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 00:52:14] [INFO ] Invariant cache hit.
[2023-04-07 00:52:14] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 00:52:14] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-04-07 00:52:14] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2023-04-07 00:52:14] [INFO ] After 170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 00:52:14] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 00:52:14] [INFO ] After 38ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 00:52:14] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-04-07 00:52:14] [INFO ] After 393ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 289 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 289/289 places, 433/433 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 289 transition count 386
Reduce places removed 47 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 56 rules applied. Total rules applied 103 place count 242 transition count 377
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 112 place count 233 transition count 377
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 55 Pre rules applied. Total rules applied 112 place count 233 transition count 322
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 222 place count 178 transition count 322
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 224 place count 177 transition count 321
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 232 place count 177 transition count 313
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 240 place count 169 transition count 313
Applied a total of 240 rules in 31 ms. Remains 169 /289 variables (removed 120) and now considering 313/433 (removed 120) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 169/289 places, 313/433 transitions.
Finished random walk after 1398 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=466 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), (X p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p2) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 158 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 433/433 transitions.
Applied a total of 0 rules in 6 ms. Remains 289 /289 variables (removed 0) and now considering 433/433 (removed 0) transitions.
[2023-04-07 00:52:14] [INFO ] Invariant cache hit.
[2023-04-07 00:52:15] [INFO ] Implicit Places using invariants in 172 ms returned []
[2023-04-07 00:52:15] [INFO ] Invariant cache hit.
[2023-04-07 00:52:15] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 00:52:15] [INFO ] Implicit Places using invariants and state equation in 850 ms returned []
Implicit Place search using SMT with State Equation took 1034 ms to find 0 implicit places.
[2023-04-07 00:52:15] [INFO ] Invariant cache hit.
[2023-04-07 00:52:16] [INFO ] Dead Transitions using invariants and state equation in 260 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1302 ms. Remains : 289/289 places, 433/433 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 105 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 00:52:16] [INFO ] Invariant cache hit.
[2023-04-07 00:52:16] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 00:52:16] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-04-07 00:52:16] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2023-04-07 00:52:16] [INFO ] After 178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 00:52:16] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 00:52:16] [INFO ] After 36ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 00:52:16] [INFO ] After 106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-04-07 00:52:17] [INFO ] After 389ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 289 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 289/289 places, 433/433 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 289 transition count 386
Reduce places removed 47 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 56 rules applied. Total rules applied 103 place count 242 transition count 377
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 112 place count 233 transition count 377
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 55 Pre rules applied. Total rules applied 112 place count 233 transition count 322
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 222 place count 178 transition count 322
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 224 place count 177 transition count 321
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 232 place count 177 transition count 313
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 240 place count 169 transition count 313
Applied a total of 240 rules in 33 ms. Remains 169 /289 variables (removed 120) and now considering 313/433 (removed 120) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 169/289 places, 313/433 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 10978 steps, run visited all 1 properties in 28 ms. (steps per millisecond=392 )
Probabilistic random walk after 10978 steps, saw 8161 distinct states, run finished after 28 ms. (steps per millisecond=392 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p2) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 179 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 431 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 1 reset in 148 ms.
Product exploration explored 100000 steps with 5 reset in 182 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 289 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 289/289 places, 433/433 transitions.
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 289 transition count 433
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 54 Pre rules applied. Total rules applied 56 place count 289 transition count 433
Deduced a syphon composed of 110 places in 0 ms
Iterating global reduction 1 with 54 rules applied. Total rules applied 110 place count 289 transition count 433
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 111 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 111 place count 289 transition count 433
Deduced a syphon composed of 111 places in 0 ms
Applied a total of 111 rules in 36 ms. Remains 289 /289 variables (removed 0) and now considering 433/433 (removed 0) transitions.
[2023-04-07 00:52:18] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 433 rows 289 cols
[2023-04-07 00:52:18] [INFO ] Computed 18 invariants in 5 ms
[2023-04-07 00:52:19] [INFO ] Dead Transitions using invariants and state equation in 275 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 289/289 places, 433/433 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 333 ms. Remains : 289/289 places, 433/433 transitions.
Support contains 5 out of 289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 433/433 transitions.
Applied a total of 0 rules in 6 ms. Remains 289 /289 variables (removed 0) and now considering 433/433 (removed 0) transitions.
// Phase 1: matrix 433 rows 289 cols
[2023-04-07 00:52:19] [INFO ] Computed 18 invariants in 4 ms
[2023-04-07 00:52:19] [INFO ] Implicit Places using invariants in 180 ms returned []
[2023-04-07 00:52:19] [INFO ] Invariant cache hit.
[2023-04-07 00:52:19] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 00:52:20] [INFO ] Implicit Places using invariants and state equation in 878 ms returned []
Implicit Place search using SMT with State Equation took 1060 ms to find 0 implicit places.
[2023-04-07 00:52:20] [INFO ] Invariant cache hit.
[2023-04-07 00:52:20] [INFO ] Dead Transitions using invariants and state equation in 270 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1342 ms. Remains : 289/289 places, 433/433 transitions.
Treatment of property Anderson-PT-08-LTLCardinality-13 finished in 8621 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 295 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 295/295 places, 481/481 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 295 transition count 417
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 231 transition count 417
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 128 place count 231 transition count 361
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 240 place count 175 transition count 361
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 247 place count 168 transition count 312
Iterating global reduction 2 with 7 rules applied. Total rules applied 254 place count 168 transition count 312
Applied a total of 254 rules in 18 ms. Remains 168 /295 variables (removed 127) and now considering 312/481 (removed 169) transitions.
// Phase 1: matrix 312 rows 168 cols
[2023-04-07 00:52:20] [INFO ] Computed 18 invariants in 2 ms
[2023-04-07 00:52:20] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-04-07 00:52:20] [INFO ] Invariant cache hit.
[2023-04-07 00:52:20] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 00:52:20] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
[2023-04-07 00:52:20] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 00:52:20] [INFO ] Invariant cache hit.
[2023-04-07 00:52:21] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 168/295 places, 312/481 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 662 ms. Remains : 168/295 places, 312/481 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-08-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 8997 reset in 154 ms.
Product exploration explored 100000 steps with 8991 reset in 162 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
[2023-04-07 00:52:21] [INFO ] Invariant cache hit.
[2023-04-07 00:52:21] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-04-07 00:52:21] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2023-04-07 00:52:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 00:52:21] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2023-04-07 00:52:21] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 00:52:21] [INFO ] [Real]Added 56 Read/Feed constraints in 10 ms returned sat
[2023-04-07 00:52:22] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 00:52:22] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-04-07 00:52:22] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 17 ms returned sat
[2023-04-07 00:52:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 00:52:22] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2023-04-07 00:52:22] [INFO ] [Nat]Added 56 Read/Feed constraints in 12 ms returned sat
[2023-04-07 00:52:22] [INFO ] Computed and/alt/rep : 192/1552/192 causal constraints (skipped 112 transitions) in 21 ms.
[2023-04-07 00:52:22] [INFO ] Added : 35 causal constraints over 7 iterations in 214 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 168 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 312/312 transitions.
Applied a total of 0 rules in 6 ms. Remains 168 /168 variables (removed 0) and now considering 312/312 (removed 0) transitions.
[2023-04-07 00:52:22] [INFO ] Invariant cache hit.
[2023-04-07 00:52:22] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-04-07 00:52:22] [INFO ] Invariant cache hit.
[2023-04-07 00:52:22] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 00:52:22] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
[2023-04-07 00:52:22] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 00:52:22] [INFO ] Invariant cache hit.
[2023-04-07 00:52:23] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 635 ms. Remains : 168/168 places, 312/312 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 222 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2023-04-07 00:52:23] [INFO ] Invariant cache hit.
[2023-04-07 00:52:23] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-04-07 00:52:23] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 12 ms returned sat
[2023-04-07 00:52:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 00:52:23] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2023-04-07 00:52:23] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 00:52:23] [INFO ] [Real]Added 56 Read/Feed constraints in 6 ms returned sat
[2023-04-07 00:52:23] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 00:52:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2023-04-07 00:52:23] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 12 ms returned sat
[2023-04-07 00:52:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 00:52:24] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2023-04-07 00:52:24] [INFO ] [Nat]Added 56 Read/Feed constraints in 11 ms returned sat
[2023-04-07 00:52:24] [INFO ] Computed and/alt/rep : 192/1552/192 causal constraints (skipped 112 transitions) in 19 ms.
[2023-04-07 00:52:24] [INFO ] Added : 35 causal constraints over 7 iterations in 198 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 8974 reset in 154 ms.
Product exploration explored 100000 steps with 8996 reset in 168 ms.
Support contains 1 out of 168 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 312/312 transitions.
Applied a total of 0 rules in 3 ms. Remains 168 /168 variables (removed 0) and now considering 312/312 (removed 0) transitions.
[2023-04-07 00:52:24] [INFO ] Invariant cache hit.
[2023-04-07 00:52:24] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-04-07 00:52:24] [INFO ] Invariant cache hit.
[2023-04-07 00:52:24] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 00:52:25] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
[2023-04-07 00:52:25] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 00:52:25] [INFO ] Invariant cache hit.
[2023-04-07 00:52:25] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 649 ms. Remains : 168/168 places, 312/312 transitions.
Treatment of property Anderson-PT-08-LTLCardinality-15 finished in 4822 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&X(F((G(F(p2))||p1))))))'
Found a Shortening insensitive property : Anderson-PT-08-LTLCardinality-13
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 295 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 295/295 places, 481/481 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 295 transition count 435
Reduce places removed 46 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 56 rules applied. Total rules applied 102 place count 249 transition count 425
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 112 place count 239 transition count 425
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 112 place count 239 transition count 371
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 220 place count 185 transition count 371
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 226 place count 179 transition count 323
Iterating global reduction 3 with 6 rules applied. Total rules applied 232 place count 179 transition count 323
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 234 place count 178 transition count 322
Applied a total of 234 rules in 22 ms. Remains 178 /295 variables (removed 117) and now considering 322/481 (removed 159) transitions.
// Phase 1: matrix 322 rows 178 cols
[2023-04-07 00:52:25] [INFO ] Computed 18 invariants in 5 ms
[2023-04-07 00:52:25] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-04-07 00:52:25] [INFO ] Invariant cache hit.
[2023-04-07 00:52:25] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 00:52:26] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
[2023-04-07 00:52:26] [INFO ] Invariant cache hit.
[2023-04-07 00:52:26] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 178/295 places, 322/481 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 702 ms. Remains : 178/295 places, 322/481 transitions.
Running random walk in product with property : Anderson-PT-08-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s158 1) (EQ s47 0) (EQ s5 1)), p1:(OR (EQ s106 0) (EQ s104 1)), p2:(EQ s158 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3 reset in 126 ms.
Product exploration explored 100000 steps with 1 reset in 169 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), (X p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 5 factoid took 201 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 00:52:26] [INFO ] Invariant cache hit.
[2023-04-07 00:52:26] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 00:52:27] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-04-07 00:52:27] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 7 ms returned sat
[2023-04-07 00:52:27] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 00:52:27] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 00:52:27] [INFO ] After 50ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 00:52:27] [INFO ] After 120ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-04-07 00:52:27] [INFO ] After 312ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 322/322 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 178 transition count 321
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 177 transition count 321
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 177 transition count 313
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 18 place count 169 transition count 313
Applied a total of 18 rules in 14 ms. Remains 169 /178 variables (removed 9) and now considering 313/322 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 169/178 places, 313/322 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 10978 steps, run visited all 1 properties in 27 ms. (steps per millisecond=406 )
Probabilistic random walk after 10978 steps, saw 8161 distinct states, run finished after 28 ms. (steps per millisecond=392 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), (X p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (NOT p0)), (F (AND (NOT p2) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 274 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 322/322 transitions.
Applied a total of 0 rules in 4 ms. Remains 178 /178 variables (removed 0) and now considering 322/322 (removed 0) transitions.
[2023-04-07 00:52:27] [INFO ] Invariant cache hit.
[2023-04-07 00:52:28] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-04-07 00:52:28] [INFO ] Invariant cache hit.
[2023-04-07 00:52:28] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 00:52:28] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 527 ms to find 0 implicit places.
[2023-04-07 00:52:28] [INFO ] Invariant cache hit.
[2023-04-07 00:52:28] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 705 ms. Remains : 178/178 places, 322/322 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 5 factoid took 202 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 2121 steps, including 0 resets, run visited all 3 properties in 17 ms. (steps per millisecond=124 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (F (NOT p0)), (F (AND (NOT p2) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 227 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 134 ms.
Stack based approach found an accepted trace after 53072 steps with 3 reset with depth 53067 and stack size 29076 in 88 ms.
Treatment of property Anderson-PT-08-LTLCardinality-13 finished in 4794 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
[2023-04-07 00:52:30] [INFO ] Flatten gal took : 39 ms
[2023-04-07 00:52:30] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-04-07 00:52:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 295 places, 481 transitions and 1676 arcs took 5 ms.
Total runtime 40187 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Anderson-PT-08
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLCardinality
FORMULA Anderson-PT-08-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Anderson-PT-08-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1680828754983
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 6 (type EXCL) for 3 Anderson-PT-08-LTLCardinality-15
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 6 (type EXCL) for Anderson-PT-08-LTLCardinality-15
lola: result : false
lola: markings : 220058
lola: fired transitions : 440118
lola: time used : 3.000000
lola: memory pages used : 2
lola: LAUNCH task # 1 (type EXCL) for 0 Anderson-PT-08-LTLCardinality-13
lola: time limit : 3597 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for Anderson-PT-08-LTLCardinality-13
lola: result : false
lola: markings : 168813
lola: fired transitions : 240736
lola: time used : 0.000000
lola: memory pages used : 2
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Anderson-PT-08-LTLCardinality-13: LTL false LTL model checker
Anderson-PT-08-LTLCardinality-15: F true state space / EG
Time elapsed: 3 secs. Pages in use: 2
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="Anderson-PT-08"
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 Anderson-PT-08, 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 r519-tall-167987244700035"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-08.tgz
mv Anderson-PT-08 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 '
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 ;