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.r489-tall-167912706700419.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 Szymanski-PT-a06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r489-tall-167912706700419
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.9K Feb 26 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 16:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 16:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 16:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Feb 26 16:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 16:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 16:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 101K Mar 5 18:23 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 Szymanski-PT-a06-LTLCardinality-00
FORMULA_NAME Szymanski-PT-a06-LTLCardinality-01
FORMULA_NAME Szymanski-PT-a06-LTLCardinality-02
FORMULA_NAME Szymanski-PT-a06-LTLCardinality-03
FORMULA_NAME Szymanski-PT-a06-LTLCardinality-04
FORMULA_NAME Szymanski-PT-a06-LTLCardinality-05
FORMULA_NAME Szymanski-PT-a06-LTLCardinality-06
FORMULA_NAME Szymanski-PT-a06-LTLCardinality-07
FORMULA_NAME Szymanski-PT-a06-LTLCardinality-08
FORMULA_NAME Szymanski-PT-a06-LTLCardinality-09
FORMULA_NAME Szymanski-PT-a06-LTLCardinality-10
FORMULA_NAME Szymanski-PT-a06-LTLCardinality-11
FORMULA_NAME Szymanski-PT-a06-LTLCardinality-12
FORMULA_NAME Szymanski-PT-a06-LTLCardinality-13
FORMULA_NAME Szymanski-PT-a06-LTLCardinality-14
FORMULA_NAME Szymanski-PT-a06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679243080465

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=Szymanski-PT-a06
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-19 16:24:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 16:24:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 16:24:42] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2023-03-19 16:24:42] [INFO ] Transformed 61 places.
[2023-03-19 16:24:42] [INFO ] Transformed 224 transitions.
[2023-03-19 16:24:42] [INFO ] Parsed PT model containing 61 places and 224 transitions and 900 arcs in 125 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 8 transitions.
FORMULA Szymanski-PT-a06-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a06-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a06-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 216/216 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 48 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 48 transition count 212
Applied a total of 2 rules in 21 ms. Remains 48 /49 variables (removed 1) and now considering 212/216 (removed 4) transitions.
[2023-03-19 16:24:42] [INFO ] Flow matrix only has 78 transitions (discarded 134 similar events)
// Phase 1: matrix 78 rows 48 cols
[2023-03-19 16:24:42] [INFO ] Computed 3 place invariants in 8 ms
[2023-03-19 16:24:42] [INFO ] Implicit Places using invariants in 187 ms returned []
[2023-03-19 16:24:42] [INFO ] Flow matrix only has 78 transitions (discarded 134 similar events)
[2023-03-19 16:24:42] [INFO ] Invariant cache hit.
[2023-03-19 16:24:42] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 16:24:42] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2023-03-19 16:24:42] [INFO ] Flow matrix only has 78 transitions (discarded 134 similar events)
[2023-03-19 16:24:42] [INFO ] Invariant cache hit.
[2023-03-19 16:24:42] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 48/49 places, 212/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 403 ms. Remains : 48/49 places, 212/216 transitions.
Support contains 31 out of 48 places after structural reductions.
[2023-03-19 16:24:43] [INFO ] Flatten gal took : 48 ms
[2023-03-19 16:24:43] [INFO ] Flatten gal took : 17 ms
[2023-03-19 16:24:43] [INFO ] Input system was already deterministic with 212 transitions.
Support contains 29 out of 48 places (down from 31) after GAL structural reductions.
Incomplete random walk after 10003 steps, including 16 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 30) seen :27
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-19 16:24:43] [INFO ] Flow matrix only has 78 transitions (discarded 134 similar events)
[2023-03-19 16:24:43] [INFO ] Invariant cache hit.
[2023-03-19 16:24:43] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 16:24:43] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 16:24:43] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
FORMULA Szymanski-PT-a06-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 9 stabilizing places and 36 stable transitions
Graph (complete) has 375 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 212/212 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 212
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 5 place count 43 transition count 200
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 43 transition count 200
Applied a total of 8 rules in 6 ms. Remains 43 /48 variables (removed 5) and now considering 200/212 (removed 12) transitions.
[2023-03-19 16:24:44] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
// Phase 1: matrix 75 rows 43 cols
[2023-03-19 16:24:44] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-19 16:24:44] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-19 16:24:44] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
[2023-03-19 16:24:44] [INFO ] Invariant cache hit.
[2023-03-19 16:24:44] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 16:24:44] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2023-03-19 16:24:44] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
[2023-03-19 16:24:44] [INFO ] Invariant cache hit.
[2023-03-19 16:24:44] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 43/48 places, 200/212 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 227 ms. Remains : 43/48 places, 200/212 transitions.
Stuttering acceptance computed with spot in 197 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Szymanski-PT-a06-LTLCardinality-01 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:(GT s18 s42)], 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 1 steps with 0 reset in 2 ms.
FORMULA Szymanski-PT-a06-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-a06-LTLCardinality-01 finished in 476 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U (X((p2||X(p2)))&&p1)))'
Support contains 6 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 212/212 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 212
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 44 transition count 200
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 44 transition count 200
Applied a total of 7 rules in 5 ms. Remains 44 /48 variables (removed 4) and now considering 200/212 (removed 12) transitions.
[2023-03-19 16:24:44] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
// Phase 1: matrix 75 rows 44 cols
[2023-03-19 16:24:44] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-19 16:24:44] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-19 16:24:44] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
[2023-03-19 16:24:44] [INFO ] Invariant cache hit.
[2023-03-19 16:24:44] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 16:24:44] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2023-03-19 16:24:44] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
[2023-03-19 16:24:44] [INFO ] Invariant cache hit.
[2023-03-19 16:24:44] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 44/48 places, 200/212 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 223 ms. Remains : 44/48 places, 200/212 transitions.
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2), true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : Szymanski-PT-a06-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}, { cond=p1, acceptance={0} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=6 dest: 2}]], initial=0, aps=[p1:(AND (LEQ s33 s37) (LEQ s20 s29)), p0:(LEQ s43 s28), p2:(LEQ s33 s37)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 316 ms.
Product exploration explored 100000 steps with 50000 reset in 217 ms.
Computed a total of 8 stabilizing places and 32 stable transitions
Graph (complete) has 347 edges and 44 vertex of which 43 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 8 stabilizing places and 32 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) (NOT p2)))), true, (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0 p2)
Knowledge based reduction with 15 factoid took 578 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Szymanski-PT-a06-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Szymanski-PT-a06-LTLCardinality-02 finished in 1646 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 212/212 transitions.
Graph (complete) has 375 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 42 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 42 transition count 196
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 25 place count 42 transition count 180
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 27 place count 40 transition count 172
Iterating global reduction 0 with 2 rules applied. Total rules applied 29 place count 40 transition count 172
Applied a total of 29 rules in 32 ms. Remains 40 /48 variables (removed 8) and now considering 172/212 (removed 40) transitions.
[2023-03-19 16:24:46] [INFO ] Flow matrix only has 68 transitions (discarded 104 similar events)
// Phase 1: matrix 68 rows 40 cols
[2023-03-19 16:24:46] [INFO ] Computed 1 place invariants in 5 ms
[2023-03-19 16:24:46] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-19 16:24:46] [INFO ] Flow matrix only has 68 transitions (discarded 104 similar events)
[2023-03-19 16:24:46] [INFO ] Invariant cache hit.
[2023-03-19 16:24:46] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 16:24:46] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2023-03-19 16:24:46] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-19 16:24:46] [INFO ] Flow matrix only has 68 transitions (discarded 104 similar events)
[2023-03-19 16:24:46] [INFO ] Invariant cache hit.
[2023-03-19 16:24:46] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/48 places, 172/212 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 210 ms. Remains : 40/48 places, 172/212 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : Szymanski-PT-a06-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 s33)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 171 steps with 0 reset in 1 ms.
FORMULA Szymanski-PT-a06-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-a06-LTLCardinality-03 finished in 275 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 212/212 transitions.
Graph (complete) has 375 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 42 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 42 transition count 196
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 25 place count 42 transition count 180
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 27 place count 40 transition count 172
Iterating global reduction 0 with 2 rules applied. Total rules applied 29 place count 40 transition count 172
Applied a total of 29 rules in 22 ms. Remains 40 /48 variables (removed 8) and now considering 172/212 (removed 40) transitions.
[2023-03-19 16:24:46] [INFO ] Flow matrix only has 68 transitions (discarded 104 similar events)
[2023-03-19 16:24:46] [INFO ] Invariant cache hit.
[2023-03-19 16:24:46] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-19 16:24:46] [INFO ] Flow matrix only has 68 transitions (discarded 104 similar events)
[2023-03-19 16:24:46] [INFO ] Invariant cache hit.
[2023-03-19 16:24:46] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 16:24:46] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2023-03-19 16:24:46] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-19 16:24:46] [INFO ] Flow matrix only has 68 transitions (discarded 104 similar events)
[2023-03-19 16:24:46] [INFO ] Invariant cache hit.
[2023-03-19 16:24:46] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/48 places, 172/212 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 243 ms. Remains : 40/48 places, 172/212 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : Szymanski-PT-a06-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 s28)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1426 steps with 18 reset in 5 ms.
FORMULA Szymanski-PT-a06-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-a06-LTLCardinality-04 finished in 304 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(p0)))&&F(p1)))'
Support contains 2 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 212/212 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 212
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 5 place count 43 transition count 200
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 43 transition count 200
Applied a total of 8 rules in 5 ms. Remains 43 /48 variables (removed 5) and now considering 200/212 (removed 12) transitions.
[2023-03-19 16:24:46] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
// Phase 1: matrix 75 rows 43 cols
[2023-03-19 16:24:46] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-19 16:24:46] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-19 16:24:46] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
[2023-03-19 16:24:46] [INFO ] Invariant cache hit.
[2023-03-19 16:24:46] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 16:24:46] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2023-03-19 16:24:46] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
[2023-03-19 16:24:46] [INFO ] Invariant cache hit.
[2023-03-19 16:24:46] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 43/48 places, 200/212 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 202 ms. Remains : 43/48 places, 200/212 transitions.
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Running random walk in product with property : Szymanski-PT-a06-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ 1 s5), p0:(GT 3 s12)], 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, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 392 steps with 5 reset in 2 ms.
FORMULA Szymanski-PT-a06-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-a06-LTLCardinality-05 finished in 447 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0||G(p1))) U G(p2)))'
Support contains 3 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 212/212 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 212
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 6 place count 42 transition count 196
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 42 transition count 196
Applied a total of 10 rules in 6 ms. Remains 42 /48 variables (removed 6) and now considering 196/212 (removed 16) transitions.
[2023-03-19 16:24:47] [INFO ] Flow matrix only has 74 transitions (discarded 122 similar events)
// Phase 1: matrix 74 rows 42 cols
[2023-03-19 16:24:47] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-19 16:24:47] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-19 16:24:47] [INFO ] Flow matrix only has 74 transitions (discarded 122 similar events)
[2023-03-19 16:24:47] [INFO ] Invariant cache hit.
[2023-03-19 16:24:47] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 16:24:47] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2023-03-19 16:24:47] [INFO ] Flow matrix only has 74 transitions (discarded 122 similar events)
[2023-03-19 16:24:47] [INFO ] Invariant cache hit.
[2023-03-19 16:24:47] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 42/48 places, 196/212 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 190 ms. Remains : 42/48 places, 196/212 transitions.
Stuttering acceptance computed with spot in 298 ms :[(NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), true, (NOT p1), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : Szymanski-PT-a06-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={} source=5 dest: 3}, { cond=(OR (AND p2 p0) (AND p2 p1)), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=6 dest: 4}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p2 p0 p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(LEQ 1 s25), p0:(LEQ 3 s22), p1:(LEQ 2 s30)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA Szymanski-PT-a06-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-a06-LTLCardinality-06 finished in 509 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 212/212 transitions.
Graph (complete) has 375 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 42 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 42 transition count 196
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 25 place count 42 transition count 180
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 27 place count 40 transition count 172
Iterating global reduction 0 with 2 rules applied. Total rules applied 29 place count 40 transition count 172
Applied a total of 29 rules in 30 ms. Remains 40 /48 variables (removed 8) and now considering 172/212 (removed 40) transitions.
[2023-03-19 16:24:47] [INFO ] Flow matrix only has 68 transitions (discarded 104 similar events)
// Phase 1: matrix 68 rows 40 cols
[2023-03-19 16:24:47] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-19 16:24:47] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-19 16:24:47] [INFO ] Flow matrix only has 68 transitions (discarded 104 similar events)
[2023-03-19 16:24:47] [INFO ] Invariant cache hit.
[2023-03-19 16:24:47] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 16:24:47] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2023-03-19 16:24:47] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-19 16:24:47] [INFO ] Flow matrix only has 68 transitions (discarded 104 similar events)
[2023-03-19 16:24:47] [INFO ] Invariant cache hit.
[2023-03-19 16:24:47] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/48 places, 172/212 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 230 ms. Remains : 40/48 places, 172/212 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : Szymanski-PT-a06-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s35)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 650 steps with 2 reset in 3 ms.
FORMULA Szymanski-PT-a06-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-a06-LTLCardinality-07 finished in 285 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p0)) U (p1&&F((p2&&F(p3))))))))'
Support contains 5 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 212/212 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 212
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 5 place count 43 transition count 200
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 43 transition count 200
Applied a total of 8 rules in 6 ms. Remains 43 /48 variables (removed 5) and now considering 200/212 (removed 12) transitions.
[2023-03-19 16:24:48] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
// Phase 1: matrix 75 rows 43 cols
[2023-03-19 16:24:48] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-19 16:24:48] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-19 16:24:48] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
[2023-03-19 16:24:48] [INFO ] Invariant cache hit.
[2023-03-19 16:24:48] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 16:24:48] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2023-03-19 16:24:48] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
[2023-03-19 16:24:48] [INFO ] Invariant cache hit.
[2023-03-19 16:24:48] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 43/48 places, 200/212 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 204 ms. Remains : 43/48 places, 200/212 transitions.
Stuttering acceptance computed with spot in 343 ms :[(OR (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (OR (NOT p2) (NOT p3)), (NOT p3)]
Running random walk in product with property : Szymanski-PT-a06-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=(NOT p1), acceptance={0} source=2 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 5}, { cond=(AND p1 p2 (NOT p3)), acceptance={0} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}, { cond=(AND p2 (NOT p3)), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p3), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ 2 s37), p0:(LEQ s32 s10), p2:(LEQ 2 s30), p3:(LEQ 2 s20)], 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, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2834 steps with 36 reset in 14 ms.
FORMULA Szymanski-PT-a06-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-a06-LTLCardinality-08 finished in 592 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(G(p0))&&F(p1)) U (p0 U p2)))'
Support contains 6 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 212/212 transitions.
Graph (complete) has 375 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 43 transition count 200
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 43 transition count 200
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 23 place count 43 transition count 184
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 25 place count 41 transition count 176
Iterating global reduction 0 with 2 rules applied. Total rules applied 27 place count 41 transition count 176
Applied a total of 27 rules in 20 ms. Remains 41 /48 variables (removed 7) and now considering 176/212 (removed 36) transitions.
[2023-03-19 16:24:48] [INFO ] Flow matrix only has 69 transitions (discarded 107 similar events)
// Phase 1: matrix 69 rows 41 cols
[2023-03-19 16:24:48] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-19 16:24:48] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-19 16:24:48] [INFO ] Flow matrix only has 69 transitions (discarded 107 similar events)
[2023-03-19 16:24:48] [INFO ] Invariant cache hit.
[2023-03-19 16:24:48] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 16:24:48] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2023-03-19 16:24:48] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 16:24:48] [INFO ] Flow matrix only has 69 transitions (discarded 107 similar events)
[2023-03-19 16:24:48] [INFO ] Invariant cache hit.
[2023-03-19 16:24:48] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/48 places, 176/212 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 195 ms. Remains : 41/48 places, 176/212 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p2), (NOT p0), (NOT p1)]
Running random walk in product with property : Szymanski-PT-a06-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (LEQ s38 0) (LEQ s0 s28)), p0:(LEQ s5 s34), p1:(LEQ 3 s26)], 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 34329 reset in 190 ms.
Product exploration explored 100000 steps with 34170 reset in 172 ms.
Computed a total of 9 stabilizing places and 36 stable transitions
Computed a total of 9 stabilizing places and 36 stable transitions
Detected a total of 9/41 stabilizing places and 36/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 10 factoid took 533 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(NOT p2), (NOT p0), (NOT p1)]
Finished random walk after 6108 steps, including 6 resets, run visited all 5 properties in 60 ms. (steps per millisecond=101 )
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F p1), (F (NOT p0)), (F p2), (F (AND (NOT p2) (NOT p1) (NOT p0))), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 10 factoid took 686 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[(NOT p2), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 133 ms :[(NOT p2), (NOT p0), (NOT p1)]
[2023-03-19 16:24:51] [INFO ] Flow matrix only has 69 transitions (discarded 107 similar events)
[2023-03-19 16:24:51] [INFO ] Invariant cache hit.
[2023-03-19 16:24:51] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 16:24:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 16:24:51] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-19 16:24:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 16:24:51] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 16:24:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 16:24:51] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-19 16:24:51] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 16:24:51] [INFO ] [Nat]Added 9 Read/Feed constraints in 4 ms returned sat
[2023-03-19 16:24:51] [INFO ] Computed and/alt/rep : 21/107/21 causal constraints (skipped 46 transitions) in 7 ms.
[2023-03-19 16:24:51] [INFO ] Added : 11 causal constraints over 3 iterations in 47 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 6 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 41 /41 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-19 16:24:51] [INFO ] Flow matrix only has 69 transitions (discarded 107 similar events)
[2023-03-19 16:24:51] [INFO ] Invariant cache hit.
[2023-03-19 16:24:51] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-19 16:24:51] [INFO ] Flow matrix only has 69 transitions (discarded 107 similar events)
[2023-03-19 16:24:51] [INFO ] Invariant cache hit.
[2023-03-19 16:24:51] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 16:24:51] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2023-03-19 16:24:51] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-19 16:24:51] [INFO ] Flow matrix only has 69 transitions (discarded 107 similar events)
[2023-03-19 16:24:51] [INFO ] Invariant cache hit.
[2023-03-19 16:24:51] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 193 ms. Remains : 41/41 places, 176/176 transitions.
Computed a total of 9 stabilizing places and 36 stable transitions
Computed a total of 9 stabilizing places and 36 stable transitions
Detected a total of 9/41 stabilizing places and 36/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p0), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 10 factoid took 542 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p2), (NOT p0), (NOT p1)]
Incomplete random walk after 10003 steps, including 9 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 16:24:52] [INFO ] Flow matrix only has 69 transitions (discarded 107 similar events)
[2023-03-19 16:24:52] [INFO ] Invariant cache hit.
[2023-03-19 16:24:52] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 16:24:52] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 16:24:52] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 16:24:52] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 16:24:52] [INFO ] After 12ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 16:24:52] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-19 16:24:52] [INFO ] After 147ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 6 out of 41 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 176/176 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 41 transition count 174
Applied a total of 2 rules in 6 ms. Remains 41 /41 variables (removed 0) and now considering 174/176 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 41/41 places, 174/176 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 776402 steps, run timeout after 3001 ms. (steps per millisecond=258 ) properties seen :{}
Probabilistic random walk after 776402 steps, saw 337126 distinct states, run finished after 3002 ms. (steps per millisecond=258 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-19 16:24:55] [INFO ] Flow matrix only has 67 transitions (discarded 107 similar events)
// Phase 1: matrix 67 rows 41 cols
[2023-03-19 16:24:55] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-19 16:24:55] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 16:24:55] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 16:24:55] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 16:24:55] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 16:24:55] [INFO ] After 10ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 16:24:55] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-19 16:24:55] [INFO ] After 105ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 6 out of 41 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 174/174 transitions.
Applied a total of 0 rules in 3 ms. Remains 41 /41 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 41/41 places, 174/174 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 174/174 transitions.
Applied a total of 0 rules in 3 ms. Remains 41 /41 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2023-03-19 16:24:55] [INFO ] Flow matrix only has 67 transitions (discarded 107 similar events)
[2023-03-19 16:24:55] [INFO ] Invariant cache hit.
[2023-03-19 16:24:55] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-19 16:24:55] [INFO ] Flow matrix only has 67 transitions (discarded 107 similar events)
[2023-03-19 16:24:55] [INFO ] Invariant cache hit.
[2023-03-19 16:24:55] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 16:24:55] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2023-03-19 16:24:55] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 16:24:55] [INFO ] Flow matrix only has 67 transitions (discarded 107 similar events)
[2023-03-19 16:24:55] [INFO ] Invariant cache hit.
[2023-03-19 16:24:55] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 41/41 places, 174/174 transitions.
Graph (trivial) has 118 edges and 41 vertex of which 18 / 41 are part of one of the 3 SCC in 2 ms
Free SCC test removed 15 places
Drop transitions removed 83 transitions
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 129 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 26 transition count 42
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 23 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 22 transition count 41
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 9 place count 22 transition count 40
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 11 place count 21 transition count 40
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 12 place count 21 transition count 40
Applied a total of 12 rules in 8 ms. Remains 21 /41 variables (removed 20) and now considering 40/174 (removed 134) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 40 rows 21 cols
[2023-03-19 16:24:56] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-19 16:24:56] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 16:24:56] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 16:24:56] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 16:24:56] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 16:24:56] [INFO ] After 7ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 16:24:56] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-19 16:24:56] [INFO ] After 78ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p0), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F p1), (F (NOT p0)), (F p2)]
Knowledge based reduction with 10 factoid took 682 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p2), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 156 ms :[(NOT p2), (NOT p0), (NOT p1)]
[2023-03-19 16:24:57] [INFO ] Flow matrix only has 69 transitions (discarded 107 similar events)
// Phase 1: matrix 69 rows 41 cols
[2023-03-19 16:24:57] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-19 16:24:57] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 16:24:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 16:24:57] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-19 16:24:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 16:24:57] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 16:24:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 16:24:57] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-19 16:24:57] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 16:24:57] [INFO ] [Nat]Added 9 Read/Feed constraints in 4 ms returned sat
[2023-03-19 16:24:57] [INFO ] Computed and/alt/rep : 21/107/21 causal constraints (skipped 46 transitions) in 6 ms.
[2023-03-19 16:24:57] [INFO ] Added : 11 causal constraints over 3 iterations in 37 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 126 ms :[(NOT p2), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 34155 reset in 160 ms.
Product exploration explored 100000 steps with 34103 reset in 168 ms.
Support contains 6 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 176/176 transitions.
Applied a total of 0 rules in 4 ms. Remains 41 /41 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-19 16:24:57] [INFO ] Flow matrix only has 69 transitions (discarded 107 similar events)
[2023-03-19 16:24:57] [INFO ] Invariant cache hit.
[2023-03-19 16:24:57] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-19 16:24:57] [INFO ] Flow matrix only has 69 transitions (discarded 107 similar events)
[2023-03-19 16:24:57] [INFO ] Invariant cache hit.
[2023-03-19 16:24:57] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 16:24:57] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2023-03-19 16:24:57] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 16:24:57] [INFO ] Flow matrix only has 69 transitions (discarded 107 similar events)
[2023-03-19 16:24:57] [INFO ] Invariant cache hit.
[2023-03-19 16:24:57] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 182 ms. Remains : 41/41 places, 176/176 transitions.
Treatment of property Szymanski-PT-a06-LTLCardinality-09 finished in 9444 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p0)&&(p1 U p2)))))'
Support contains 4 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 212/212 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 212
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 6 place count 42 transition count 196
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 42 transition count 196
Applied a total of 10 rules in 2 ms. Remains 42 /48 variables (removed 6) and now considering 196/212 (removed 16) transitions.
[2023-03-19 16:24:58] [INFO ] Flow matrix only has 74 transitions (discarded 122 similar events)
// Phase 1: matrix 74 rows 42 cols
[2023-03-19 16:24:58] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-19 16:24:58] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-19 16:24:58] [INFO ] Flow matrix only has 74 transitions (discarded 122 similar events)
[2023-03-19 16:24:58] [INFO ] Invariant cache hit.
[2023-03-19 16:24:58] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 16:24:58] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2023-03-19 16:24:58] [INFO ] Flow matrix only has 74 transitions (discarded 122 similar events)
[2023-03-19 16:24:58] [INFO ] Invariant cache hit.
[2023-03-19 16:24:58] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 42/48 places, 196/212 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 178 ms. Remains : 42/48 places, 196/212 transitions.
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (NOT p2)]
Running random walk in product with property : Szymanski-PT-a06-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(OR p2 p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(LEQ s38 s17), p1:(LEQ s33 0), p0:(LEQ 2 s41)], 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 3 steps with 0 reset in 1 ms.
FORMULA Szymanski-PT-a06-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-a06-LTLCardinality-10 finished in 405 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||(p0 U p1)))))'
Support contains 2 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 212/212 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 212
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 5 place count 43 transition count 200
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 43 transition count 200
Applied a total of 8 rules in 2 ms. Remains 43 /48 variables (removed 5) and now considering 200/212 (removed 12) transitions.
[2023-03-19 16:24:58] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
// Phase 1: matrix 75 rows 43 cols
[2023-03-19 16:24:58] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-19 16:24:58] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-19 16:24:58] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
[2023-03-19 16:24:58] [INFO ] Invariant cache hit.
[2023-03-19 16:24:58] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 16:24:58] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2023-03-19 16:24:58] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
[2023-03-19 16:24:58] [INFO ] Invariant cache hit.
[2023-03-19 16:24:58] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 43/48 places, 200/212 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 195 ms. Remains : 43/48 places, 200/212 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Szymanski-PT-a06-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(OR p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 s8), p1:(LEQ s28 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 0 ms.
FORMULA Szymanski-PT-a06-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-a06-LTLCardinality-12 finished in 302 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(p1&&X(p1)))))'
Support contains 3 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 212/212 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 212
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 5 place count 43 transition count 200
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 43 transition count 200
Applied a total of 8 rules in 2 ms. Remains 43 /48 variables (removed 5) and now considering 200/212 (removed 12) transitions.
[2023-03-19 16:24:58] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
// Phase 1: matrix 75 rows 43 cols
[2023-03-19 16:24:58] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-19 16:24:58] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-19 16:24:58] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
[2023-03-19 16:24:58] [INFO ] Invariant cache hit.
[2023-03-19 16:24:58] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 16:24:58] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2023-03-19 16:24:58] [INFO ] Flow matrix only has 75 transitions (discarded 125 similar events)
[2023-03-19 16:24:58] [INFO ] Invariant cache hit.
[2023-03-19 16:24:58] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 43/48 places, 200/212 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 202 ms. Remains : 43/48 places, 200/212 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Szymanski-PT-a06-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}]], initial=0, aps=[p0:(LEQ s0 s25), p1:(LEQ s12 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 148 ms.
Product exploration explored 100000 steps with 50000 reset in 136 ms.
Computed a total of 8 stabilizing places and 32 stable transitions
Computed a total of 8 stabilizing places and 32 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) p1)
Knowledge based reduction with 3 factoid took 289 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Szymanski-PT-a06-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Szymanski-PT-a06-LTLCardinality-13 finished in 868 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(G(p0))&&F(p1)) U (p0 U p2)))'
[2023-03-19 16:24:59] [INFO ] Flatten gal took : 12 ms
[2023-03-19 16:24:59] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-19 16:24:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 48 places, 212 transitions and 852 arcs took 2 ms.
Total runtime 17513 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1221/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Szymanski-PT-a06-LTLCardinality-09

BK_STOP 1679243100884

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name Szymanski-PT-a06-LTLCardinality-09
ltl formula formula --ltl=/tmp/1221/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 48 places, 212 transitions and 852 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1221/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1221/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1221/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1221/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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="Szymanski-PT-a06"
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 Szymanski-PT-a06, 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 r489-tall-167912706700419"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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