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.r167-tall-167838853600779.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is GPPP-PT-C0001N0000000010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-167838853600779
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 8.7K Feb 26 10:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 10:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 26 10:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 10:35 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.6K Feb 25 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 10:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 26 10:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Feb 26 10:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 132K Feb 26 10:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:09 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-C0001N0000000010-LTLCardinality-00
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLCardinality-01
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLCardinality-02
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLCardinality-03
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLCardinality-04
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLCardinality-05
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLCardinality-06
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLCardinality-07
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLCardinality-08
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLCardinality-09
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLCardinality-10
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLCardinality-11
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLCardinality-12
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLCardinality-13
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLCardinality-14
FORMULA_NAME GPPP-PT-C0001N0000000010-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678525767168

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C0001N0000000010
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 09:09:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 09:09:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 09:09:28] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2023-03-11 09:09:28] [INFO ] Transformed 33 places.
[2023-03-11 09:09:28] [INFO ] Transformed 22 transitions.
[2023-03-11 09:09:28] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 97 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA GPPP-PT-C0001N0000000010-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000010-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000010-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 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 102 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-11 09:09:29] [INFO ] Computed 13 place invariants in 12 ms
[2023-03-11 09:09:29] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
[2023-03-11 09:09:29] [INFO ] Invariant cache hit.
[2023-03-11 09:09:29] [INFO ] Implicit Places using invariants in 41 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 43 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 0 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 410 ms. Remains : 32/33 places, 22/22 transitions.
Support contains 26 out of 32 places after structural reductions.
[2023-03-11 09:09:29] [INFO ] Flatten gal took : 17 ms
[2023-03-11 09:09:29] [INFO ] Flatten gal took : 5 ms
[2023-03-11 09:09:29] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 27) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 22 rows 32 cols
[2023-03-11 09:09:29] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-11 09:09:29] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-11 09:09:29] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-11 09:09:29] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:3
[2023-03-11 09:09:30] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-11 09:09:30] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-11 09:09:30] [INFO ] After 46ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA GPPP-PT-C0001N0000000010-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 5 atomic propositions for a total of 12 simplifications.
FORMULA GPPP-PT-C0001N0000000010-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000010-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA GPPP-PT-C0001N0000000010-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 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 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 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 6 place count 28 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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 9 place count 26 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 0 with 2 rules applied. Total rules applied 11 place count 25 transition count 17
Applied a total of 11 rules in 13 ms. Remains 25 /32 variables (removed 7) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 25 cols
[2023-03-11 09:09:30] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-11 09:09:30] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-03-11 09:09:30] [INFO ] Invariant cache hit.
[2023-03-11 09:09:30] [INFO ] Implicit Places using invariants in 32 ms returned [0, 1, 2, 12]
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 : 21/32 places, 17/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 16
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 15
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 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 4 place count 19 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 8 place count 17 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 10 place count 16 transition count 12
Applied a total of 10 rules in 5 ms. Remains 16 /21 variables (removed 5) and now considering 12/17 (removed 5) transitions.
// Phase 1: matrix 12 rows 16 cols
[2023-03-11 09:09:30] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-11 09:09:30] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-11 09:09:30] [INFO ] Invariant cache hit.
[2023-03-11 09:09:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 09:09:30] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/32 places, 12/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 148 ms. Remains : 16/32 places, 12/22 transitions.
Stuttering acceptance computed with spot in 232 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000000010-LTLCardinality-00 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 s7 s1)], 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 14 steps with 0 reset in 3 ms.
FORMULA GPPP-PT-C0001N0000000010-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000010-LTLCardinality-00 finished in 433 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((p0||X(X((p1 U (p2||G(p1))))))))'
Support contains 3 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-11 09:09:30] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-11 09:09:30] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-03-11 09:09:30] [INFO ] Invariant cache hit.
[2023-03-11 09:09:30] [INFO ] Implicit Places using invariants in 37 ms returned [0, 1, 2, 18]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 38 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 84 ms. Remains : 28/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), true]
Running random walk in product with property : GPPP-PT-C0001N0000000010-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s9 s5), p2:(AND (GT 1 s26) (GT 1 s5)), p1:(GT 1 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 728 steps with 4 reset in 13 ms.
FORMULA GPPP-PT-C0001N0000000010-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000010-LTLCardinality-03 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' '!((G((p0||X(X(F(p1))))) U (p2||X((G(p1) U (p2&&G(p1)))))))'
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.
[2023-03-11 09:09:30] [INFO ] Invariant cache hit.
[2023-03-11 09:09:31] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-03-11 09:09:31] [INFO ] Invariant cache hit.
[2023-03-11 09:09:31] [INFO ] Implicit Places using invariants in 31 ms returned [0, 1, 2, 18]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 32 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 74 ms. Remains : 28/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0001N0000000010-LTLCardinality-04 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=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(LEQ 1 s3), p0:(GT 3 s16), p1:(LEQ s9 s15)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 326 reset in 204 ms.
Stack based approach found an accepted trace after 83694 steps with 263 reset with depth 12 and stack size 12 in 127 ms.
FORMULA GPPP-PT-C0001N0000000010-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0001N0000000010-LTLCardinality-04 finished in 571 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 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-11 09:09:31] [INFO ] Invariant cache hit.
[2023-03-11 09:09:31] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
[2023-03-11 09:09:31] [INFO ] Invariant cache hit.
[2023-03-11 09:09:31] [INFO ] Implicit Places using invariants in 102 ms returned [0, 1, 2, 18]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 104 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 172 ms. Remains : 28/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000000010-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s10 s9)], 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 6 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000000010-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000010-LTLCardinality-05 finished in 260 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))||G(p1)||(p1&&F(p2))))'
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 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-11 09:09:31] [INFO ] Invariant cache hit.
[2023-03-11 09:09:31] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
[2023-03-11 09:09:31] [INFO ] Invariant cache hit.
[2023-03-11 09:09:31] [INFO ] Implicit Places using invariants in 68 ms returned [0, 1, 2, 18]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 70 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 133 ms. Remains : 28/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 215 ms :[true, (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0001N0000000010-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 6}]], initial=2, aps=[p2:(GT 1 s1), p1:(GT 2 s22), p0:(LEQ s9 s13)], 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, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 30 steps with 0 reset in 1 ms.
FORMULA GPPP-PT-C0001N0000000010-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000010-LTLCardinality-06 finished in 362 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 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 1 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 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 24 transition count 16
Applied a total of 13 rules in 4 ms. Remains 24 /32 variables (removed 8) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 24 cols
[2023-03-11 09:09:32] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-11 09:09:32] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-03-11 09:09:32] [INFO ] Invariant cache hit.
[2023-03-11 09:09:32] [INFO ] Implicit Places using invariants in 43 ms returned [0, 1, 2, 12]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 44 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/32 places, 16/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 14
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 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 8 place count 16 transition count 12
Applied a total of 8 rules in 2 ms. Remains 16 /20 variables (removed 4) and now considering 12/16 (removed 4) transitions.
// Phase 1: matrix 12 rows 16 cols
[2023-03-11 09:09:32] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-11 09:09:32] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-11 09:09:32] [INFO ] Invariant cache hit.
[2023-03-11 09:09:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 09:09:32] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/32 places, 12/22 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 147 ms. Remains : 16/32 places, 12/22 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000000010-LTLCardinality-09 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 s15 s9)], 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 15 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000000010-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000010-LTLCardinality-09 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' '!(X(X(X(X(X(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-11 09:09:32] [INFO ] Computed 12 place invariants in 0 ms
[2023-03-11 09:09:32] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2023-03-11 09:09:32] [INFO ] Invariant cache hit.
[2023-03-11 09:09:32] [INFO ] Implicit Places using invariants in 31 ms returned [0, 1, 2, 18]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 32 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 70 ms. Remains : 28/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 222 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000000010-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=4, aps=[p0:(LEQ s4 s10)], 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, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 16666 reset in 96 ms.
Product exploration explored 100000 steps with 16666 reset in 73 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (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.
// Phase 1: matrix 22 rows 28 cols
[2023-03-11 09:09:33] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-11 09:09:33] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2023-03-11 09:09:33] [INFO ] Invariant cache hit.
[2023-03-11 09:09:33] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-11 09:09:33] [INFO ] Invariant cache hit.
[2023-03-11 09:09:33] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-03-11 09:09:33] [INFO ] Invariant cache hit.
[2023-03-11 09:09:33] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 134 ms. Remains : 28/28 places, 22/22 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 102 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 114 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 208 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 16666 reset in 66 ms.
Product exploration explored 100000 steps with 16666 reset in 66 ms.
Applying partial POR strategy [true, false, false, false, false, false]
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 28 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 28/28 places, 22/22 transitions.
Graph (trivial) has 8 edges and 28 vertex of which 2 / 28 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 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 27 transition count 21
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 5 place count 27 transition count 21
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 27 transition count 21
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 10 place count 24 transition count 18
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 24 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 24 transition count 18
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 23 transition count 17
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 23 transition count 17
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 17 rules in 10 ms. Remains 23 /28 variables (removed 5) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 23 cols
[2023-03-11 09:09:35] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-11 09:09:35] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
[2023-03-11 09:09:35] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 09:09:35] [INFO ] Invariant cache hit.
[2023-03-11 09:09:35] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/28 places, 17/22 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 69 ms. Remains : 23/28 places, 17/22 transitions.
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.
// Phase 1: matrix 22 rows 28 cols
[2023-03-11 09:09:35] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-11 09:09:35] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
[2023-03-11 09:09:35] [INFO ] Invariant cache hit.
[2023-03-11 09:09:35] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-11 09:09:35] [INFO ] Invariant cache hit.
[2023-03-11 09:09:35] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-11 09:09:35] [INFO ] Invariant cache hit.
[2023-03-11 09:09:35] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112 ms. Remains : 28/28 places, 22/22 transitions.
Treatment of property GPPP-PT-C0001N0000000010-LTLCardinality-10 finished in 3196 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||X((((p1||F(p2)) U X(p0)) U (p0&&((p1||F(p2)) U X(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 0 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2023-03-11 09:09:35] [INFO ] Computed 12 place invariants in 0 ms
[2023-03-11 09:09:35] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2023-03-11 09:09:35] [INFO ] Invariant cache hit.
[2023-03-11 09:09:35] [INFO ] Implicit Places using invariants in 27 ms returned [1, 2, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 29 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 61 ms. Remains : 29/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 267 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p0)), (NOT p0), (NOT p2)]
Running random walk in product with property : GPPP-PT-C0001N0000000010-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 3}, { cond=p0, acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s21 s19), p1:(LEQ 2 s3), p2:(AND (LEQ 3 s0) (LEQ s21 s19))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1219 reset in 135 ms.
Stack based approach found an accepted trace after 127 steps with 1 reset with depth 76 and stack size 73 in 2 ms.
FORMULA GPPP-PT-C0001N0000000010-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0001N0000000010-LTLCardinality-13 finished in 495 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&&X(F((p1&&G(p2)))))))'
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 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-11 09:09:36] [INFO ] Invariant cache hit.
[2023-03-11 09:09:36] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2023-03-11 09:09:36] [INFO ] Invariant cache hit.
[2023-03-11 09:09:36] [INFO ] Implicit Places using invariants in 29 ms returned [0, 1, 2, 18]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 30 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 64 ms. Remains : 28/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : GPPP-PT-C0001N0000000010-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 3 s17), p1:(LEQ 2 s5), p2:(LEQ s24 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 118 ms.
Stack based approach found an accepted trace after 10 steps with 0 reset with depth 11 and stack size 11 in 0 ms.
FORMULA GPPP-PT-C0001N0000000010-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property GPPP-PT-C0001N0000000010-LTLCardinality-14 finished in 317 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(X(X(F(p0)))))))'
Found a Shortening insensitive property : GPPP-PT-C0001N0000000010-LTLCardinality-10
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (NOT p0), (NOT p0), (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 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 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 24 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 2 with 2 rules applied. Total rules applied 15 place count 23 transition count 15
Applied a total of 15 rules in 7 ms. Remains 23 /32 variables (removed 9) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 23 cols
[2023-03-11 09:09:36] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-11 09:09:36] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
[2023-03-11 09:09:36] [INFO ] Invariant cache hit.
[2023-03-11 09:09:36] [INFO ] Implicit Places using invariants in 27 ms returned [0, 1, 2, 12]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 28 ms to find 4 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 19/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 19 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 17 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 17 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 16 transition count 12
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 15 transition count 11
Applied a total of 8 rules in 3 ms. Remains 15 /19 variables (removed 4) and now considering 11/15 (removed 4) transitions.
// Phase 1: matrix 11 rows 15 cols
[2023-03-11 09:09:36] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-11 09:09:36] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-11 09:09:36] [INFO ] Invariant cache hit.
[2023-03-11 09:09:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 09:09:36] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 15/32 places, 11/22 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 122 ms. Remains : 15/32 places, 11/22 transitions.
Running random walk in product with property : GPPP-PT-C0001N0000000010-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=4, aps=[p0:(LEQ s0 s5)], 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, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
Treatment of property GPPP-PT-C0001N0000000010-LTLCardinality-10 finished in 416 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-11 09:09:36] [INFO ] Flatten gal took : 4 ms
[2023-03-11 09:09:36] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-11 09:09:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 32 places, 22 transitions and 81 arcs took 1 ms.
Total runtime 8246 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT GPPP-PT-C0001N0000000010
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLCardinality

FORMULA GPPP-PT-C0001N0000000010-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678525777813

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 1 (type EXCL) for 0 GPPP-PT-C0001N0000000010-LTLCardinality-10
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for GPPP-PT-C0001N0000000010-LTLCardinality-10
lola: result : true
lola: markings : 13
lola: fired transitions : 15
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
GPPP-PT-C0001N0000000010-LTLCardinality-10: LTL true LTL model checker


Time elapsed: 0 secs. Pages in use: 1

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is GPPP-PT-C0001N0000000010, 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 r167-tall-167838853600779"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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