About the Execution of LoLa+red for PGCD-COL-D02N100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 397.252 | 15234.00 | 23196.00 | 475.50 | FFFFFTTFFFFFFFFF | normal |
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.r519-tall-167987245200396.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 PGCD-COL-D02N100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r519-tall-167987245200396
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 376K
-rw-r--r-- 1 mcc users 5.8K Mar 23 15:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Mar 23 15:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 7 12:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 7 12:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 7 12:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 7 12:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 7.5K Mar 23 15:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Mar 23 15:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Mar 23 15:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Mar 23 15:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 7 12:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 7 12:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_pt
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 11K Mar 31 16:48 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME PGCD-COL-D02N100-LTLFireability-00
FORMULA_NAME PGCD-COL-D02N100-LTLFireability-01
FORMULA_NAME PGCD-COL-D02N100-LTLFireability-02
FORMULA_NAME PGCD-COL-D02N100-LTLFireability-03
FORMULA_NAME PGCD-COL-D02N100-LTLFireability-04
FORMULA_NAME PGCD-COL-D02N100-LTLFireability-05
FORMULA_NAME PGCD-COL-D02N100-LTLFireability-06
FORMULA_NAME PGCD-COL-D02N100-LTLFireability-07
FORMULA_NAME PGCD-COL-D02N100-LTLFireability-08
FORMULA_NAME PGCD-COL-D02N100-LTLFireability-09
FORMULA_NAME PGCD-COL-D02N100-LTLFireability-10
FORMULA_NAME PGCD-COL-D02N100-LTLFireability-11
FORMULA_NAME PGCD-COL-D02N100-LTLFireability-12
FORMULA_NAME PGCD-COL-D02N100-LTLFireability-13
FORMULA_NAME PGCD-COL-D02N100-LTLFireability-14
FORMULA_NAME PGCD-COL-D02N100-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1680942428052
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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PGCD-COL-D02N100
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2023-04-08 08:27:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-08 08:27:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-08 08:27:09] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-04-08 08:27:09] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-04-08 08:27:10] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 614 ms
[2023-04-08 08:27:10] [INFO ] Imported 3 HL places and 3 HL transitions for a total of 9 PT places and 9.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2023-04-08 08:27:10] [INFO ] Built PT skeleton of HLPN with 3 places and 3 transitions 14 arcs in 4 ms.
[2023-04-08 08:27:10] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 1 properties that can be checked using skeleton over-approximation.
FORMULA PGCD-COL-D02N100-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
[2023-04-08 08:27:10] [INFO ] Flatten gal took : 13 ms
[2023-04-08 08:27:10] [INFO ] Flatten gal took : 0 ms
Arc [2:1*[(MOD (ADD $x 1) 3)]] contains successor/predecessor on variables of sort CD
[2023-04-08 08:27:10] [INFO ] Unfolded HLPN to a Petri net with 9 places and 9 transitions 42 arcs in 10 ms.
[2023-04-08 08:27:10] [INFO ] Unfolded 15 HLPN properties in 0 ms.
Initial state reduction rules removed 3 formulas.
FORMULA PGCD-COL-D02N100-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-COL-D02N100-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-COL-D02N100-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 6 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
// Phase 1: matrix 9 rows 9 cols
[2023-04-08 08:27:10] [INFO ] Computed 4 invariants in 4 ms
[2023-04-08 08:27:10] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
[2023-04-08 08:27:10] [INFO ] Invariant cache hit.
[2023-04-08 08:27:10] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-04-08 08:27:10] [INFO ] Invariant cache hit.
[2023-04-08 08:27:10] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 08:27:10] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-04-08 08:27:10] [INFO ] Invariant cache hit.
[2023-04-08 08:27:10] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 220 ms. Remains : 9/9 places, 9/9 transitions.
Support contains 9 out of 9 places after structural reductions.
[2023-04-08 08:27:10] [INFO ] Flatten gal took : 4 ms
[2023-04-08 08:27:10] [INFO ] Flatten gal took : 4 ms
[2023-04-08 08:27:10] [INFO ] Input system was already deterministic with 9 transitions.
Finished random walk after 412 steps, including 0 resets, run visited all 8 properties in 13 ms. (steps per millisecond=31 )
Parikh walk visited 0 properties in 0 ms.
FORMULA PGCD-COL-D02N100-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 5 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 08:27:11] [INFO ] Invariant cache hit.
[2023-04-08 08:27:11] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
[2023-04-08 08:27:11] [INFO ] Invariant cache hit.
[2023-04-08 08:27:11] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-04-08 08:27:11] [INFO ] Invariant cache hit.
[2023-04-08 08:27:11] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 08:27:11] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-04-08 08:27:11] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 08:27:11] [INFO ] Invariant cache hit.
[2023-04-08 08:27:11] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 106 ms. Remains : 9/9 places, 9/9 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 148 ms :[(NOT p0)]
Running random walk in product with property : PGCD-COL-D02N100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s2 1) (LT s5 1) (LT s8 1)) (OR (LT s0 1) (LT s3 1) (LT s6 1)) (OR (LT s1 1) (LT s4 1) (LT s7 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 216 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA PGCD-COL-D02N100-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property PGCD-COL-D02N100-LTLFireability-02 finished in 525 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(p1))))'
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 08:27:11] [INFO ] Invariant cache hit.
[2023-04-08 08:27:11] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-04-08 08:27:11] [INFO ] Invariant cache hit.
[2023-04-08 08:27:11] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-04-08 08:27:11] [INFO ] Invariant cache hit.
[2023-04-08 08:27:11] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 08:27:11] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-04-08 08:27:11] [INFO ] Invariant cache hit.
[2023-04-08 08:27:11] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101 ms. Remains : 9/9 places, 9/9 transitions.
Stuttering acceptance computed with spot in 312 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : PGCD-COL-D02N100-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(OR (AND (GEQ s0 1) (GEQ s3 1)) (AND (GEQ s1 1) (GEQ s4 1)) (AND (GEQ s2 1) (GEQ s5 1))), p0:(AND (OR (LT s0 3) (LT s6 1)) (OR (LT s1 3) (LT s7 1)) (OR...], 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 127 ms.
Product exploration explored 100000 steps with 0 reset in 202 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 p1 p0), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 243 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10010 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=770 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-08 08:27:12] [INFO ] Invariant cache hit.
[2023-04-08 08:27:12] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-04-08 08:27:12] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 9 ms returned sat
[2023-04-08 08:27:12] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-08 08:27:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 08:27:12] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-08 08:27:12] [INFO ] After 41ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0)), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 10 factoid took 328 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA PGCD-COL-D02N100-LTLFireability-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property PGCD-COL-D02N100-LTLFireability-03 finished in 1595 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||G((p1||G(p2)))))'
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 3 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 08:27:13] [INFO ] Invariant cache hit.
[2023-04-08 08:27:13] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2023-04-08 08:27:13] [INFO ] Invariant cache hit.
[2023-04-08 08:27:13] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-04-08 08:27:13] [INFO ] Invariant cache hit.
[2023-04-08 08:27:13] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 08:27:13] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-04-08 08:27:13] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 08:27:13] [INFO ] Invariant cache hit.
[2023-04-08 08:27:13] [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 101 ms. Remains : 9/9 places, 9/9 transitions.
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PGCD-COL-D02N100-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (OR (LT s0 3) (LT s6 1)) (OR (LT s1 3) (LT s7 1)) (OR (LT s2 3) (LT s8 1))), p0:(AND (OR (LT s2 1) (LT s5 1) (LT s8 1)) (OR (LT s0 1) (LT s3 1) (L...], 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 136 ms.
Stack based approach found an accepted trace after 76334 steps with 0 reset with depth 76335 and stack size 14875 in 156 ms.
FORMULA PGCD-COL-D02N100-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property PGCD-COL-D02N100-LTLFireability-04 finished in 555 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(!p0) U (X(X(F(!p2)))||p1)))'
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 08:27:13] [INFO ] Invariant cache hit.
[2023-04-08 08:27:13] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
[2023-04-08 08:27:13] [INFO ] Invariant cache hit.
[2023-04-08 08:27:13] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-04-08 08:27:13] [INFO ] Invariant cache hit.
[2023-04-08 08:27:13] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 08:27:13] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-04-08 08:27:13] [INFO ] Invariant cache hit.
[2023-04-08 08:27:13] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105 ms. Remains : 9/9 places, 9/9 transitions.
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p1) p2), (OR (AND (NOT p1) p2) (AND p0 p2)), (OR (AND (NOT p1) p2) (AND p0 p2)), p2]
Running random walk in product with property : PGCD-COL-D02N100-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p2), acceptance={0} source=2 dest: 3}], [{ cond=p2, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (GEQ s0 3) (GEQ s6 1)) (AND (GEQ s1 3) (GEQ s7 1)) (AND (GEQ s2 3) (GEQ s8 1))), p0:(AND (OR (LT s0 3) (LT s6 1)) (OR (LT s1 3) (LT s7 1)) (OR...], 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][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 127 ms.
Product exploration explored 100000 steps with 33333 reset in 133 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 20 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PGCD-COL-D02N100-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PGCD-COL-D02N100-LTLFireability-06 finished in 580 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(!p0))))'
Support contains 6 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 2 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 08:27:14] [INFO ] Invariant cache hit.
[2023-04-08 08:27:14] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2023-04-08 08:27:14] [INFO ] Invariant cache hit.
[2023-04-08 08:27:14] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-04-08 08:27:14] [INFO ] Invariant cache hit.
[2023-04-08 08:27:14] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 08:27:14] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-04-08 08:27:14] [INFO ] Invariant cache hit.
[2023-04-08 08:27:14] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 138 ms. Remains : 9/9 places, 9/9 transitions.
Stuttering acceptance computed with spot in 107 ms :[p0, p0, p0]
Running random walk in product with property : PGCD-COL-D02N100-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (OR (LT s0 3) (LT s6 1)) (OR (LT s1 3) (LT s7 1)) (OR (LT s2 3) (LT s8 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 23421 reset in 75 ms.
Stack based approach found an accepted trace after 50 steps with 12 reset with depth 5 and stack size 5 in 0 ms.
FORMULA PGCD-COL-D02N100-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property PGCD-COL-D02N100-LTLFireability-07 finished in 331 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 08:27:14] [INFO ] Invariant cache hit.
[2023-04-08 08:27:14] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
[2023-04-08 08:27:14] [INFO ] Invariant cache hit.
[2023-04-08 08:27:14] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-04-08 08:27:14] [INFO ] Invariant cache hit.
[2023-04-08 08:27:14] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 08:27:14] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-04-08 08:27:14] [INFO ] Invariant cache hit.
[2023-04-08 08:27:14] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 92 ms. Remains : 9/9 places, 9/9 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PGCD-COL-D02N100-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s2 1) (LT s5 1) (LT s8 1)) (OR (LT s0 1) (LT s3 1) (LT s6 1)) (OR (LT s1 1) (LT s4 1) (LT s7 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 82 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 0 ms.
FORMULA PGCD-COL-D02N100-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property PGCD-COL-D02N100-LTLFireability-08 finished in 267 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((F(G(p1))&&p0))&&(F(!p2) U ((p1&&F(!p2))||G(F(!p2))))))'
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 08:27:14] [INFO ] Invariant cache hit.
[2023-04-08 08:27:14] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
[2023-04-08 08:27:14] [INFO ] Invariant cache hit.
[2023-04-08 08:27:14] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-04-08 08:27:14] [INFO ] Invariant cache hit.
[2023-04-08 08:27:14] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 08:27:14] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-04-08 08:27:14] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 08:27:14] [INFO ] Invariant cache hit.
[2023-04-08 08:27:14] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 101 ms. Remains : 9/9 places, 9/9 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p1) (NOT p0) p2), (NOT p1), (NOT p0), p2, p2]
Running random walk in product with property : PGCD-COL-D02N100-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}, { cond=p2, acceptance={} source=0 dest: 4}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=p2, acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (OR (LT s2 1) (LT s5 1) (LT s8 1)) (OR (LT s0 1) (LT s3 1) (LT s6 1)) (OR (LT s1 1) (LT s4 1) (LT s7 1))), p1:(AND (OR (LT s2 1) (LT s5 1) (LT s8 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 91 ms.
Stack based approach found an accepted trace after 17 steps with 0 reset with depth 18 and stack size 17 in 0 ms.
FORMULA PGCD-COL-D02N100-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property PGCD-COL-D02N100-LTLFireability-09 finished in 409 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&(G(F(!p1)) U (G(p0)||p2))))'
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 08:27:15] [INFO ] Invariant cache hit.
[2023-04-08 08:27:15] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2023-04-08 08:27:15] [INFO ] Invariant cache hit.
[2023-04-08 08:27:15] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-04-08 08:27:15] [INFO ] Invariant cache hit.
[2023-04-08 08:27:15] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 08:27:15] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-04-08 08:27:15] [INFO ] Invariant cache hit.
[2023-04-08 08:27:15] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 98 ms. Remains : 9/9 places, 9/9 transitions.
Stuttering acceptance computed with spot in 242 ms :[(NOT p0), (NOT p0), p1, p1, (AND (NOT p0) (NOT p2)), true, (AND p1 (NOT p0))]
Running random walk in product with property : PGCD-COL-D02N100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 2}, { cond=(NOT p0), acceptance={} source=6 dest: 3}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(OR (AND (GEQ s2 1) (GEQ s5 1) (GEQ s8 1)) (AND (GEQ s0 1) (GEQ s3 1) (GEQ s6 1)) (AND (GEQ s1 1) (GEQ s4 1) (GEQ s7 1))), p0:(OR (AND (GEQ s0 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 85 ms.
Product exploration explored 100000 steps with 0 reset in 108 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) p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X p0), (X (NOT p1)), true, (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 113 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p0)]
Finished random walk after 404 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=202 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X p0), (X (NOT p1)), true, (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 13 factoid took 164 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA PGCD-COL-D02N100-LTLFireability-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property PGCD-COL-D02N100-LTLFireability-10 finished in 904 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G((p0 U !p1)) U !p1)&&(X((G(!p1) U (p0&&G(!p1))))||p2))))'
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 08:27:16] [INFO ] Invariant cache hit.
[2023-04-08 08:27:16] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2023-04-08 08:27:16] [INFO ] Invariant cache hit.
[2023-04-08 08:27:16] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-04-08 08:27:16] [INFO ] Invariant cache hit.
[2023-04-08 08:27:16] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 08:27:16] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2023-04-08 08:27:16] [INFO ] Invariant cache hit.
[2023-04-08 08:27:16] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 88 ms. Remains : 9/9 places, 9/9 transitions.
Stuttering acceptance computed with spot in 293 ms :[(OR p1 (AND (NOT p0) (NOT p2))), (OR p1 (AND (NOT p0) (NOT p2))), true, p1, p1, p1, (OR (NOT p0) p1), p1]
Running random walk in product with property : PGCD-COL-D02N100-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 p0 p2), acceptance={} source=1 dest: 4}, { cond=(AND p1 p0 p2), acceptance={} source=1 dest: 5}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p1 p0), acceptance={} source=4 dest: 3}, { cond=(OR (NOT p1) p0), acceptance={} source=4 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=5 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=5 dest: 4}, { cond=(AND p1 p0), acceptance={0} source=5 dest: 5}], [{ cond=p1, acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 7}], [{ cond=p1, acceptance={} source=7 dest: 2}, { cond=(NOT p1), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(AND (OR (LT s0 3) (LT s6 1)) (OR (LT s1 3) (LT s7 1)) (OR (LT s2 3) (LT s8 1))), p0:(OR (AND (GEQ s0 1) (GEQ s3 1)) (AND (GEQ s1 1) (GEQ s4 1)) (AND (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 120 ms.
Product exploration explored 100000 steps with 3 reset in 154 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 p1 p0 p2), (X (AND p1 p0 p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 333 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter sensitive) to 7 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 237 ms :[p1, true, p1, p1, p1, false, false]
Incomplete random walk after 10059 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=502 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-04-08 08:27:17] [INFO ] Invariant cache hit.
[2023-04-08 08:27:17] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 08:27:17] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-08 08:27:17] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-08 08:27:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 08:27:17] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-08 08:27:17] [INFO ] After 30ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X (AND p1 p0 p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0))))), (G (NOT (AND (NOT p0) p1))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 10 factoid took 336 ms. Reduced automaton from 7 states, 18 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[p1, p1, p1]
Stuttering acceptance computed with spot in 83 ms :[p1, p1, p1]
[2023-04-08 08:27:18] [INFO ] Invariant cache hit.
[2023-04-08 08:27:18] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 08:27:18] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-08 08:27:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 08:27:18] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-04-08 08:27:18] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 08:27:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 08:27:18] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-08 08:27:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 08:27:18] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-04-08 08:27:18] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 08:27:18] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2023-04-08 08:27:18] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 08:27:18] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Could not prove EG p1
Support contains 6 out of 9 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 08:27:18] [INFO ] Invariant cache hit.
[2023-04-08 08:27:18] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
[2023-04-08 08:27:18] [INFO ] Invariant cache hit.
[2023-04-08 08:27:18] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-04-08 08:27:18] [INFO ] Invariant cache hit.
[2023-04-08 08:27:18] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 08:27:18] [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-04-08 08:27:18] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 08:27:18] [INFO ] Invariant cache hit.
[2023-04-08 08:27:18] [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 94 ms. Remains : 9/9 places, 9/9 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 : [p1, (X p1), true]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[p1, p1, p1]
Finished random walk after 101 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=101 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1, (X p1), true]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[p1, p1, p1]
Stuttering acceptance computed with spot in 96 ms :[p1, p1, p1]
[2023-04-08 08:27:18] [INFO ] Invariant cache hit.
[2023-04-08 08:27:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 08:27:18] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-08 08:27:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-08 08:27:18] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-04-08 08:27:18] [INFO ] Solution in real domain found non-integer solution.
[2023-04-08 08:27:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 08:27:18] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-08 08:27:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-08 08:27:18] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-04-08 08:27:18] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 08:27:18] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2023-04-08 08:27:18] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-04-08 08:27:18] [INFO ] Added : 0 causal constraints over 0 iterations in 16 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 82 ms :[p1, p1, p1]
Product exploration explored 100000 steps with 0 reset in 89 ms.
Product exploration explored 100000 steps with 20 reset in 100 ms.
Support contains 6 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 2 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 08:27:19] [INFO ] Invariant cache hit.
[2023-04-08 08:27:19] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2023-04-08 08:27:19] [INFO ] Invariant cache hit.
[2023-04-08 08:27:19] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-08 08:27:19] [INFO ] Invariant cache hit.
[2023-04-08 08:27:19] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 08:27:19] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-04-08 08:27:19] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 08:27:19] [INFO ] Invariant cache hit.
[2023-04-08 08:27:19] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 105 ms. Remains : 9/9 places, 9/9 transitions.
Treatment of property PGCD-COL-D02N100-LTLFireability-11 finished in 3176 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 08:27:19] [INFO ] Invariant cache hit.
[2023-04-08 08:27:19] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
[2023-04-08 08:27:19] [INFO ] Invariant cache hit.
[2023-04-08 08:27:19] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-04-08 08:27:19] [INFO ] Invariant cache hit.
[2023-04-08 08:27:19] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 08:27:19] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-04-08 08:27:19] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 08:27:19] [INFO ] Invariant cache hit.
[2023-04-08 08:27:19] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 103 ms. Remains : 9/9 places, 9/9 transitions.
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PGCD-COL-D02N100-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s3 1)) (AND (GEQ s1 1) (GEQ s4 1)) (AND (GEQ s2 1) (GEQ s5 1))), p1:(OR (AND (GEQ s2 1) (GEQ s5 1) (GEQ s8 1)) (AND (GEQ s0 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 100 ms.
Product exploration explored 100000 steps with 0 reset in 156 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 74 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 317 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=63 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 116 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 08:27:20] [INFO ] Invariant cache hit.
[2023-04-08 08:27:20] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2023-04-08 08:27:20] [INFO ] Invariant cache hit.
[2023-04-08 08:27:20] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-04-08 08:27:20] [INFO ] Invariant cache hit.
[2023-04-08 08:27:20] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 08:27:20] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-04-08 08:27:20] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 08:27:20] [INFO ] Invariant cache hit.
[2023-04-08 08:27:20] [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 102 ms. Remains : 9/9 places, 9/9 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 p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 81 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 611 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=305 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 133 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 90 ms.
Product exploration explored 100000 steps with 0 reset in 126 ms.
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 08:27:21] [INFO ] Invariant cache hit.
[2023-04-08 08:27:21] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
[2023-04-08 08:27:21] [INFO ] Invariant cache hit.
[2023-04-08 08:27:21] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-08 08:27:21] [INFO ] Invariant cache hit.
[2023-04-08 08:27:21] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 08:27:21] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-04-08 08:27:21] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 08:27:21] [INFO ] Invariant cache hit.
[2023-04-08 08:27:21] [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 102 ms. Remains : 9/9 places, 9/9 transitions.
Treatment of property PGCD-COL-D02N100-LTLFireability-12 finished in 2219 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||X((p1&&F(!p0)))))'
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-08 08:27:21] [INFO ] Invariant cache hit.
[2023-04-08 08:27:21] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
[2023-04-08 08:27:21] [INFO ] Invariant cache hit.
[2023-04-08 08:27:21] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-04-08 08:27:21] [INFO ] Invariant cache hit.
[2023-04-08 08:27:21] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-08 08:27:21] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2023-04-08 08:27:21] [INFO ] Invariant cache hit.
[2023-04-08 08:27:21] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83 ms. Remains : 9/9 places, 9/9 transitions.
Stuttering acceptance computed with spot in 205 ms :[true, p0, (OR (NOT p1) p0), p0, p0, p0]
Running random walk in product with property : PGCD-COL-D02N100-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 p1), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={} source=5 dest: 0}, { cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=3, aps=[p0:(AND (OR (LT s0 3) (LT s6 1)) (OR (LT s1 3) (LT s7 1)) (OR (LT s2 3) (LT s8 1))), p1:(OR (AND (GEQ s0 1) (GEQ s3 1)) (AND (GEQ s1 1) (GEQ s4 1)) (AND (...], 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 23446 reset in 89 ms.
Stack based approach found an accepted trace after 335 steps with 82 reset with depth 5 and stack size 5 in 0 ms.
FORMULA PGCD-COL-D02N100-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property PGCD-COL-D02N100-LTLFireability-13 finished in 392 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G((p0 U !p1)) U !p1)&&(X((G(!p1) U (p0&&G(!p1))))||p2))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
[2023-04-08 08:27:22] [INFO ] Flatten gal took : 10 ms
[2023-04-08 08:27:22] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-04-08 08:27:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 9 places, 9 transitions and 42 arcs took 0 ms.
Total runtime 12753 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT PGCD-COL-D02N100
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability
FORMULA PGCD-COL-D02N100-LTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PGCD-COL-D02N100-LTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1680942443286
--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: rewrite Frontend/Parser/formula_rewrite.k:550
lola: rewrite Frontend/Parser/formula_rewrite.k:544
lola: rewrite Frontend/Parser/formula_rewrite.k:373
lola: Rule S: 0 transitions removed,0 places removed
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: LAUNCH task # 3 (type EXCL) for 0 PGCD-COL-D02N100-LTLFireability-11
lola: time limit : 900 sec
lola: memory limit: 32 pages
lola: FINISHED task # 3 (type EXCL) for PGCD-COL-D02N100-LTLFireability-11
lola: result : false
lola: markings : 6
lola: fired transitions : 6
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 10 (type EXCL) for 7 PGCD-COL-D02N100-LTLFireability-12
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 10 (type EXCL) for PGCD-COL-D02N100-LTLFireability-12
lola: result : false
lola: markings : 2003
lola: fired transitions : 3039
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PGCD-COL-D02N100-LTLFireability-11: CONJ false LTL model checker
PGCD-COL-D02N100-LTLFireability-12: CONJ false 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="PGCD-COL-D02N100"
export BK_EXAMINATION="LTLFireability"
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 PGCD-COL-D02N100, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r519-tall-167987245200396"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PGCD-COL-D02N100.tgz
mv PGCD-COL-D02N100 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;