Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.1K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 16K Mar 23 15:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 167K Mar 23 15:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Mar 23 15:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 23 15:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 927K 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-09-LTLCardinality-00
FORMULA_NAME Anderson-PT-09-LTLCardinality-01
FORMULA_NAME Anderson-PT-09-LTLCardinality-02
FORMULA_NAME Anderson-PT-09-LTLCardinality-03
FORMULA_NAME Anderson-PT-09-LTLCardinality-04
FORMULA_NAME Anderson-PT-09-LTLCardinality-05
FORMULA_NAME Anderson-PT-09-LTLCardinality-06
FORMULA_NAME Anderson-PT-09-LTLCardinality-07
FORMULA_NAME Anderson-PT-09-LTLCardinality-08
FORMULA_NAME Anderson-PT-09-LTLCardinality-09
FORMULA_NAME Anderson-PT-09-LTLCardinality-10
FORMULA_NAME Anderson-PT-09-LTLCardinality-11
FORMULA_NAME Anderson-PT-09-LTLCardinality-12
FORMULA_NAME Anderson-PT-09-LTLCardinality-13
FORMULA_NAME Anderson-PT-09-LTLCardinality-14
FORMULA_NAME Anderson-PT-09-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680863502804

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-09
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 10:31:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 10:31:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 10:31:47] [INFO ] Load time of PNML (sax parser for PT used): 254 ms
[2023-04-07 10:31:47] [INFO ] Transformed 505 places.
[2023-04-07 10:31:47] [INFO ] Transformed 1845 transitions.
[2023-04-07 10:31:47] [INFO ] Found NUPN structural information;
[2023-04-07 10:31:47] [INFO ] Parsed PT model containing 505 places and 1845 transitions and 7092 arcs in 619 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Anderson-PT-09-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-09-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-09-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-09-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-09-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 505 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 505/505 places, 1845/1845 transitions.
Discarding 124 places :
Symmetric choice reduction at 0 with 124 rule applications. Total rules 124 place count 381 transition count 681
Iterating global reduction 0 with 124 rules applied. Total rules applied 248 place count 381 transition count 681
Applied a total of 248 rules in 129 ms. Remains 381 /505 variables (removed 124) and now considering 681/1845 (removed 1164) transitions.
// Phase 1: matrix 681 rows 381 cols
[2023-04-07 10:31:48] [INFO ] Computed 21 invariants in 101 ms
[2023-04-07 10:31:50] [INFO ] Implicit Places using invariants in 2463 ms returned []
[2023-04-07 10:31:50] [INFO ] Invariant cache hit.
[2023-04-07 10:31:51] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 10:31:54] [INFO ] Implicit Places using invariants and state equation in 3223 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 5835 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 380/505 places, 681/1845 transitions.
Applied a total of 0 rules in 28 ms. Remains 380 /380 variables (removed 0) and now considering 681/681 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5992 ms. Remains : 380/505 places, 681/1845 transitions.
Support contains 41 out of 380 places after structural reductions.
[2023-04-07 10:31:54] [INFO ] Flatten gal took : 181 ms
[2023-04-07 10:31:54] [INFO ] Flatten gal took : 61 ms
[2023-04-07 10:31:54] [INFO ] Input system was already deterministic with 681 transitions.
Support contains 33 out of 380 places (down from 41) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 332 ms. (steps per millisecond=30 ) properties (out of 22) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 681 rows 380 cols
[2023-04-07 10:31:55] [INFO ] Computed 20 invariants in 14 ms
[2023-04-07 10:31:55] [INFO ] After 381ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 10:31:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 24 ms returned sat
[2023-04-07 10:31:56] [INFO ] [Nat]Absence check using 11 positive and 9 generalized place invariants in 90 ms returned sat
[2023-04-07 10:31:57] [INFO ] After 1128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 10:31:57] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 10:31:57] [INFO ] After 434ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 10:31:58] [INFO ] After 703ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 304 ms.
[2023-04-07 10:31:58] [INFO ] After 2597ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 6 ms.
Support contains 5 out of 380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 681/681 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 380 transition count 601
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 300 transition count 601
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 68 Pre rules applied. Total rules applied 160 place count 300 transition count 533
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 296 place count 232 transition count 533
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 312 place count 216 transition count 421
Iterating global reduction 2 with 16 rules applied. Total rules applied 328 place count 216 transition count 421
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 334 place count 213 transition count 418
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 335 place count 213 transition count 417
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 336 place count 212 transition count 417
Applied a total of 336 rules in 193 ms. Remains 212 /380 variables (removed 168) and now considering 417/681 (removed 264) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 193 ms. Remains : 212/380 places, 417/681 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 553618 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 553618 steps, saw 369241 distinct states, run finished after 3002 ms. (steps per millisecond=184 ) properties seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 417 rows 212 cols
[2023-04-07 10:32:02] [INFO ] Computed 20 invariants in 22 ms
[2023-04-07 10:32:02] [INFO ] After 215ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 10:32:02] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-04-07 10:32:02] [INFO ] [Nat]Absence check using 11 positive and 9 generalized place invariants in 7 ms returned sat
[2023-04-07 10:32:03] [INFO ] After 1252ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 10:32:03] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 10:32:03] [INFO ] After 138ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 10:32:03] [INFO ] After 210ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-04-07 10:32:04] [INFO ] After 1627ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 417/417 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 210 transition count 415
Applied a total of 4 rules in 28 ms. Remains 210 /212 variables (removed 2) and now considering 415/417 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 210/212 places, 415/417 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 496378 steps, run visited all 1 properties in 2554 ms. (steps per millisecond=194 )
Probabilistic random walk after 496378 steps, saw 331056 distinct states, run finished after 2554 ms. (steps per millisecond=194 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 681/681 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 361 transition count 550
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 361 transition count 550
Applied a total of 38 rules in 34 ms. Remains 361 /380 variables (removed 19) and now considering 550/681 (removed 131) transitions.
// Phase 1: matrix 550 rows 361 cols
[2023-04-07 10:32:07] [INFO ] Computed 20 invariants in 5 ms
[2023-04-07 10:32:07] [INFO ] Implicit Places using invariants in 446 ms returned []
[2023-04-07 10:32:07] [INFO ] Invariant cache hit.
[2023-04-07 10:32:09] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 10:32:12] [INFO ] Implicit Places using invariants and state equation in 4356 ms returned []
Implicit Place search using SMT with State Equation took 4816 ms to find 0 implicit places.
[2023-04-07 10:32:12] [INFO ] Invariant cache hit.
[2023-04-07 10:32:12] [INFO ] Dead Transitions using invariants and state equation in 688 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 361/380 places, 550/681 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5566 ms. Remains : 361/380 places, 550/681 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 519 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s125 1) (EQ s230 0) (EQ s84 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][false, false]]
Product exploration explored 100000 steps with 3 reset in 470 ms.
Stack based approach found an accepted trace after 69 steps with 0 reset with depth 70 and stack size 70 in 1 ms.
FORMULA Anderson-PT-09-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-09-LTLCardinality-00 finished in 6669 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(p0)))'
Support contains 1 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 681/681 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 361 transition count 550
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 361 transition count 550
Applied a total of 38 rules in 16 ms. Remains 361 /380 variables (removed 19) and now considering 550/681 (removed 131) transitions.
// Phase 1: matrix 550 rows 361 cols
[2023-04-07 10:32:13] [INFO ] Computed 20 invariants in 3 ms
[2023-04-07 10:32:21] [INFO ] Implicit Places using invariants in 7716 ms returned []
[2023-04-07 10:32:21] [INFO ] Invariant cache hit.
[2023-04-07 10:32:22] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 10:32:23] [INFO ] Implicit Places using invariants and state equation in 1791 ms returned []
Implicit Place search using SMT with State Equation took 9532 ms to find 0 implicit places.
[2023-04-07 10:32:23] [INFO ] Invariant cache hit.
[2023-04-07 10:32:24] [INFO ] Dead Transitions using invariants and state equation in 659 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 361/380 places, 550/681 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10223 ms. Remains : 361/380 places, 550/681 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-01 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}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(EQ s54 0)], 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 634 ms.
Product exploration explored 100000 steps with 33333 reset in 571 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 : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 34 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-09-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-09-LTLCardinality-01 finished in 11710 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(F(p1))||p0))))'
Support contains 4 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 681/681 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 362 transition count 567
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 362 transition count 567
Applied a total of 36 rules in 24 ms. Remains 362 /380 variables (removed 18) and now considering 567/681 (removed 114) transitions.
// Phase 1: matrix 567 rows 362 cols
[2023-04-07 10:32:25] [INFO ] Computed 20 invariants in 3 ms
[2023-04-07 10:32:26] [INFO ] Implicit Places using invariants in 481 ms returned []
[2023-04-07 10:32:26] [INFO ] Invariant cache hit.
[2023-04-07 10:32:26] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 10:32:27] [INFO ] Implicit Places using invariants and state equation in 1650 ms returned []
Implicit Place search using SMT with State Equation took 2159 ms to find 0 implicit places.
[2023-04-07 10:32:27] [INFO ] Invariant cache hit.
[2023-04-07 10:32:28] [INFO ] Dead Transitions using invariants and state equation in 729 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 362/380 places, 567/681 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2924 ms. Remains : 362/380 places, 567/681 transitions.
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s298 0) (EQ s89 1)), p1:(OR (EQ s36 0) (EQ s302 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 329 ms.
Product exploration explored 100000 steps with 50000 reset in 304 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 p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 44 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-09-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-09-LTLCardinality-03 finished in 3872 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||(F(p1) U p2)))))'
Support contains 7 out of 380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 380/380 places, 681/681 transitions.
Drop transitions removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 77 place count 380 transition count 604
Reduce places removed 77 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 78 rules applied. Total rules applied 155 place count 303 transition count 603
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 156 place count 302 transition count 603
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 69 Pre rules applied. Total rules applied 156 place count 302 transition count 534
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 3 with 138 rules applied. Total rules applied 294 place count 233 transition count 534
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 309 place count 218 transition count 455
Iterating global reduction 3 with 15 rules applied. Total rules applied 324 place count 218 transition count 455
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 328 place count 216 transition count 453
Applied a total of 328 rules in 68 ms. Remains 216 /380 variables (removed 164) and now considering 453/681 (removed 228) transitions.
// Phase 1: matrix 453 rows 216 cols
[2023-04-07 10:32:29] [INFO ] Computed 20 invariants in 2 ms
[2023-04-07 10:32:29] [INFO ] Implicit Places using invariants in 354 ms returned []
[2023-04-07 10:32:29] [INFO ] Invariant cache hit.
[2023-04-07 10:32:30] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 10:32:30] [INFO ] Implicit Places using invariants and state equation in 802 ms returned []
Implicit Place search using SMT with State Equation took 1195 ms to find 0 implicit places.
[2023-04-07 10:32:30] [INFO ] Redundant transitions in 35 ms returned []
[2023-04-07 10:32:30] [INFO ] Invariant cache hit.
[2023-04-07 10:32:31] [INFO ] Dead Transitions using invariants and state equation in 461 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 216/380 places, 453/681 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1780 ms. Remains : 216/380 places, 453/681 transitions.
Stuttering acceptance computed with spot in 279 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND p0 (NOT p1)) (AND p2 (NOT p1))), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s33 1) (OR (EQ s38 0) (EQ s101 1))), p2:(AND (OR (EQ s125 0) (EQ s163 1)) (OR (EQ s56 0) (EQ s30 1))), p1:(EQ s33 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 47 reset in 266 ms.
Stack based approach found an accepted trace after 533 steps with 1 reset with depth 395 and stack size 363 in 2 ms.
FORMULA Anderson-PT-09-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-09-LTLCardinality-05 finished in 2385 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||X((F(p2)&&p1))))))'
Support contains 2 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 681/681 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 362 transition count 567
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 362 transition count 567
Applied a total of 36 rules in 33 ms. Remains 362 /380 variables (removed 18) and now considering 567/681 (removed 114) transitions.
// Phase 1: matrix 567 rows 362 cols
[2023-04-07 10:32:31] [INFO ] Computed 20 invariants in 3 ms
[2023-04-07 10:32:32] [INFO ] Implicit Places using invariants in 427 ms returned []
[2023-04-07 10:32:32] [INFO ] Invariant cache hit.
[2023-04-07 10:32:32] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 10:32:34] [INFO ] Implicit Places using invariants and state equation in 2026 ms returned []
Implicit Place search using SMT with State Equation took 2475 ms to find 0 implicit places.
[2023-04-07 10:32:34] [INFO ] Invariant cache hit.
[2023-04-07 10:32:36] [INFO ] Dead Transitions using invariants and state equation in 2074 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 362/380 places, 567/681 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4603 ms. Remains : 362/380 places, 567/681 transitions.
Stuttering acceptance computed with spot in 314 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s46 0) (EQ s31 1)), p1:(AND (EQ s46 0) (EQ s31 1)), p2:(EQ s46 0)], 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]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-09-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-09-LTLCardinality-08 finished in 4975 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||F((G(p2)||p1)))))'
Support contains 3 out of 380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 380/380 places, 681/681 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 380 transition count 601
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 300 transition count 601
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 70 Pre rules applied. Total rules applied 160 place count 300 transition count 531
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 300 place count 230 transition count 531
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 320 place count 210 transition count 399
Iterating global reduction 2 with 20 rules applied. Total rules applied 340 place count 210 transition count 399
Applied a total of 340 rules in 67 ms. Remains 210 /380 variables (removed 170) and now considering 399/681 (removed 282) transitions.
// Phase 1: matrix 399 rows 210 cols
[2023-04-07 10:32:36] [INFO ] Computed 20 invariants in 8 ms
[2023-04-07 10:32:37] [INFO ] Implicit Places using invariants in 310 ms returned []
[2023-04-07 10:32:37] [INFO ] Invariant cache hit.
[2023-04-07 10:32:37] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 10:32:38] [INFO ] Implicit Places using invariants and state equation in 907 ms returned []
Implicit Place search using SMT with State Equation took 1233 ms to find 0 implicit places.
[2023-04-07 10:32:38] [INFO ] Redundant transitions in 5 ms returned []
[2023-04-07 10:32:38] [INFO ] Invariant cache hit.
[2023-04-07 10:32:38] [INFO ] Dead Transitions using invariants and state equation in 427 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 210/380 places, 399/681 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1767 ms. Remains : 210/380 places, 399/681 transitions.
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s126 0) (EQ s119 1)), p1:(OR (EQ s126 0) (EQ s119 1)), p2:(EQ s209 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 94 reset in 138 ms.
Product exploration explored 100000 steps with 105 reset in 259 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 266 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 3) seen :2
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
Running SMT prover for 1 properties.
[2023-04-07 10:32:39] [INFO ] Invariant cache hit.
[2023-04-07 10:32:39] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 10:32:39] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-04-07 10:32:39] [INFO ] [Nat]Absence check using 11 positive and 9 generalized place invariants in 16 ms returned sat
[2023-04-07 10:32:39] [INFO ] After 112ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (G (NOT (AND (NOT p1) p2)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 6 factoid took 326 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 out of 210 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 210/210 places, 399/399 transitions.
Applied a total of 0 rules in 7 ms. Remains 210 /210 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2023-04-07 10:32:40] [INFO ] Invariant cache hit.
[2023-04-07 10:32:40] [INFO ] Implicit Places using invariants in 256 ms returned []
[2023-04-07 10:32:40] [INFO ] Invariant cache hit.
[2023-04-07 10:32:41] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 10:32:43] [INFO ] Implicit Places using invariants and state equation in 2428 ms returned []
Implicit Place search using SMT with State Equation took 2705 ms to find 0 implicit places.
[2023-04-07 10:32:43] [INFO ] Redundant transitions in 2 ms returned []
[2023-04-07 10:32:43] [INFO ] Invariant cache hit.
[2023-04-07 10:32:43] [INFO ] Dead Transitions using invariants and state equation in 448 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3205 ms. Remains : 210/210 places, 399/399 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 229 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 161 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 2551 steps, including 0 resets, run visited all 2 properties in 19 ms. (steps per millisecond=134 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 180 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 77 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 90 reset in 124 ms.
Product exploration explored 100000 steps with 101 reset in 174 ms.
Support contains 2 out of 210 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 210/210 places, 399/399 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 210 transition count 398
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 209 transition count 398
Applied a total of 2 rules in 17 ms. Remains 209 /210 variables (removed 1) and now considering 398/399 (removed 1) transitions.
// Phase 1: matrix 398 rows 209 cols
[2023-04-07 10:32:44] [INFO ] Computed 20 invariants in 2 ms
[2023-04-07 10:32:45] [INFO ] Implicit Places using invariants in 339 ms returned []
[2023-04-07 10:32:45] [INFO ] Invariant cache hit.
[2023-04-07 10:32:45] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 10:32:46] [INFO ] Implicit Places using invariants and state equation in 934 ms returned []
Implicit Place search using SMT with State Equation took 1317 ms to find 0 implicit places.
[2023-04-07 10:32:46] [INFO ] Redundant transitions in 2 ms returned []
[2023-04-07 10:32:46] [INFO ] Invariant cache hit.
[2023-04-07 10:32:46] [INFO ] Dead Transitions using invariants and state equation in 409 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 209/210 places, 398/399 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1768 ms. Remains : 209/210 places, 398/399 transitions.
Treatment of property Anderson-PT-09-LTLCardinality-09 finished in 10177 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(F(p0)))'
Support contains 1 out of 380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 380/380 places, 681/681 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 380 transition count 601
Reduce places removed 80 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 81 rules applied. Total rules applied 161 place count 300 transition count 600
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 162 place count 299 transition count 600
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 162 place count 299 transition count 528
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 306 place count 227 transition count 528
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 326 place count 207 transition count 396
Iterating global reduction 3 with 20 rules applied. Total rules applied 346 place count 207 transition count 396
Applied a total of 346 rules in 49 ms. Remains 207 /380 variables (removed 173) and now considering 396/681 (removed 285) transitions.
// Phase 1: matrix 396 rows 207 cols
[2023-04-07 10:32:47] [INFO ] Computed 20 invariants in 2 ms
[2023-04-07 10:32:57] [INFO ] Implicit Places using invariants in 10295 ms returned []
[2023-04-07 10:32:57] [INFO ] Invariant cache hit.
[2023-04-07 10:32:57] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 10:32:58] [INFO ] Implicit Places using invariants and state equation in 669 ms returned []
Implicit Place search using SMT with State Equation took 11003 ms to find 0 implicit places.
[2023-04-07 10:32:58] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 10:32:58] [INFO ] Invariant cache hit.
[2023-04-07 10:32:58] [INFO ] Dead Transitions using invariants and state equation in 403 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 207/380 places, 396/681 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11482 ms. Remains : 207/380 places, 396/681 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s162 0)], 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 94 reset in 110 ms.
Product exploration explored 100000 steps with 80 reset in 240 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 : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 483 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2641 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=660 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 303 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 224 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 207/207 places, 396/396 transitions.
Applied a total of 0 rules in 6 ms. Remains 207 /207 variables (removed 0) and now considering 396/396 (removed 0) transitions.
[2023-04-07 10:33:00] [INFO ] Invariant cache hit.
[2023-04-07 10:33:00] [INFO ] Implicit Places using invariants in 252 ms returned []
[2023-04-07 10:33:00] [INFO ] Invariant cache hit.
[2023-04-07 10:33:00] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 10:33:01] [INFO ] Implicit Places using invariants and state equation in 769 ms returned []
Implicit Place search using SMT with State Equation took 1041 ms to find 0 implicit places.
[2023-04-07 10:33:01] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 10:33:01] [INFO ] Invariant cache hit.
[2023-04-07 10:33:01] [INFO ] Dead Transitions using invariants and state equation in 371 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1442 ms. Remains : 207/207 places, 396/396 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 232 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1297 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=432 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 322 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 98 reset in 114 ms.
Product exploration explored 100000 steps with 70 reset in 198 ms.
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 207/207 places, 396/396 transitions.
Applied a total of 0 rules in 30 ms. Remains 207 /207 variables (removed 0) and now considering 396/396 (removed 0) transitions.
[2023-04-07 10:33:03] [INFO ] Invariant cache hit.
[2023-04-07 10:33:03] [INFO ] Implicit Places using invariants in 465 ms returned []
[2023-04-07 10:33:03] [INFO ] Invariant cache hit.
[2023-04-07 10:33:03] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 10:33:04] [INFO ] Implicit Places using invariants and state equation in 791 ms returned []
Implicit Place search using SMT with State Equation took 1281 ms to find 0 implicit places.
[2023-04-07 10:33:04] [INFO ] Redundant transitions in 2 ms returned []
[2023-04-07 10:33:04] [INFO ] Invariant cache hit.
[2023-04-07 10:33:04] [INFO ] Dead Transitions using invariants and state equation in 369 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1708 ms. Remains : 207/207 places, 396/396 transitions.
Treatment of property Anderson-PT-09-LTLCardinality-10 finished in 18041 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)||F(((!p1&&X(p2))||G(p2)))))))'
Support contains 4 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 681/681 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 360 transition count 549
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 360 transition count 549
Applied a total of 40 rules in 9 ms. Remains 360 /380 variables (removed 20) and now considering 549/681 (removed 132) transitions.
// Phase 1: matrix 549 rows 360 cols
[2023-04-07 10:33:05] [INFO ] Computed 20 invariants in 3 ms
[2023-04-07 10:33:05] [INFO ] Implicit Places using invariants in 384 ms returned []
[2023-04-07 10:33:05] [INFO ] Invariant cache hit.
[2023-04-07 10:33:05] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 10:33:06] [INFO ] Implicit Places using invariants and state equation in 1425 ms returned []
Implicit Place search using SMT with State Equation took 1851 ms to find 0 implicit places.
[2023-04-07 10:33:06] [INFO ] Invariant cache hit.
[2023-04-07 10:33:07] [INFO ] Dead Transitions using invariants and state equation in 648 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 360/380 places, 549/681 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2525 ms. Remains : 360/380 places, 549/681 transitions.
Stuttering acceptance computed with spot in 552 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=(AND p2 p1), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 6}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(OR (EQ s170 0) (EQ s305 1)), p2:(OR (EQ s270 0) (EQ s144 1)), p0:(AND (EQ s144 0) (EQ s270 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 26 reset in 132 ms.
Stack based approach found an accepted trace after 3468 steps with 1 reset with depth 2411 and stack size 1451 in 6 ms.
FORMULA Anderson-PT-09-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-09-LTLCardinality-11 finished in 3276 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(p1)&&p0)))'
Support contains 4 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 681/681 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 362 transition count 551
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 362 transition count 551
Applied a total of 36 rules in 14 ms. Remains 362 /380 variables (removed 18) and now considering 551/681 (removed 130) transitions.
// Phase 1: matrix 551 rows 362 cols
[2023-04-07 10:33:08] [INFO ] Computed 20 invariants in 5 ms
[2023-04-07 10:33:08] [INFO ] Implicit Places using invariants in 454 ms returned []
[2023-04-07 10:33:08] [INFO ] Invariant cache hit.
[2023-04-07 10:33:09] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 10:33:10] [INFO ] Implicit Places using invariants and state equation in 1473 ms returned []
Implicit Place search using SMT with State Equation took 1943 ms to find 0 implicit places.
[2023-04-07 10:33:10] [INFO ] Invariant cache hit.
[2023-04-07 10:33:11] [INFO ] Dead Transitions using invariants and state equation in 748 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 362/380 places, 551/681 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2720 ms. Remains : 362/380 places, 551/681 transitions.
Stuttering acceptance computed with spot in 191 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (EQ s277 0) (EQ s288 1)), p0:(AND (EQ s109 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-09-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-09-LTLCardinality-13 finished in 2972 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((X(G(p1))||p0)))'
Support contains 3 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 681/681 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 362 transition count 567
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 362 transition count 567
Applied a total of 36 rules in 10 ms. Remains 362 /380 variables (removed 18) and now considering 567/681 (removed 114) transitions.
// Phase 1: matrix 567 rows 362 cols
[2023-04-07 10:33:11] [INFO ] Computed 20 invariants in 3 ms
[2023-04-07 10:33:11] [INFO ] Implicit Places using invariants in 390 ms returned []
[2023-04-07 10:33:11] [INFO ] Invariant cache hit.
[2023-04-07 10:33:12] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 10:33:13] [INFO ] Implicit Places using invariants and state equation in 1853 ms returned []
Implicit Place search using SMT with State Equation took 2260 ms to find 0 implicit places.
[2023-04-07 10:33:13] [INFO ] Invariant cache hit.
[2023-04-07 10:33:14] [INFO ] Dead Transitions using invariants and state equation in 724 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 362/380 places, 567/681 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3015 ms. Remains : 362/380 places, 567/681 transitions.
Stuttering acceptance computed with spot in 163 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s35 0) (EQ s119 1)), p1:(OR (EQ s35 0) (EQ s119 1) (EQ s82 0))], 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]]
Product exploration explored 100000 steps with 0 reset in 248 ms.
Product exploration explored 100000 steps with 0 reset in 301 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 p1), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 304 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 328 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 10:33:15] [INFO ] Invariant cache hit.
[2023-04-07 10:33:15] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 10:33:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 71 ms returned sat
[2023-04-07 10:33:16] [INFO ] [Nat]Absence check using 11 positive and 9 generalized place invariants in 99 ms returned sat
[2023-04-07 10:33:19] [INFO ] After 2881ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 10:33:19] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 10:33:19] [INFO ] After 176ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 10:33:19] [INFO ] After 278ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 64 ms.
[2023-04-07 10:33:19] [INFO ] After 3609ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 567/567 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 362 transition count 487
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 282 transition count 487
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 70 Pre rules applied. Total rules applied 160 place count 282 transition count 417
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 300 place count 212 transition count 417
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 302 place count 211 transition count 416
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 303 place count 211 transition count 415
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 304 place count 210 transition count 415
Applied a total of 304 rules in 52 ms. Remains 210 /362 variables (removed 152) and now considering 415/567 (removed 152) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 210/362 places, 415/567 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Finished probabilistic random walk after 471954 steps, run visited all 1 properties in 1323 ms. (steps per millisecond=356 )
Probabilistic random walk after 471954 steps, saw 328889 distinct states, run finished after 1333 ms. (steps per millisecond=354 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 248 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 125 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 567/567 transitions.
Applied a total of 0 rules in 4 ms. Remains 362 /362 variables (removed 0) and now considering 567/567 (removed 0) transitions.
[2023-04-07 10:33:21] [INFO ] Invariant cache hit.
[2023-04-07 10:33:21] [INFO ] Implicit Places using invariants in 411 ms returned []
[2023-04-07 10:33:21] [INFO ] Invariant cache hit.
[2023-04-07 10:33:22] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 10:33:23] [INFO ] Implicit Places using invariants and state equation in 1950 ms returned []
Implicit Place search using SMT with State Equation took 2404 ms to find 0 implicit places.
[2023-04-07 10:33:23] [INFO ] Invariant cache hit.
[2023-04-07 10:33:24] [INFO ] Dead Transitions using invariants and state equation in 690 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3112 ms. Remains : 362/362 places, 567/567 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 294 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 302 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 10:33:25] [INFO ] Invariant cache hit.
[2023-04-07 10:33:25] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 10:33:25] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-04-07 10:33:25] [INFO ] [Nat]Absence check using 11 positive and 9 generalized place invariants in 20 ms returned sat
[2023-04-07 10:33:25] [INFO ] After 318ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 10:33:25] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 10:33:26] [INFO ] After 195ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 10:33:26] [INFO ] After 304ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-04-07 10:33:26] [INFO ] After 855ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 567/567 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 362 transition count 487
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 282 transition count 487
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 70 Pre rules applied. Total rules applied 160 place count 282 transition count 417
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 300 place count 212 transition count 417
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 2 with 2 rules applied. Total rules applied 302 place count 211 transition count 416
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 303 place count 211 transition count 415
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 304 place count 210 transition count 415
Applied a total of 304 rules in 61 ms. Remains 210 /362 variables (removed 152) and now considering 415/567 (removed 152) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 210/362 places, 415/567 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Finished probabilistic random walk after 471954 steps, run visited all 1 properties in 2115 ms. (steps per millisecond=223 )
Probabilistic random walk after 471954 steps, saw 328889 distinct states, run finished after 2129 ms. (steps per millisecond=221 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 258 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 161 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 131 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 131 ms.
Product exploration explored 100000 steps with 0 reset in 131 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 184 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 362 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 362/362 places, 567/567 transitions.
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 362 transition count 567
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 70 Pre rules applied. Total rules applied 80 place count 362 transition count 567
Deduced a syphon composed of 150 places in 1 ms
Iterating global reduction 1 with 70 rules applied. Total rules applied 150 place count 362 transition count 567
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 151 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 151 place count 362 transition count 567
Deduced a syphon composed of 151 places in 0 ms
Applied a total of 151 rules in 93 ms. Remains 362 /362 variables (removed 0) and now considering 567/567 (removed 0) transitions.
[2023-04-07 10:33:30] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 567 rows 362 cols
[2023-04-07 10:33:30] [INFO ] Computed 20 invariants in 3 ms
[2023-04-07 10:33:31] [INFO ] Dead Transitions using invariants and state equation in 1404 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 362/362 places, 567/567 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1540 ms. Remains : 362/362 places, 567/567 transitions.
Support contains 3 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 567/567 transitions.
Applied a total of 0 rules in 17 ms. Remains 362 /362 variables (removed 0) and now considering 567/567 (removed 0) transitions.
// Phase 1: matrix 567 rows 362 cols
[2023-04-07 10:33:31] [INFO ] Computed 20 invariants in 2 ms
[2023-04-07 10:33:31] [INFO ] Implicit Places using invariants in 398 ms returned []
[2023-04-07 10:33:31] [INFO ] Invariant cache hit.
[2023-04-07 10:33:35] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 10:33:36] [INFO ] Implicit Places using invariants and state equation in 4460 ms returned []
Implicit Place search using SMT with State Equation took 4865 ms to find 0 implicit places.
[2023-04-07 10:33:36] [INFO ] Invariant cache hit.
[2023-04-07 10:33:36] [INFO ] Dead Transitions using invariants and state equation in 661 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5577 ms. Remains : 362/362 places, 567/567 transitions.
Treatment of property Anderson-PT-09-LTLCardinality-14 finished in 25859 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 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 681/681 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 361 transition count 550
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 361 transition count 550
Applied a total of 38 rules in 28 ms. Remains 361 /380 variables (removed 19) and now considering 550/681 (removed 131) transitions.
// Phase 1: matrix 550 rows 361 cols
[2023-04-07 10:33:37] [INFO ] Computed 20 invariants in 3 ms
[2023-04-07 10:33:37] [INFO ] Implicit Places using invariants in 518 ms returned []
[2023-04-07 10:33:37] [INFO ] Invariant cache hit.
[2023-04-07 10:33:38] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 10:33:42] [INFO ] Implicit Places using invariants and state equation in 4307 ms returned []
Implicit Place search using SMT with State Equation took 4857 ms to find 0 implicit places.
[2023-04-07 10:33:42] [INFO ] Invariant cache hit.
[2023-04-07 10:33:42] [INFO ] Dead Transitions using invariants and state equation in 645 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 361/380 places, 550/681 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5550 ms. Remains : 361/380 places, 550/681 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-15 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 s58 0) (EQ s336 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 41 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-09-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-09-LTLCardinality-15 finished in 5738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||F((G(p2)||p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
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((X(G(p1))||p0)))'
Found a Lengthening insensitive property : Anderson-PT-09-LTLCardinality-14
Stuttering acceptance computed with spot in 191 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 380 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 380/380 places, 681/681 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 380 transition count 601
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 300 transition count 601
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 70 Pre rules applied. Total rules applied 160 place count 300 transition count 531
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 300 place count 230 transition count 531
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 318 place count 212 transition count 417
Iterating global reduction 2 with 18 rules applied. Total rules applied 336 place count 212 transition count 417
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 338 place count 211 transition count 416
Applied a total of 338 rules in 27 ms. Remains 211 /380 variables (removed 169) and now considering 416/681 (removed 265) transitions.
// Phase 1: matrix 416 rows 211 cols
[2023-04-07 10:33:43] [INFO ] Computed 20 invariants in 2 ms
[2023-04-07 10:33:43] [INFO ] Implicit Places using invariants in 406 ms returned []
[2023-04-07 10:33:43] [INFO ] Invariant cache hit.
[2023-04-07 10:33:44] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 10:33:48] [INFO ] Implicit Places using invariants and state equation in 4374 ms returned []
Implicit Place search using SMT with State Equation took 4804 ms to find 0 implicit places.
[2023-04-07 10:33:48] [INFO ] Invariant cache hit.
[2023-04-07 10:33:48] [INFO ] Dead Transitions using invariants and state equation in 357 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 211/380 places, 416/681 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 5215 ms. Remains : 211/380 places, 416/681 transitions.
Running random walk in product with property : Anderson-PT-09-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s35 0) (EQ s118 1)), p1:(OR (EQ s35 0) (EQ s118 1) (EQ s81 0))], 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, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 174 ms.
Product exploration explored 100000 steps with 0 reset in 137 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 p1), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 178 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 10:33:49] [INFO ] Invariant cache hit.
[2023-04-07 10:33:49] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 10:33:49] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-04-07 10:33:49] [INFO ] [Nat]Absence check using 12 positive and 8 generalized place invariants in 5 ms returned sat
[2023-04-07 10:33:49] [INFO ] After 207ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 10:33:49] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 10:33:49] [INFO ] After 52ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 10:33:49] [INFO ] After 96ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-04-07 10:33:49] [INFO ] After 471ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 416/416 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 211 transition count 415
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 210 transition count 415
Applied a total of 2 rules in 35 ms. Remains 210 /211 variables (removed 1) and now considering 415/416 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 210/211 places, 415/416 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 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 471954 steps, run visited all 1 properties in 1540 ms. (steps per millisecond=306 )
Probabilistic random walk after 471954 steps, saw 328889 distinct states, run finished after 1540 ms. (steps per millisecond=306 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 206 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 118 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 416/416 transitions.
Applied a total of 0 rules in 2 ms. Remains 211 /211 variables (removed 0) and now considering 416/416 (removed 0) transitions.
[2023-04-07 10:33:52] [INFO ] Invariant cache hit.
[2023-04-07 10:33:52] [INFO ] Implicit Places using invariants in 277 ms returned []
[2023-04-07 10:33:52] [INFO ] Invariant cache hit.
[2023-04-07 10:33:52] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 10:33:53] [INFO ] Implicit Places using invariants and state equation in 1071 ms returned []
Implicit Place search using SMT with State Equation took 1353 ms to find 0 implicit places.
[2023-04-07 10:33:53] [INFO ] Invariant cache hit.
[2023-04-07 10:33:53] [INFO ] Dead Transitions using invariants and state equation in 457 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1812 ms. Remains : 211/211 places, 416/416 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 85 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 10:33:54] [INFO ] Invariant cache hit.
[2023-04-07 10:33:54] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 10:33:54] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-04-07 10:33:54] [INFO ] [Nat]Absence check using 12 positive and 8 generalized place invariants in 17 ms returned sat
[2023-04-07 10:33:54] [INFO ] After 185ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 10:33:54] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 10:33:54] [INFO ] After 83ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 10:33:54] [INFO ] After 198ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-04-07 10:33:54] [INFO ] After 552ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 416/416 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 211 transition count 415
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 210 transition count 415
Applied a total of 2 rules in 27 ms. Remains 210 /211 variables (removed 1) and now considering 415/416 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 210/211 places, 415/416 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 471954 steps, run visited all 1 properties in 2181 ms. (steps per millisecond=216 )
Probabilistic random walk after 471954 steps, saw 328889 distinct states, run finished after 2181 ms. (steps per millisecond=216 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 212 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 116 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 146 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 251 ms.
Product exploration explored 100000 steps with 0 reset in 377 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 176 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 416/416 transitions.
Applied a total of 0 rules in 12 ms. Remains 211 /211 variables (removed 0) and now considering 416/416 (removed 0) transitions.
[2023-04-07 10:33:58] [INFO ] Redundant transitions in 2 ms returned []
[2023-04-07 10:33:58] [INFO ] Invariant cache hit.
[2023-04-07 10:33:59] [INFO ] Dead Transitions using invariants and state equation in 570 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 619 ms. Remains : 211/211 places, 416/416 transitions.
Support contains 3 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 416/416 transitions.
Applied a total of 0 rules in 2 ms. Remains 211 /211 variables (removed 0) and now considering 416/416 (removed 0) transitions.
[2023-04-07 10:33:59] [INFO ] Invariant cache hit.
[2023-04-07 10:33:59] [INFO ] Implicit Places using invariants in 464 ms returned []
[2023-04-07 10:33:59] [INFO ] Invariant cache hit.
[2023-04-07 10:34:00] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-04-07 10:34:00] [INFO ] Implicit Places using invariants and state equation in 975 ms returned []
Implicit Place search using SMT with State Equation took 1456 ms to find 0 implicit places.
[2023-04-07 10:34:00] [INFO ] Invariant cache hit.
[2023-04-07 10:34:01] [INFO ] Dead Transitions using invariants and state equation in 470 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1938 ms. Remains : 211/211 places, 416/416 transitions.
Treatment of property Anderson-PT-09-LTLCardinality-14 finished in 18209 ms.
[2023-04-07 10:34:01] [INFO ] Flatten gal took : 100 ms
[2023-04-07 10:34:01] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-04-07 10:34:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 380 places, 681 transitions and 2392 arcs took 16 ms.
Total runtime 134398 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1403/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1403/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1403/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Anderson-PT-09-LTLCardinality-09
Could not compute solution for formula : Anderson-PT-09-LTLCardinality-10
Could not compute solution for formula : Anderson-PT-09-LTLCardinality-14

