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.r169-tall-167838856500827.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 GPPP-PT-C0010N0000000100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838856500827
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 6.6K Feb 26 10:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 10:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 10:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 10:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 16:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 10:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Feb 26 10:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 10:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Feb 26 10:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1 Mar 5 18:22 large_marking
-rw-r--r-- 1 mcc users 21K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678650507409

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=GPPP-PT-C0010N0000000100
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 19:48:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 19:48:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 19:48:29] [INFO ] Load time of PNML (sax parser for PT used): 27 ms
[2023-03-12 19:48:29] [INFO ] Transformed 33 places.
[2023-03-12 19:48:29] [INFO ] Transformed 22 transitions.
[2023-03-12 19:48:29] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 92 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.
FORMULA GPPP-PT-C0010N0000000100-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000100-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000100-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 10 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 19:48:29] [INFO ] Computed 12 place invariants in 10 ms
[2023-03-12 19:48:29] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
[2023-03-12 19:48:29] [INFO ] Invariant cache hit.
[2023-03-12 19:48:29] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-12 19:48:29] [INFO ] Invariant cache hit.
[2023-03-12 19:48:29] [INFO ] Implicit Places using invariants and state equation in 73 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 123 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 313 ms. Remains : 32/33 places, 22/22 transitions.
Support contains 28 out of 32 places after structural reductions.
[2023-03-12 19:48:29] [INFO ] Flatten gal took : 20 ms
[2023-03-12 19:48:29] [INFO ] Flatten gal took : 6 ms
[2023-03-12 19:48:29] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 10015 steps, including 23 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 28) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 22 rows 32 cols
[2023-03-12 19:48:30] [INFO ] Computed 11 place invariants in 5 ms
[2023-03-12 19:48:30] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-12 19:48:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 19:48:30] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-12 19:48:31] [INFO ] After 507ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :0
Fused 7 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 7 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA GPPP-PT-C0010N0000000100-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000100-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000100-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((G(F(p0))||(p1&&F(p0))))&&F(G(p2)))))'
Support contains 3 out of 32 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 2 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 30 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 29 transition count 19
Applied a total of 5 rules in 12 ms. Remains 29 /32 variables (removed 3) and now considering 19/22 (removed 3) transitions.
// Phase 1: matrix 19 rows 29 cols
[2023-03-12 19:48:31] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-12 19:48:31] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
[2023-03-12 19:48:31] [INFO ] Invariant cache hit.
[2023-03-12 19:48:31] [INFO ] Implicit Places using invariants in 37 ms returned [1, 2, 3, 16]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 38 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/32 places, 19/22 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 25 transition count 17
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 23 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 22 transition count 16
Applied a total of 6 rules in 3 ms. Remains 22 /25 variables (removed 3) and now considering 16/19 (removed 3) transitions.
// Phase 1: matrix 16 rows 22 cols
[2023-03-12 19:48:31] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-12 19:48:31] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-12 19:48:31] [INFO ] Invariant cache hit.
[2023-03-12 19:48:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 19:48:31] [INFO ] Implicit Places using invariants and state equation in 41 ms returned [0, 2]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 70 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/32 places, 16/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 164 ms. Remains : 20/32 places, 16/22 transitions.
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0010N0000000100-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(GT 3 s9), p0:(LEQ s16 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 2 ms.
FORMULA GPPP-PT-C0010N0000000100-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000100-LTLCardinality-01 finished in 479 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)||(p1&&F(G(p0)))))))'
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 31 transition count 20
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 30 transition count 19
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 72 edges and 28 vertex of which 27 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 2 with 3 rules applied. Total rules applied 7 place count 27 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 7 place count 27 transition count 17
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 9 place count 26 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 11 place count 25 transition count 16
Applied a total of 11 rules in 6 ms. Remains 25 /32 variables (removed 7) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 25 cols
[2023-03-12 19:48:31] [INFO ] Computed 10 place invariants in 14 ms
[2023-03-12 19:48:32] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
[2023-03-12 19:48:32] [INFO ] Invariant cache hit.
[2023-03-12 19:48:32] [INFO ] Implicit Places using invariants in 45 ms returned [1, 2, 3]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 46 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/32 places, 16/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 21 transition count 15
Applied a total of 2 rules in 3 ms. Remains 21 /22 variables (removed 1) and now considering 15/16 (removed 1) transitions.
// Phase 1: matrix 15 rows 21 cols
[2023-03-12 19:48:32] [INFO ] Computed 7 place invariants in 3 ms
[2023-03-12 19:48:32] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-12 19:48:32] [INFO ] Invariant cache hit.
[2023-03-12 19:48:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 19:48:32] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/32 places, 15/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 185 ms. Remains : 21/32 places, 15/22 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C0010N0000000100-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GT s1 s16), p0:(GT s10 s19)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2438 reset in 281 ms.
Product exploration explored 100000 steps with 2257 reset in 184 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 302 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 58 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 19:48:33] [INFO ] Invariant cache hit.
[2023-03-12 19:48:33] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 19:48:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-12 19:48:33] [INFO ] [Nat]Absence check using 3 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-12 19:48:41] [INFO ] After 7835ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 248 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
[2023-03-12 19:48:41] [INFO ] Invariant cache hit.
[2023-03-12 19:48:41] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-12 19:48:41] [INFO ] [Real]Absence check using 3 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-12 19:48:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 19:48:41] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-12 19:48:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 19:48:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-12 19:48:41] [INFO ] [Nat]Absence check using 3 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-12 19:48:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 19:48:41] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2023-03-12 19:48:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 19:48:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-12 19:48:41] [INFO ] Computed and/alt/rep : 14/35/14 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 19:48:41] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 15/15 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2023-03-12 19:48:41] [INFO ] Invariant cache hit.
[2023-03-12 19:48:41] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2023-03-12 19:48:41] [INFO ] Invariant cache hit.
[2023-03-12 19:48:41] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-12 19:48:41] [INFO ] Invariant cache hit.
[2023-03-12 19:48:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 19:48:41] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-12 19:48:41] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 19:48:41] [INFO ] Invariant cache hit.
[2023-03-12 19:48:41] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 136 ms. Remains : 21/21 places, 15/15 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
[2023-03-12 19:48:42] [INFO ] Invariant cache hit.
[2023-03-12 19:48:42] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-12 19:48:42] [INFO ] [Real]Absence check using 3 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-12 19:48:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 19:48:42] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-12 19:48:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 19:48:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-12 19:48:42] [INFO ] [Nat]Absence check using 3 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-12 19:48:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 19:48:42] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2023-03-12 19:48:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 19:48:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-12 19:48:42] [INFO ] Computed and/alt/rep : 14/35/14 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-12 19:48:42] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2033 reset in 201 ms.
Product exploration explored 100000 steps with 2193 reset in 152 ms.
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2023-03-12 19:48:43] [INFO ] Invariant cache hit.
[2023-03-12 19:48:43] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2023-03-12 19:48:43] [INFO ] Invariant cache hit.
[2023-03-12 19:48:43] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-12 19:48:43] [INFO ] Invariant cache hit.
[2023-03-12 19:48:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 19:48:43] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-12 19:48:43] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 19:48:43] [INFO ] Invariant cache hit.
[2023-03-12 19:48:43] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 135 ms. Remains : 21/21 places, 15/15 transitions.
Treatment of property GPPP-PT-C0010N0000000100-LTLCardinality-03 finished in 11230 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 31 transition count 20
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 30 transition count 19
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 72 edges and 28 vertex of which 27 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 2 with 3 rules applied. Total rules applied 7 place count 27 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 7 place count 27 transition count 17
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 9 place count 26 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 11 place count 25 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 13 place count 24 transition count 15
Applied a total of 13 rules in 6 ms. Remains 24 /32 variables (removed 8) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 24 cols
[2023-03-12 19:48:43] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-12 19:48:43] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-03-12 19:48:43] [INFO ] Invariant cache hit.
[2023-03-12 19:48:43] [INFO ] Implicit Places using invariants in 36 ms returned [1, 2, 3, 13]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 37 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/32 places, 15/22 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 20 transition count 13
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 18 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 18 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 17 transition count 12
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 15 transition count 10
Applied a total of 10 rules in 3 ms. Remains 15 /20 variables (removed 5) and now considering 10/15 (removed 5) transitions.
// Phase 1: matrix 10 rows 15 cols
[2023-03-12 19:48:43] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 19:48:43] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-12 19:48:43] [INFO ] Invariant cache hit.
[2023-03-12 19:48:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 19:48:43] [INFO ] Implicit Places using invariants and state equation in 35 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 82 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/32 places, 10/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 161 ms. Remains : 14/32 places, 10/22 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0010N0000000100-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 s13)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0010N0000000100-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000100-LTLCardinality-05 finished in 245 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G(F(p0)))))))'
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2023-03-12 19:48:43] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-12 19:48:43] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
[2023-03-12 19:48:43] [INFO ] Invariant cache hit.
[2023-03-12 19:48:43] [INFO ] Implicit Places using invariants in 48 ms returned [1, 2, 3, 18]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 50 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 93 ms. Remains : 28/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0010N0000000100-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GT s23 s15)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 19908 reset in 91 ms.
Product exploration explored 100000 steps with 20031 reset in 111 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 43 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=43 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 22 rows 28 cols
[2023-03-12 19:48:44] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 19:48:44] [INFO ] [Real]Absence check using 5 positive place invariants in 0 ms returned sat
[2023-03-12 19:48:44] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-12 19:48:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 19:48:44] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-12 19:48:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 19:48:44] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 19:48:44] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 53 ms returned sat
[2023-03-12 19:48:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 19:48:45] [INFO ] [Nat]Absence check using state equation in 1031 ms returned sat
[2023-03-12 19:48:45] [INFO ] Computed and/alt/rep : 21/40/21 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-12 19:48:45] [INFO ] Added : 1 causal constraints over 1 iterations in 42 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 19:48:45] [INFO ] Invariant cache hit.
[2023-03-12 19:48:45] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2023-03-12 19:48:45] [INFO ] Invariant cache hit.
[2023-03-12 19:48:45] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-12 19:48:45] [INFO ] Invariant cache hit.
[2023-03-12 19:48:45] [INFO ] Implicit Places using invariants and state equation in 39 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 74 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 27/28 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 111 ms. Remains : 27/28 places, 22/22 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 55 edges and 27 vertex of which 25 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 106 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 43 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=21 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 22 rows 27 cols
[2023-03-12 19:48:46] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 19:48:46] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-12 19:48:46] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-12 19:48:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 19:48:46] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-12 19:48:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 19:48:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-12 19:48:46] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-12 19:48:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 19:48:46] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2023-03-12 19:48:46] [INFO ] Computed and/alt/rep : 21/40/21 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-12 19:48:46] [INFO ] Added : 20 causal constraints over 4 iterations in 36 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20097 reset in 75 ms.
Product exploration explored 100000 steps with 19923 reset in 70 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 22/22 transitions.
Graph (trivial) has 7 edges and 27 vertex of which 2 / 27 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 53 edges and 26 vertex of which 24 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 5 place count 24 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 5 place count 24 transition count 20
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 24 transition count 20
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 24 transition count 20
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 11 place count 21 transition count 17
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 14 place count 21 transition count 17
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 14 rules in 10 ms. Remains 21 /27 variables (removed 6) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 21 cols
[2023-03-12 19:48:47] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 19:48:47] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-03-12 19:48:47] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 19:48:47] [INFO ] Invariant cache hit.
[2023-03-12 19:48:47] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/27 places, 17/22 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 85 ms. Remains : 21/27 places, 17/22 transitions.
Support contains 2 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 27 /27 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 27 cols
[2023-03-12 19:48:47] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 19:48:47] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
[2023-03-12 19:48:47] [INFO ] Invariant cache hit.
[2023-03-12 19:48:47] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-12 19:48:47] [INFO ] Invariant cache hit.
[2023-03-12 19:48:47] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-12 19:48:47] [INFO ] Invariant cache hit.
[2023-03-12 19:48:47] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 150 ms. Remains : 27/27 places, 22/22 transitions.
Treatment of property GPPP-PT-C0010N0000000100-LTLCardinality-07 finished in 4032 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 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 4 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 31 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 30 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 30 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 29 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 28 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 27 transition count 17
Applied a total of 9 rules in 3 ms. Remains 27 /32 variables (removed 5) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 27 cols
[2023-03-12 19:48:47] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-12 19:48:47] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2023-03-12 19:48:47] [INFO ] Invariant cache hit.
[2023-03-12 19:48:47] [INFO ] Implicit Places using invariants in 32 ms returned [1, 2, 3, 16]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 33 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/32 places, 17/22 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 21 transition count 15
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 21 transition count 14
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 20 transition count 14
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 18 transition count 12
Applied a total of 10 rules in 4 ms. Remains 18 /23 variables (removed 5) and now considering 12/17 (removed 5) transitions.
// Phase 1: matrix 12 rows 18 cols
[2023-03-12 19:48:47] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-12 19:48:47] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-12 19:48:47] [INFO ] Invariant cache hit.
[2023-03-12 19:48:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 19:48:47] [INFO ] Implicit Places using invariants and state equation in 37 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 63 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/32 places, 12/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 134 ms. Remains : 17/32 places, 12/22 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0010N0000000100-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s1 s15)], 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 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0010N0000000100-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000100-LTLCardinality-08 finished in 301 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 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 3 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 31 transition count 20
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 73 edges and 29 vertex of which 28 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 28 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 28 transition count 18
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 27 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 26 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 25 transition count 16
Applied a total of 11 rules in 8 ms. Remains 25 /32 variables (removed 7) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 25 cols
[2023-03-12 19:48:47] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-12 19:48:47] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2023-03-12 19:48:47] [INFO ] Invariant cache hit.
[2023-03-12 19:48:47] [INFO ] Implicit Places using invariants in 30 ms returned [1, 2, 3, 13]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 31 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/32 places, 16/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 20 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 20 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 18 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 17 transition count 12
Applied a total of 8 rules in 3 ms. Remains 17 /21 variables (removed 4) and now considering 12/16 (removed 4) transitions.
// Phase 1: matrix 12 rows 17 cols
[2023-03-12 19:48:47] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-12 19:48:47] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-12 19:48:47] [INFO ] Invariant cache hit.
[2023-03-12 19:48:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 19:48:47] [INFO ] Implicit Places using invariants and state equation in 38 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 63 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/32 places, 12/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 135 ms. Remains : 16/32 places, 12/22 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0010N0000000100-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s7)], 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 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0010N0000000100-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000100-LTLCardinality-10 finished in 196 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' '!(((p0&&X(p1)) U X((p1&&G(p0)))))'
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2023-03-12 19:48:47] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-12 19:48:48] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
[2023-03-12 19:48:48] [INFO ] Invariant cache hit.
[2023-03-12 19:48:48] [INFO ] Implicit Places using invariants in 45 ms returned [1, 2, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 45 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 92 ms. Remains : 29/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 217 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0010N0000000100-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(GT s15 s26), p1:(GT s1 s2)], 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, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0010N0000000100-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000100-LTLCardinality-12 finished in 334 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(F(p0)))'
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 19:48:48] [INFO ] Invariant cache hit.
[2023-03-12 19:48:48] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2023-03-12 19:48:48] [INFO ] Invariant cache hit.
[2023-03-12 19:48:48] [INFO ] Implicit Places using invariants in 43 ms returned [1, 2, 3, 18]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 44 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/32 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 76 ms. Remains : 28/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0010N0000000100-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 3401 reset in 101 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA GPPP-PT-C0010N0000000100-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0010N0000000100-LTLCardinality-13 finished in 261 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 19:48:48] [INFO ] Invariant cache hit.
[2023-03-12 19:48:48] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2023-03-12 19:48:48] [INFO ] Invariant cache hit.
[2023-03-12 19:48:48] [INFO ] Implicit Places using invariants in 36 ms returned [1, 2, 3, 18]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 37 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/32 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 28 /28 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 74 ms. Remains : 28/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : GPPP-PT-C0010N0000000100-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GT s23 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0010N0000000100-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000100-LTLCardinality-14 finished in 180 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X(p0) U p1))))'
Support contains 5 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 19:48:48] [INFO ] Invariant cache hit.
[2023-03-12 19:48:48] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-03-12 19:48:48] [INFO ] Invariant cache hit.
[2023-03-12 19:48:48] [INFO ] Implicit Places using invariants in 37 ms returned [2, 3, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 38 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/32 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 78 ms. Remains : 29/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : GPPP-PT-C0010N0000000100-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (LEQ s14 s26) (LEQ 3 s16)), p0:(AND (LEQ s19 s1) (LEQ s14 s26))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1499 steps with 5 reset in 5 ms.
FORMULA GPPP-PT-C0010N0000000100-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0010N0000000100-LTLCardinality-15 finished in 259 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)||(p1&&F(G(p0)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G(F(p0)))))))'
Found a Shortening insensitive property : GPPP-PT-C0010N0000000100-LTLCardinality-07
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 32 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 3 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 31 transition count 19
Reduce places removed 3 places and 0 transitions.
Graph (complete) has 72 edges and 28 vertex of which 27 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 27 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 26 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 25 transition count 16
Applied a total of 11 rules in 10 ms. Remains 25 /32 variables (removed 7) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 25 cols
[2023-03-12 19:48:49] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-12 19:48:49] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2023-03-12 19:48:49] [INFO ] Invariant cache hit.
[2023-03-12 19:48:49] [INFO ] Implicit Places using invariants in 30 ms returned [1, 2, 3, 13]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 31 ms to find 4 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 21/32 places, 16/22 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 15
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 20 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 19 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 4 place count 19 transition count 13
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 6 place count 18 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8 place count 17 transition count 12
Applied a total of 8 rules in 8 ms. Remains 17 /21 variables (removed 4) and now considering 12/16 (removed 4) transitions.
// Phase 1: matrix 12 rows 17 cols
[2023-03-12 19:48:49] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-12 19:48:49] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-12 19:48:49] [INFO ] Invariant cache hit.
[2023-03-12 19:48:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 19:48:49] [INFO ] Implicit Places using invariants and state equation in 33 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 62 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 16/32 places, 12/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 16 /16 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 142 ms. Remains : 16/32 places, 12/22 transitions.
Running random walk in product with property : GPPP-PT-C0010N0000000100-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GT s11 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 64 ms.
Product exploration explored 100000 steps with 33333 reset in 64 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 64 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
Treatment of property GPPP-PT-C0010N0000000100-LTLCardinality-07 finished in 555 ms.
FORMULA GPPP-PT-C0010N0000000100-LTLCardinality-07 TRUE TECHNIQUES SHORTENING_INSENSITIVE
[2023-03-12 19:48:49] [INFO ] Flatten gal took : 8 ms
[2023-03-12 19:48:49] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-12 19:48:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 32 places, 22 transitions and 81 arcs took 0 ms.
Total runtime 20483 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1120/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1120/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : GPPP-PT-C0010N0000000100-LTLCardinality-03
Could not compute solution for formula : GPPP-PT-C0010N0000000100-LTLCardinality-07

