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.r103-tall-167814478300451.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 DES-PT-30b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r103-tall-167814478300451
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 7.1K Feb 26 15:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 15:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 26 15:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 15:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Feb 26 15:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 15:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 26 15:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 103K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DES-PT-30b-LTLCardinality-00
FORMULA_NAME DES-PT-30b-LTLCardinality-01
FORMULA_NAME DES-PT-30b-LTLCardinality-02
FORMULA_NAME DES-PT-30b-LTLCardinality-03
FORMULA_NAME DES-PT-30b-LTLCardinality-04
FORMULA_NAME DES-PT-30b-LTLCardinality-05
FORMULA_NAME DES-PT-30b-LTLCardinality-06
FORMULA_NAME DES-PT-30b-LTLCardinality-07
FORMULA_NAME DES-PT-30b-LTLCardinality-08
FORMULA_NAME DES-PT-30b-LTLCardinality-09
FORMULA_NAME DES-PT-30b-LTLCardinality-10
FORMULA_NAME DES-PT-30b-LTLCardinality-11
FORMULA_NAME DES-PT-30b-LTLCardinality-12
FORMULA_NAME DES-PT-30b-LTLCardinality-13
FORMULA_NAME DES-PT-30b-LTLCardinality-14
FORMULA_NAME DES-PT-30b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678252476236

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=DES-PT-30b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 05:14:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 05:14:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 05:14:38] [INFO ] Load time of PNML (sax parser for PT used): 258 ms
[2023-03-08 05:14:38] [INFO ] Transformed 399 places.
[2023-03-08 05:14:38] [INFO ] Transformed 350 transitions.
[2023-03-08 05:14:38] [INFO ] Found NUPN structural information;
[2023-03-08 05:14:38] [INFO ] Parsed PT model containing 399 places and 350 transitions and 1143 arcs in 326 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA DES-PT-30b-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30b-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30b-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30b-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30b-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30b-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30b-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 399 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 399/399 places, 350/350 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 396 transition count 350
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 28 place count 371 transition count 325
Iterating global reduction 1 with 25 rules applied. Total rules applied 53 place count 371 transition count 325
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 68 place count 356 transition count 310
Iterating global reduction 1 with 15 rules applied. Total rules applied 83 place count 356 transition count 310
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 95 place count 356 transition count 298
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 96 place count 355 transition count 297
Iterating global reduction 2 with 1 rules applied. Total rules applied 97 place count 355 transition count 297
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 98 place count 355 transition count 296
Applied a total of 98 rules in 111 ms. Remains 355 /399 variables (removed 44) and now considering 296/350 (removed 54) transitions.
// Phase 1: matrix 296 rows 355 cols
[2023-03-08 05:14:38] [INFO ] Computed 62 place invariants in 34 ms
[2023-03-08 05:14:38] [INFO ] Implicit Places using invariants in 333 ms returned []
[2023-03-08 05:14:38] [INFO ] Invariant cache hit.
[2023-03-08 05:14:39] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 733 ms to find 0 implicit places.
[2023-03-08 05:14:39] [INFO ] Invariant cache hit.
[2023-03-08 05:14:39] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 355/399 places, 296/350 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1014 ms. Remains : 355/399 places, 296/350 transitions.
Support contains 18 out of 355 places after structural reductions.
[2023-03-08 05:14:39] [INFO ] Flatten gal took : 45 ms
[2023-03-08 05:14:39] [INFO ] Flatten gal took : 25 ms
[2023-03-08 05:14:39] [INFO ] Input system was already deterministic with 296 transitions.
Incomplete random walk after 10000 steps, including 85 resets, run finished after 282 ms. (steps per millisecond=35 ) properties (out of 10) seen :8
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 05:14:39] [INFO ] Invariant cache hit.
[2023-03-08 05:14:39] [INFO ] [Real]Absence check using 33 positive place invariants in 7 ms returned sat
[2023-03-08 05:14:39] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 32 ms returned sat
[2023-03-08 05:14:39] [INFO ] After 202ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 05:14:40] [INFO ] [Nat]Absence check using 33 positive place invariants in 26 ms returned sat
[2023-03-08 05:14:40] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 25 ms returned sat
[2023-03-08 05:14:40] [INFO ] After 179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 05:14:40] [INFO ] After 251ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-08 05:14:40] [INFO ] After 456ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 57 ms.
Support contains 2 out of 355 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 355/355 places, 296/296 transitions.
Graph (complete) has 770 edges and 355 vertex of which 348 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 348 transition count 273
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 37 place count 331 transition count 273
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 37 place count 331 transition count 262
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 59 place count 320 transition count 262
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 319 transition count 261
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 319 transition count 261
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 319 transition count 260
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 62 place count 319 transition count 259
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 64 place count 318 transition count 259
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 218 place count 241 transition count 182
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 222 place count 239 transition count 184
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 223 place count 239 transition count 183
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 224 place count 238 transition count 183
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 225 place count 238 transition count 183
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 226 place count 237 transition count 182
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 227 place count 236 transition count 182
Applied a total of 227 rules in 120 ms. Remains 236 /355 variables (removed 119) and now considering 182/296 (removed 114) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 236/355 places, 182/296 transitions.
Incomplete random walk after 10000 steps, including 483 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 87 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1196233 steps, run timeout after 3001 ms. (steps per millisecond=398 ) properties seen :{}
Probabilistic random walk after 1196233 steps, saw 165795 distinct states, run finished after 3003 ms. (steps per millisecond=398 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 182 rows 236 cols
[2023-03-08 05:14:43] [INFO ] Computed 60 place invariants in 7 ms
[2023-03-08 05:14:43] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 05:14:43] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 23 ms returned sat
[2023-03-08 05:14:44] [INFO ] After 94ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-08 05:14:44] [INFO ] After 114ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-08 05:14:44] [INFO ] After 231ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2023-03-08 05:14:44] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 05:14:44] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2023-03-08 05:14:44] [INFO ] After 129ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 05:14:44] [INFO ] After 162ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-08 05:14:44] [INFO ] After 315ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 22 ms.
Support contains 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 7 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 236/236 places, 182/182 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 9 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2023-03-08 05:14:44] [INFO ] Invariant cache hit.
[2023-03-08 05:14:44] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-08 05:14:44] [INFO ] Invariant cache hit.
[2023-03-08 05:14:44] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
[2023-03-08 05:14:44] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-08 05:14:44] [INFO ] Invariant cache hit.
[2023-03-08 05:14:44] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 512 ms. Remains : 236/236 places, 182/182 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 236 transition count 182
Applied a total of 1 rules in 14 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 182 rows 236 cols
[2023-03-08 05:14:44] [INFO ] Computed 60 place invariants in 5 ms
[2023-03-08 05:14:45] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 05:14:45] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2023-03-08 05:14:45] [INFO ] After 69ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-08 05:14:45] [INFO ] After 111ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-08 05:14:45] [INFO ] After 245ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2023-03-08 05:14:45] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 05:14:45] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 19 ms returned sat
[2023-03-08 05:14:45] [INFO ] After 172ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 05:14:45] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 0 ms to minimize.
[2023-03-08 05:14:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2023-03-08 05:14:45] [INFO ] After 345ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-08 05:14:45] [INFO ] After 520ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA DES-PT-30b-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 176 stabilizing places and 168 stable transitions
Graph (complete) has 770 edges and 355 vertex of which 348 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.9 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||G(p1)))))'
Support contains 3 out of 355 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 355/355 places, 296/296 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 353 transition count 294
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 353 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 353 transition count 293
Applied a total of 5 rules in 13 ms. Remains 353 /355 variables (removed 2) and now considering 293/296 (removed 3) transitions.
// Phase 1: matrix 293 rows 353 cols
[2023-03-08 05:14:45] [INFO ] Computed 62 place invariants in 4 ms
[2023-03-08 05:14:46] [INFO ] Implicit Places using invariants in 198 ms returned []
[2023-03-08 05:14:46] [INFO ] Invariant cache hit.
[2023-03-08 05:14:46] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 538 ms to find 0 implicit places.
[2023-03-08 05:14:46] [INFO ] Invariant cache hit.
[2023-03-08 05:14:46] [INFO ] Dead Transitions using invariants and state equation in 238 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 353/355 places, 293/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 791 ms. Remains : 353/355 places, 293/296 transitions.
Stuttering acceptance computed with spot in 335 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-30b-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p1:(OR (EQ s240 0) (EQ s337 1)), p0:(EQ s126 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 73 steps with 0 reset in 4 ms.
FORMULA DES-PT-30b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLCardinality-00 finished in 1202 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 355 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 355/355 places, 296/296 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 353 transition count 294
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 353 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 353 transition count 293
Applied a total of 5 rules in 21 ms. Remains 353 /355 variables (removed 2) and now considering 293/296 (removed 3) transitions.
[2023-03-08 05:14:47] [INFO ] Invariant cache hit.
[2023-03-08 05:14:47] [INFO ] Implicit Places using invariants in 294 ms returned []
[2023-03-08 05:14:47] [INFO ] Invariant cache hit.
[2023-03-08 05:14:47] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 666 ms to find 0 implicit places.
[2023-03-08 05:14:47] [INFO ] Invariant cache hit.
[2023-03-08 05:14:47] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 353/355 places, 293/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 849 ms. Remains : 353/355 places, 293/296 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-30b-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s76 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 148 steps with 0 reset in 3 ms.
FORMULA DES-PT-30b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLCardinality-02 finished in 975 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p0 U p1)))))'
Support contains 4 out of 355 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 355/355 places, 296/296 transitions.
Graph (complete) has 770 edges and 355 vertex of which 348 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 347 transition count 277
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 333 transition count 276
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 332 transition count 276
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 31 place count 332 transition count 266
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 51 place count 322 transition count 266
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 52 place count 321 transition count 265
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 321 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 54 place count 321 transition count 264
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 54 place count 321 transition count 263
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 56 place count 320 transition count 263
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 4 with 152 rules applied. Total rules applied 208 place count 244 transition count 187
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 212 place count 242 transition count 189
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 214 place count 240 transition count 187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 215 place count 239 transition count 187
Applied a total of 215 rules in 75 ms. Remains 239 /355 variables (removed 116) and now considering 187/296 (removed 109) transitions.
// Phase 1: matrix 187 rows 239 cols
[2023-03-08 05:14:48] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-08 05:14:48] [INFO ] Implicit Places using invariants in 132 ms returned []
[2023-03-08 05:14:48] [INFO ] Invariant cache hit.
[2023-03-08 05:14:48] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
[2023-03-08 05:14:48] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-08 05:14:48] [INFO ] Invariant cache hit.
[2023-03-08 05:14:48] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 239/355 places, 187/296 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 593 ms. Remains : 239/355 places, 187/296 transitions.
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DES-PT-30b-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s166 0) (EQ s206 1)), p1:(AND (OR (EQ s41 0) (EQ s169 1)) (OR (EQ s166 0) (EQ s206 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5133 reset in 289 ms.
Product exploration explored 100000 steps with 5131 reset in 291 ms.
Computed a total of 134 stabilizing places and 129 stable transitions
Computed a total of 134 stabilizing places and 129 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 276 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 517 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 79 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 05:14:49] [INFO ] Invariant cache hit.
[2023-03-08 05:14:49] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:14:49] [INFO ] [Nat]Absence check using 33 positive place invariants in 3 ms returned sat
[2023-03-08 05:14:49] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 62 ms returned sat
[2023-03-08 05:14:49] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:14:50] [INFO ] After 101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-08 05:14:50] [INFO ] After 240ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 4 out of 239 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 187/187 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 239 transition count 186
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 239 transition count 185
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 238 transition count 185
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 238 transition count 185
Applied a total of 4 rules in 22 ms. Remains 238 /239 variables (removed 1) and now considering 185/187 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 238/239 places, 185/187 transitions.
Incomplete random walk after 10000 steps, including 506 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1686505 steps, run timeout after 3001 ms. (steps per millisecond=561 ) properties seen :{}
Probabilistic random walk after 1686505 steps, saw 234051 distinct states, run finished after 3003 ms. (steps per millisecond=561 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 238 cols
[2023-03-08 05:14:53] [INFO ] Computed 59 place invariants in 15 ms
[2023-03-08 05:14:53] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:14:53] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 05:14:53] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 51 ms returned sat
[2023-03-08 05:14:53] [INFO ] After 146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:14:53] [INFO ] After 180ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-08 05:14:53] [INFO ] After 303ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 238 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 185/185 transitions.
Applied a total of 0 rules in 6 ms. Remains 238 /238 variables (removed 0) and now considering 185/185 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 238/238 places, 185/185 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 185/185 transitions.
Applied a total of 0 rules in 6 ms. Remains 238 /238 variables (removed 0) and now considering 185/185 (removed 0) transitions.
[2023-03-08 05:14:53] [INFO ] Invariant cache hit.
[2023-03-08 05:14:53] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-08 05:14:53] [INFO ] Invariant cache hit.
[2023-03-08 05:14:53] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
[2023-03-08 05:14:53] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 05:14:53] [INFO ] Invariant cache hit.
[2023-03-08 05:14:54] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 586 ms. Remains : 238/238 places, 185/185 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 238 transition count 185
Applied a total of 1 rules in 10 ms. Remains 238 /238 variables (removed 0) and now considering 185/185 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 238 cols
[2023-03-08 05:14:54] [INFO ] Computed 59 place invariants in 3 ms
[2023-03-08 05:14:54] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:14:54] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:14:54] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 56 ms returned sat
[2023-03-08 05:14:54] [INFO ] After 154ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:14:54] [INFO ] After 177ms 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-03-08 05:14:54] [INFO ] After 305ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 284 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 239 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 239/239 places, 187/187 transitions.
Applied a total of 0 rules in 11 ms. Remains 239 /239 variables (removed 0) and now considering 187/187 (removed 0) transitions.
// Phase 1: matrix 187 rows 239 cols
[2023-03-08 05:14:54] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 05:14:55] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-08 05:14:55] [INFO ] Invariant cache hit.
[2023-03-08 05:14:55] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
[2023-03-08 05:14:55] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:14:55] [INFO ] Invariant cache hit.
[2023-03-08 05:14:55] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 509 ms. Remains : 239/239 places, 187/187 transitions.
Computed a total of 134 stabilizing places and 129 stable transitions
Computed a total of 134 stabilizing places and 129 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 277 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 499 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 05:14:55] [INFO ] Invariant cache hit.
[2023-03-08 05:14:55] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:14:55] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 05:14:55] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 62 ms returned sat
[2023-03-08 05:14:56] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:14:56] [INFO ] After 91ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-08 05:14:56] [INFO ] After 229ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 4 out of 239 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 187/187 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 239 transition count 186
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 239 transition count 185
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 238 transition count 185
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 238 transition count 185
Applied a total of 4 rules in 21 ms. Remains 238 /239 variables (removed 1) and now considering 185/187 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 238/239 places, 185/187 transitions.
Incomplete random walk after 10000 steps, including 535 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1754699 steps, run timeout after 3001 ms. (steps per millisecond=584 ) properties seen :{}
Probabilistic random walk after 1754699 steps, saw 242910 distinct states, run finished after 3001 ms. (steps per millisecond=584 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 238 cols
[2023-03-08 05:14:59] [INFO ] Computed 59 place invariants in 3 ms
[2023-03-08 05:14:59] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:14:59] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:14:59] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 51 ms returned sat
[2023-03-08 05:14:59] [INFO ] After 143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:14:59] [INFO ] After 172ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-08 05:14:59] [INFO ] After 291ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 238 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 185/185 transitions.
Applied a total of 0 rules in 5 ms. Remains 238 /238 variables (removed 0) and now considering 185/185 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 238/238 places, 185/185 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 185/185 transitions.
Applied a total of 0 rules in 5 ms. Remains 238 /238 variables (removed 0) and now considering 185/185 (removed 0) transitions.
[2023-03-08 05:14:59] [INFO ] Invariant cache hit.
[2023-03-08 05:14:59] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-08 05:14:59] [INFO ] Invariant cache hit.
[2023-03-08 05:14:59] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
[2023-03-08 05:14:59] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:14:59] [INFO ] Invariant cache hit.
[2023-03-08 05:15:00] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 486 ms. Remains : 238/238 places, 185/185 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 238 transition count 185
Applied a total of 1 rules in 8 ms. Remains 238 /238 variables (removed 0) and now considering 185/185 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 238 cols
[2023-03-08 05:15:00] [INFO ] Computed 59 place invariants in 4 ms
[2023-03-08 05:15:00] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:15:00] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:15:00] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 51 ms returned sat
[2023-03-08 05:15:00] [INFO ] After 156ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:15:00] [INFO ] After 176ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-08 05:15:00] [INFO ] After 296ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 248 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 5162 reset in 227 ms.
Product exploration explored 100000 steps with 5144 reset in 290 ms.
Support contains 4 out of 239 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 239/239 places, 187/187 transitions.
Applied a total of 0 rules in 5 ms. Remains 239 /239 variables (removed 0) and now considering 187/187 (removed 0) transitions.
// Phase 1: matrix 187 rows 239 cols
[2023-03-08 05:15:01] [INFO ] Computed 58 place invariants in 5 ms
[2023-03-08 05:15:01] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-08 05:15:01] [INFO ] Invariant cache hit.
[2023-03-08 05:15:01] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
[2023-03-08 05:15:01] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:15:01] [INFO ] Invariant cache hit.
[2023-03-08 05:15:01] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 485 ms. Remains : 239/239 places, 187/187 transitions.
Treatment of property DES-PT-30b-LTLCardinality-04 finished in 13881 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||F(p1))))'
Support contains 3 out of 355 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 355/355 places, 296/296 transitions.
Graph (complete) has 770 edges and 355 vertex of which 348 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 347 transition count 277
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 333 transition count 276
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 332 transition count 276
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 31 place count 332 transition count 265
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 53 place count 321 transition count 265
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 205 place count 245 transition count 189
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 211 place count 242 transition count 192
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 213 place count 240 transition count 190
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 214 place count 239 transition count 190
Applied a total of 214 rules in 32 ms. Remains 239 /355 variables (removed 116) and now considering 190/296 (removed 106) transitions.
// Phase 1: matrix 190 rows 239 cols
[2023-03-08 05:15:01] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 05:15:02] [INFO ] Implicit Places using invariants in 117 ms returned []
[2023-03-08 05:15:02] [INFO ] Invariant cache hit.
[2023-03-08 05:15:02] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
[2023-03-08 05:15:02] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:15:02] [INFO ] Invariant cache hit.
[2023-03-08 05:15:02] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 239/355 places, 190/296 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 479 ms. Remains : 239/355 places, 190/296 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DES-PT-30b-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s100 0), p1:(AND (EQ s130 0) (EQ s194 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 4896 reset in 189 ms.
Product exploration explored 100000 steps with 4855 reset in 222 ms.
Computed a total of 134 stabilizing places and 129 stable transitions
Computed a total of 134 stabilizing places and 129 stable transitions
Detected a total of 134/239 stabilizing places and 129/190 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 475 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 05:15:03] [INFO ] Invariant cache hit.
[2023-03-08 05:15:03] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:15:03] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 05:15:03] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 35 ms returned sat
[2023-03-08 05:15:03] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:15:03] [INFO ] After 125ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-08 05:15:03] [INFO ] After 292ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 239 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 190/190 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 239 transition count 189
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 239 transition count 188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 238 transition count 188
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 238 transition count 187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 237 transition count 187
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 6 place count 237 transition count 187
Applied a total of 6 rules in 31 ms. Remains 237 /239 variables (removed 2) and now considering 187/190 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 237/239 places, 187/190 transitions.
Incomplete random walk after 10000 steps, including 506 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1772026 steps, run timeout after 3001 ms. (steps per millisecond=590 ) properties seen :{}
Probabilistic random walk after 1772026 steps, saw 232397 distinct states, run finished after 3001 ms. (steps per millisecond=590 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 187 rows 237 cols
[2023-03-08 05:15:06] [INFO ] Computed 59 place invariants in 5 ms
[2023-03-08 05:15:06] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:15:06] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:15:06] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 32 ms returned sat
[2023-03-08 05:15:06] [INFO ] After 132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:15:06] [INFO ] After 149ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-08 05:15:06] [INFO ] After 265ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 187/187 transitions.
Applied a total of 0 rules in 8 ms. Remains 237 /237 variables (removed 0) and now considering 187/187 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 237/237 places, 187/187 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 187/187 transitions.
Applied a total of 0 rules in 7 ms. Remains 237 /237 variables (removed 0) and now considering 187/187 (removed 0) transitions.
[2023-03-08 05:15:06] [INFO ] Invariant cache hit.
[2023-03-08 05:15:07] [INFO ] Implicit Places using invariants in 184 ms returned []
[2023-03-08 05:15:07] [INFO ] Invariant cache hit.
[2023-03-08 05:15:07] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
[2023-03-08 05:15:07] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 05:15:07] [INFO ] Invariant cache hit.
[2023-03-08 05:15:07] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 558 ms. Remains : 237/237 places, 187/187 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 237 transition count 187
Applied a total of 1 rules in 9 ms. Remains 237 /237 variables (removed 0) and now considering 187/187 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 187 rows 237 cols
[2023-03-08 05:15:07] [INFO ] Computed 59 place invariants in 1 ms
[2023-03-08 05:15:07] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:15:07] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 05:15:07] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 32 ms returned sat
[2023-03-08 05:15:07] [INFO ] After 152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:15:07] [INFO ] After 169ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-08 05:15:07] [INFO ] After 295ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 176 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 239 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 239/239 places, 190/190 transitions.
Applied a total of 0 rules in 13 ms. Remains 239 /239 variables (removed 0) and now considering 190/190 (removed 0) transitions.
// Phase 1: matrix 190 rows 239 cols
[2023-03-08 05:15:08] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 05:15:08] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-08 05:15:08] [INFO ] Invariant cache hit.
[2023-03-08 05:15:08] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
[2023-03-08 05:15:08] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 05:15:08] [INFO ] Invariant cache hit.
[2023-03-08 05:15:08] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 506 ms. Remains : 239/239 places, 190/190 transitions.
Computed a total of 134 stabilizing places and 129 stable transitions
Computed a total of 134 stabilizing places and 129 stable transitions
Detected a total of 134/239 stabilizing places and 129/190 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 470 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 05:15:08] [INFO ] Invariant cache hit.
[2023-03-08 05:15:08] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:15:09] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 05:15:09] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 35 ms returned sat
[2023-03-08 05:15:09] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:15:09] [INFO ] After 123ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-08 05:15:09] [INFO ] After 301ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 239 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 190/190 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 239 transition count 189
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 239 transition count 188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 238 transition count 188
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 238 transition count 187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 237 transition count 187
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 6 place count 237 transition count 187
Applied a total of 6 rules in 18 ms. Remains 237 /239 variables (removed 2) and now considering 187/190 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 237/239 places, 187/190 transitions.
Incomplete random walk after 10000 steps, including 487 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1737381 steps, run timeout after 3001 ms. (steps per millisecond=578 ) properties seen :{}
Probabilistic random walk after 1737381 steps, saw 228305 distinct states, run finished after 3001 ms. (steps per millisecond=578 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 187 rows 237 cols
[2023-03-08 05:15:12] [INFO ] Computed 59 place invariants in 5 ms
[2023-03-08 05:15:12] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:15:12] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:15:12] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 31 ms returned sat
[2023-03-08 05:15:12] [INFO ] After 127ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:15:12] [INFO ] After 142ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-08 05:15:12] [INFO ] After 261ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 187/187 transitions.
Applied a total of 0 rules in 4 ms. Remains 237 /237 variables (removed 0) and now considering 187/187 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 237/237 places, 187/187 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 187/187 transitions.
Applied a total of 0 rules in 4 ms. Remains 237 /237 variables (removed 0) and now considering 187/187 (removed 0) transitions.
[2023-03-08 05:15:12] [INFO ] Invariant cache hit.
[2023-03-08 05:15:12] [INFO ] Implicit Places using invariants in 253 ms returned []
[2023-03-08 05:15:12] [INFO ] Invariant cache hit.
[2023-03-08 05:15:13] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
[2023-03-08 05:15:13] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 05:15:13] [INFO ] Invariant cache hit.
[2023-03-08 05:15:13] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 695 ms. Remains : 237/237 places, 187/187 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 237 transition count 187
Applied a total of 1 rules in 8 ms. Remains 237 /237 variables (removed 0) and now considering 187/187 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 187 rows 237 cols
[2023-03-08 05:15:13] [INFO ] Computed 59 place invariants in 2 ms
[2023-03-08 05:15:13] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:15:13] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:15:13] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 32 ms returned sat
[2023-03-08 05:15:13] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:15:13] [INFO ] After 179ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-08 05:15:13] [INFO ] After 360ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 157 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 4805 reset in 202 ms.
Product exploration explored 100000 steps with 4816 reset in 244 ms.
Support contains 3 out of 239 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 239/239 places, 190/190 transitions.
Applied a total of 0 rules in 5 ms. Remains 239 /239 variables (removed 0) and now considering 190/190 (removed 0) transitions.
// Phase 1: matrix 190 rows 239 cols
[2023-03-08 05:15:14] [INFO ] Computed 58 place invariants in 18 ms
[2023-03-08 05:15:14] [INFO ] Implicit Places using invariants in 265 ms returned []
[2023-03-08 05:15:14] [INFO ] Invariant cache hit.
[2023-03-08 05:15:15] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 528 ms to find 0 implicit places.
[2023-03-08 05:15:15] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:15:15] [INFO ] Invariant cache hit.
[2023-03-08 05:15:15] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 655 ms. Remains : 239/239 places, 190/190 transitions.
Treatment of property DES-PT-30b-LTLCardinality-06 finished in 13409 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 355 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 355/355 places, 296/296 transitions.
Graph (complete) has 770 edges and 355 vertex of which 353 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 352 transition count 278
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 337 transition count 278
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 31 place count 337 transition count 267
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 53 place count 326 transition count 267
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 325 transition count 266
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 325 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 325 transition count 265
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 56 place count 325 transition count 264
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 58 place count 324 transition count 264
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 202 place count 252 transition count 192
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 206 place count 250 transition count 194
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 207 place count 250 transition count 194
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 209 place count 248 transition count 192
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 210 place count 247 transition count 192
Applied a total of 210 rules in 64 ms. Remains 247 /355 variables (removed 108) and now considering 192/296 (removed 104) transitions.
// Phase 1: matrix 192 rows 247 cols
[2023-03-08 05:15:15] [INFO ] Computed 61 place invariants in 2 ms
[2023-03-08 05:15:15] [INFO ] Implicit Places using invariants in 276 ms returned []
[2023-03-08 05:15:15] [INFO ] Invariant cache hit.
[2023-03-08 05:15:16] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 598 ms to find 0 implicit places.
[2023-03-08 05:15:16] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:15:16] [INFO ] Invariant cache hit.
[2023-03-08 05:15:16] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 247/355 places, 192/296 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 796 ms. Remains : 247/355 places, 192/296 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-30b-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (EQ s139 0) (EQ s182 1)) (AND (EQ s93 0) (EQ s200 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]]
Stuttering criterion allowed to conclude after 1359 steps with 250 reset in 9 ms.
FORMULA DES-PT-30b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLCardinality-13 finished in 850 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 355 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 355/355 places, 296/296 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 353 transition count 294
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 353 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 353 transition count 293
Applied a total of 5 rules in 18 ms. Remains 353 /355 variables (removed 2) and now considering 293/296 (removed 3) transitions.
// Phase 1: matrix 293 rows 353 cols
[2023-03-08 05:15:16] [INFO ] Computed 62 place invariants in 6 ms
[2023-03-08 05:15:16] [INFO ] Implicit Places using invariants in 159 ms returned []
[2023-03-08 05:15:16] [INFO ] Invariant cache hit.
[2023-03-08 05:15:16] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 510 ms to find 0 implicit places.
[2023-03-08 05:15:16] [INFO ] Invariant cache hit.
[2023-03-08 05:15:16] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 353/355 places, 293/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 678 ms. Remains : 353/355 places, 293/296 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : DES-PT-30b-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s99 0) (EQ s131 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-30b-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30b-LTLCardinality-14 finished in 822 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p0 U p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||F(p1))))'
[2023-03-08 05:15:17] [INFO ] Flatten gal took : 22 ms
[2023-03-08 05:15:17] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-08 05:15:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 355 places, 296 transitions and 1005 arcs took 2 ms.
Total runtime 39603 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DES-PT-30b
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLCardinality

FORMULA DES-PT-30b-LTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-30b-LTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678252520033

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/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: LAUNCH task # 1 (type EXCL) for 0 DES-PT-30b-LTLCardinality-04
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for DES-PT-30b-LTLCardinality-04
lola: result : false
lola: markings : 258561
lola: fired transitions : 358294
lola: time used : 1.000000
lola: memory pages used : 2
lola: LAUNCH task # 4 (type EXCL) for 3 DES-PT-30b-LTLCardinality-06
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for DES-PT-30b-LTLCardinality-06
lola: result : false
lola: markings : 332606
lola: fired transitions : 378850
lola: time used : 1.000000
lola: memory pages used : 3
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-30b-LTLCardinality-04: LTL false LTL model checker
DES-PT-30b-LTLCardinality-06: LTL false LTL model checker


Time elapsed: 2 secs. Pages in use: 3

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="DES-PT-30b"
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 DES-PT-30b, 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 r103-tall-167814478300451"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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