BK_STOP 1680863644236

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name Anderson-PT-09-LTLCardinality-09
ltl formula formula --ltl=/tmp/1403/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 380 places, 681 transitions and 2392 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1403/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.210 real 0.030 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1403/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1403/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1403/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name Anderson-PT-09-LTLCardinality-10
ltl formula formula --ltl=/tmp/1403/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 380 places, 681 transitions and 2392 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.190 real 0.020 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1403/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1403/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1403/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1403/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x5608ec9213f4]
1: pnml2lts-mc(+0xa2496) [0x5608ec921496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f5bb66d1140]
3: pnml2lts-mc(+0x405be5) [0x5608ecc84be5]
4: pnml2lts-mc(+0x16b3f9) [0x5608ec9ea3f9]
5: pnml2lts-mc(+0x164ac4) [0x5608ec9e3ac4]
6: pnml2lts-mc(+0x272e0a) [0x5608ecaf1e0a]
7: pnml2lts-mc(+0xb61f0) [0x5608ec9351f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f5bb65244d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f5bb652467a]
10: pnml2lts-mc(+0xa1581) [0x5608ec920581]
11: pnml2lts-mc(+0xa1910) [0x5608ec920910]
12: pnml2lts-mc(+0xa32a2) [0x5608ec9222a2]
13: pnml2lts-mc(+0xa50f4) [0x5608ec9240f4]
14: pnml2lts-mc(+0xa516b) [0x5608ec92416b]
15: pnml2lts-mc(+0x3f34b3) [0x5608ecc724b3]
16: pnml2lts-mc(+0x7c63d) [0x5608ec8fb63d]
17: pnml2lts-mc(+0x67d86) [0x5608ec8e6d86]
18: pnml2lts-mc(+0x60a8a) [0x5608ec8dfa8a]
19: pnml2lts-mc(+0x5eb15) [0x5608ec8ddb15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f5bb650cd0a]
21: pnml2lts-mc(+0x6075e) [0x5608ec8df75e]
ltl formula name Anderson-PT-09-LTLCardinality-14
ltl formula formula --ltl=/tmp/1403/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 380 places, 681 transitions and 2392 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1403/ltl_2_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.260 real 0.020 user 0.040 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1403/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1403/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1403/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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