Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r519-tall-167987244700027.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is Anderson-PT-07, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r519-tall-167987244700027
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 924K
-rw-r--r-- 1 mcc users 7.6K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K 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 11K Mar 23 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Mar 23 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Mar 23 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Mar 23 15:20 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 461K 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-07-LTLCardinality-00
FORMULA_NAME Anderson-PT-07-LTLCardinality-01
FORMULA_NAME Anderson-PT-07-LTLCardinality-02
FORMULA_NAME Anderson-PT-07-LTLCardinality-03
FORMULA_NAME Anderson-PT-07-LTLCardinality-04
FORMULA_NAME Anderson-PT-07-LTLCardinality-05
FORMULA_NAME Anderson-PT-07-LTLCardinality-06
FORMULA_NAME Anderson-PT-07-LTLCardinality-07
FORMULA_NAME Anderson-PT-07-LTLCardinality-08
FORMULA_NAME Anderson-PT-07-LTLCardinality-09
FORMULA_NAME Anderson-PT-07-LTLCardinality-10
FORMULA_NAME Anderson-PT-07-LTLCardinality-11
FORMULA_NAME Anderson-PT-07-LTLCardinality-12
FORMULA_NAME Anderson-PT-07-LTLCardinality-13
FORMULA_NAME Anderson-PT-07-LTLCardinality-14
FORMULA_NAME Anderson-PT-07-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680827683013

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-07
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2023-04-07 00:34:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 00:34:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 00:34:44] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2023-04-07 00:34:44] [INFO ] Transformed 309 places.
[2023-04-07 00:34:44] [INFO ] Transformed 917 transitions.
[2023-04-07 00:34:44] [INFO ] Found NUPN structural information;
[2023-04-07 00:34:44] [INFO ] Parsed PT model containing 309 places and 917 transitions and 3500 arcs in 155 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA Anderson-PT-07-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-07-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-07-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-07-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-07-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-07-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 309 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 917/917 transitions.
Discarding 68 places :
Symmetric choice reduction at 0 with 68 rule applications. Total rules 68 place count 241 transition count 441
Iterating global reduction 0 with 68 rules applied. Total rules applied 136 place count 241 transition count 441
Applied a total of 136 rules in 53 ms. Remains 241 /309 variables (removed 68) and now considering 441/917 (removed 476) transitions.
// Phase 1: matrix 441 rows 241 cols
[2023-04-07 00:34:44] [INFO ] Computed 17 invariants in 39 ms
[2023-04-07 00:34:45] [INFO ] Implicit Places using invariants in 479 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 504 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/309 places, 441/917 transitions.
Applied a total of 0 rules in 7 ms. Remains 240 /240 variables (removed 0) and now considering 441/441 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 564 ms. Remains : 240/309 places, 441/917 transitions.
Support contains 33 out of 240 places after structural reductions.
[2023-04-07 00:34:45] [INFO ] Flatten gal took : 67 ms
[2023-04-07 00:34:45] [INFO ] Flatten gal took : 33 ms
[2023-04-07 00:34:45] [INFO ] Input system was already deterministic with 441 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 370 ms. (steps per millisecond=27 ) properties (out of 20) seen :17
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 441 rows 240 cols
[2023-04-07 00:34:46] [INFO ] Computed 16 invariants in 6 ms
[2023-04-07 00:34:46] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-04-07 00:34:46] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2023-04-07 00:34:46] [INFO ] [Nat]Absence check using 9 positive and 7 generalized place invariants in 9 ms returned sat
[2023-04-07 00:34:46] [INFO ] After 168ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-04-07 00:34:46] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-04-07 00:34:46] [INFO ] After 115ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-04-07 00:34:46] [INFO ] After 246ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 92 ms.
[2023-04-07 00:34:46] [INFO ] After 616ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 441/441 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 240 transition count 393
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 192 transition count 393
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 96 place count 192 transition count 354
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 174 place count 153 transition count 354
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 188 place count 139 transition count 244
Iterating global reduction 2 with 14 rules applied. Total rules applied 202 place count 139 transition count 244
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 206 place count 137 transition count 242
Applied a total of 206 rules in 43 ms. Remains 137 /240 variables (removed 103) and now considering 242/441 (removed 199) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 137/240 places, 242/441 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 242 rows 137 cols
[2023-04-07 00:34:47] [INFO ] Computed 16 invariants in 2 ms
[2023-04-07 00:34:47] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 00:34:47] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2023-04-07 00:34:47] [INFO ] [Nat]Absence check using 9 positive and 7 generalized place invariants in 7 ms returned sat
[2023-04-07 00:34:47] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 00:34:47] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-04-07 00:34:47] [INFO ] After 35ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 00:34:47] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-04-07 00:34:47] [INFO ] After 179ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 242/242 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 137 transition count 241
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 136 transition count 241
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 135 transition count 240
Applied a total of 4 rules in 16 ms. Remains 135 /137 variables (removed 2) and now considering 240/242 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 135/137 places, 240/242 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3643 steps, run visited all 1 properties in 24 ms. (steps per millisecond=151 )
Probabilistic random walk after 3643 steps, saw 2669 distinct states, run finished after 24 ms. (steps per millisecond=151 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
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' '!((F(p0)&&X((F(G(p1))||(p2 U X(p3))))))'
Support contains 6 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 441/441 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 228 transition count 369
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 228 transition count 369
Applied a total of 24 rules in 10 ms. Remains 228 /240 variables (removed 12) and now considering 369/441 (removed 72) transitions.
// Phase 1: matrix 369 rows 228 cols
[2023-04-07 00:34:47] [INFO ] Computed 16 invariants in 6 ms
[2023-04-07 00:34:47] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-04-07 00:34:47] [INFO ] Invariant cache hit.
[2023-04-07 00:34:48] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-04-07 00:34:48] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 622 ms to find 0 implicit places.
[2023-04-07 00:34:48] [INFO ] Invariant cache hit.
[2023-04-07 00:34:48] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 228/240 places, 369/441 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 832 ms. Remains : 228/240 places, 369/441 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 411 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (NOT p1)]
Running random walk in product with property : Anderson-PT-07-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=p2, acceptance={} source=2 dest: 4}], [{ cond=(NOT p3), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 5}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s29 0) (EQ s25 1)), p2:(OR (EQ s214 0) (EQ s22 1)), p3:(OR (EQ s73 0) (EQ s109 1)), p1:(AND (EQ s25 0) (EQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 357 ms.
Product exploration explored 100000 steps with 33333 reset in 294 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 p2 p3 (NOT p1)), (X p0), (X p2), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X p0)), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X p3))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 35 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-07-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-07-LTLCardinality-01 finished in 1999 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(p0))||G(p1)))'
Support contains 4 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 441/441 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 226 transition count 343
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 226 transition count 343
Applied a total of 28 rules in 6 ms. Remains 226 /240 variables (removed 14) and now considering 343/441 (removed 98) transitions.
// Phase 1: matrix 343 rows 226 cols
[2023-04-07 00:34:49] [INFO ] Computed 16 invariants in 3 ms
[2023-04-07 00:34:49] [INFO ] Implicit Places using invariants in 117 ms returned []
[2023-04-07 00:34:49] [INFO ] Invariant cache hit.
[2023-04-07 00:34:49] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-04-07 00:34:50] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
[2023-04-07 00:34:50] [INFO ] Invariant cache hit.
[2023-04-07 00:34:50] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 226/240 places, 343/441 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 808 ms. Remains : 226/240 places, 343/441 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-07-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s221 0) (EQ s78 1)), p1:(OR (EQ s160 0) (EQ s22 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]]
Product exploration explored 100000 steps with 50000 reset in 289 ms.
Product exploration explored 100000 steps with 50000 reset in 297 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), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 17 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-07-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-07-LTLCardinality-02 finished in 1560 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||G(p1))))'
Support contains 4 out of 240 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 240/240 places, 441/441 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 240 transition count 394
Reduce places removed 47 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 48 rules applied. Total rules applied 95 place count 193 transition count 393
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 96 place count 192 transition count 393
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 96 place count 192 transition count 353
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 176 place count 152 transition count 353
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 189 place count 139 transition count 256
Iterating global reduction 3 with 13 rules applied. Total rules applied 202 place count 139 transition count 256
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 3 with 4 rules applied. Total rules applied 206 place count 137 transition count 254
Applied a total of 206 rules in 35 ms. Remains 137 /240 variables (removed 103) and now considering 254/441 (removed 187) transitions.
// Phase 1: matrix 254 rows 137 cols
[2023-04-07 00:34:51] [INFO ] Computed 16 invariants in 1 ms
[2023-04-07 00:34:51] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-04-07 00:34:51] [INFO ] Invariant cache hit.
[2023-04-07 00:34:51] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-04-07 00:34:51] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2023-04-07 00:34:51] [INFO ] Redundant transitions in 14 ms returned []
[2023-04-07 00:34:51] [INFO ] Invariant cache hit.
[2023-04-07 00:34:51] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 137/240 places, 254/441 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 532 ms. Remains : 137/240 places, 254/441 transitions.
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : Anderson-PT-07-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (EQ s134 0) (EQ s23 1)), p0:(AND (NEQ s33 0) (NEQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 152 reset in 123 ms.
Stack based approach found an accepted trace after 2548 steps with 6 reset with depth 342 and stack size 280 in 9 ms.
FORMULA Anderson-PT-07-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-07-LTLCardinality-03 finished in 709 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(G(p0)))'
Support contains 4 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 441/441 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 227 transition count 344
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 227 transition count 344
Applied a total of 26 rules in 8 ms. Remains 227 /240 variables (removed 13) and now considering 344/441 (removed 97) transitions.
// Phase 1: matrix 344 rows 227 cols
[2023-04-07 00:34:51] [INFO ] Computed 16 invariants in 3 ms
[2023-04-07 00:34:52] [INFO ] Implicit Places using invariants in 229 ms returned []
[2023-04-07 00:34:52] [INFO ] Invariant cache hit.
[2023-04-07 00:34:52] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-04-07 00:34:52] [INFO ] Implicit Places using invariants and state equation in 583 ms returned []
Implicit Place search using SMT with State Equation took 815 ms to find 0 implicit places.
[2023-04-07 00:34:52] [INFO ] Invariant cache hit.
[2023-04-07 00:34:52] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 227/240 places, 344/441 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1018 ms. Remains : 227/240 places, 344/441 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-07-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s41 0) (EQ s28 1) (EQ s129 0) (EQ s58 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 74737 steps with 0 reset in 86 ms.
FORMULA Anderson-PT-07-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-07-LTLCardinality-07 finished in 1215 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(G(p0))&&((p2 U !p0)||p1))))'
Support contains 4 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 441/441 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 226 transition count 331
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 226 transition count 331
Applied a total of 28 rules in 9 ms. Remains 226 /240 variables (removed 14) and now considering 331/441 (removed 110) transitions.
// Phase 1: matrix 331 rows 226 cols
[2023-04-07 00:34:53] [INFO ] Computed 16 invariants in 5 ms
[2023-04-07 00:34:53] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-04-07 00:34:53] [INFO ] Invariant cache hit.
[2023-04-07 00:34:53] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-04-07 00:34:53] [INFO ] Implicit Places using invariants and state equation in 476 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
[2023-04-07 00:34:53] [INFO ] Invariant cache hit.
[2023-04-07 00:34:53] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 226/240 places, 331/441 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 794 ms. Remains : 226/240 places, 331/441 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0), p0]
Running random walk in product with property : Anderson-PT-07-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(OR (NOT p0) p1 p2), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p0 p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s78 0) (EQ s172 1)), p1:(OR (EQ s78 0) (EQ s172 1)), p2:(OR (EQ s35 0) (EQ s204 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 140 ms.
Stack based approach found an accepted trace after 439 steps with 0 reset with depth 440 and stack size 243 in 1 ms.
FORMULA Anderson-PT-07-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-07-LTLCardinality-09 finished in 1130 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(p0) U X(p1)))'
Support contains 4 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 441/441 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 226 transition count 343
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 226 transition count 343
Applied a total of 28 rules in 12 ms. Remains 226 /240 variables (removed 14) and now considering 343/441 (removed 98) transitions.
// Phase 1: matrix 343 rows 226 cols
[2023-04-07 00:34:54] [INFO ] Computed 16 invariants in 3 ms
[2023-04-07 00:34:54] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-04-07 00:34:54] [INFO ] Invariant cache hit.
[2023-04-07 00:34:54] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-04-07 00:34:54] [INFO ] Implicit Places using invariants and state equation in 458 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
[2023-04-07 00:34:54] [INFO ] Invariant cache hit.
[2023-04-07 00:34:55] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 226/240 places, 343/441 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 808 ms. Remains : 226/240 places, 343/441 transitions.
Stuttering acceptance computed with spot in 197 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : Anderson-PT-07-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s78 0) (EQ s124 1)), p1:(OR (EQ s25 0) (EQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 289 ms.
Product exploration explored 100000 steps with 50000 reset in 303 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), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 18 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-07-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-07-LTLCardinality-10 finished in 1641 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(X(X(p0)))&&G(p1)))'
Support contains 4 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 441/441 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 225 transition count 342
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 225 transition count 342
Applied a total of 30 rules in 16 ms. Remains 225 /240 variables (removed 15) and now considering 342/441 (removed 99) transitions.
// Phase 1: matrix 342 rows 225 cols
[2023-04-07 00:34:55] [INFO ] Computed 16 invariants in 5 ms
[2023-04-07 00:34:56] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-04-07 00:34:56] [INFO ] Invariant cache hit.
[2023-04-07 00:34:56] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-04-07 00:34:56] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 578 ms to find 0 implicit places.
[2023-04-07 00:34:56] [INFO ] Invariant cache hit.
[2023-04-07 00:34:56] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 225/240 places, 342/441 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 779 ms. Remains : 225/240 places, 342/441 transitions.
Stuttering acceptance computed with spot in 282 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Anderson-PT-07-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 3}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=4, aps=[p1:(OR (EQ s101 0) (EQ s201 1)), p0:(OR (EQ s14 0) (EQ s28 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 101 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-07-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-07-LTLCardinality-11 finished in 1081 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(G(p0)))'
Support contains 2 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 441/441 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 225 transition count 330
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 225 transition count 330
Applied a total of 30 rules in 9 ms. Remains 225 /240 variables (removed 15) and now considering 330/441 (removed 111) transitions.
// Phase 1: matrix 330 rows 225 cols
[2023-04-07 00:34:56] [INFO ] Computed 16 invariants in 5 ms
[2023-04-07 00:34:57] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-04-07 00:34:57] [INFO ] Invariant cache hit.
[2023-04-07 00:34:57] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-04-07 00:34:57] [INFO ] Implicit Places using invariants and state equation in 550 ms returned []
Implicit Place search using SMT with State Equation took 695 ms to find 0 implicit places.
[2023-04-07 00:34:57] [INFO ] Invariant cache hit.
[2023-04-07 00:34:57] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 225/240 places, 330/441 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 897 ms. Remains : 225/240 places, 330/441 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-07-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s45 0) (EQ s48 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 2868 steps with 0 reset in 4 ms.
FORMULA Anderson-PT-07-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-07-LTLCardinality-12 finished in 1016 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(p0))'
Support contains 1 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 441/441 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 224 transition count 329
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 224 transition count 329
Applied a total of 32 rules in 7 ms. Remains 224 /240 variables (removed 16) and now considering 329/441 (removed 112) transitions.
// Phase 1: matrix 329 rows 224 cols
[2023-04-07 00:34:58] [INFO ] Computed 16 invariants in 2 ms
[2023-04-07 00:34:58] [INFO ] Implicit Places using invariants in 117 ms returned []
[2023-04-07 00:34:58] [INFO ] Invariant cache hit.
[2023-04-07 00:34:58] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-04-07 00:34:58] [INFO ] Implicit Places using invariants and state equation in 602 ms returned []
Implicit Place search using SMT with State Equation took 728 ms to find 0 implicit places.
[2023-04-07 00:34:58] [INFO ] Invariant cache hit.
[2023-04-07 00:34:58] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 224/240 places, 329/441 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 929 ms. Remains : 224/240 places, 329/441 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Anderson-PT-07-LTLCardinality-13 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:(EQ s200 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 Anderson-PT-07-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-07-LTLCardinality-13 finished in 1047 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(X(G(p0))))'
Support contains 2 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 441/441 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 224 transition count 329
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 224 transition count 329
Applied a total of 32 rules in 13 ms. Remains 224 /240 variables (removed 16) and now considering 329/441 (removed 112) transitions.
[2023-04-07 00:34:59] [INFO ] Invariant cache hit.
[2023-04-07 00:34:59] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-04-07 00:34:59] [INFO ] Invariant cache hit.
[2023-04-07 00:34:59] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-04-07 00:34:59] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 608 ms to find 0 implicit places.
[2023-04-07 00:34:59] [INFO ] Invariant cache hit.
[2023-04-07 00:34:59] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 224/240 places, 329/441 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 806 ms. Remains : 224/240 places, 329/441 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-07-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s193 0) (EQ s118 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-07-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-07-LTLCardinality-14 finished in 946 ms.
All properties solved by simple procedures.
Total runtime 15455 ms.
ITS solved all properties within timeout

BK_STOP 1680827700953

--------------------
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'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is Anderson-PT-07, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r519-tall-167987244700027"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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