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-167838852800251.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 FMS-PT-01000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-167838852800251
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 8.0K Feb 25 20:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 20:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 20:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 20:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Feb 25 20:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Feb 25 20:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 25 20:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 25 20:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 16:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16K 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 FMS-PT-01000-LTLCardinality-00
FORMULA_NAME FMS-PT-01000-LTLCardinality-01
FORMULA_NAME FMS-PT-01000-LTLCardinality-02
FORMULA_NAME FMS-PT-01000-LTLCardinality-03
FORMULA_NAME FMS-PT-01000-LTLCardinality-04
FORMULA_NAME FMS-PT-01000-LTLCardinality-05
FORMULA_NAME FMS-PT-01000-LTLCardinality-06
FORMULA_NAME FMS-PT-01000-LTLCardinality-07
FORMULA_NAME FMS-PT-01000-LTLCardinality-08
FORMULA_NAME FMS-PT-01000-LTLCardinality-09
FORMULA_NAME FMS-PT-01000-LTLCardinality-10
FORMULA_NAME FMS-PT-01000-LTLCardinality-11
FORMULA_NAME FMS-PT-01000-LTLCardinality-12
FORMULA_NAME FMS-PT-01000-LTLCardinality-13
FORMULA_NAME FMS-PT-01000-LTLCardinality-14
FORMULA_NAME FMS-PT-01000-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678446921656

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=FMS-PT-01000
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-10 11:15:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 11:15:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 11:15:23] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2023-03-10 11:15:23] [INFO ] Transformed 22 places.
[2023-03-10 11:15:23] [INFO ] Transformed 20 transitions.
[2023-03-10 11:15:23] [INFO ] Parsed PT model containing 22 places and 20 transitions and 50 arcs in 76 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 2 formulas.
FORMULA FMS-PT-01000-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-01000-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 13 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2023-03-10 11:15:23] [INFO ] Computed 6 place invariants in 7 ms
[2023-03-10 11:15:23] [INFO ] Implicit Places using invariants in 111 ms returned []
[2023-03-10 11:15:23] [INFO ] Invariant cache hit.
[2023-03-10 11:15:23] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2023-03-10 11:15:23] [INFO ] Invariant cache hit.
[2023-03-10 11:15:23] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 229 ms. Remains : 22/22 places, 20/20 transitions.
Support contains 21 out of 22 places after structural reductions.
[2023-03-10 11:15:23] [INFO ] Flatten gal took : 14 ms
[2023-03-10 11:15:23] [INFO ] Flatten gal took : 4 ms
[2023-03-10 11:15:23] [INFO ] Input system was already deterministic with 20 transitions.
Incomplete random walk after 10054 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=457 ) properties (out of 28) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) seen :7
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-10 11:15:24] [INFO ] Invariant cache hit.
[2023-03-10 11:15:24] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-10 11:15:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 12 ms returned sat
[2023-03-10 11:15:24] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-10 11:15:24] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-10 11:15:24] [INFO ] After 82ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 5545 steps, including 0 resets, run visited all 2 properties in 56 ms. (steps per millisecond=99 )
Parikh walk visited 2 properties in 56 ms.
FORMULA FMS-PT-01000-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G((p1&&X(X(p0))))))))'
Support contains 2 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-10 11:15:24] [INFO ] Invariant cache hit.
[2023-03-10 11:15:24] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-10 11:15:24] [INFO ] Invariant cache hit.
[2023-03-10 11:15:24] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2023-03-10 11:15:24] [INFO ] Invariant cache hit.
[2023-03-10 11:15:24] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 108 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FMS-PT-01000-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s21 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 191 ms.
Product exploration explored 100000 steps with 50000 reset in 118 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 165 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FMS-PT-01000-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FMS-PT-01000-LTLCardinality-00 finished in 806 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||(!p0 U (p1||G(!p0)))) U p2)))'
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 17
Reduce places removed 5 places and 0 transitions.
Graph (trivial) has 6 edges and 17 vertex of which 3 / 17 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 9 rules applied. Total rules applied 12 place count 15 transition count 14
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 18 place count 11 transition count 12
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 11 transition count 12
Applied a total of 19 rules in 11 ms. Remains 11 /22 variables (removed 11) and now considering 12/20 (removed 8) transitions.
// Phase 1: matrix 12 rows 11 cols
[2023-03-10 11:15:25] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-10 11:15:25] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-10 11:15:25] [INFO ] Invariant cache hit.
[2023-03-10 11:15:25] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-03-10 11:15:25] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 11:15:25] [INFO ] Invariant cache hit.
[2023-03-10 11:15:25] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/22 places, 12/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 89 ms. Remains : 11/22 places, 12/20 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p2), (AND p0 (NOT p1)), (NOT p2), true]
Running random walk in product with property : FMS-PT-01000-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(OR (LEQ s8 s10) (LEQ 3 s2) (LEQ s5 s4)), p0:(LEQ s8 s10), p1:(AND (GT s5 s4) (GT s8 s10))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 327 ms.
Product exploration explored 100000 steps with 0 reset in 273 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 p2 p0 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p2), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), true, (X (X p2)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 354 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 174 ms :[(NOT p2), (AND p0 (NOT p1)), (NOT p2), true]
Incomplete random walk after 10012 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1668 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-10 11:15:26] [INFO ] Invariant cache hit.
[2023-03-10 11:15:27] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-10 11:15:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-10 11:15:27] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-10 11:15:27] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-10 11:15:27] [INFO ] After 75ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 4748 steps, including 0 resets, run visited all 1 properties in 12 ms. (steps per millisecond=395 )
Parikh walk visited 1 properties in 11 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p2), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), true, (X (X p2)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p2) (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1))), (F (NOT p2))]
Knowledge based reduction with 11 factoid took 641 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p2), (NOT p2)]
Support contains 5 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 3 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-03-10 11:15:27] [INFO ] Invariant cache hit.
[2023-03-10 11:15:27] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-10 11:15:27] [INFO ] Invariant cache hit.
[2023-03-10 11:15:27] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-10 11:15:27] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 11:15:27] [INFO ] Invariant cache hit.
[2023-03-10 11:15:27] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 79 ms. Remains : 11/11 places, 12/12 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 : [p2, (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 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 65 ms :[(NOT p2), (NOT p2)]
Incomplete random walk after 10012 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2002 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3272171 steps, run timeout after 3001 ms. (steps per millisecond=1090 ) properties seen :{}
Probabilistic random walk after 3272171 steps, saw 1706551 distinct states, run finished after 3001 ms. (steps per millisecond=1090 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-10 11:15:31] [INFO ] Invariant cache hit.
[2023-03-10 11:15:31] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 11:15:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-10 11:15:31] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 11:15:31] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-10 11:15:31] [INFO ] After 57ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 4995 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=624 )
Parikh walk visited 1 properties in 9 ms.
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 3 factoid took 116 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 62 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 84 ms.
Product exploration explored 100000 steps with 0 reset in 205 ms.
Support contains 5 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 11 /11 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-03-10 11:15:31] [INFO ] Invariant cache hit.
[2023-03-10 11:15:31] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-10 11:15:31] [INFO ] Invariant cache hit.
[2023-03-10 11:15:31] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-10 11:15:31] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 11:15:31] [INFO ] Invariant cache hit.
[2023-03-10 11:15:31] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 79 ms. Remains : 11/11 places, 12/12 transitions.
Treatment of property FMS-PT-01000-LTLCardinality-02 finished in 6643 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 1 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2023-03-10 11:15:32] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-10 11:15:32] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-10 11:15:32] [INFO ] Invariant cache hit.
[2023-03-10 11:15:32] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2023-03-10 11:15:32] [INFO ] Invariant cache hit.
[2023-03-10 11:15:32] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 108 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FMS-PT-01000-LTLCardinality-03 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 3 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FMS-PT-01000-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-01000-LTLCardinality-03 finished in 213 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((G(!p0)||(X(!p0)&&(X(p1) U ((p2&&X(p1))||X(G(p1)))))))))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-10 11:15:32] [INFO ] Invariant cache hit.
[2023-03-10 11:15:32] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-10 11:15:32] [INFO ] Invariant cache hit.
[2023-03-10 11:15:32] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-10 11:15:32] [INFO ] Invariant cache hit.
[2023-03-10 11:15:32] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 175 ms :[p0, (AND p0 p1), (AND p0 (NOT p1)), false]
Running random walk in product with property : FMS-PT-01000-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0, 1} source=1 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={0, 1} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={1} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p0 p1), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p2:(GT 3 s1), p0:(LEQ 3 s0), p1:(GT s20 s13)], nbAcceptance=2, 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 39857 reset in 108 ms.
Product exploration explored 100000 steps with 40028 reset in 95 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 p2 (NOT p0) p1), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 813 ms. Reduced automaton from 4 states, 17 edges and 3 AP (stutter sensitive) to 4 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[p0, (AND p0 p1), (AND p0 (NOT p1)), false]
Incomplete random walk after 10018 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2003 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-10 11:15:33] [INFO ] Invariant cache hit.
[2023-03-10 11:15:33] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-10 11:15:33] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-10 11:15:33] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-10 11:15:33] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-10 11:15:33] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-10 11:15:33] [INFO ] After 47ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 2022 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=505 )
Parikh walk visited 3 properties in 80 ms.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p2) p0 (NOT p1))), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (AND (NOT p2) p0)), (F (AND (NOT p2) p0 p1)), (F (AND p0 p1)), (F (AND (NOT p2) (NOT p0) p1)), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 17 factoid took 987 ms. Reduced automaton from 4 states, 17 edges and 3 AP (stutter sensitive) to 4 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[p0, (AND p0 p1), (AND p0 (NOT p1)), false]
Stuttering acceptance computed with spot in 141 ms :[p0, (AND p0 p1), (AND p0 (NOT p1)), false]
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-10 11:15:35] [INFO ] Invariant cache hit.
[2023-03-10 11:15:35] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-10 11:15:35] [INFO ] Invariant cache hit.
[2023-03-10 11:15:35] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-03-10 11:15:35] [INFO ] Invariant cache hit.
[2023-03-10 11:15:35] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 122 ms. Remains : 22/22 places, 20/20 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 927 ms. Reduced automaton from 4 states, 17 edges and 3 AP (stutter sensitive) to 4 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[p0, (AND p0 p1), (AND p0 (NOT p1)), false]
Incomplete random walk after 10013 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1668 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) 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 3) seen :0
Running SMT prover for 3 properties.
[2023-03-10 11:15:36] [INFO ] Invariant cache hit.
[2023-03-10 11:15:36] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-10 11:15:36] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-10 11:15:36] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-10 11:15:36] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-10 11:15:36] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-10 11:15:36] [INFO ] After 47ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 1985 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=397 )
Parikh walk visited 3 properties in 69 ms.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p2) p0 (NOT p1))), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (AND (NOT p2) p0)), (F (AND (NOT p2) p0 p1)), (F (AND p0 p1)), (F (AND (NOT p2) (NOT p0) p1)), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 17 factoid took 1102 ms. Reduced automaton from 4 states, 17 edges and 3 AP (stutter sensitive) to 4 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[p0, (AND p0 p1), (AND p0 (NOT p1)), false]
Stuttering acceptance computed with spot in 132 ms :[p0, (AND p0 p1), (AND p0 (NOT p1)), false]
Stuttering acceptance computed with spot in 165 ms :[p0, (AND p0 p1), (AND p0 (NOT p1)), false]
Product exploration explored 100000 steps with 40046 reset in 87 ms.
Product exploration explored 100000 steps with 39861 reset in 87 ms.
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-10 11:15:38] [INFO ] Invariant cache hit.
[2023-03-10 11:15:38] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-10 11:15:38] [INFO ] Invariant cache hit.
[2023-03-10 11:15:38] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-10 11:15:38] [INFO ] Invariant cache hit.
[2023-03-10 11:15:38] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82 ms. Remains : 22/22 places, 20/20 transitions.
Treatment of property FMS-PT-01000-LTLCardinality-04 finished in 6646 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 1 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-10 11:15:38] [INFO ] Invariant cache hit.
[2023-03-10 11:15:38] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-10 11:15:38] [INFO ] Invariant cache hit.
[2023-03-10 11:15:38] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-10 11:15:38] [INFO ] Invariant cache hit.
[2023-03-10 11:15:38] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 78 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FMS-PT-01000-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 2 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FMS-PT-01000-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-01000-LTLCardinality-05 finished in 163 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((X(X(p1))&&p0)))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-10 11:15:39] [INFO ] Invariant cache hit.
[2023-03-10 11:15:39] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-10 11:15:39] [INFO ] Invariant cache hit.
[2023-03-10 11:15:39] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-03-10 11:15:39] [INFO ] Invariant cache hit.
[2023-03-10 11:15:39] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 91 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : FMS-PT-01000-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 2}, { cond=(NOT p0), acceptance={0} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}]], initial=1, aps=[p0:(AND (GT s6 s0) (GT 2 s13)), p1:(LEQ s6 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 5247 reset in 102 ms.
Stack based approach found an accepted trace after 144 steps with 4 reset with depth 10 and stack size 10 in 0 ms.
FORMULA FMS-PT-01000-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-01000-LTLCardinality-06 finished in 328 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 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 16
Reduce places removed 5 places and 0 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 1 with 7 rules applied. Total rules applied 11 place count 17 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 13 place count 15 transition count 14
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 13 place count 15 transition count 11
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 19 place count 12 transition count 11
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 26 place count 8 transition count 8
Applied a total of 26 rules in 7 ms. Remains 8 /22 variables (removed 14) and now considering 8/20 (removed 12) transitions.
// Phase 1: matrix 8 rows 8 cols
[2023-03-10 11:15:39] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-10 11:15:39] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-10 11:15:39] [INFO ] Invariant cache hit.
[2023-03-10 11:15:39] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-03-10 11:15:39] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 11:15:39] [INFO ] Invariant cache hit.
[2023-03-10 11:15:39] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/22 places, 8/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71 ms. Remains : 8/22 places, 8/20 transitions.
Stuttering acceptance computed with spot in 55 ms :[p0, p0]
Running random walk in product with property : FMS-PT-01000-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s6 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 841 reset in 111 ms.
Product exploration explored 100000 steps with 880 reset in 110 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 (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 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 65 ms :[p0, p0]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 96 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 54 ms :[p0, p0]
Stuttering acceptance computed with spot in 51 ms :[p0, p0]
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-10 11:15:40] [INFO ] Invariant cache hit.
[2023-03-10 11:15:40] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-10 11:15:40] [INFO ] Invariant cache hit.
[2023-03-10 11:15:40] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-10 11:15:40] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 11:15:40] [INFO ] Invariant cache hit.
[2023-03-10 11:15:40] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 77 ms. Remains : 8/8 places, 8/8 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 (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 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 51 ms :[p0, p0]
Finished random walk after 60 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=60 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 97 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 66 ms :[p0, p0]
Stuttering acceptance computed with spot in 61 ms :[p0, p0]
Stuttering acceptance computed with spot in 76 ms :[p0, p0]
Product exploration explored 100000 steps with 886 reset in 92 ms.
Product exploration explored 100000 steps with 879 reset in 83 ms.
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-10 11:15:40] [INFO ] Invariant cache hit.
[2023-03-10 11:15:40] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-10 11:15:40] [INFO ] Invariant cache hit.
[2023-03-10 11:15:40] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-03-10 11:15:40] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 11:15:40] [INFO ] Invariant cache hit.
[2023-03-10 11:15:40] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 75 ms. Remains : 8/8 places, 8/8 transitions.
Treatment of property FMS-PT-01000-LTLCardinality-07 finished in 1562 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)||G(p1))))'
Support contains 6 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 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 22 transition count 19
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 21 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 20 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 4 place count 20 transition count 15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 10 place count 17 transition count 15
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 3 with 5 rules applied. Total rules applied 15 place count 14 transition count 13
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 16 place count 14 transition count 13
Applied a total of 16 rules in 5 ms. Remains 14 /22 variables (removed 8) and now considering 13/20 (removed 7) transitions.
// Phase 1: matrix 13 rows 14 cols
[2023-03-10 11:15:41] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 11:15:41] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-10 11:15:41] [INFO ] Invariant cache hit.
[2023-03-10 11:15:41] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-03-10 11:15:41] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 11:15:41] [INFO ] Invariant cache hit.
[2023-03-10 11:15:41] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/22 places, 13/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 77 ms. Remains : 14/22 places, 13/20 transitions.
Stuttering acceptance computed with spot in 27 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : FMS-PT-01000-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LEQ s9 s5) (LEQ s4 s1)), p1:(AND (LEQ 2 s5) (LEQ s13 s11))], nbAcceptance=2, 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 FMS-PT-01000-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-01000-LTLCardinality-09 finished in 213 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(p1))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2023-03-10 11:15:41] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-10 11:15:41] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-10 11:15:41] [INFO ] Invariant cache hit.
[2023-03-10 11:15:41] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-03-10 11:15:41] [INFO ] Invariant cache hit.
[2023-03-10 11:15:41] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 60 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FMS-PT-01000-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s6 s14), p1:(LEQ 2 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 3657 reset in 99 ms.
Stack based approach found an accepted trace after 189 steps with 10 reset with depth 16 and stack size 16 in 0 ms.
FORMULA FMS-PT-01000-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-01000-LTLCardinality-10 finished in 252 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)) U G(p1)))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 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 22 transition count 18
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 20 transition count 17
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 5 edges and 18 vertex of which 3 / 18 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 2 with 3 rules applied. Total rules applied 8 place count 16 transition count 17
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 11 place count 15 transition count 15
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 11 place count 15 transition count 12
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 19 place count 10 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 4 with 2 rules applied. Total rules applied 21 place count 9 transition count 11
Applied a total of 21 rules in 4 ms. Remains 9 /22 variables (removed 13) and now considering 11/20 (removed 9) transitions.
// Phase 1: matrix 11 rows 9 cols
[2023-03-10 11:15:41] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-10 11:15:41] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-10 11:15:41] [INFO ] Invariant cache hit.
[2023-03-10 11:15:41] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2023-03-10 11:15:41] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 11:15:41] [INFO ] Invariant cache hit.
[2023-03-10 11:15:41] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/22 places, 11/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61 ms. Remains : 9/22 places, 11/20 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : FMS-PT-01000-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s7 s0), p0:(GT s5 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 0 ms.
FORMULA FMS-PT-01000-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-01000-LTLCardinality-11 finished in 137 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||X((G(p1) U (p0&&G(p1))))) U p2)))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2023-03-10 11:15:41] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-10 11:15:41] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-10 11:15:41] [INFO ] Invariant cache hit.
[2023-03-10 11:15:41] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-03-10 11:15:41] [INFO ] Invariant cache hit.
[2023-03-10 11:15:41] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p2), (NOT p2), (OR (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : FMS-PT-01000-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(LEQ 1 s14), p0:(LEQ 2 s12), p1:(LEQ s7 s13)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA FMS-PT-01000-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-01000-LTLCardinality-12 finished in 246 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(G(p0))||G(p1)))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-10 11:15:41] [INFO ] Invariant cache hit.
[2023-03-10 11:15:41] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-10 11:15:41] [INFO ] Invariant cache hit.
[2023-03-10 11:15:41] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-03-10 11:15:41] [INFO ] Invariant cache hit.
[2023-03-10 11:15:41] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 96 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FMS-PT-01000-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(GT 1 s19), p0:(GT s0 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 132 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 FMS-PT-01000-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-01000-LTLCardinality-13 finished in 376 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)))))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-10 11:15:42] [INFO ] Invariant cache hit.
[2023-03-10 11:15:42] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-10 11:15:42] [INFO ] Invariant cache hit.
[2023-03-10 11:15:42] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-03-10 11:15:42] [INFO ] Invariant cache hit.
[2023-03-10 11:15:42] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FMS-PT-01000-LTLCardinality-14 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: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(GT s0 s7), p1:(GT s19 s13)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FMS-PT-01000-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-01000-LTLCardinality-14 finished in 208 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||(!p0 U (p1||G(!p0)))) U p2)))'
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(!p0)||(X(!p0)&&(X(p1) U ((p2&&X(p1))||X(G(p1)))))))))'
Found a Shortening insensitive property : FMS-PT-01000-LTLCardinality-04
Stuttering acceptance computed with spot in 145 ms :[p0, (AND p0 p1), (AND p0 (NOT p1)), false]
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 22/22 places, 20/20 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 22 transition count 18
Reduce places removed 3 places and 0 transitions.
Graph (trivial) has 6 edges and 19 vertex of which 3 / 19 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 8 place count 17 transition count 16
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 14 place count 14 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 15 place count 13 transition count 13
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 15 place count 13 transition count 10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 7 rules applied. Total rules applied 22 place count 9 transition count 10
Applied a total of 22 rules in 4 ms. Remains 9 /22 variables (removed 13) and now considering 10/20 (removed 10) transitions.
// Phase 1: matrix 10 rows 9 cols
[2023-03-10 11:15:42] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-10 11:15:42] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-10 11:15:42] [INFO ] Invariant cache hit.
[2023-03-10 11:15:42] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2023-03-10 11:15:42] [INFO ] Invariant cache hit.
[2023-03-10 11:15:42] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 9/22 places, 10/20 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 59 ms. Remains : 9/22 places, 10/20 transitions.
Running random walk in product with property : FMS-PT-01000-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0, 1} source=1 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={0, 1} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={1} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p0 p1), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p2:(GT 3 s1), p0:(LEQ 3 s0), p1:(GT s8 s4)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 5223 steps with 2063 reset in 6 ms.
Treatment of property FMS-PT-01000-LTLCardinality-04 finished in 299 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
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)))'
[2023-03-10 11:15:42] [INFO ] Flatten gal took : 4 ms
[2023-03-10 11:15:42] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-10 11:15:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 22 places, 20 transitions and 50 arcs took 0 ms.
Total runtime 19589 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT FMS-PT-01000
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLCardinality

FORMULA FMS-PT-01000-LTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678446973944

--------------------
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
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: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:253
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: rewrite Frontend/Parser/formula_rewrite.k:544
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 3 (type EXCL) for 0 FMS-PT-01000-LTLCardinality-02
lola: time limit : 900 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FMS-PT-01000-LTLCardinality-02: CONJ 0 1 1 0 2 0 0 0
FMS-PT-01000-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0
FMS-PT-01000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 5/900 31/32 FMS-PT-01000-LTLCardinality-02 4712631 m, 942526 m/sec, 7346722 t fired, .

Time elapsed: 5 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 3 (type EXCL) for FMS-PT-01000-LTLCardinality-02 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FMS-PT-01000-LTLCardinality-02: CONJ 0 1 0 0 2 0 1 0
FMS-PT-01000-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0
FMS-PT-01000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 10 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 8 (type EXCL) for 7 FMS-PT-01000-LTLCardinality-04
lola: time limit : 1196 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FMS-PT-01000-LTLCardinality-02: CONJ 0 1 0 0 2 0 1 0
FMS-PT-01000-LTLCardinality-04: LTL 0 0 1 0 1 0 0 0
FMS-PT-01000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 5/1196 26/32 FMS-PT-01000-LTLCardinality-04 3875132 m, 775026 m/sec, 5423661 t fired, .

