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.r521-tall-167987246100035.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 ltsminxred
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 r521-tall-167987246100035
=====================================================================

--------------------
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 1680860341632

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-08
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 09:39:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 09:39:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 09:39:05] [INFO ] Load time of PNML (sax parser for PT used): 231 ms
[2023-04-07 09:39:05] [INFO ] Transformed 401 places.
[2023-04-07 09:39:05] [INFO ] Transformed 1328 transitions.
[2023-04-07 09:39:05] [INFO ] Found NUPN structural information;
[2023-04-07 09:39:05] [INFO ] Parsed PT model containing 401 places and 1328 transitions and 5088 arcs in 402 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 38 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 153 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 09:39:05] [INFO ] Computed 19 invariants in 44 ms
[2023-04-07 09:39:06] [INFO ] Implicit Places using invariants in 1009 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1051 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 4 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 1212 ms. Remains : 295/401 places, 481/1328 transitions.
Support contains 21 out of 295 places after structural reductions.
[2023-04-07 09:39:07] [INFO ] Flatten gal took : 134 ms
[2023-04-07 09:39:07] [INFO ] Flatten gal took : 63 ms
[2023-04-07 09:39:08] [INFO ] Input system was already deterministic with 481 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 361 ms. (steps per millisecond=27 ) properties (out of 13) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 481 rows 295 cols
[2023-04-07 09:39:08] [INFO ] Computed 18 invariants in 9 ms
[2023-04-07 09:39:09] [INFO ] [Real]Absence check using 10 positive place invariants in 85 ms returned sat
[2023-04-07 09:39:09] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 47 ms returned sat
[2023-04-07 09:39:09] [INFO ] After 477ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 09:39:09] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-04-07 09:39:09] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 124 ms returned sat
[2023-04-07 09:39:10] [INFO ] After 1103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 09:39:10] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 09:39:11] [INFO ] After 200ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 09:39:11] [INFO ] After 382ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 115 ms.
[2023-04-07 09:39:11] [INFO ] After 1998ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 10 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 121 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 121 ms. Remains : 170/295 places, 314/481 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 2) seen :0
Finished probabilistic random walk after 33469 steps, run visited all 2 properties in 267 ms. (steps per millisecond=125 )
Probabilistic random walk after 33469 steps, saw 23650 distinct states, run finished after 267 ms. (steps per millisecond=125 ) properties seen :2
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 1 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 89 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 09:39:12] [INFO ] Computed 18 invariants in 3 ms
[2023-04-07 09:39:12] [INFO ] Implicit Places using invariants in 300 ms returned []
[2023-04-07 09:39:12] [INFO ] Invariant cache hit.
[2023-04-07 09:39:13] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 09:39:13] [INFO ] Implicit Places using invariants and state equation in 787 ms returned []
Implicit Place search using SMT with State Equation took 1106 ms to find 0 implicit places.
[2023-04-07 09:39:13] [INFO ] Redundant transitions in 22 ms returned []
[2023-04-07 09:39:13] [INFO ] Invariant cache hit.
[2023-04-07 09:39:14] [INFO ] Dead Transitions using invariants and state equation in 355 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 1605 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 318 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 139 reset in 394 ms.
Stack based approach found an accepted trace after 80 steps with 0 reset with depth 81 and stack size 81 in 11 ms.
FORMULA Anderson-PT-08-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-08-LTLCardinality-03 finished in 2403 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 5 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 52 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 09:39:14] [INFO ] Computed 18 invariants in 3 ms
[2023-04-07 09:39:15] [INFO ] Implicit Places using invariants in 676 ms returned []
[2023-04-07 09:39:15] [INFO ] Invariant cache hit.
[2023-04-07 09:39:15] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 09:39:16] [INFO ] Implicit Places using invariants and state equation in 690 ms returned []
Implicit Place search using SMT with State Equation took 1370 ms to find 0 implicit places.
[2023-04-07 09:39:16] [INFO ] Redundant transitions in 6 ms returned []
[2023-04-07 09:39:16] [INFO ] Invariant cache hit.
[2023-04-07 09:39:16] [INFO ] Dead Transitions using invariants and state equation in 289 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 1753 ms. Remains : 170/295 places, 314/481 transitions.
Stuttering acceptance computed with spot in 106 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 350 ms.
Stack based approach found an accepted trace after 2195 steps with 0 reset with depth 2196 and stack size 1701 in 5 ms.
FORMULA Anderson-PT-08-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-08-LTLCardinality-07 finished in 2253 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 61 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 09:39:17] [INFO ] Computed 18 invariants in 2 ms
[2023-04-07 09:39:17] [INFO ] Implicit Places using invariants in 303 ms returned []
[2023-04-07 09:39:17] [INFO ] Invariant cache hit.
[2023-04-07 09:39:17] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 09:39:18] [INFO ] Implicit Places using invariants and state equation in 513 ms returned []
Implicit Place search using SMT with State Equation took 835 ms to find 0 implicit places.
[2023-04-07 09:39:18] [INFO ] Redundant transitions in 2 ms returned []
[2023-04-07 09:39:18] [INFO ] Invariant cache hit.
[2023-04-07 09:39:18] [INFO ] Dead Transitions using invariants and state equation in 299 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 1228 ms. Remains : 172/295 places, 344/481 transitions.
Stuttering acceptance computed with spot in 88 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 183 ms.
Stack based approach found an accepted trace after 76 steps with 2 reset with depth 33 and stack size 33 in 0 ms.
FORMULA Anderson-PT-08-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-08-LTLCardinality-08 finished in 1531 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 8 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 09:39:18] [INFO ] Computed 18 invariants in 3 ms
[2023-04-07 09:39:19] [INFO ] Implicit Places using invariants in 539 ms returned []
[2023-04-07 09:39:19] [INFO ] Invariant cache hit.
[2023-04-07 09:39:19] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 09:39:20] [INFO ] Implicit Places using invariants and state equation in 748 ms returned []
Implicit Place search using SMT with State Equation took 1311 ms to find 0 implicit places.
[2023-04-07 09:39:20] [INFO ] Invariant cache hit.
[2023-04-07 09:39:20] [INFO ] Dead Transitions using invariants and state equation in 344 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 1695 ms. Remains : 289/295 places, 433/481 transitions.
Stuttering acceptance computed with spot in 497 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 12972 steps with 0 reset in 22 ms.
FORMULA Anderson-PT-08-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-08-LTLCardinality-10 finished in 2262 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 48 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 09:39:21] [INFO ] Computed 18 invariants in 3 ms
[2023-04-07 09:39:21] [INFO ] Implicit Places using invariants in 353 ms returned []
[2023-04-07 09:39:21] [INFO ] Invariant cache hit.
[2023-04-07 09:39:21] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 09:39:22] [INFO ] Implicit Places using invariants and state equation in 1275 ms returned []
Implicit Place search using SMT with State Equation took 1660 ms to find 0 implicit places.
[2023-04-07 09:39:22] [INFO ] Invariant cache hit.
[2023-04-07 09:39:23] [INFO ] Dead Transitions using invariants and state equation in 485 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 2213 ms. Remains : 291/295 places, 449/481 transitions.
Stuttering acceptance computed with spot in 372 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 155 ms.
Stack based approach found an accepted trace after 93 steps with 0 reset with depth 94 and stack size 94 in 1 ms.
FORMULA Anderson-PT-08-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-08-LTLCardinality-12 finished in 2784 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 18 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 09:39:23] [INFO ] Computed 18 invariants in 5 ms
[2023-04-07 09:39:24] [INFO ] Implicit Places using invariants in 213 ms returned []
[2023-04-07 09:39:24] [INFO ] Invariant cache hit.
[2023-04-07 09:39:24] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 09:39:25] [INFO ] Implicit Places using invariants and state equation in 1139 ms returned []
Implicit Place search using SMT with State Equation took 1390 ms to find 0 implicit places.
[2023-04-07 09:39:25] [INFO ] Invariant cache hit.
[2023-04-07 09:39:25] [INFO ] Dead Transitions using invariants and state equation in 317 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 1751 ms. Remains : 289/295 places, 433/481 transitions.
Stuttering acceptance computed with spot in 260 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 0 reset in 152 ms.
Product exploration explored 100000 steps with 0 reset in 292 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 p1), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 300 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 311 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 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 09:39:26] [INFO ] Invariant cache hit.
[2023-04-07 09:39:27] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 09:39:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-04-07 09:39:27] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2023-04-07 09:39:27] [INFO ] After 201ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 09:39:27] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 09:39:27] [INFO ] After 36ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 09:39:27] [INFO ] After 127ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 67 ms.
[2023-04-07 09:39:27] [INFO ] After 488ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 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 46 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 46 ms. Remains : 169/289 places, 313/433 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
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
Finished probabilistic random walk after 10978 steps, run visited all 1 properties in 70 ms. (steps per millisecond=156 )
Probabilistic random walk after 10978 steps, saw 8161 distinct states, run finished after 70 ms. (steps per millisecond=156 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p1), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p1)), (X (X p0)), (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 286 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 273 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 274 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 8 ms. Remains 289 /289 variables (removed 0) and now considering 433/433 (removed 0) transitions.
[2023-04-07 09:39:28] [INFO ] Invariant cache hit.
[2023-04-07 09:39:29] [INFO ] Implicit Places using invariants in 1441 ms returned []
[2023-04-07 09:39:29] [INFO ] Invariant cache hit.
[2023-04-07 09:39:30] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 09:39:31] [INFO ] Implicit Places using invariants and state equation in 1094 ms returned []
Implicit Place search using SMT with State Equation took 2552 ms to find 0 implicit places.
[2023-04-07 09:39:31] [INFO ] Invariant cache hit.
[2023-04-07 09:39:31] [INFO ] Dead Transitions using invariants and state equation in 432 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2996 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 p1), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 182 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 275 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 18 ms. (steps per millisecond=555 ) 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 09:39:32] [INFO ] Invariant cache hit.
[2023-04-07 09:39:32] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 09:39:32] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2023-04-07 09:39:32] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 15 ms returned sat
[2023-04-07 09:39:32] [INFO ] After 243ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 09:39:32] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 09:39:32] [INFO ] After 39ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 09:39:32] [INFO ] After 114ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-04-07 09:39:32] [INFO ] After 521ms 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 29 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 29 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 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 10978 steps, run visited all 1 properties in 47 ms. (steps per millisecond=233 )
Probabilistic random walk after 10978 steps, saw 8161 distinct states, run finished after 47 ms. (steps per millisecond=233 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p1), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p2) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 305 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 250 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 187 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 229 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 2 reset in 176 ms.
Product exploration explored 100000 steps with 2 reset in 162 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 268 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 1 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 71 ms. Remains 289 /289 variables (removed 0) and now considering 433/433 (removed 0) transitions.
[2023-04-07 09:39:34] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 433 rows 289 cols
[2023-04-07 09:39:34] [INFO ] Computed 18 invariants in 3 ms
[2023-04-07 09:39:37] [INFO ] Dead Transitions using invariants and state equation in 3191 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 3348 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 15 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 09:39:38] [INFO ] Computed 18 invariants in 5 ms
[2023-04-07 09:39:38] [INFO ] Implicit Places using invariants in 368 ms returned []
[2023-04-07 09:39:38] [INFO ] Invariant cache hit.
[2023-04-07 09:39:38] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 09:39:39] [INFO ] Implicit Places using invariants and state equation in 1059 ms returned []
Implicit Place search using SMT with State Equation took 1461 ms to find 0 implicit places.
[2023-04-07 09:39:39] [INFO ] Invariant cache hit.
[2023-04-07 09:39:39] [INFO ] Dead Transitions using invariants and state equation in 488 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1971 ms. Remains : 289/289 places, 433/433 transitions.
Treatment of property Anderson-PT-08-LTLCardinality-13 finished in 16364 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 35 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 09:39:40] [INFO ] Computed 18 invariants in 2 ms
[2023-04-07 09:39:40] [INFO ] Implicit Places using invariants in 311 ms returned []
[2023-04-07 09:39:40] [INFO ] Invariant cache hit.
[2023-04-07 09:39:40] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 09:39:41] [INFO ] Implicit Places using invariants and state equation in 561 ms returned []
Implicit Place search using SMT with State Equation took 887 ms to find 0 implicit places.
[2023-04-07 09:39:41] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 09:39:41] [INFO ] Invariant cache hit.
[2023-04-07 09:39:41] [INFO ] Dead Transitions using invariants and state equation in 242 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 1197 ms. Remains : 168/295 places, 312/481 transitions.
Stuttering acceptance computed with spot in 54 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 8969 reset in 189 ms.
Product exploration explored 100000 steps with 9001 reset in 196 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 142 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 34 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 111 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 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0)]
[2023-04-07 09:39:42] [INFO ] Invariant cache hit.
[2023-04-07 09:39:42] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-04-07 09:39:42] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2023-04-07 09:39:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 09:39:42] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2023-04-07 09:39:42] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 09:39:42] [INFO ] [Real]Added 56 Read/Feed constraints in 9 ms returned sat
[2023-04-07 09:39:42] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 09:39:42] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-04-07 09:39:42] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 15 ms returned sat
[2023-04-07 09:39:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 09:39:42] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2023-04-07 09:39:42] [INFO ] [Nat]Added 56 Read/Feed constraints in 11 ms returned sat
[2023-04-07 09:39:42] [INFO ] Computed and/alt/rep : 192/1552/192 causal constraints (skipped 112 transitions) in 25 ms.
[2023-04-07 09:39:43] [INFO ] Added : 35 causal constraints over 7 iterations in 292 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 10 ms. Remains 168 /168 variables (removed 0) and now considering 312/312 (removed 0) transitions.
[2023-04-07 09:39:43] [INFO ] Invariant cache hit.
[2023-04-07 09:39:43] [INFO ] Implicit Places using invariants in 206 ms returned []
[2023-04-07 09:39:43] [INFO ] Invariant cache hit.
[2023-04-07 09:39:43] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 09:39:43] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 647 ms to find 0 implicit places.
[2023-04-07 09:39:43] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 09:39:43] [INFO ] Invariant cache hit.
[2023-04-07 09:39:47] [INFO ] Dead Transitions using invariants and state equation in 3879 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4575 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 199 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 30 ms :[(NOT p0)]
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
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 107 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 67 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0)]
[2023-04-07 09:39:48] [INFO ] Invariant cache hit.
[2023-04-07 09:39:48] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-04-07 09:39:48] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 11 ms returned sat
[2023-04-07 09:39:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 09:39:48] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2023-04-07 09:39:48] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 09:39:48] [INFO ] [Real]Added 56 Read/Feed constraints in 15 ms returned sat
[2023-04-07 09:39:48] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 09:39:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-04-07 09:39:48] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 12 ms returned sat
[2023-04-07 09:39:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 09:39:48] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2023-04-07 09:39:48] [INFO ] [Nat]Added 56 Read/Feed constraints in 12 ms returned sat
[2023-04-07 09:39:48] [INFO ] Computed and/alt/rep : 192/1552/192 causal constraints (skipped 112 transitions) in 22 ms.
[2023-04-07 09:39:49] [INFO ] Added : 35 causal constraints over 7 iterations in 252 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 79 ms :[(NOT p0)]
Product exploration explored 100000 steps with 8996 reset in 139 ms.
Product exploration explored 100000 steps with 8990 reset in 199 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 5 ms. Remains 168 /168 variables (removed 0) and now considering 312/312 (removed 0) transitions.
[2023-04-07 09:39:49] [INFO ] Invariant cache hit.
[2023-04-07 09:39:49] [INFO ] Implicit Places using invariants in 185 ms returned []
[2023-04-07 09:39:49] [INFO ] Invariant cache hit.
[2023-04-07 09:39:50] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 09:39:50] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 607 ms to find 0 implicit places.
[2023-04-07 09:39:50] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 09:39:50] [INFO ] Invariant cache hit.
[2023-04-07 09:39:50] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 829 ms. Remains : 168/168 places, 312/312 transitions.
Treatment of property Anderson-PT-08-LTLCardinality-15 finished in 10428 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 206 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 1 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 16 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 09:39:50] [INFO ] Computed 18 invariants in 4 ms
[2023-04-07 09:39:51] [INFO ] Implicit Places using invariants in 203 ms returned []
[2023-04-07 09:39:51] [INFO ] Invariant cache hit.
[2023-04-07 09:39:51] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 09:39:51] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
[2023-04-07 09:39:51] [INFO ] Invariant cache hit.
[2023-04-07 09:39:51] [INFO ] Dead Transitions using invariants and state equation in 228 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 918 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 0 reset in 209 ms.
Product exploration explored 100000 steps with 0 reset in 148 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 p1), (X p0), (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 391 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 429 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 20 ms. (steps per millisecond=500 ) 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 09:39:53] [INFO ] Invariant cache hit.
[2023-04-07 09:39:53] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 09:39:53] [INFO ] [Nat]Absence check using 9 positive place invariants in 35 ms returned sat
[2023-04-07 09:39:53] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 7 ms returned sat
[2023-04-07 09:39:53] [INFO ] After 189ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 09:39:53] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 09:39:53] [INFO ] After 71ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 09:39:53] [INFO ] After 192ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-04-07 09:39:53] [INFO ] After 559ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 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 28 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 29 ms. Remains : 169/178 places, 313/322 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) 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 10978 steps, run visited all 1 properties in 60 ms. (steps per millisecond=182 )
Probabilistic random walk after 10978 steps, saw 8161 distinct states, run finished after 60 ms. (steps per millisecond=182 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p1), (X p0), (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 450 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 259 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 258 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 3 ms. Remains 178 /178 variables (removed 0) and now considering 322/322 (removed 0) transitions.
[2023-04-07 09:39:54] [INFO ] Invariant cache hit.
[2023-04-07 09:39:55] [INFO ] Implicit Places using invariants in 205 ms returned []
[2023-04-07 09:39:55] [INFO ] Invariant cache hit.
[2023-04-07 09:39:55] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 09:39:55] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 746 ms to find 0 implicit places.
[2023-04-07 09:39:55] [INFO ] Invariant cache hit.
[2023-04-07 09:39:55] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 977 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 p1), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Knowledge based reduction with 5 factoid took 219 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 268 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 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 09:39:56] [INFO ] Invariant cache hit.
[2023-04-07 09:39:56] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 09:39:56] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-04-07 09:39:56] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 39 ms returned sat
[2023-04-07 09:39:56] [INFO ] After 112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 09:39:56] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 09:39:56] [INFO ] After 76ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 09:39:56] [INFO ] After 150ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-04-07 09:39:56] [INFO ] After 437ms 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 28 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 29 ms. Remains : 169/178 places, 313/322 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) 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 26 ms. (steps per millisecond=422 )
Probabilistic random walk after 10978 steps, saw 8161 distinct states, run finished after 26 ms. (steps per millisecond=422 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p1), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (NOT p0)), (F (AND (NOT p2) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 393 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 223 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 284 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 208 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 135 ms.
Product exploration explored 100000 steps with 1 reset in 207 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 206 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 SI_LTL mode, iteration 0 : 178/178 places, 322/322 transitions.
Applied a total of 0 rules in 7 ms. Remains 178 /178 variables (removed 0) and now considering 322/322 (removed 0) transitions.
[2023-04-07 09:39:58] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 09:39:58] [INFO ] Invariant cache hit.
[2023-04-07 09:39:59] [INFO ] Dead Transitions using invariants and state equation in 268 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 313 ms. Remains : 178/178 places, 322/322 transitions.
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 1 ms. Remains 178 /178 variables (removed 0) and now considering 322/322 (removed 0) transitions.
[2023-04-07 09:39:59] [INFO ] Invariant cache hit.
[2023-04-07 09:39:59] [INFO ] Implicit Places using invariants in 245 ms returned []
[2023-04-07 09:39:59] [INFO ] Invariant cache hit.
[2023-04-07 09:39:59] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 09:39:59] [INFO ] Implicit Places using invariants and state equation in 682 ms returned []
Implicit Place search using SMT with State Equation took 944 ms to find 0 implicit places.
[2023-04-07 09:40:00] [INFO ] Invariant cache hit.
[2023-04-07 09:40:00] [INFO ] Dead Transitions using invariants and state equation in 323 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1275 ms. Remains : 178/178 places, 322/322 transitions.
Treatment of property Anderson-PT-08-LTLCardinality-13 finished in 9837 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))'
[2023-04-07 09:40:00] [INFO ] Flatten gal took : 63 ms
[2023-04-07 09:40:00] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-04-07 09:40:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 295 places, 481 transitions and 1676 arcs took 4 ms.
Total runtime 55569 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1268/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1268/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Anderson-PT-08-LTLCardinality-13
Could not compute solution for formula : Anderson-PT-08-LTLCardinality-15

