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.r517-tall-167987243600235.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 itstools
Input is EisenbergMcGuire-PT-05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r517-tall-167987243600235
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 968K
-rw-r--r-- 1 mcc users 9.1K Mar 23 15:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Mar 23 15:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 14K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 23 15:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Mar 23 15:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 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 460K 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 EisenbergMcGuire-PT-05-LTLCardinality-00
FORMULA_NAME EisenbergMcGuire-PT-05-LTLCardinality-01
FORMULA_NAME EisenbergMcGuire-PT-05-LTLCardinality-02
FORMULA_NAME EisenbergMcGuire-PT-05-LTLCardinality-03
FORMULA_NAME EisenbergMcGuire-PT-05-LTLCardinality-04
FORMULA_NAME EisenbergMcGuire-PT-05-LTLCardinality-05
FORMULA_NAME EisenbergMcGuire-PT-05-LTLCardinality-06
FORMULA_NAME EisenbergMcGuire-PT-05-LTLCardinality-07
FORMULA_NAME EisenbergMcGuire-PT-05-LTLCardinality-08
FORMULA_NAME EisenbergMcGuire-PT-05-LTLCardinality-09
FORMULA_NAME EisenbergMcGuire-PT-05-LTLCardinality-10
FORMULA_NAME EisenbergMcGuire-PT-05-LTLCardinality-11
FORMULA_NAME EisenbergMcGuire-PT-05-LTLCardinality-12
FORMULA_NAME EisenbergMcGuire-PT-05-LTLCardinality-13
FORMULA_NAME EisenbergMcGuire-PT-05-LTLCardinality-14
FORMULA_NAME EisenbergMcGuire-PT-05-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680822832882

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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-05
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2023-04-06 23:13:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-04-06 23:13:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 23:13:54] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2023-04-06 23:13:54] [INFO ] Transformed 295 places.
[2023-04-06 23:13:54] [INFO ] Transformed 800 transitions.
[2023-04-06 23:13:54] [INFO ] Found NUPN structural information;
[2023-04-06 23:13:54] [INFO ] Parsed PT model containing 295 places and 800 transitions and 3600 arcs in 146 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA EisenbergMcGuire-PT-05-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-05-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-05-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-05-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-05-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-05-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 295 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 295/295 places, 800/800 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 278 transition count 715
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 278 transition count 715
Applied a total of 34 rules in 47 ms. Remains 278 /295 variables (removed 17) and now considering 715/800 (removed 85) transitions.
[2023-04-06 23:13:54] [INFO ] Flow matrix only has 380 transitions (discarded 335 similar events)
// Phase 1: matrix 380 rows 278 cols
[2023-04-06 23:13:54] [INFO ] Computed 16 invariants in 21 ms
[2023-04-06 23:13:55] [INFO ] Implicit Places using invariants in 443 ms returned []
[2023-04-06 23:13:55] [INFO ] Flow matrix only has 380 transitions (discarded 335 similar events)
[2023-04-06 23:13:55] [INFO ] Invariant cache hit.
[2023-04-06 23:13:55] [INFO ] State equation strengthened by 128 read => feed constraints.
[2023-04-06 23:13:55] [INFO ] Implicit Places using invariants and state equation in 615 ms returned []
Implicit Place search using SMT with State Equation took 1084 ms to find 0 implicit places.
[2023-04-06 23:13:55] [INFO ] Flow matrix only has 380 transitions (discarded 335 similar events)
[2023-04-06 23:13:55] [INFO ] Invariant cache hit.
[2023-04-06 23:13:56] [INFO ] Dead Transitions using invariants and state equation in 245 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 278/295 places, 715/800 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1379 ms. Remains : 278/295 places, 715/800 transitions.
Support contains 37 out of 278 places after structural reductions.
[2023-04-06 23:13:56] [INFO ] Flatten gal took : 69 ms
[2023-04-06 23:13:56] [INFO ] Flatten gal took : 38 ms
[2023-04-06 23:13:56] [INFO ] Input system was already deterministic with 715 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 479 ms. (steps per millisecond=20 ) properties (out of 22) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-04-06 23:13:57] [INFO ] Flow matrix only has 380 transitions (discarded 335 similar events)
[2023-04-06 23:13:57] [INFO ] Invariant cache hit.
[2023-04-06 23:13:57] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-04-06 23:13:57] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-06 23:13:57] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-04-06 23:13:57] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-04-06 23:13:57] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 3 ms returned sat
[2023-04-06 23:13:57] [INFO ] After 232ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-04-06 23:13:57] [INFO ] State equation strengthened by 128 read => feed constraints.
[2023-04-06 23:13:58] [INFO ] After 205ms SMT Verify possible using 128 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-04-06 23:13:58] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 4 ms to minimize.
[2023-04-06 23:13:58] [INFO ] Deduced a trap composed of 55 places in 129 ms of which 1 ms to minimize.
[2023-04-06 23:13:58] [INFO ] Deduced a trap composed of 57 places in 98 ms of which 1 ms to minimize.
[2023-04-06 23:13:58] [INFO ] Deduced a trap composed of 76 places in 106 ms of which 1 ms to minimize.
[2023-04-06 23:13:58] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 0 ms to minimize.
[2023-04-06 23:13:58] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 0 ms to minimize.
[2023-04-06 23:13:58] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 0 ms to minimize.
[2023-04-06 23:13:59] [INFO ] Deduced a trap composed of 73 places in 97 ms of which 1 ms to minimize.
[2023-04-06 23:13:59] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 1 ms to minimize.
[2023-04-06 23:13:59] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 0 ms to minimize.
[2023-04-06 23:13:59] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 1 ms to minimize.
[2023-04-06 23:13:59] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 0 ms to minimize.
[2023-04-06 23:13:59] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2023-04-06 23:13:59] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1523 ms
[2023-04-06 23:13:59] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 0 ms to minimize.
[2023-04-06 23:13:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2023-04-06 23:13:59] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-04-06 23:13:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2023-04-06 23:13:59] [INFO ] After 2155ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :10
Attempting to minimize the solution found.
Minimization took 188 ms.
[2023-04-06 23:14:00] [INFO ] After 2776ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :10
Fused 11 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 89 ms.
Support contains 17 out of 278 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 715/715 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 278 transition count 710
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 273 transition count 710
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 71 Pre rules applied. Total rules applied 10 place count 273 transition count 639
Deduced a syphon composed of 71 places in 1 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 152 place count 202 transition count 639
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 155 place count 199 transition count 624
Iterating global reduction 2 with 3 rules applied. Total rules applied 158 place count 199 transition count 624
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 196 place count 180 transition count 605
Applied a total of 196 rules in 70 ms. Remains 180 /278 variables (removed 98) and now considering 605/715 (removed 110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 180/278 places, 605/715 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Finished probabilistic random walk after 576502 steps, run visited all 10 properties in 2094 ms. (steps per millisecond=275 )
Probabilistic random walk after 576502 steps, saw 117438 distinct states, run finished after 2094 ms. (steps per millisecond=275 ) properties seen :10
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p1 U G(!p1))&&(F(p3)||p2)&&p0)))'
Support contains 5 out of 278 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 278/278 places, 715/715 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 276 transition count 705
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 276 transition count 705
Applied a total of 4 rules in 10 ms. Remains 276 /278 variables (removed 2) and now considering 705/715 (removed 10) transitions.
[2023-04-06 23:14:03] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
// Phase 1: matrix 370 rows 276 cols
[2023-04-06 23:14:03] [INFO ] Computed 16 invariants in 2 ms
[2023-04-06 23:14:03] [INFO ] Implicit Places using invariants in 180 ms returned []
[2023-04-06 23:14:03] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
[2023-04-06 23:14:03] [INFO ] Invariant cache hit.
[2023-04-06 23:14:03] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-04-06 23:14:03] [INFO ] Implicit Places using invariants and state equation in 559 ms returned []
Implicit Place search using SMT with State Equation took 743 ms to find 0 implicit places.
[2023-04-06 23:14:03] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
[2023-04-06 23:14:03] [INFO ] Invariant cache hit.
[2023-04-06 23:14:04] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 276/278 places, 705/715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 970 ms. Remains : 276/278 places, 705/715 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 363 ms :[(OR (NOT p0) p1 (AND (NOT p2) (NOT p3))), (OR (NOT p0) p1 (AND (NOT p2) (NOT p3))), true, p1, p1, (NOT p3)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s60 0) (EQ s243 1)), p1:(OR (EQ s172 0) (EQ s50 1)), p2:(OR (EQ s243 0) (EQ s60 1)), p3:(OR (EQ s172 0) (EQ s75 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA EisenbergMcGuire-PT-05-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLCardinality-01 finished in 1394 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 278 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 278/278 places, 715/715 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 275 transition count 700
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 275 transition count 700
Applied a total of 6 rules in 17 ms. Remains 275 /278 variables (removed 3) and now considering 700/715 (removed 15) transitions.
[2023-04-06 23:14:04] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
// Phase 1: matrix 365 rows 275 cols
[2023-04-06 23:14:04] [INFO ] Computed 16 invariants in 3 ms
[2023-04-06 23:14:04] [INFO ] Implicit Places using invariants in 160 ms returned []
[2023-04-06 23:14:04] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2023-04-06 23:14:04] [INFO ] Invariant cache hit.
[2023-04-06 23:14:04] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 23:14:05] [INFO ] Implicit Places using invariants and state equation in 488 ms returned []
Implicit Place search using SMT with State Equation took 655 ms to find 0 implicit places.
[2023-04-06 23:14:05] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2023-04-06 23:14:05] [INFO ] Invariant cache hit.
[2023-04-06 23:14:05] [INFO ] Dead Transitions using invariants and state equation in 240 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 275/278 places, 700/715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 915 ms. Remains : 275/278 places, 700/715 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s222 0) (EQ s257 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA EisenbergMcGuire-PT-05-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLCardinality-04 finished in 1050 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 278 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 278/278 places, 715/715 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 275 transition count 700
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 275 transition count 700
Applied a total of 6 rules in 13 ms. Remains 275 /278 variables (removed 3) and now considering 700/715 (removed 15) transitions.
[2023-04-06 23:14:05] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2023-04-06 23:14:05] [INFO ] Invariant cache hit.
[2023-04-06 23:14:05] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-04-06 23:14:05] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2023-04-06 23:14:05] [INFO ] Invariant cache hit.
[2023-04-06 23:14:05] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 23:14:06] [INFO ] Implicit Places using invariants and state equation in 599 ms returned []
Implicit Place search using SMT with State Equation took 730 ms to find 0 implicit places.
[2023-04-06 23:14:06] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2023-04-06 23:14:06] [INFO ] Invariant cache hit.
[2023-04-06 23:14:06] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 275/278 places, 700/715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 971 ms. Remains : 275/278 places, 700/715 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLCardinality-05 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:(AND (NEQ s15 0) (NEQ s129 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 52 steps with 0 reset in 2 ms.
FORMULA EisenbergMcGuire-PT-05-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLCardinality-05 finished in 1079 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(X(F(p1))))))'
Support contains 5 out of 278 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 278/278 places, 715/715 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 275 transition count 700
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 275 transition count 700
Applied a total of 6 rules in 11 ms. Remains 275 /278 variables (removed 3) and now considering 700/715 (removed 15) transitions.
[2023-04-06 23:14:06] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2023-04-06 23:14:06] [INFO ] Invariant cache hit.
[2023-04-06 23:14:06] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-04-06 23:14:06] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2023-04-06 23:14:06] [INFO ] Invariant cache hit.
[2023-04-06 23:14:06] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 23:14:07] [INFO ] Implicit Places using invariants and state equation in 544 ms returned []
Implicit Place search using SMT with State Equation took 691 ms to find 0 implicit places.
[2023-04-06 23:14:07] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2023-04-06 23:14:07] [INFO ] Invariant cache hit.
[2023-04-06 23:14:07] [INFO ] Dead Transitions using invariants and state equation in 244 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 275/278 places, 700/715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 947 ms. Remains : 275/278 places, 700/715 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s6 0), p1:(AND (EQ s166 0) (EQ s138 1) (EQ s39 0) (EQ s19 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 212 ms.
Stack based approach found an accepted trace after 26 steps with 0 reset with depth 27 and stack size 27 in 0 ms.
FORMULA EisenbergMcGuire-PT-05-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLCardinality-06 finished in 1361 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(p1)||p0))))'
Support contains 2 out of 278 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 278/278 places, 715/715 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 275 transition count 700
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 275 transition count 700
Applied a total of 6 rules in 14 ms. Remains 275 /278 variables (removed 3) and now considering 700/715 (removed 15) transitions.
[2023-04-06 23:14:08] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2023-04-06 23:14:08] [INFO ] Invariant cache hit.
[2023-04-06 23:14:08] [INFO ] Implicit Places using invariants in 201 ms returned []
[2023-04-06 23:14:08] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2023-04-06 23:14:08] [INFO ] Invariant cache hit.
[2023-04-06 23:14:08] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 23:14:08] [INFO ] Implicit Places using invariants and state equation in 549 ms returned []
Implicit Place search using SMT with State Equation took 758 ms to find 0 implicit places.
[2023-04-06 23:14:08] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2023-04-06 23:14:08] [INFO ] Invariant cache hit.
[2023-04-06 23:14:09] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 275/278 places, 700/715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 992 ms. Remains : 275/278 places, 700/715 transitions.
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLCardinality-07 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 s42 0) (EQ s49 1)), p1:(OR (EQ s42 0) (EQ s49 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 313 ms.
Product exploration explored 100000 steps with 50000 reset in 265 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND 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 17 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-05-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-05-LTLCardinality-07 finished in 1749 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 278 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 278/278 places, 715/715 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 275 transition count 700
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 275 transition count 700
Applied a total of 6 rules in 11 ms. Remains 275 /278 variables (removed 3) and now considering 700/715 (removed 15) transitions.
[2023-04-06 23:14:09] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2023-04-06 23:14:09] [INFO ] Invariant cache hit.
[2023-04-06 23:14:09] [INFO ] Implicit Places using invariants in 132 ms returned []
[2023-04-06 23:14:09] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2023-04-06 23:14:09] [INFO ] Invariant cache hit.
[2023-04-06 23:14:10] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 23:14:10] [INFO ] Implicit Places using invariants and state equation in 491 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
[2023-04-06 23:14:10] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2023-04-06 23:14:10] [INFO ] Invariant cache hit.
[2023-04-06 23:14:10] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 275/278 places, 700/715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 866 ms. Remains : 275/278 places, 700/715 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s243 0) (EQ s178 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 50000 reset in 242 ms.
Product exploration explored 100000 steps with 50000 reset in 246 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), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-05-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-05-LTLCardinality-09 finished in 1479 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((((F(p1) U p2)||p0)&&(G(!p3) U p2)))))'
Support contains 6 out of 278 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 278/278 places, 715/715 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 278 transition count 710
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 273 transition count 710
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 75 Pre rules applied. Total rules applied 10 place count 273 transition count 635
Deduced a syphon composed of 75 places in 1 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 160 place count 198 transition count 635
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 163 place count 195 transition count 620
Iterating global reduction 2 with 3 rules applied. Total rules applied 166 place count 195 transition count 620
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 204 place count 176 transition count 601
Applied a total of 204 rules in 45 ms. Remains 176 /278 variables (removed 102) and now considering 601/715 (removed 114) transitions.
[2023-04-06 23:14:11] [INFO ] Flow matrix only has 266 transitions (discarded 335 similar events)
// Phase 1: matrix 266 rows 176 cols
[2023-04-06 23:14:11] [INFO ] Computed 16 invariants in 6 ms
[2023-04-06 23:14:11] [INFO ] Implicit Places using invariants in 130 ms returned []
[2023-04-06 23:14:11] [INFO ] Flow matrix only has 266 transitions (discarded 335 similar events)
[2023-04-06 23:14:11] [INFO ] Invariant cache hit.
[2023-04-06 23:14:11] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 23:14:11] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
[2023-04-06 23:14:11] [INFO ] Redundant transitions in 39 ms returned []
[2023-04-06 23:14:11] [INFO ] Flow matrix only has 266 transitions (discarded 335 similar events)
[2023-04-06 23:14:11] [INFO ] Invariant cache hit.
[2023-04-06 23:14:12] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 176/278 places, 601/715 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 757 ms. Remains : 176/278 places, 601/715 transitions.
Stuttering acceptance computed with spot in 519 ms :[(NOT p2), (AND (NOT p2) p3), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2) p3), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(OR p2 (NOT p3)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p3), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p3)), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0, 1} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=(AND p2 p3), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p3), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p2 (NOT p3)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p2) p3), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p3)), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0, 1} source=2 dest: 2}], [{ cond=(OR (AND p2 (NOT p1)) (AND (NOT p3) p0 (NOT p1))), acceptance={0} source=3 dest: 3}, { cond=(OR (AND (NOT p2) p3 (NOT p1)) (AND (NOT p2) (NOT p0) (NOT p1))), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p3) p0 (NOT p1)), acceptance={1} source=3 dest: 5}, { cond=(AND (NOT p2) (NOT p3) p0 (NOT p1)), acceptance={0, 1} source=3 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={0} source=4 dest: 4}, { cond=(OR (AND (NOT p2) p3) (AND (NOT p2) (NOT p0))), acceptance={0, 1} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p3) p0 (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={0, 1} source=4 dest: 7}], [{ cond=(AND p2 p3 (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p2) p3 (NOT p1)), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p2 (NOT p3) (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={1} source=5 dest: 5}], [{ cond=(AND (NOT p2) p3 (NOT p1)), acceptance={0, 1} source=6 dest: 3}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={1} source=6 dest: 5}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={0, 1} source=6 dest: 6}], [{ cond=(AND (NOT p2) p3 (NOT p1)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p2) p3), acceptance={0, 1} source=7 dest: 4}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0, 1} source=7 dest: 7}]], initial=0, aps=[p2:(OR (EQ s56 0) (EQ s85 1)), p3:(OR (EQ s60 0) (EQ s119 1)), p0:(OR (EQ s60 0) (EQ s119 1)), p1:(OR (EQ s55 0) (EQ s30 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 204 ms.
Stack based approach found an accepted trace after 338 steps with 0 reset with depth 339 and stack size 267 in 1 ms.
FORMULA EisenbergMcGuire-PT-05-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLCardinality-10 finished in 1505 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((X(F(p0))||(G(p2)&&p1))))'
Support contains 5 out of 278 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 278/278 places, 715/715 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 275 transition count 700
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 275 transition count 700
Applied a total of 6 rules in 9 ms. Remains 275 /278 variables (removed 3) and now considering 700/715 (removed 15) transitions.
[2023-04-06 23:14:12] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
// Phase 1: matrix 365 rows 275 cols
[2023-04-06 23:14:12] [INFO ] Computed 16 invariants in 2 ms
[2023-04-06 23:14:12] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-04-06 23:14:12] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2023-04-06 23:14:12] [INFO ] Invariant cache hit.
[2023-04-06 23:14:13] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-06 23:14:13] [INFO ] Implicit Places using invariants and state equation in 519 ms returned []
Implicit Place search using SMT with State Equation took 662 ms to find 0 implicit places.
[2023-04-06 23:14:13] [INFO ] Flow matrix only has 365 transitions (discarded 335 similar events)
[2023-04-06 23:14:13] [INFO ] Invariant cache hit.
[2023-04-06 23:14:13] [INFO ] Dead Transitions using invariants and state equation in 235 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 275/278 places, 700/715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 908 ms. Remains : 275/278 places, 700/715 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p2), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s137 0) (EQ s231 1)), p2:(AND (EQ s137 0) (EQ s231 1)), p0:(OR (EQ s11 1) (EQ s114 0) (EQ s62 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 296 ms.
Product exploration explored 100000 steps with 50000 reset in 294 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 120 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-05-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-05-LTLCardinality-12 finished in 1773 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 278 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 278/278 places, 715/715 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 278 transition count 710
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 273 transition count 710
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 78 Pre rules applied. Total rules applied 10 place count 273 transition count 632
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 166 place count 195 transition count 632
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 168 place count 193 transition count 622
Iterating global reduction 2 with 2 rules applied. Total rules applied 170 place count 193 transition count 622
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 208 place count 174 transition count 603
Applied a total of 208 rules in 31 ms. Remains 174 /278 variables (removed 104) and now considering 603/715 (removed 112) transitions.
[2023-04-06 23:14:14] [INFO ] Flow matrix only has 268 transitions (discarded 335 similar events)
// Phase 1: matrix 268 rows 174 cols
[2023-04-06 23:14:14] [INFO ] Computed 16 invariants in 2 ms
[2023-04-06 23:14:14] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-04-06 23:14:14] [INFO ] Flow matrix only has 268 transitions (discarded 335 similar events)
[2023-04-06 23:14:14] [INFO ] Invariant cache hit.
[2023-04-06 23:14:14] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-04-06 23:14:15] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
[2023-04-06 23:14:15] [INFO ] Redundant transitions in 13 ms returned []
[2023-04-06 23:14:15] [INFO ] Flow matrix only has 268 transitions (discarded 335 similar events)
[2023-04-06 23:14:15] [INFO ] Invariant cache hit.
[2023-04-06 23:14:15] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 174/278 places, 603/715 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 720 ms. Remains : 174/278 places, 603/715 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s57 1) (OR (EQ s45 0) (EQ s56 1)) (OR (EQ s45 0) (EQ s133 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 142 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 0 ms.
FORMULA EisenbergMcGuire-PT-05-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLCardinality-14 finished in 913 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((G((F(p0) U p1)) U p1))))'
Support contains 4 out of 278 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 278/278 places, 715/715 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 276 transition count 705
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 276 transition count 705
Applied a total of 4 rules in 8 ms. Remains 276 /278 variables (removed 2) and now considering 705/715 (removed 10) transitions.
[2023-04-06 23:14:15] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
// Phase 1: matrix 370 rows 276 cols
[2023-04-06 23:14:15] [INFO ] Computed 16 invariants in 5 ms
[2023-04-06 23:14:15] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-04-06 23:14:15] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
[2023-04-06 23:14:15] [INFO ] Invariant cache hit.
[2023-04-06 23:14:15] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-04-06 23:14:16] [INFO ] Implicit Places using invariants and state equation in 548 ms returned []
Implicit Place search using SMT with State Equation took 685 ms to find 0 implicit places.
[2023-04-06 23:14:16] [INFO ] Flow matrix only has 370 transitions (discarded 335 similar events)
[2023-04-06 23:14:16] [INFO ] Invariant cache hit.
[2023-04-06 23:14:16] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 276/278 places, 705/715 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 910 ms. Remains : 276/278 places, 705/715 transitions.
Stuttering acceptance computed with spot in 203 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-05-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 2}, { cond=(NOT p1), acceptance={0} source=5 dest: 4}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (EQ s75 0) (EQ s41 1)), p0:(OR (EQ s58 0) (EQ s98 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2811 reset in 153 ms.
Stack based approach found an accepted trace after 793 steps with 21 reset with depth 34 and stack size 33 in 1 ms.
FORMULA EisenbergMcGuire-PT-05-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-05-LTLCardinality-15 finished in 1292 ms.
All properties solved by simple procedures.
Total runtime 22341 ms.

BK_STOP 1680822857697

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="EisenbergMcGuire-PT-05"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is EisenbergMcGuire-PT-05, 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 r517-tall-167987243600235"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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