fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r101-tall-167814476201028
Last Updated
May 14, 2023

About the Execution of ITS-Tools for DatabaseWithMutex-COL-04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2068.144 175114.00 334532.00 18798.50 FFFFFFFFTFFFFFTT 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.r101-tall-167814476201028.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 itstools
Input is DatabaseWithMutex-COL-04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r101-tall-167814476201028
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 8.3K Feb 25 13:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 25 13:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 13:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 25 13:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 25 13:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 25 13:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 25 13:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Feb 25 13:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 21K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678342320945

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DatabaseWithMutex-COL-04
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202303021504
[2023-03-09 06:12:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 06:12:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 06:12:02] [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-03-09 06:12:02] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-09 06:12:02] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 410 ms
[2023-03-09 06:12:02] [INFO ] Imported 11 HL places and 8 HL transitions for a total of 140 PT places and 128.0 transition bindings in 13 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2023-03-09 06:12:02] [INFO ] Built PT skeleton of HLPN with 11 places and 8 transitions 22 arcs in 5 ms.
[2023-03-09 06:12:02] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA DatabaseWithMutex-COL-04-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-COL-04-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 48 steps, including 0 resets, run visited all 11 properties in 8 ms. (steps per millisecond=6 )
[2023-03-09 06:12:03] [INFO ] Flatten gal took : 12 ms
[2023-03-09 06:12:03] [INFO ] Flatten gal took : 2 ms
Transition Release forces synchronizations/join behavior on parameter s of sort site
Transition Acquire forces synchronizations/join behavior on parameter f of sort file
[2023-03-09 06:12:03] [INFO ] Unfolded HLPN to a Petri net with 140 places and 128 transitions 416 arcs in 12 ms.
[2023-03-09 06:12:03] [INFO ] Unfolded 14 HLPN properties in 1 ms.
[2023-03-09 06:12:03] [INFO ] Reduced 12 identical enabling conditions.
[2023-03-09 06:12:03] [INFO ] Reduced 12 identical enabling conditions.
[2023-03-09 06:12:03] [INFO ] Reduced 12 identical enabling conditions.
Support contains 140 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 6 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2023-03-09 06:12:03] [INFO ] Computed 28 place invariants in 8 ms
[2023-03-09 06:12:03] [INFO ] Implicit Places using invariants in 139 ms returned []
[2023-03-09 06:12:03] [INFO ] Invariant cache hit.
[2023-03-09 06:12:03] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
[2023-03-09 06:12:03] [INFO ] Invariant cache hit.
[2023-03-09 06:12:03] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 352 ms. Remains : 140/140 places, 128/128 transitions.
Support contains 140 out of 140 places after structural reductions.
[2023-03-09 06:12:03] [INFO ] Flatten gal took : 27 ms
[2023-03-09 06:12:03] [INFO ] Flatten gal took : 19 ms
[2023-03-09 06:12:03] [INFO ] Input system was already deterministic with 128 transitions.
Finished random walk after 43 steps, including 0 resets, run visited all 13 properties in 6 ms. (steps per millisecond=7 )
FORMULA DatabaseWithMutex-COL-04-LTLFireability-03 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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0 U (!p0 U X(X((p1&&X(p1))))))) U (p0&&G((p0 U (!p0 U X(X((p1&&X(p1)))))))))))'
Support contains 48 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 5 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2023-03-09 06:12:04] [INFO ] Invariant cache hit.
[2023-03-09 06:12:04] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-09 06:12:04] [INFO ] Invariant cache hit.
[2023-03-09 06:12:04] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2023-03-09 06:12:04] [INFO ] Invariant cache hit.
[2023-03-09 06:12:05] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 246 ms. Remains : 140/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 685 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}, { cond=(NOT p0), acceptance={0} source=1 dest: 3}, { cond=p0, acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 5}, { cond=p0, acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}, { cond=p0, acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 8}, { cond=(AND p0 p1), acceptance={0} source=5 dest: 9}], [{ cond=(NOT p1), acceptance={} source=6 dest: 10}, { cond=p1, acceptance={} source=6 dest: 11}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=7 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={0} source=7 dest: 8}, { cond=(AND p0 p1), acceptance={0} source=7 dest: 13}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=8 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=8 dest: 6}], [{ cond=(NOT p1), acceptance={} source=9 dest: 10}], [{ cond=p1, acceptance={} source=10 dest: 11}, { cond=(NOT p1), acceptance={} source=10 dest: 12}], [{ cond=(NOT p1), acceptance={} source=11 dest: 12}], [{ cond=true, acceptance={0} source=12 dest: 12}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=13 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=13 dest: 7}]], initial=0, aps=[p0:(OR (AND (GEQ s21 1) (GEQ s93 1) (GEQ s97 1) (GEQ s101 1)) (AND (GEQ s27 1) (GEQ s91 1) (GEQ s99 1) (GEQ s103 1)) (AND (GEQ s33 1) (GEQ s89 1) (GEQ s93...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 726 steps with 88 reset in 17 ms.
FORMULA DatabaseWithMutex-COL-04-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-04-LTLFireability-00 finished in 1683 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)||F(G(p1))))'
Support contains 36 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 140 transition count 112
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 124 transition count 112
Applied a total of 32 rules in 17 ms. Remains 124 /140 variables (removed 16) and now considering 112/128 (removed 16) transitions.
// Phase 1: matrix 112 rows 124 cols
[2023-03-09 06:12:05] [INFO ] Computed 28 place invariants in 3 ms
[2023-03-09 06:12:05] [INFO ] Implicit Places using invariants in 61 ms returned [20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 63 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/140 places, 112/128 transitions.
Applied a total of 0 rules in 5 ms. Remains 108 /108 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 85 ms. Remains : 108/140 places, 112/128 transitions.
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s4 1) (GEQ s73 1)) (AND (GEQ s6 1) (GEQ s73 1)) (AND (GEQ s11 1) (GEQ s74 1)) (AND (GEQ s14 1) (GEQ s75 1)) (AND (GEQ s9 1) (GEQ s74 1)) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 294 ms.
Stack based approach found an accepted trace after 28 steps with 0 reset with depth 29 and stack size 29 in 1 ms.
FORMULA DatabaseWithMutex-COL-04-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-COL-04-LTLFireability-01 finished in 450 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(p1)&&p0))||X(G(p2))))'
Support contains 36 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 6 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2023-03-09 06:12:06] [INFO ] Computed 28 place invariants in 2 ms
[2023-03-09 06:12:06] [INFO ] Implicit Places using invariants in 72 ms returned [20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 74 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 128/128 transitions.
Applied a total of 0 rules in 3 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 85 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 293 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLFireability-02 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}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(AND (LT s94 1) (LT s95 1) (LT s92 1) (LT s93 1) (LT s98 1) (LT s99 1) (LT s96 1) (LT s97 1) (LT s102 1) (LT s103 1) (LT s100 1) (LT s101 1) (LT s106 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 7663 reset in 290 ms.
Product exploration explored 100000 steps with 7563 reset in 262 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 (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 18 factoid took 859 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1))]
Finished random walk after 14 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND (NOT p1) p0)), (F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 18 factoid took 1756 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1))]
Support contains 36 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 128/128 transitions.
Applied a total of 0 rules in 7 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 124 cols
[2023-03-09 06:12:10] [INFO ] Computed 12 place invariants in 5 ms
[2023-03-09 06:12:10] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-09 06:12:10] [INFO ] Invariant cache hit.
[2023-03-09 06:12:10] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2023-03-09 06:12:10] [INFO ] Invariant cache hit.
[2023-03-09 06:12:10] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 221 ms. Remains : 124/124 places, 128/128 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 p1 p0), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 2 factoid took 126 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 660 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1))]
Finished random walk after 9 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (AND p0 (NOT p1))), (F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 155 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 181 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 7706 reset in 235 ms.
Product exploration explored 100000 steps with 7595 reset in 227 ms.
Built C files in :
/tmp/ltsmin12379313404155575023
[2023-03-09 06:12:12] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12379313404155575023
Running compilation step : cd /tmp/ltsmin12379313404155575023;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 316 ms.
Running link step : cd /tmp/ltsmin12379313404155575023;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin12379313404155575023;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13817919262091002327.hoa' '--buchi-type=spotba'
LTSmin run took 174 ms.
FORMULA DatabaseWithMutex-COL-04-LTLFireability-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DatabaseWithMutex-COL-04-LTLFireability-02 finished in 7042 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(((G(p1)&&p0) U (p2 U !p3)))))'
Support contains 84 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 7 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2023-03-09 06:12:13] [INFO ] Computed 28 place invariants in 2 ms
[2023-03-09 06:12:13] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-09 06:12:13] [INFO ] Invariant cache hit.
[2023-03-09 06:12:13] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2023-03-09 06:12:13] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 06:12:13] [INFO ] Invariant cache hit.
[2023-03-09 06:12:13] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 212 ms. Remains : 140/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 340 ms :[p3, (AND (NOT p1) p3), p3, p3, (AND (NOT p1) p3)]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p3) p2 (AND p0 p1)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p3 (NOT p2) (NOT p0)) (AND p3 (NOT p2) (NOT p1))), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p3 (NOT p2) p0 p1), acceptance={1} source=0 dest: 1}, { cond=(AND p3 p0 p1), acceptance={0, 1} source=0 dest: 2}, { cond=(OR (AND p3 p2 (NOT p0)) (AND p3 p2 (NOT p1))), acceptance={0, 1} source=0 dest: 3}], [{ cond=(OR (AND (NOT p3) (NOT p1)) (AND p2 (NOT p1))), acceptance={0} source=1 dest: 0}, { cond=(AND p3 (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(OR (AND (NOT p3) p1) (AND p2 p1)), acceptance={} source=1 dest: 1}, { cond=(AND p3 (NOT p2) p1), acceptance={1} source=1 dest: 1}, { cond=(AND p3 p2 (NOT p1)), acceptance={0, 1} source=1 dest: 3}, { cond=(AND p3 p2 p1), acceptance={1} source=1 dest: 4}], [{ cond=(OR (AND p3 (NOT p2) (NOT p0)) (AND p3 (NOT p2) (NOT p1))), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p3 (NOT p2) p0 p1), acceptance={1} source=2 dest: 1}, { cond=(AND p3 p0 p1), acceptance={0, 1} source=2 dest: 2}, { cond=(OR (AND p3 p2 (NOT p0)) (AND p3 p2 (NOT p1))), acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND p3 (NOT p2) p0 p1), acceptance={0} source=3 dest: 0}, { cond=(OR (AND p3 (NOT p2) (NOT p0)) (AND p3 (NOT p2) (NOT p1))), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p3 (NOT p2) p0 p1), acceptance={1} source=3 dest: 1}, { cond=(AND p3 p0 p1), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p3 p2 p0 p1), acceptance={0} source=3 dest: 3}, { cond=(OR (AND p3 p2 (NOT p0)) (AND p3 p2 (NOT p1))), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND p3 (NOT p2) (NOT p1)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p3 (NOT p2) p1), acceptance={1} source=4 dest: 1}, { cond=(AND p3 p2 (NOT p1)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p3 p2 p1), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p3:(AND (LT s41 1) (LT s40 1) (LT s43 1) (LT s42 1) (LT s45 1) (LT s44 1) (LT s47 1) (LT s46 1) (LT s49 1) (LT s48 1) (LT s51 1) (LT s50 1) (LT s53 1) (LT...], nbAcceptance=2, 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 6444 reset in 724 ms.
Stack based approach found an accepted trace after 8238 steps with 546 reset with depth 84 and stack size 84 in 57 ms.
FORMULA DatabaseWithMutex-COL-04-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-COL-04-LTLFireability-04 finished in 1358 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)&&F((p1&&F(p2)))))))'
Support contains 52 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 5 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2023-03-09 06:12:15] [INFO ] Invariant cache hit.
[2023-03-09 06:12:15] [INFO ] Implicit Places using invariants in 88 ms returned [20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 89 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 128/128 transitions.
Applied a total of 0 rules in 2 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 96 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 217 ms :[(NOT p0), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p2) (NOT p1)), true, (OR (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p2), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 p1 p2), acceptance={0} source=5 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=5 dest: 1}, { cond=(NOT p0), acceptance={0} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=3, aps=[p0:(OR (GEQ s49 1) (GEQ s48 1) (GEQ s51 1) (GEQ s50 1) (GEQ s53 1) (GEQ s52 1) (GEQ s55 1) (GEQ s54 1) (GEQ s41 1) (GEQ s40 1) (GEQ s43 1) (GEQ s42 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DatabaseWithMutex-COL-04-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-04-LTLFireability-05 finished in 1417 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 52 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 2 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2023-03-09 06:12:16] [INFO ] Invariant cache hit.
[2023-03-09 06:12:16] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-09 06:12:16] [INFO ] Invariant cache hit.
[2023-03-09 06:12:16] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2023-03-09 06:12:16] [INFO ] Invariant cache hit.
[2023-03-09 06:12:16] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 191 ms. Remains : 140/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLFireability-07 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:(OR (AND (GEQ s4 1) (GEQ s105 1)) (AND (GEQ s6 1) (GEQ s105 1)) (AND (GEQ s11 1) (GEQ s106 1)) (AND (GEQ s14 1) (GEQ s107 1)) (AND (GEQ s9 1) (GEQ s106...], 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 63 steps with 0 reset in 1 ms.
FORMULA DatabaseWithMutex-COL-04-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-04-LTLFireability-07 finished in 284 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 32 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 16 Pre rules applied. Total rules applied 0 place count 140 transition count 112
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 124 transition count 112
Applied a total of 32 rules in 10 ms. Remains 124 /140 variables (removed 16) and now considering 112/128 (removed 16) transitions.
// Phase 1: matrix 112 rows 124 cols
[2023-03-09 06:12:16] [INFO ] Computed 28 place invariants in 2 ms
[2023-03-09 06:12:16] [INFO ] Implicit Places using invariants in 66 ms returned [4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 68 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/140 places, 112/128 transitions.
Applied a total of 0 rules in 3 ms. Remains 108 /108 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 83 ms. Remains : 108/140 places, 112/128 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s33 1) (GEQ s32 1) (GEQ s35 1) (GEQ s34 1) (GEQ s37 1) (GEQ s36 1) (GEQ s39 1) (GEQ s38 1) (GEQ s25 1) (GEQ s24 1) (GEQ s27 1) (GEQ s26 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 19672 reset in 203 ms.
Product exploration explored 100000 steps with 19659 reset in 208 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))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 165 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 136 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
// Phase 1: matrix 112 rows 108 cols
[2023-03-09 06:12:17] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-09 06:12:17] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-09 06:12:17] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 06:12:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 06:12:17] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2023-03-09 06:12:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 06:12:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-09 06:12:17] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-09 06:12:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 06:12:17] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-09 06:12:17] [INFO ] Computed and/alt/rep : 96/160/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-09 06:12:17] [INFO ] Added : 46 causal constraints over 10 iterations in 126 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 32 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 112/112 transitions.
Applied a total of 0 rules in 3 ms. Remains 108 /108 variables (removed 0) and now considering 112/112 (removed 0) transitions.
[2023-03-09 06:12:17] [INFO ] Invariant cache hit.
[2023-03-09 06:12:17] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-09 06:12:17] [INFO ] Invariant cache hit.
[2023-03-09 06:12:17] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2023-03-09 06:12:17] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 06:12:17] [INFO ] Invariant cache hit.
[2023-03-09 06:12:17] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 215 ms. Remains : 108/108 places, 112/112 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))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 626 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 131 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2023-03-09 06:12:18] [INFO ] Invariant cache hit.
[2023-03-09 06:12:18] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-09 06:12:18] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 06:12:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 06:12:18] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2023-03-09 06:12:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 06:12:19] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-09 06:12:19] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 06:12:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 06:12:19] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2023-03-09 06:12:19] [INFO ] Computed and/alt/rep : 96/160/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-09 06:12:19] [INFO ] Added : 46 causal constraints over 10 iterations in 101 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 2596 ms :[(NOT p0)]
Product exploration explored 100000 steps with 19642 reset in 197 ms.
Product exploration explored 100000 steps with 19699 reset in 202 ms.
Built C files in :
/tmp/ltsmin7343964466840400776
[2023-03-09 06:12:22] [INFO ] Computing symmetric may disable matrix : 112 transitions.
[2023-03-09 06:12:22] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 06:12:22] [INFO ] Computing symmetric may enable matrix : 112 transitions.
[2023-03-09 06:12:22] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 06:12:22] [INFO ] Computing Do-Not-Accords matrix : 112 transitions.
[2023-03-09 06:12:22] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 06:12:22] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7343964466840400776
Running compilation step : cd /tmp/ltsmin7343964466840400776;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 875 ms.
Running link step : cd /tmp/ltsmin7343964466840400776;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin7343964466840400776;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13204017117008709648.hoa' '--buchi-type=spotba'
LTSmin run took 136 ms.
FORMULA DatabaseWithMutex-COL-04-LTLFireability-08 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DatabaseWithMutex-COL-04-LTLFireability-08 finished in 6995 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)||G((X((!p2 U (X(p0)||G(!p2))))&&p1))))'
Support contains 24 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 2 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2023-03-09 06:12:23] [INFO ] Computed 28 place invariants in 2 ms
[2023-03-09 06:12:23] [INFO ] Implicit Places using invariants in 61 ms returned [20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 63 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 128/128 transitions.
Applied a total of 0 rules in 1 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 99 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (LT s16 1) (LT s17 1) (LT s18 1) (LT s19 1)), p1:(AND (OR (LT s4 1) (LT s89 1)) (OR (LT s6 1) (LT s89 1)) (OR (LT s11 1) (LT s90 1)) (OR (LT s14 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 16449 reset in 314 ms.
Product exploration explored 100000 steps with 16383 reset in 316 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 p0) p1 (NOT p2)), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)))), (X (NOT p0)), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 1525 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 328 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Finished random walk after 11 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)))), (X (NOT p0)), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (AND p1 (NOT p2) (NOT p0)))), (F (OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0))))]
Knowledge based reduction with 7 factoid took 300 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Support contains 24 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 128/128 transitions.
Applied a total of 0 rules in 3 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 124 cols
[2023-03-09 06:12:26] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-09 06:12:26] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-09 06:12:26] [INFO ] Invariant cache hit.
[2023-03-09 06:12:26] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2023-03-09 06:12:26] [INFO ] Invariant cache hit.
[2023-03-09 06:12:26] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 202 ms. Remains : 124/124 places, 128/128 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 (NOT p0) p1 (NOT p2)), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0))))), (X (AND p1 (NOT p2) (NOT p0))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0)))))), (X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 311 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Finished random walk after 40 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0))))), (X (AND p1 (NOT p2) (NOT p0))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0)))))), (X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (AND p1 (NOT p2) (NOT p0)))), (F (OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0))))]
Knowledge based reduction with 6 factoid took 270 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Stuttering acceptance computed with spot in 298 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Product exploration explored 100000 steps with 16439 reset in 315 ms.
Product exploration explored 100000 steps with 16451 reset in 312 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Support contains 24 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 128/128 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 124 transition count 128
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 16 place count 124 transition count 136
Deduced a syphon composed of 20 places in 3 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 124 transition count 136
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 32 place count 124 transition count 136
Deduced a syphon composed of 32 places in 1 ms
Applied a total of 32 rules in 22 ms. Remains 124 /124 variables (removed 0) and now considering 136/128 (removed -8) transitions.
[2023-03-09 06:12:28] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 136 rows 124 cols
[2023-03-09 06:12:28] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-09 06:12:28] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/124 places, 136/128 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 94 ms. Remains : 124/124 places, 136/128 transitions.
Built C files in :
/tmp/ltsmin14169555944858046492
[2023-03-09 06:12:28] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14169555944858046492
Running compilation step : cd /tmp/ltsmin14169555944858046492;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1672 ms.
Running link step : cd /tmp/ltsmin14169555944858046492;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin14169555944858046492;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10592554898587846316.hoa' '--buchi-type=spotba'
LTSmin run took 235 ms.
FORMULA DatabaseWithMutex-COL-04-LTLFireability-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DatabaseWithMutex-COL-04-LTLFireability-09 finished in 7618 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(((!p0&&X(p2))||p1))))'
Support contains 32 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 4 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2023-03-09 06:12:30] [INFO ] Computed 28 place invariants in 2 ms
[2023-03-09 06:12:30] [INFO ] Implicit Places using invariants in 76 ms returned [20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 77 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 128/128 transitions.
Applied a total of 0 rules in 1 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 82 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), true]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(OR p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (GEQ s25 1) (GEQ s24 1) (GEQ s27 1) (GEQ s26 1) (GEQ s29 1) (GEQ s28 1) (GEQ s31 1) (GEQ s30 1) (GEQ s33 1) (GEQ s32 1) (GEQ s35 1) (GEQ s34 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 175 steps with 67 reset in 2 ms.
FORMULA DatabaseWithMutex-COL-04-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-COL-04-LTLFireability-10 finished in 233 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 140 transition count 96
Reduce places removed 36 places and 0 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 68 rules applied. Total rules applied 100 place count 104 transition count 64
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 132 place count 72 transition count 64
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 132 place count 72 transition count 48
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 164 place count 56 transition count 48
Applied a total of 164 rules in 12 ms. Remains 56 /140 variables (removed 84) and now considering 48/128 (removed 80) transitions.
// Phase 1: matrix 48 rows 56 cols
[2023-03-09 06:12:31] [INFO ] Computed 24 place invariants in 2 ms
[2023-03-09 06:12:31] [INFO ] Implicit Places using invariants in 64 ms returned [4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39]
[2023-03-09 06:12:31] [INFO ] Actually due to overlaps returned [24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 65 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/140 places, 48/128 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 80 ms. Remains : 40/140 places, 48/128 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s0 1) (LT s1 1) (LT s2 1) (LT s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 15972 reset in 92 ms.
Stack based approach found an accepted trace after 127 steps with 21 reset with depth 6 and stack size 6 in 1 ms.
FORMULA DatabaseWithMutex-COL-04-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-COL-04-LTLFireability-12 finished in 270 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(G(!p0))||(p0 U (p1||G(p0)||G(!p2))))))'
Support contains 52 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Applied a total of 0 rules in 0 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2023-03-09 06:12:31] [INFO ] Computed 28 place invariants in 2 ms
[2023-03-09 06:12:31] [INFO ] Implicit Places using invariants in 70 ms returned [20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 71 ms to find 16 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 128/128 transitions.
Applied a total of 0 rules in 0 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 72 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 151 ms :[false, p0, (AND p0 p2), false]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p1:(AND (OR (LT s21 1) (LT s109 1)) (OR (LT s22 1) (LT s118 1)) (OR (LT s21 1) (LT s113 1)) (OR (LT s22 1) (LT s114 1)) (OR (LT s21 1) (LT s117 1)) (OR (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 171 ms.
Stack based approach found an accepted trace after 2553 steps with 1 reset with depth 2548 and stack size 2548 in 5 ms.
FORMULA DatabaseWithMutex-COL-04-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-COL-04-LTLFireability-13 finished in 430 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(F(p1)))) U p0))'
Support contains 32 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 32 Pre rules applied. Total rules applied 0 place count 140 transition count 96
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 0 with 64 rules applied. Total rules applied 64 place count 108 transition count 96
Applied a total of 64 rules in 8 ms. Remains 108 /140 variables (removed 32) and now considering 96/128 (removed 32) transitions.
// Phase 1: matrix 96 rows 108 cols
[2023-03-09 06:12:31] [INFO ] Computed 28 place invariants in 0 ms
[2023-03-09 06:12:31] [INFO ] Implicit Places using invariants in 71 ms returned [4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 72 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 92/140 places, 96/128 transitions.
Applied a total of 0 rules in 2 ms. Remains 92 /92 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 83 ms. Remains : 92/140 places, 96/128 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s33 1) (GEQ s32 1) (GEQ s35 1) (GEQ s34 1) (GEQ s37 1) (GEQ s36 1) (GEQ s39 1) (GEQ s38 1) (GEQ s25 1) (GEQ s24 1) (GEQ s27 1) (GEQ s26 1) (GE...], 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 9056 reset in 224 ms.
Product exploration explored 100000 steps with 9115 reset in 230 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 p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), true]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 5 factoid took 300 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 4 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), true]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F p0), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 343 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 96 rows 92 cols
[2023-03-09 06:12:33] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-09 06:12:33] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-09 06:12:33] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 06:12:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 06:12:33] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2023-03-09 06:12:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 06:12:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-09 06:12:33] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 06:12:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 06:12:33] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2023-03-09 06:12:33] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 6 ms to minimize.
[2023-03-09 06:12:33] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2023-03-09 06:12:33] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2023-03-09 06:12:33] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2023-03-09 06:12:33] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2023-03-09 06:12:33] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2023-03-09 06:12:33] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2023-03-09 06:12:33] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2023-03-09 06:12:34] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2023-03-09 06:12:34] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 363 ms
[2023-03-09 06:12:34] [INFO ] Computed and/alt/rep : 80/144/80 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-09 06:12:34] [INFO ] Added : 0 causal constraints over 0 iterations in 18 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 32 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 92 /92 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2023-03-09 06:12:34] [INFO ] Invariant cache hit.
[2023-03-09 06:12:34] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-09 06:12:34] [INFO ] Invariant cache hit.
[2023-03-09 06:12:34] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2023-03-09 06:12:34] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 06:12:34] [INFO ] Invariant cache hit.
[2023-03-09 06:12:34] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 200 ms. Remains : 92/92 places, 96/96 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 (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), true]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 5 factoid took 1231 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 4 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), true]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F p0), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 1733 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 396 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-09 06:12:38] [INFO ] Invariant cache hit.
[2023-03-09 06:12:38] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-09 06:12:38] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 06:12:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 06:12:38] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-09 06:12:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 06:12:38] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-09 06:12:38] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 06:12:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 06:12:38] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-09 06:12:38] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2023-03-09 06:12:38] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2023-03-09 06:12:38] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2023-03-09 06:12:38] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2023-03-09 06:12:38] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 4 ms to minimize.
[2023-03-09 06:12:38] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2023-03-09 06:12:38] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2023-03-09 06:12:38] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2023-03-09 06:12:38] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2023-03-09 06:12:38] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2023-03-09 06:12:38] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2023-03-09 06:12:38] [INFO ] Trap strengthening procedure interrupted after too many repetitions 363 ms
[2023-03-09 06:12:38] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 363 ms
[2023-03-09 06:12:38] [INFO ] Computed and/alt/rep : 80/144/80 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-09 06:12:38] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2023-03-09 06:12:38] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2023-03-09 06:12:38] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2023-03-09 06:12:38] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2023-03-09 06:12:38] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2023-03-09 06:12:38] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 0 ms to minimize.
[2023-03-09 06:12:39] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2023-03-09 06:12:39] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 0 ms to minimize.
[2023-03-09 06:12:39] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 293 ms
[2023-03-09 06:12:39] [INFO ] Added : 40 causal constraints over 9 iterations in 383 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 4324 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 9124 reset in 221 ms.
Product exploration explored 100000 steps with 9204 reset in 228 ms.
Built C files in :
/tmp/ltsmin6507911828683848216
[2023-03-09 06:12:43] [INFO ] Computing symmetric may disable matrix : 96 transitions.
[2023-03-09 06:12:43] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 06:12:43] [INFO ] Computing symmetric may enable matrix : 96 transitions.
[2023-03-09 06:12:43] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 06:12:43] [INFO ] Computing Do-Not-Accords matrix : 96 transitions.
[2023-03-09 06:12:43] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 06:12:43] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6507911828683848216
Running compilation step : cd /tmp/ltsmin6507911828683848216;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 207 ms.
Running link step : cd /tmp/ltsmin6507911828683848216;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin6507911828683848216;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6150945474452726971.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 32 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 96/96 transitions.
Applied a total of 0 rules in 7 ms. Remains 92 /92 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2023-03-09 06:12:59] [INFO ] Invariant cache hit.
[2023-03-09 06:12:59] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-09 06:12:59] [INFO ] Invariant cache hit.
[2023-03-09 06:12:59] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2023-03-09 06:12:59] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 06:12:59] [INFO ] Invariant cache hit.
[2023-03-09 06:12:59] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 192 ms. Remains : 92/92 places, 96/96 transitions.
Built C files in :
/tmp/ltsmin2339893055521340677
[2023-03-09 06:13:01] [INFO ] Computing symmetric may disable matrix : 96 transitions.
[2023-03-09 06:13:01] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 06:13:01] [INFO ] Computing symmetric may enable matrix : 96 transitions.
[2023-03-09 06:13:01] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 06:13:01] [INFO ] Computing Do-Not-Accords matrix : 96 transitions.
[2023-03-09 06:13:01] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 06:13:01] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2339893055521340677
Running compilation step : cd /tmp/ltsmin2339893055521340677;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2249 ms.
Running link step : cd /tmp/ltsmin2339893055521340677;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin2339893055521340677;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17171437446495361550.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-09 06:13:17] [INFO ] Flatten gal took : 6 ms
[2023-03-09 06:13:17] [INFO ] Flatten gal took : 6 ms
[2023-03-09 06:13:17] [INFO ] Time to serialize gal into /tmp/LTL7235545318470633745.gal : 3 ms
[2023-03-09 06:13:17] [INFO ] Time to serialize properties into /tmp/LTL6924536505643135090.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7235545318470633745.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8724371101137071099.hoa' '-atoms' '/tmp/LTL6924536505643135090.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL6924536505643135090.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8724371101137071099.hoa
Detected timeout of ITS tools.
[2023-03-09 06:13:32] [INFO ] Flatten gal took : 6 ms
[2023-03-09 06:13:32] [INFO ] Flatten gal took : 5 ms
[2023-03-09 06:13:32] [INFO ] Time to serialize gal into /tmp/LTL7363909609290691523.gal : 1 ms
[2023-03-09 06:13:32] [INFO ] Time to serialize properties into /tmp/LTL12639825071939467878.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7363909609290691523.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12639825071939467878.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F((G("(((((Modify_9>=1)||(Modify_8>=1))||((Modify_11>=1)||(Modify_10>=1)))||(((Modify_13>=1)||(Modify_12>=1))||((Modify_15>=1)||(M...909
Formula 0 simplified : G(F!"(((((Modify_9>=1)||(Modify_8>=1))||((Modify_11>=1)||(Modify_10>=1)))||(((Modify_13>=1)||(Modify_12>=1))||((Modify_15>=1)||(Modi...898
Detected timeout of ITS tools.
[2023-03-09 06:13:47] [INFO ] Flatten gal took : 8 ms
[2023-03-09 06:13:47] [INFO ] Applying decomposition
[2023-03-09 06:13:47] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph7292180821081221563.txt' '-o' '/tmp/graph7292180821081221563.bin' '-w' '/tmp/graph7292180821081221563.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7292180821081221563.bin' '-l' '-1' '-v' '-w' '/tmp/graph7292180821081221563.weights' '-q' '0' '-e' '0.001'
[2023-03-09 06:13:48] [INFO ] Decomposing Gal with order
[2023-03-09 06:13:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 06:13:48] [INFO ] Removed a total of 56 redundant transitions.
[2023-03-09 06:13:48] [INFO ] Flatten gal took : 19 ms
[2023-03-09 06:13:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-09 06:13:48] [INFO ] Time to serialize gal into /tmp/LTL6682011736781823772.gal : 2 ms
[2023-03-09 06:13:48] [INFO ] Time to serialize properties into /tmp/LTL16340702016462933721.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6682011736781823772.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16340702016462933721.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((F((G("(((((u6.Modify_9>=1)||(u5.Modify_8>=1))||((u11.Modify_11>=1)||(u4.Modify_10>=1)))||(((u6.Modify_13>=1)||(u5.Modify_12>=1))||...1065
Formula 0 simplified : G(F!"(((((u6.Modify_9>=1)||(u5.Modify_8>=1))||((u11.Modify_11>=1)||(u4.Modify_10>=1)))||(((u6.Modify_13>=1)||(u5.Modify_12>=1))||((u...1054
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
13 unique states visited
0 strongly connected components in search stack
17 transitions explored
7 items max in DFS search stack
1318 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,13.1981,518708,1,0,1.2502e+06,8284,1116,752737,403,34457,2677734
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-COL-04-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Detected timeout of ITS tools.
Treatment of property DatabaseWithMutex-COL-04-LTLFireability-14 finished in 91328 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 16 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 128/128 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 140 transition count 112
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 124 transition count 112
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 32 place count 124 transition count 80
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 96 place count 92 transition count 80
Applied a total of 96 rules in 10 ms. Remains 92 /140 variables (removed 48) and now considering 80/128 (removed 48) transitions.
// Phase 1: matrix 80 rows 92 cols
[2023-03-09 06:14:03] [INFO ] Computed 28 place invariants in 2 ms
[2023-03-09 06:14:03] [INFO ] Implicit Places using invariants in 69 ms returned [4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 71 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 76/140 places, 80/128 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 83 ms. Remains : 76/140 places, 80/128 transitions.
Stuttering acceptance computed with spot in 1530 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-COL-04-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s46 1) (GEQ s47 1) (GEQ s44 1) (GEQ s45 1) (GEQ s50 1) (GEQ s51 1) (GEQ s48 1) (GEQ s49 1) (GEQ s54 1) (GEQ s55 1) (GEQ s52 1) (GEQ s53 1) (GE...], 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 13567 reset in 164 ms.
Product exploration explored 100000 steps with 13579 reset in 162 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 111 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 84 ms :[(NOT p0), (NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 108 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 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 80 rows 76 cols
[2023-03-09 06:14:05] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-09 06:14:05] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-09 06:14:05] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 06:14:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 06:14:05] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-09 06:14:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 06:14:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-09 06:14:05] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 06:14:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 06:14:05] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-09 06:14:05] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2023-03-09 06:14:05] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
[2023-03-09 06:14:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 67 ms
[2023-03-09 06:14:05] [INFO ] Computed and/alt/rep : 64/128/64 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-09 06:14:05] [INFO ] Added : 46 causal constraints over 10 iterations in 71 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 16 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 76 /76 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2023-03-09 06:14:05] [INFO ] Invariant cache hit.
[2023-03-09 06:14:05] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-09 06:14:05] [INFO ] Invariant cache hit.
[2023-03-09 06:14:05] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2023-03-09 06:14:05] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 06:14:05] [INFO ] Invariant cache hit.
[2023-03-09 06:14:06] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 177 ms. Remains : 76/76 places, 80/80 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 132 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 p0), (NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 136 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 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
[2023-03-09 06:14:06] [INFO ] Invariant cache hit.
[2023-03-09 06:14:06] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-09 06:14:06] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 06:14:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 06:14:06] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-09 06:14:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 06:14:06] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-09 06:14:06] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 06:14:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 06:14:06] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-09 06:14:06] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2023-03-09 06:14:06] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2023-03-09 06:14:06] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 0 ms to minimize.
[2023-03-09 06:14:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 96 ms
[2023-03-09 06:14:06] [INFO ] Computed and/alt/rep : 64/128/64 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-09 06:14:06] [INFO ] Added : 31 causal constraints over 7 iterations in 58 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13659 reset in 157 ms.
Product exploration explored 100000 steps with 13553 reset in 187 ms.
Built C files in :
/tmp/ltsmin6461216065071557978
[2023-03-09 06:14:07] [INFO ] Computing symmetric may disable matrix : 80 transitions.
[2023-03-09 06:14:07] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 06:14:07] [INFO ] Computing symmetric may enable matrix : 80 transitions.
[2023-03-09 06:14:07] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 06:14:07] [INFO ] Computing Do-Not-Accords matrix : 80 transitions.
[2023-03-09 06:14:07] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 06:14:07] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6461216065071557978
Running compilation step : cd /tmp/ltsmin6461216065071557978;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 174 ms.
Running link step : cd /tmp/ltsmin6461216065071557978;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin6461216065071557978;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12206847960069824301.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 16 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 80/80 transitions.
Applied a total of 0 rules in 6 ms. Remains 76 /76 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2023-03-09 06:14:22] [INFO ] Invariant cache hit.
[2023-03-09 06:14:22] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-09 06:14:22] [INFO ] Invariant cache hit.
[2023-03-09 06:14:22] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2023-03-09 06:14:22] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 06:14:22] [INFO ] Invariant cache hit.
[2023-03-09 06:14:22] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 194 ms. Remains : 76/76 places, 80/80 transitions.
Built C files in :
/tmp/ltsmin509423269907100544
[2023-03-09 06:14:22] [INFO ] Computing symmetric may disable matrix : 80 transitions.
[2023-03-09 06:14:22] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 06:14:22] [INFO ] Computing symmetric may enable matrix : 80 transitions.
[2023-03-09 06:14:22] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 06:14:22] [INFO ] Computing Do-Not-Accords matrix : 80 transitions.
[2023-03-09 06:14:22] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 06:14:22] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin509423269907100544
Running compilation step : cd /tmp/ltsmin509423269907100544;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 181 ms.
Running link step : cd /tmp/ltsmin509423269907100544;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin509423269907100544;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13407108018309110843.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-09 06:14:37] [INFO ] Flatten gal took : 4 ms
[2023-03-09 06:14:37] [INFO ] Flatten gal took : 5 ms
[2023-03-09 06:14:37] [INFO ] Time to serialize gal into /tmp/LTL11701279960383605271.gal : 3 ms
[2023-03-09 06:14:37] [INFO ] Time to serialize properties into /tmp/LTL14907285195086452586.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11701279960383605271.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14840132313156407889.hoa' '-atoms' '/tmp/LTL14907285195086452586.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL14907285195086452586.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14840132313156407889.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1154 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,11.5512,335980,1,0,31,1.73036e+06,24,1,2100,690140,79
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-COL-04-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property DatabaseWithMutex-COL-04-LTLFireability-15 finished in 47389 ms.
All properties solved by simple procedures.
Total runtime 168212 ms.

BK_STOP 1678342496059

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="DatabaseWithMutex-COL-04"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is DatabaseWithMutex-COL-04, 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 r101-tall-167814476201028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DatabaseWithMutex-COL-04.tgz
mv DatabaseWithMutex-COL-04 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;