Time elapsed: 15 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 8 (type EXCL) for FMS-PT-01000-LTLCardinality-04 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FMS-PT-01000-LTLCardinality-02: CONJ 0 1 0 0 2 0 1 0
FMS-PT-01000-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
FMS-PT-01000-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 20 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 11 (type EXCL) for 10 FMS-PT-01000-LTLCardinality-07
lola: time limit : 1790 sec
lola: memory limit: 32 pages
lola: FINISHED task # 11 (type EXCL) for FMS-PT-01000-LTLCardinality-07
lola: result : true
lola: markings : 49959
lola: fired transitions : 101920
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 5 (type EXCL) for 0 FMS-PT-01000-LTLCardinality-02
lola: time limit : 3580 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FMS-PT-01000-LTLCardinality-07: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FMS-PT-01000-LTLCardinality-02: CONJ 0 0 1 0 2 0 1 0
FMS-PT-01000-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 5/3580 27/32 FMS-PT-01000-LTLCardinality-02 4100481 m, 820096 m/sec, 6327012 t fired, .

Time elapsed: 25 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 5 (type EXCL) for FMS-PT-01000-LTLCardinality-02 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FMS-PT-01000-LTLCardinality-07: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FMS-PT-01000-LTLCardinality-02: CONJ 0 0 0 0 2 0 2 0
FMS-PT-01000-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 30 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: Portfolio finished: no open tasks 3

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FMS-PT-01000-LTLCardinality-02: CONJ unknown CONJ
FMS-PT-01000-LTLCardinality-04: LTL unknown AGGR
FMS-PT-01000-LTLCardinality-07: LTL true LTL model checker


Time elapsed: 30 secs. Pages in use: 32

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="FMS-PT-01000"
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 FMS-PT-01000, 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-167838852800251"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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