BK_STOP 1678650530878

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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 GPPP-PT-C0010N0000000100-LTLCardinality-03
ltl formula formula --ltl=/tmp/1120/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 32 places, 22 transitions and 81 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.010 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1120/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1120/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1120/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1120/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55f77bb653f4]
1: pnml2lts-mc(+0xa2496) [0x55f77bb65496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fc5642cf140]
3: pnml2lts-mc(+0x405be5) [0x55f77bec8be5]
4: pnml2lts-mc(+0x16b3f9) [0x55f77bc2e3f9]
5: pnml2lts-mc(+0x164ac4) [0x55f77bc27ac4]
6: pnml2lts-mc(+0x272e0a) [0x55f77bd35e0a]
7: pnml2lts-mc(+0xb61f0) [0x55f77bb791f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7fc5641224d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7fc56412267a]
10: pnml2lts-mc(+0xa1581) [0x55f77bb64581]
11: pnml2lts-mc(+0xa1910) [0x55f77bb64910]
12: pnml2lts-mc(+0xa32a2) [0x55f77bb662a2]
13: pnml2lts-mc(+0xa50f4) [0x55f77bb680f4]
14: pnml2lts-mc(+0xa516b) [0x55f77bb6816b]
15: pnml2lts-mc(+0x3f34b3) [0x55f77beb64b3]
16: pnml2lts-mc(+0x7c63d) [0x55f77bb3f63d]
17: pnml2lts-mc(+0x67d86) [0x55f77bb2ad86]
18: pnml2lts-mc(+0x60a8a) [0x55f77bb23a8a]
19: pnml2lts-mc(+0x5eb15) [0x55f77bb21b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7fc56410ad0a]
21: pnml2lts-mc(+0x6075e) [0x55f77bb2375e]
ltl formula name GPPP-PT-C0010N0000000100-LTLCardinality-07
ltl formula formula --ltl=/tmp/1120/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 32 places, 22 transitions and 81 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.010 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1120/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1120/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1120/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1120/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
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="GPPP-PT-C0010N0000000100"
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 GPPP-PT-C0010N0000000100, 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 r169-tall-167838856500827"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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