Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r153-tall-171631150900033.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is DatabaseWithMutex-PT-04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-171631150900033
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 20K Apr 11 18:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 117K Apr 11 18:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 28K Apr 11 18:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 164K Apr 11 18:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 12K Apr 22 14:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Apr 22 14:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 22 14:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 22 14:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 61K Apr 11 18:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 337K Apr 11 18:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 42K Apr 11 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 234K Apr 11 18:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.3K Apr 22 14:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 61K May 18 16:42 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-PT-04-LTLFireability-00
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-01
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-02
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-03
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-04
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-05
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-06
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-07
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-08
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-09
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-10
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-11
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-12
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-13
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-14
FORMULA_NAME DatabaseWithMutex-PT-04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716409768164

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DatabaseWithMutex-PT-04
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-22 20:29:29] [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]
[2024-05-22 20:29:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 20:29:30] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2024-05-22 20:29:30] [INFO ] Transformed 140 places.
[2024-05-22 20:29:30] [INFO ] Transformed 128 transitions.
[2024-05-22 20:29:30] [INFO ] Found NUPN structural information;
[2024-05-22 20:29:30] [INFO ] Parsed PT model containing 140 places and 128 transitions and 416 arcs in 386 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
[2024-05-22 20:29:30] [INFO ] Reduced 12 identical enabling conditions.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-04-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 109 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 11 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2024-05-22 20:29:30] [INFO ] Computed 28 invariants in 14 ms
[2024-05-22 20:29:30] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-22 20:29:30] [INFO ] Invariant cache hit.
[2024-05-22 20:29:30] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
[2024-05-22 20:29:30] [INFO ] Invariant cache hit.
[2024-05-22 20:29:30] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 507 ms. Remains : 140/140 places, 128/128 transitions.
Support contains 109 out of 140 places after structural reductions.
[2024-05-22 20:29:30] [INFO ] Flatten gal took : 30 ms
[2024-05-22 20:29:31] [INFO ] Flatten gal took : 13 ms
[2024-05-22 20:29:31] [INFO ] Input system was already deterministic with 128 transitions.
Finished random walk after 240 steps, including 0 resets, run visited all 27 properties in 24 ms. (steps per millisecond=10 )
Parikh walk visited 0 properties in 0 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(p1))))'
Support contains 20 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.
[2024-05-22 20:29:31] [INFO ] Invariant cache hit.
[2024-05-22 20:29:31] [INFO ] Implicit Places using invariants in 103 ms returned [7, 14, 16, 24, 34, 41, 42, 50, 55, 66, 84, 99, 103, 115, 129, 138]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 105 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 113 ms. Remains : 124/140 places, 128/128 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 821 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s57 1) (EQ s49 1) (EQ s66 1) (EQ s51 1)), p0:(OR (EQ s1 1) (EQ s119 1) (EQ s88 1) (EQ s61 1) (EQ s7 1) (EQ s93 1) (EQ s62 1) (EQ s36 1) (EQ s39...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 2 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-00 finished in 982 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(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.
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 20 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 52 rules applied. Total rules applied 68 place count 120 transition count 80
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 100 place count 88 transition count 80
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 100 place count 88 transition count 64
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 132 place count 72 transition count 64
Applied a total of 132 rules in 21 ms. Remains 72 /140 variables (removed 68) and now considering 64/128 (removed 64) transitions.
// Phase 1: matrix 64 rows 72 cols
[2024-05-22 20:29:32] [INFO ] Computed 24 invariants in 2 ms
[2024-05-22 20:29:32] [INFO ] Implicit Places using invariants in 88 ms returned [0, 2, 5, 7, 8, 12, 13, 15, 16, 18, 19, 20, 23, 25, 26, 33, 36, 41, 42, 43, 44, 46, 47, 49, 51, 57, 60, 62, 63, 64, 65, 70]
[2024-05-22 20:29:32] [INFO ] Actually due to overlaps returned [0, 8, 13, 16, 18, 26, 36, 41, 43, 44, 46, 51, 60, 62, 63, 65]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 89 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/140 places, 64/128 transitions.
Applied a total of 0 rules in 2 ms. Remains 56 /56 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 114 ms. Remains : 56/140 places, 64/128 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (EQ s13 0) (EQ s53 0)) (OR (EQ s43 0) (EQ s50 0)) (OR (EQ s3 0) (EQ s9 0)) (OR (EQ s47 0) (EQ s55 0)) (OR (EQ s46 0) (EQ s53 0)) (OR (EQ s17 0...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 14451 reset in 339 ms.
Product exploration explored 100000 steps with 14425 reset in 299 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 (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 4 factoid took 129 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 4 factoid took 203 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 36 out of 56 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 64/64 transitions.
Applied a total of 0 rules in 6 ms. Remains 56 /56 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 56 cols
[2024-05-22 20:29:33] [INFO ] Computed 8 invariants in 3 ms
[2024-05-22 20:29:33] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-22 20:29:33] [INFO ] Invariant cache hit.
[2024-05-22 20:29:33] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2024-05-22 20:29:34] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 20:29:34] [INFO ] Invariant cache hit.
[2024-05-22 20:29:34] [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 144 ms. Remains : 56/56 places, 64/64 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 4 factoid took 103 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 4 factoid took 177 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 14379 reset in 300 ms.
Product exploration explored 100000 steps with 14535 reset in 243 ms.
Built C files in :
/tmp/ltsmin7978189356900910199
[2024-05-22 20:29:35] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2024-05-22 20:29:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 20:29:35] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2024-05-22 20:29:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 20:29:35] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2024-05-22 20:29:35] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 20:29:35] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7978189356900910199
Running compilation step : cd /tmp/ltsmin7978189356900910199;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 273 ms.
Running link step : cd /tmp/ltsmin7978189356900910199;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin7978189356900910199;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased167961622246042025.hoa' '--buchi-type=spotba'
LTSmin run took 590 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-02 finished in 3733 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||(G(p2)&&p1))))'
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 8 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2024-05-22 20:29:36] [INFO ] Computed 28 invariants in 5 ms
[2024-05-22 20:29:36] [INFO ] Implicit Places using invariants in 93 ms returned [7, 14, 16, 24, 34, 41, 42, 50, 55, 66, 84, 99, 103, 115, 129, 138]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 96 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 107 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 215 ms :[true, (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p1 p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(AND (OR (EQ s28 0) (EQ s106 0)) (OR (EQ s44 0) (EQ s81 0)) (OR (EQ s32 0) (EQ s86 0)) (OR (EQ s2 0) (EQ s18 0)) (OR (EQ s103 0) (EQ s106 0)) (OR (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 281 ms.
Product exploration explored 100000 steps with 33333 reset in 277 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 p2), (X (AND p1 p2)), (X (NOT (OR (NOT p1) (NOT p2)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 20 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DatabaseWithMutex-PT-04-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-03 finished in 925 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(p1))||p0)))'
Support contains 16 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.
[2024-05-22 20:29:37] [INFO ] Invariant cache hit.
[2024-05-22 20:29:37] [INFO ] Implicit Places using invariants in 92 ms returned [7, 14, 16, 24, 34, 41, 42, 50, 55, 66, 84, 99, 103, 115, 129, 138]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 94 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 101 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s1 1) (EQ s119 1) (EQ s88 1) (EQ s61 1) (EQ s7 1) (EQ s93 1) (EQ s62 1) (EQ s36 1) (EQ s39 1) (EQ s71 1) (EQ s76 1) (EQ s46 1) (EQ s21 1) (EQ s...], 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 6109 reset in 235 ms.
Product exploration explored 100000 steps with 6166 reset in 253 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 (NOT p0)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 128 rows 124 cols
[2024-05-22 20:29:38] [INFO ] Computed 12 invariants in 2 ms
[2024-05-22 20:29:38] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-22 20:29:38] [INFO ] [Real]Absence check using 8 positive and 4 generalized place invariants in 5 ms returned sat
[2024-05-22 20:29:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 20:29:38] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2024-05-22 20:29:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 20:29:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-22 20:29:38] [INFO ] [Nat]Absence check using 8 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-22 20:29:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 20:29:38] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2024-05-22 20:29:38] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 3 ms to minimize.
[2024-05-22 20:29:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2024-05-22 20:29:38] [INFO ] Computed and/alt/rep : 112/176/112 causal constraints (skipped 0 transitions) in 24 ms.
[2024-05-22 20:29:39] [INFO ] Added : 81 causal constraints over 17 iterations in 318 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 16 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.
[2024-05-22 20:29:39] [INFO ] Invariant cache hit.
[2024-05-22 20:29:39] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-22 20:29:39] [INFO ] Invariant cache hit.
[2024-05-22 20:29:39] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
[2024-05-22 20:29:39] [INFO ] Invariant cache hit.
[2024-05-22 20:29:39] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 359 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) (NOT p1)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 17 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=8 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-22 20:29:40] [INFO ] Invariant cache hit.
[2024-05-22 20:29:40] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-22 20:29:40] [INFO ] [Real]Absence check using 8 positive and 4 generalized place invariants in 6 ms returned sat
[2024-05-22 20:29:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 20:29:40] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2024-05-22 20:29:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 20:29:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-22 20:29:40] [INFO ] [Nat]Absence check using 8 positive and 4 generalized place invariants in 5 ms returned sat
[2024-05-22 20:29:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 20:29:40] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2024-05-22 20:29:40] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-22 20:29:40] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-22 20:29:40] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-22 20:29:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 154 ms
[2024-05-22 20:29:40] [INFO ] Computed and/alt/rep : 112/176/112 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-22 20:29:41] [INFO ] Added : 81 causal constraints over 17 iterations in 552 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 6109 reset in 222 ms.
Product exploration explored 100000 steps with 6114 reset in 233 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 16 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 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 16 Pre rules applied. Total rules applied 16 place count 124 transition count 128
Deduced a syphon composed of 32 places in 1 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 32 place count 124 transition count 128
Deduced a syphon composed of 32 places in 0 ms
Applied a total of 32 rules in 22 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-05-22 20:29:42] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 128 rows 124 cols
[2024-05-22 20:29:42] [INFO ] Computed 12 invariants in 2 ms
[2024-05-22 20:29:42] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/124 places, 128/128 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 139 ms. Remains : 124/124 places, 128/128 transitions.
Built C files in :
/tmp/ltsmin11185812483801165726
[2024-05-22 20:29:42] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11185812483801165726
Running compilation step : cd /tmp/ltsmin11185812483801165726;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 216 ms.
Running link step : cd /tmp/ltsmin11185812483801165726;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin11185812483801165726;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8862796987297519169.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 16 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 5 ms. Remains 124 /124 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 124 cols
[2024-05-22 20:29:57] [INFO ] Computed 12 invariants in 5 ms
[2024-05-22 20:29:57] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-22 20:29:57] [INFO ] Invariant cache hit.
[2024-05-22 20:29:57] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
[2024-05-22 20:29:57] [INFO ] Invariant cache hit.
[2024-05-22 20:29:58] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 394 ms. Remains : 124/124 places, 128/128 transitions.
Built C files in :
/tmp/ltsmin567760811061199413
[2024-05-22 20:29:58] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin567760811061199413
Running compilation step : cd /tmp/ltsmin567760811061199413;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 216 ms.
Running link step : cd /tmp/ltsmin567760811061199413;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin567760811061199413;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6005152322254239290.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 20:30:13] [INFO ] Flatten gal took : 8 ms
[2024-05-22 20:30:13] [INFO ] Flatten gal took : 8 ms
[2024-05-22 20:30:13] [INFO ] Time to serialize gal into /tmp/LTL12460124918590169182.gal : 3 ms
[2024-05-22 20:30:13] [INFO ] Time to serialize properties into /tmp/LTL8473739083282729753.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12460124918590169182.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7980555148450287687.hoa' '-atoms' '/tmp/LTL8473739083282729753.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8473739083282729753.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7980555148450287687.hoa
Detected timeout of ITS tools.
[2024-05-22 20:30:28] [INFO ] Flatten gal took : 8 ms
[2024-05-22 20:30:28] [INFO ] Flatten gal took : 7 ms
[2024-05-22 20:30:28] [INFO ] Time to serialize gal into /tmp/LTL11464395340200812960.gal : 2 ms
[2024-05-22 20:30:28] [INFO ] Time to serialize properties into /tmp/LTL12031421860382122319.ltl : 7 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11464395340200812960.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12031421860382122319.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(("(((((MesBuffReply_3_4==1)||(MesBuffReply_4_4==1))||((MesBuffReply_1_3==1)||(MesBuffReply_2_1==1)))||(((MesBuffReply_2_2==1)||(M...837
Formula 0 simplified : G(!"(((((MesBuffReply_3_4==1)||(MesBuffReply_4_4==1))||((MesBuffReply_1_3==1)||(MesBuffReply_2_1==1)))||(((MesBuffReply_2_2==1)||(Me...829
Detected timeout of ITS tools.
[2024-05-22 20:30:43] [INFO ] Flatten gal took : 7 ms
[2024-05-22 20:30:43] [INFO ] Applying decomposition
[2024-05-22 20:30:43] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph17602399750145493117.txt' '-o' '/tmp/graph17602399750145493117.bin' '-w' '/tmp/graph17602399750145493117.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17602399750145493117.bin' '-l' '-1' '-v' '-w' '/tmp/graph17602399750145493117.weights' '-q' '0' '-e' '0.001'
[2024-05-22 20:30:43] [INFO ] Decomposing Gal with order
[2024-05-22 20:30:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 20:30:43] [INFO ] Removed a total of 85 redundant transitions.
[2024-05-22 20:30:43] [INFO ] Flatten gal took : 40 ms
[2024-05-22 20:30:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-22 20:30:43] [INFO ] Time to serialize gal into /tmp/LTL12817670155705899562.gal : 4 ms
[2024-05-22 20:30:43] [INFO ] Time to serialize properties into /tmp/LTL3844714218710513496.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12817670155705899562.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3844714218710513496.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(("(((((i9.u1.MesBuffReply_3_4==1)||(i2.u41.MesBuffReply_4_4==1))||((i0.u33.MesBuffReply_1_3==1)||(i5.u30.MesBuffReply_2_1==1)))||...1055
Formula 0 simplified : G(!"(((((i9.u1.MesBuffReply_3_4==1)||(i2.u41.MesBuffReply_4_4==1))||((i0.u33.MesBuffReply_1_3==1)||(i5.u30.MesBuffReply_2_1==1)))||(...1047
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
776 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,7.78446,232792,1,0,554734,390,1396,380916,169,2109,1000108
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-05 finished in 75501 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p1 U p2)||p0))))'
Support contains 20 out of 140 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 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 20 places and 0 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 1 with 36 rules applied. Total rules applied 52 place count 120 transition count 96
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 68 place count 104 transition count 96
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 68 place count 104 transition count 80
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 100 place count 88 transition count 80
Applied a total of 100 rules in 6 ms. Remains 88 /140 variables (removed 52) and now considering 80/128 (removed 48) transitions.
// Phase 1: matrix 80 rows 88 cols
[2024-05-22 20:30:52] [INFO ] Computed 24 invariants in 1 ms
[2024-05-22 20:30:52] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-22 20:30:52] [INFO ] Invariant cache hit.
[2024-05-22 20:30:52] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2024-05-22 20:30:52] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 20:30:52] [INFO ] Invariant cache hit.
[2024-05-22 20:30:52] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/140 places, 80/128 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 221 ms. Remains : 88/140 places, 80/128 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(OR (AND (EQ s19 1) (EQ s85 1)) (AND (EQ s67 1) (EQ s81 1)) (AND (EQ s4 1) (EQ s12 1)) (AND (EQ s72 1) (EQ s87 1)) (AND (EQ s71 1) (EQ s85 1)) (AND (EQ...], 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 9829 reset in 222 ms.
Product exploration explored 100000 steps with 9868 reset in 237 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 p2) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 2 factoid took 138 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2024-05-22 20:30:53] [INFO ] Invariant cache hit.
[2024-05-22 20:30:54] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-22 20:30:54] [INFO ] [Real]Absence check using 4 positive and 20 generalized place invariants in 19 ms returned sat
[2024-05-22 20:30:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 20:30:54] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2024-05-22 20:30:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 20:30:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-22 20:30:54] [INFO ] [Nat]Absence check using 4 positive and 20 generalized place invariants in 16 ms returned sat
[2024-05-22 20:30:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 20:30:54] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2024-05-22 20:30:54] [INFO ] Computed and/alt/rep : 64/144/64 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-22 20:30:54] [INFO ] Added : 30 causal constraints over 6 iterations in 74 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 20 out of 88 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 88 /88 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2024-05-22 20:30:54] [INFO ] Invariant cache hit.
[2024-05-22 20:30:54] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-22 20:30:54] [INFO ] Invariant cache hit.
[2024-05-22 20:30:54] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2024-05-22 20:30:54] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 20:30:54] [INFO ] Invariant cache hit.
[2024-05-22 20:30:54] [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 204 ms. Remains : 88/88 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 : [(AND (NOT p0) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 2 factoid took 130 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2024-05-22 20:30:55] [INFO ] Invariant cache hit.
[2024-05-22 20:30:55] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-22 20:30:55] [INFO ] [Real]Absence check using 4 positive and 20 generalized place invariants in 12 ms returned sat
[2024-05-22 20:30:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 20:30:55] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-05-22 20:30:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 20:30:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-22 20:30:55] [INFO ] [Nat]Absence check using 4 positive and 20 generalized place invariants in 16 ms returned sat
[2024-05-22 20:30:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 20:30:55] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-05-22 20:30:55] [INFO ] Computed and/alt/rep : 64/144/64 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-22 20:30:55] [INFO ] Added : 30 causal constraints over 6 iterations in 56 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 9995 reset in 232 ms.
Product exploration explored 100000 steps with 9675 reset in 238 ms.
Built C files in :
/tmp/ltsmin15170222288890351289
[2024-05-22 20:30:56] [INFO ] Computing symmetric may disable matrix : 80 transitions.
[2024-05-22 20:30:56] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 20:30:56] [INFO ] Computing symmetric may enable matrix : 80 transitions.
[2024-05-22 20:30:56] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 20:30:56] [INFO ] Computing Do-Not-Accords matrix : 80 transitions.
[2024-05-22 20:30:56] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 20:30:56] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15170222288890351289
Running compilation step : cd /tmp/ltsmin15170222288890351289;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 192 ms.
Running link step : cd /tmp/ltsmin15170222288890351289;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin15170222288890351289;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13378155001990313647.hoa' '--buchi-type=spotba'
LTSmin run took 10331 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-06 finished in 14019 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(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.
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 20 places and 0 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 1 with 36 rules applied. Total rules applied 52 place count 120 transition count 96
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 68 place count 104 transition count 96
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 68 place count 104 transition count 80
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 100 place count 88 transition count 80
Applied a total of 100 rules in 14 ms. Remains 88 /140 variables (removed 52) and now considering 80/128 (removed 48) transitions.
[2024-05-22 20:31:06] [INFO ] Invariant cache hit.
[2024-05-22 20:31:06] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-22 20:31:06] [INFO ] Invariant cache hit.
[2024-05-22 20:31:06] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2024-05-22 20:31:06] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 20:31:06] [INFO ] Invariant cache hit.
[2024-05-22 20:31:06] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/140 places, 80/128 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 188 ms. Remains : 88/140 places, 80/128 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (EQ s5 1) (EQ s6 1) (EQ s23 1) (EQ s51 1)) (AND (EQ s5 1) (EQ s22 1) (EQ s51 1) (EQ s63 1)) (AND (EQ s29 1) (EQ s42 1) (EQ s56 1) (EQ s70 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 7233 reset in 185 ms.
Product exploration explored 100000 steps with 7215 reset in 201 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 97 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 34 ms :[(NOT p0)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 93 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 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
[2024-05-22 20:31:07] [INFO ] Invariant cache hit.
[2024-05-22 20:31:07] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 20:31:07] [INFO ] [Real]Absence check using 4 positive and 20 generalized place invariants in 11 ms returned sat
[2024-05-22 20:31:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 20:31:07] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2024-05-22 20:31:07] [INFO ] Computed and/alt/rep : 64/144/64 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-22 20:31:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 20:31:07] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 20:31:07] [INFO ] [Nat]Absence check using 4 positive and 20 generalized place invariants in 8 ms returned sat
[2024-05-22 20:31:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 20:31:07] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-05-22 20:31:07] [INFO ] Computed and/alt/rep : 64/144/64 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-22 20:31:08] [INFO ] Added : 30 causal constraints over 6 iterations in 62 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 32 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 80/80 transitions.
Applied a total of 0 rules in 5 ms. Remains 88 /88 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2024-05-22 20:31:08] [INFO ] Invariant cache hit.
[2024-05-22 20:31:08] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-22 20:31:08] [INFO ] Invariant cache hit.
[2024-05-22 20:31:08] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2024-05-22 20:31:08] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 20:31:08] [INFO ] Invariant cache hit.
[2024-05-22 20:31:08] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 203 ms. Remains : 88/88 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 81 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 31 ms :[(NOT p0)]
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 80 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 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
[2024-05-22 20:31:08] [INFO ] Invariant cache hit.
[2024-05-22 20:31:08] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-22 20:31:08] [INFO ] [Real]Absence check using 4 positive and 20 generalized place invariants in 10 ms returned sat
[2024-05-22 20:31:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 20:31:08] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-05-22 20:31:08] [INFO ] Computed and/alt/rep : 64/144/64 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-22 20:31:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 20:31:08] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-22 20:31:08] [INFO ] [Nat]Absence check using 4 positive and 20 generalized place invariants in 8 ms returned sat
[2024-05-22 20:31:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 20:31:08] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-05-22 20:31:08] [INFO ] Computed and/alt/rep : 64/144/64 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-22 20:31:08] [INFO ] Added : 30 causal constraints over 6 iterations in 61 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7220 reset in 197 ms.
Product exploration explored 100000 steps with 7246 reset in 202 ms.
Built C files in :
/tmp/ltsmin4036814377148430519
[2024-05-22 20:31:09] [INFO ] Computing symmetric may disable matrix : 80 transitions.
[2024-05-22 20:31:09] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 20:31:09] [INFO ] Computing symmetric may enable matrix : 80 transitions.
[2024-05-22 20:31:09] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 20:31:09] [INFO ] Computing Do-Not-Accords matrix : 80 transitions.
[2024-05-22 20:31:09] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 20:31:09] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4036814377148430519
Running compilation step : cd /tmp/ltsmin4036814377148430519;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 181 ms.
Running link step : cd /tmp/ltsmin4036814377148430519;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin4036814377148430519;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4074139488462673396.hoa' '--buchi-type=spotba'
LTSmin run took 3450 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-07 finished in 6456 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G(p0))&&(p1||X((F(G(p2)) U p3))))))'
Support contains 6 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 9 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2024-05-22 20:31:13] [INFO ] Computed 28 invariants in 4 ms
[2024-05-22 20:31:13] [INFO ] Implicit Places using invariants in 102 ms returned [7, 14, 16, 24, 34, 41, 42, 50, 55, 66, 84, 99, 103, 115, 129, 138]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 103 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 114 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 299 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND p0 (NOT p2) (NOT p1) (NOT p3))]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={1} source=1 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0, 1} source=2 dest: 2}, { cond=(NOT p3), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p3)), acceptance={0, 1} source=2 dest: 4}], [{ cond=(AND p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=3 dest: 5}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={0, 1} source=4 dest: 2}, { cond=(NOT p3), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p3)), acceptance={1} source=4 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND p0 (NOT p3) p2), acceptance={0} source=5 dest: 3}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={0, 1} source=5 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p3) p2), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p3) (NOT p2)), acceptance={0, 1} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s51 1), p0:(AND (EQ s120 1) (EQ s122 1)), p3:(AND (EQ s98 1) (EQ s116 1)), p2:(AND (EQ s104 1) (EQ s122 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 9594 reset in 217 ms.
Product exploration explored 100000 steps with 9608 reset in 173 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) (NOT p3) (NOT p2))]
False Knowledge obtained : [(X (AND p1 (NOT p3))), (X (NOT (AND p1 (NOT p3)))), (X (AND (NOT p1) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT p3)), (X p3), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (AND p1 (NOT p0) (NOT p3)))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (NOT p3))), (X (X p3)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 1 factoid took 1257 ms. Reduced automaton from 6 states, 22 edges and 4 AP (stutter sensitive) to 5 states, 24 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND p0 (NOT p2) (NOT p1) (NOT p3))]
Finished random walk after 2249 steps, including 0 resets, run visited all 19 properties in 71 ms. (steps per millisecond=31 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p3) (NOT p2))]
False Knowledge obtained : [(X (AND p1 (NOT p3))), (X (NOT (AND p1 (NOT p3)))), (X (AND (NOT p1) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT p3)), (X p3), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (AND p1 (NOT p0) (NOT p3)))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (NOT p3))), (X (X p3)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) p2)), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 p2 (NOT p3))), (F p3), (F (NOT (AND (NOT p0) p1 (NOT p3)))), (F (AND (NOT p1) (NOT p3))), (F (AND p0 (NOT p3))), (F (AND p0 p2)), (F (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND p2 (NOT p3)))), (F (NOT (AND p1 (NOT p3)))), (F p0), (F (AND p0 (NOT p1) (NOT p2) (NOT p3))), (F (AND p0 (NOT p1) p2 (NOT p3))), (F (AND (NOT p0) (NOT p1) (NOT p3))), (F (AND p0 (NOT p2) (NOT p3))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1) p2))]
Knowledge based reduction with 1 factoid took 1740 ms. Reduced automaton from 5 states, 24 edges and 4 AP (stutter insensitive) to 5 states, 24 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 241 ms :[(NOT p0), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND p0 (NOT p2) (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 229 ms :[(NOT p0), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND p0 (NOT p2) (NOT p1) (NOT p3))]
// Phase 1: matrix 128 rows 124 cols
[2024-05-22 20:31:17] [INFO ] Computed 12 invariants in 6 ms
[2024-05-22 20:31:17] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-22 20:31:17] [INFO ] [Real]Absence check using 8 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-22 20:31:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 20:31:17] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2024-05-22 20:31:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 20:31:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-22 20:31:18] [INFO ] [Nat]Absence check using 8 positive and 4 generalized place invariants in 5 ms returned sat
[2024-05-22 20:31:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 20:31:18] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2024-05-22 20:31:18] [INFO ] Computed and/alt/rep : 112/176/112 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-22 20:31:18] [INFO ] Added : 27 causal constraints over 6 iterations in 78 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 6 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 128/128 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 124 transition count 104
Reduce places removed 28 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 60 rules applied. Total rules applied 84 place count 96 transition count 72
Reduce places removed 32 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 2 with 40 rules applied. Total rules applied 124 place count 64 transition count 64
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 132 place count 56 transition count 64
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 132 place count 56 transition count 48
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 164 place count 40 transition count 48
Applied a total of 164 rules in 9 ms. Remains 40 /124 variables (removed 84) and now considering 48/128 (removed 80) transitions.
// Phase 1: matrix 48 rows 40 cols
[2024-05-22 20:31:18] [INFO ] Computed 8 invariants in 0 ms
[2024-05-22 20:31:18] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-22 20:31:18] [INFO ] Invariant cache hit.
[2024-05-22 20:31:18] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2024-05-22 20:31:18] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 20:31:18] [INFO ] Invariant cache hit.
[2024-05-22 20:31:18] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/124 places, 48/128 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 160 ms. Remains : 40/124 places, 48/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 p3) (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))]
False Knowledge obtained : [(X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p1 (NOT p3))), (X (NOT (AND p1 (NOT p3)))), (X (AND (NOT p1) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) (NOT p1) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (AND p0 (NOT p1) (NOT p2) (NOT p3))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (NOT p3)), (X p3), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (NOT p0)), (X (AND p0 (NOT p2) (NOT p3))), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND p0 p2 (NOT p3)))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND p2 (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND p2 (NOT p3)))))), (X (X (NOT p3))), (X (X p3)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) p1 (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (AND p0 (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3)))))]
Knowledge based reduction with 5 factoid took 1807 ms. Reduced automaton from 5 states, 24 edges and 4 AP (stutter insensitive) to 5 states, 24 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 215 ms :[(NOT p0), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND p0 (NOT p2) (NOT p1) (NOT p3))]
Finished random walk after 74 steps, including 0 resets, run visited all 19 properties in 4 ms. (steps per millisecond=18 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p3) (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))]
False Knowledge obtained : [(X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p1 (NOT p3))), (X (NOT (AND p1 (NOT p3)))), (X (AND (NOT p1) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) (NOT p1) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (AND p0 (NOT p1) (NOT p2) (NOT p3))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (NOT p3)), (X p3), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X (NOT p0)), (X (AND p0 (NOT p2) (NOT p3))), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND p0 p2 (NOT p3)))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND p2 (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND p2 (NOT p3)))))), (X (X (NOT p3))), (X (X p3)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) p1 (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (AND p0 (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) p2)), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 p2 (NOT p3))), (F p3), (F (NOT (AND (NOT p0) p1 (NOT p3)))), (F (AND (NOT p1) (NOT p3))), (F (AND p0 (NOT p3))), (F (AND p0 p2)), (F (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND p2 (NOT p3)))), (F (NOT (AND p1 (NOT p3)))), (F p0), (F (AND p0 (NOT p2) (NOT p1) (NOT p3))), (F (AND p0 p2 (NOT p1) (NOT p3))), (F (AND (NOT p0) (NOT p1) (NOT p3))), (F (AND p0 (NOT p2) (NOT p3))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (AND (NOT p0) p2 (NOT p1)))]
Knowledge based reduction with 5 factoid took 2591 ms. Reduced automaton from 5 states, 24 edges and 4 AP (stutter insensitive) to 5 states, 24 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND p0 (NOT p2) (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 237 ms :[(NOT p0), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND p0 (NOT p2) (NOT p1) (NOT p3))]
[2024-05-22 20:31:23] [INFO ] Invariant cache hit.
[2024-05-22 20:31:23] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 20:31:23] [INFO ] [Real]Absence check using 3 positive and 5 generalized place invariants in 3 ms returned sat
[2024-05-22 20:31:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 20:31:23] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-05-22 20:31:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 20:31:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 20:31:23] [INFO ] [Nat]Absence check using 3 positive and 5 generalized place invariants in 2 ms returned sat
[2024-05-22 20:31:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 20:31:23] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-22 20:31:23] [INFO ] Computed and/alt/rep : 32/160/32 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-22 20:31:23] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 266 ms :[(NOT p0), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND p0 (NOT p2) (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 12379 reset in 245 ms.
Stack based approach found an accepted trace after 253 steps with 27 reset with depth 23 and stack size 23 in 1 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-08 finished in 11036 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 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 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 140 transition count 97
Reduce places removed 35 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 67 rules applied. Total rules applied 98 place count 105 transition count 65
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 130 place count 73 transition count 65
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 130 place count 73 transition count 49
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 162 place count 57 transition count 49
Applied a total of 162 rules in 12 ms. Remains 57 /140 variables (removed 83) and now considering 49/128 (removed 79) transitions.
// Phase 1: matrix 49 rows 57 cols
[2024-05-22 20:31:24] [INFO ] Computed 24 invariants in 1 ms
[2024-05-22 20:31:24] [INFO ] Implicit Places using invariants in 79 ms returned [0, 2, 5, 6, 7, 10, 11, 12, 13, 15, 16, 17, 19, 20, 21, 26, 29, 32, 33, 34, 35, 36, 37, 38, 39, 44, 47, 48, 49, 50, 51, 55]
[2024-05-22 20:31:24] [INFO ] Actually due to overlaps returned [0, 7, 11, 13, 15, 21, 29, 32, 34, 35, 36, 39, 47, 48, 49, 51]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 80 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/140 places, 49/128 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 41 transition count 38
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 23 place count 30 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 29 transition count 37
Applied a total of 24 rules in 3 ms. Remains 29 /41 variables (removed 12) and now considering 37/49 (removed 12) transitions.
// Phase 1: matrix 37 rows 29 cols
[2024-05-22 20:31:24] [INFO ] Computed 8 invariants in 1 ms
[2024-05-22 20:31:24] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-22 20:31:24] [INFO ] Invariant cache hit.
[2024-05-22 20:31:24] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 29/140 places, 37/128 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 167 ms. Remains : 29/140 places, 37/128 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-09 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 (EQ s8 1) (EQ s1 1))], 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 7611 reset in 150 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-09 finished in 407 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X((F(p1)&&p0)) U (F(p1)&&G(p2)))&&X(F(p3))))'
Support contains 4 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
[2024-05-22 20:31:24] [INFO ] Computed 28 invariants in 0 ms
[2024-05-22 20:31:24] [INFO ] Implicit Places using invariants in 82 ms returned [7, 14, 16, 24, 34, 41, 42, 50, 55, 66, 84, 99, 103, 115, 129, 138]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 83 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 91 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p2) (NOT p1) (NOT p3)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p3), (NOT p1), (NOT p2), true, (AND (NOT p2) p0)]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}, { cond=p2, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=1 dest: 3}, { cond=(AND p2 p0), acceptance={} source=1 dest: 4}, { cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 1}, { cond=p2, acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) p0), acceptance={} source=6 dest: 5}, { cond=(AND p2 p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (EQ s33 1) (EQ s122 1)), p1:(EQ s43 1), p0:(AND (EQ s33 1) (EQ s122 1)), p3:(EQ s99 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-10 finished in 350 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 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 10 ms. Remains 56 /140 variables (removed 84) and now considering 48/128 (removed 80) transitions.
// Phase 1: matrix 48 rows 56 cols
[2024-05-22 20:31:24] [INFO ] Computed 24 invariants in 0 ms
[2024-05-22 20:31:24] [INFO ] Implicit Places using invariants in 70 ms returned [0, 2, 4, 5, 6, 9, 10, 11, 12, 14, 15, 16, 18, 19, 20, 25, 28, 31, 32, 33, 34, 35, 36, 37, 38, 43, 46, 47, 48, 49, 50, 54]
[2024-05-22 20:31:24] [INFO ] Actually due to overlaps returned [0, 6, 10, 12, 14, 20, 28, 31, 33, 34, 35, 38, 46, 47, 48, 50]
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 : 40/140 places, 48/128 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 40 transition count 36
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 28 transition count 36
Applied a total of 24 rules in 2 ms. Remains 28 /40 variables (removed 12) and now considering 36/48 (removed 12) transitions.
// Phase 1: matrix 36 rows 28 cols
[2024-05-22 20:31:24] [INFO ] Computed 8 invariants in 0 ms
[2024-05-22 20:31:25] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-22 20:31:25] [INFO ] Invariant cache hit.
[2024-05-22 20:31:25] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 28/140 places, 36/128 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 148 ms. Remains : 28/140 places, 36/128 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 111 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-11 finished in 315 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((!p0||F(p1))) U X(G(p0))))'
Support contains 3 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.
// Phase 1: matrix 128 rows 140 cols
[2024-05-22 20:31:25] [INFO ] Computed 28 invariants in 1 ms
[2024-05-22 20:31:25] [INFO ] Implicit Places using invariants in 93 ms returned [7, 14, 16, 24, 34, 41, 42, 50, 55, 66, 84, 99, 103, 115, 129, 138]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 94 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 101 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 173 ms :[false, (NOT p0), (AND (NOT p1) (NOT p0)), (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p0:(AND (EQ s104 1) (EQ s122 1)), p1:(NEQ s66 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 24341 reset in 160 ms.
Product exploration explored 100000 steps with 24373 reset in 165 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 (NOT (AND p0 (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 263 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[false, (NOT p0), (AND (NOT p1) (NOT p0)), (AND p0 (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 128 rows 124 cols
[2024-05-22 20:31:26] [INFO ] Computed 12 invariants in 1 ms
[2024-05-22 20:31:26] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-22 20:31:26] [INFO ] [Real]Absence check using 8 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-22 20:31:26] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 20:31:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-22 20:31:26] [INFO ] [Nat]Absence check using 8 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-22 20:31:26] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 20:31:26] [INFO ] Deduced a trap composed of 54 places in 45 ms of which 1 ms to minimize.
[2024-05-22 20:31:26] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-05-22 20:31:26] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-22 20:31:26] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-05-22 20:31:26] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-05-22 20:31:26] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-22 20:31:26] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-22 20:31:27] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-22 20:31:27] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-22 20:31:27] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-05-22 20:31:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 662 ms
[2024-05-22 20:31:27] [INFO ] After 723ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2024-05-22 20:31:27] [INFO ] After 760ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1))))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 409 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
[2024-05-22 20:31:27] [INFO ] Invariant cache hit.
[2024-05-22 20:31:27] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-22 20:31:27] [INFO ] [Real]Absence check using 8 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-22 20:31:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 20:31:27] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2024-05-22 20:31:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 20:31:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-22 20:31:27] [INFO ] [Nat]Absence check using 8 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-22 20:31:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 20:31:28] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-05-22 20:31:28] [INFO ] Computed and/alt/rep : 112/176/112 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-22 20:31:28] [INFO ] Added : 27 causal constraints over 6 iterations in 70 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 124 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 128/128 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 124 transition count 100
Reduce places removed 32 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 64 rules applied. Total rules applied 92 place count 92 transition count 68
Reduce places removed 32 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 36 rules applied. Total rules applied 128 place count 60 transition count 64
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 132 place count 56 transition count 64
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 132 place count 56 transition count 48
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 164 place count 40 transition count 48
Applied a total of 164 rules in 14 ms. Remains 40 /124 variables (removed 84) and now considering 48/128 (removed 80) transitions.
// Phase 1: matrix 48 rows 40 cols
[2024-05-22 20:31:28] [INFO ] Computed 8 invariants in 1 ms
[2024-05-22 20:31:28] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-22 20:31:28] [INFO ] Invariant cache hit.
[2024-05-22 20:31:28] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2024-05-22 20:31:28] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 20:31:28] [INFO ] Invariant cache hit.
[2024-05-22 20:31:28] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/124 places, 48/128 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 164 ms. Remains : 40/124 places, 48/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 : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 163 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 80 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=40 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 1 factoid took 189 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
[2024-05-22 20:31:28] [INFO ] Invariant cache hit.
[2024-05-22 20:31:28] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-22 20:31:28] [INFO ] [Real]Absence check using 3 positive and 5 generalized place invariants in 4 ms returned sat
[2024-05-22 20:31:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 20:31:28] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-22 20:31:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 20:31:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 20:31:28] [INFO ] [Nat]Absence check using 3 positive and 5 generalized place invariants in 2 ms returned sat
[2024-05-22 20:31:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 20:31:28] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-22 20:31:28] [INFO ] Computed and/alt/rep : 32/160/32 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-22 20:31:28] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 157 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 1 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-12 finished in 3958 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 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 3 ms. Remains 140 /140 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 140 cols
[2024-05-22 20:31:29] [INFO ] Computed 28 invariants in 1 ms
[2024-05-22 20:31:29] [INFO ] Implicit Places using invariants in 89 ms returned [7, 14, 16, 24, 34, 41, 42, 50, 55, 66, 84, 99, 103, 115, 129, 138]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 90 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 95 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s49 1)], 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 2 steps with 0 reset in 1 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-14 finished in 219 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p0&&F(p1)))||(!p2 U (p3||G(!p2))))))'
Support contains 4 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.
[2024-05-22 20:31:29] [INFO ] Invariant cache hit.
[2024-05-22 20:31:29] [INFO ] Implicit Places using invariants in 89 ms returned [7, 14, 16, 24, 34, 41, 42, 50, 55, 66, 84, 99, 103, 115, 129, 138]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 90 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 93 ms. Remains : 124/140 places, 128/128 transitions.
Stuttering acceptance computed with spot in 299 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) p2 (NOT p3))), (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) p2 (NOT p3))), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p3) p2), (AND (NOT p1) (NOT p3) p2)]
Running random walk in product with property : DatabaseWithMutex-PT-04-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p3) p2 p0 (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p3) (NOT p2) p0 (NOT p1)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p3) p2), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=7 dest: 7}]], initial=3, aps=[p1:(EQ s62 0), p0:(EQ s50 0), p3:(AND (NEQ s50 1) (NOT (AND (EQ s105 1) (EQ s123 1)))), p2:(AND (EQ s105 1) (EQ s123 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, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 48468 reset in 170 ms.
Product exploration explored 100000 steps with 48469 reset in 200 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 p3 (NOT p2)), (X (NOT (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p3) p2)), (X (NOT (AND (NOT p3) p2))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p3) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))))]
Knowledge based reduction with 6 factoid took 225 ms. Reduced automaton from 8 states, 15 edges and 4 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p3) (NOT p0)), (NOT p0), true, (AND (NOT p3) (NOT p0))]
Finished random walk after 37 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=18 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0 p3 (NOT p2)), (X (NOT (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p3) p2)), (X (NOT (AND (NOT p3) p2))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p3) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (F (NOT p3)), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 234 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p3) (NOT p0)), (NOT p0), true, (AND (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p3) (NOT p0)), (NOT p0), true, (AND (NOT p3) (NOT p0))]
Support contains 3 out of 124 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 124/124 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.
// Phase 1: matrix 128 rows 124 cols
[2024-05-22 20:31:31] [INFO ] Computed 12 invariants in 2 ms
[2024-05-22 20:31:31] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-22 20:31:31] [INFO ] Invariant cache hit.
[2024-05-22 20:31:31] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
[2024-05-22 20:31:31] [INFO ] Invariant cache hit.
[2024-05-22 20:31:31] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 355 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 p3 p0)]
False Knowledge obtained : [(X (NOT p3)), (X p3), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 180 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p3) (NOT p0)), (NOT p0), true, (AND (NOT p3) (NOT p0))]
Finished random walk after 119 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=59 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p3 p0)]
False Knowledge obtained : [(X (NOT p3)), (X p3), (X (X (NOT p0))), (X (X p0)), (F (NOT p3)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 187 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p3) (NOT p0)), (NOT p0), true, (AND (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p3) (NOT p0)), (NOT p0), true, (AND (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p3) (NOT p0)), (NOT p0), true, (AND (NOT p3) (NOT p0))]
Product exploration explored 100000 steps with 48456 reset in 145 ms.
Product exploration explored 100000 steps with 48482 reset in 160 ms.
Applying partial POR strategy [false, true, true, false]
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p3) (NOT p0)), (NOT p0), true, (AND (NOT p3) (NOT p0))]
Support contains 3 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 128/128 transitions.
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 124 transition count 128
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 20 Pre rules applied. Total rules applied 31 place count 124 transition count 136
Deduced a syphon composed of 51 places in 1 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 51 place count 124 transition count 136
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 63 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 63 place count 124 transition count 136
Deduced a syphon composed of 63 places in 0 ms
Applied a total of 63 rules in 15 ms. Remains 124 /124 variables (removed 0) and now considering 136/128 (removed -8) transitions.
[2024-05-22 20:31:32] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 136 rows 124 cols
[2024-05-22 20:31:32] [INFO ] Computed 12 invariants in 1 ms
[2024-05-22 20:31:33] [INFO ] Dead Transitions using invariants and state equation in 94 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 124 ms. Remains : 124/124 places, 136/128 transitions.
Built C files in :
/tmp/ltsmin9157277387628307281
[2024-05-22 20:31:33] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9157277387628307281
Running compilation step : cd /tmp/ltsmin9157277387628307281;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 208 ms.
Running link step : cd /tmp/ltsmin9157277387628307281;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin9157277387628307281;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9414136711439989770.hoa' '--buchi-type=spotba'
LTSmin run took 141 ms.
FORMULA DatabaseWithMutex-PT-04-LTLFireability-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DatabaseWithMutex-PT-04-LTLFireability-15 finished in 4025 ms.
All properties solved by simple procedures.
Total runtime 123703 ms.

BK_STOP 1716409894347

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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-PT-04"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is DatabaseWithMutex-PT-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 r153-tall-171631150900033"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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