BK_STOP 1680860402357

--------------------
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:
++ 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
++ sed s/.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
mcc2023
ltl formula name Anderson-PT-08-LTLCardinality-13
ltl formula formula --ltl=/tmp/1268/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 295 places, 481 transitions and 1676 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.110 real 0.010 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1268/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1268/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1268/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1268/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name Anderson-PT-08-LTLCardinality-15
ltl formula formula --ltl=/tmp/1268/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 295 places, 481 transitions and 1676 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1268/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1268/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.180 real 0.030 user 0.040 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1268/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1268/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x556ed96243f4]
1: pnml2lts-mc(+0xa2496) [0x556ed9624496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fbcb70c0140]
3: pnml2lts-mc(+0x405be5) [0x556ed9987be5]
4: pnml2lts-mc(+0x16b3f9) [0x556ed96ed3f9]
5: pnml2lts-mc(+0x164ac4) [0x556ed96e6ac4]
6: pnml2lts-mc(+0x272e0a) [0x556ed97f4e0a]
7: pnml2lts-mc(+0xb61f0) [0x556ed96381f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7fbcb6f134d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7fbcb6f1367a]
10: pnml2lts-mc(+0xa1581) [0x556ed9623581]
11: pnml2lts-mc(+0xa1910) [0x556ed9623910]
12: pnml2lts-mc(+0xa32a2) [0x556ed96252a2]
13: pnml2lts-mc(+0xa50f4) [0x556ed96270f4]
14: pnml2lts-mc(+0xa516b) [0x556ed962716b]
15: pnml2lts-mc(+0x3f34b3) [0x556ed99754b3]
16: pnml2lts-mc(+0x7c63d) [0x556ed95fe63d]
17: pnml2lts-mc(+0x67d86) [0x556ed95e9d86]
18: pnml2lts-mc(+0x60a8a) [0x556ed95e2a8a]
19: pnml2lts-mc(+0x5eb15) [0x556ed95e0b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7fbcb6efbd0a]
21: pnml2lts-mc(+0x6075e) [0x556ed95e275e]

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is 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 r521-tall-167987246100035"
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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;