About the Execution of 2023-gold for Philosophers-COL-000100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4586.491 | 959648.00 | 2613135.00 | 2390.20 | FFFFTFFFFFFFFFFT | normal |
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.r285-smll-171654422300258.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 Philosophers-COL-000100, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r285-smll-171654422300258
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 6.4K Apr 13 10:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Apr 13 10:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 13 09:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 13 09:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Apr 13 10:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Apr 13 10:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 13 10:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 13 10:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 14K May 18 16:43 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 Philosophers-COL-000100-LTLFireability-00
FORMULA_NAME Philosophers-COL-000100-LTLFireability-01
FORMULA_NAME Philosophers-COL-000100-LTLFireability-02
FORMULA_NAME Philosophers-COL-000100-LTLFireability-03
FORMULA_NAME Philosophers-COL-000100-LTLFireability-04
FORMULA_NAME Philosophers-COL-000100-LTLFireability-05
FORMULA_NAME Philosophers-COL-000100-LTLFireability-06
FORMULA_NAME Philosophers-COL-000100-LTLFireability-07
FORMULA_NAME Philosophers-COL-000100-LTLFireability-08
FORMULA_NAME Philosophers-COL-000100-LTLFireability-09
FORMULA_NAME Philosophers-COL-000100-LTLFireability-10
FORMULA_NAME Philosophers-COL-000100-LTLFireability-11
FORMULA_NAME Philosophers-COL-000100-LTLFireability-12
FORMULA_NAME Philosophers-COL-000100-LTLFireability-13
FORMULA_NAME Philosophers-COL-000100-LTLFireability-14
FORMULA_NAME Philosophers-COL-000100-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716942563769
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=Philosophers-COL-000100
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202304061127
[2024-05-29 00:29:26] [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-29 00:29:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 00:29:26] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-29 00:29:26] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-29 00:29:27] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 876 ms
[2024-05-29 00:29:27] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 500 PT places and 500.0 transition bindings in 29 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2024-05-29 00:29:27] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 7 ms.
[2024-05-29 00:29:27] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Philosophers-COL-000100-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 7 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10097 steps, including 98 resets, run finished after 39 ms. (steps per millisecond=258 ) properties (out of 3) seen :2
Finished Best-First random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 1 ms.
[2024-05-29 00:29:27] [INFO ] Flatten gal took : 23 ms
[2024-05-29 00:29:27] [INFO ] Flatten gal took : 4 ms
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 100) 100) 100)]] contains successor/predecessor on variables of sort Philo
[2024-05-29 00:29:28] [INFO ] Unfolded HLPN to a Petri net with 500 places and 500 transitions 1600 arcs in 47 ms.
[2024-05-29 00:29:28] [INFO ] Unfolded 15 HLPN properties in 3 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Philosophers-COL-000100-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 500 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 39 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2024-05-29 00:29:28] [INFO ] Computed 200 invariants in 36 ms
[2024-05-29 00:29:29] [INFO ] Implicit Places using invariants in 663 ms returned []
[2024-05-29 00:29:29] [INFO ] Invariant cache hit.
[2024-05-29 00:29:29] [INFO ] Implicit Places using invariants and state equation in 758 ms returned []
Implicit Place search using SMT with State Equation took 1428 ms to find 0 implicit places.
[2024-05-29 00:29:29] [INFO ] Invariant cache hit.
[2024-05-29 00:29:30] [INFO ] Dead Transitions using invariants and state equation in 609 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2077 ms. Remains : 500/500 places, 500/500 transitions.
Support contains 500 out of 500 places after structural reductions.
[2024-05-29 00:29:30] [INFO ] Flatten gal took : 91 ms
[2024-05-29 00:29:30] [INFO ] Flatten gal took : 99 ms
[2024-05-29 00:29:31] [INFO ] Input system was already deterministic with 500 transitions.
Finished random walk after 474 steps, including 0 resets, run visited all 12 properties in 124 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
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' '!((X(!p0) U ((X(!p0)&&(!p1 U (G(!p1)||(F(G(!p1))&&p2))))||X(G(!p0)))))'
Support contains 300 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 21 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-05-29 00:29:32] [INFO ] Invariant cache hit.
[2024-05-29 00:29:32] [INFO ] Implicit Places using invariants in 313 ms returned []
[2024-05-29 00:29:32] [INFO ] Invariant cache hit.
[2024-05-29 00:29:33] [INFO ] Implicit Places using invariants and state equation in 584 ms returned []
Implicit Place search using SMT with State Equation took 901 ms to find 0 implicit places.
[2024-05-29 00:29:33] [INFO ] Invariant cache hit.
[2024-05-29 00:29:33] [INFO ] Dead Transitions using invariants and state equation in 562 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1487 ms. Remains : 500/500 places, 500/500 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 672 ms :[p0, (AND p0 p1), p0, (AND p0 p1), (AND p0 p1), true, (AND p0 p1), (AND p0 p1), (AND p0 p1), p1, (AND (NOT p0) p1), (AND p1 (NOT p0))]
Running random walk in product with property : Philosophers-COL-000100-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={0, 1} source=1 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p2 p1), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 6}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 7}, { cond=(AND p2 p1), acceptance={} source=1 dest: 8}], [{ cond=true, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p2 p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={1} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 4}, { cond=(AND p1 p0), acceptance={0, 1} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 7}, { cond=p1, acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={1} source=4 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 p0), acceptance={0, 1} source=4 dest: 4}, { cond=true, acceptance={} source=4 dest: 8}], [{ cond=true, acceptance={0, 1} source=5 dest: 5}], [{ cond=(AND (NOT p2) p1 p0), acceptance={} source=6 dest: 5}, { cond=(AND p2 p1 p0), acceptance={} source=6 dest: 9}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=6 dest: 10}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=6 dest: 11}], [{ cond=(AND p1 p0), acceptance={} source=7 dest: 9}, { cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 11}], [{ cond=p0, acceptance={} source=8 dest: 9}], [{ cond=(NOT p1), acceptance={1} source=9 dest: 9}, { cond=p1, acceptance={0, 1} source=9 dest: 9}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=10 dest: 5}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=10 dest: 9}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=10 dest: 10}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=10 dest: 11}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=11 dest: 9}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=11 dest: 11}]], initial=2, aps=[p0:(OR (GEQ s452 1) (GEQ s448 1) (GEQ s460 1) (GEQ s456 1) (GEQ s407 1) (GEQ s468 1) (GEQ s403 1) (GEQ s464 1) (GEQ s415 1) (GEQ s476 1) (GEQ s411 1) (GEQ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 839 reset in 1423 ms.
Stack based approach found an accepted trace after 288 steps with 2 reset with depth 285 and stack size 285 in 7 ms.
FORMULA Philosophers-COL-000100-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000100-LTLFireability-01 finished in 3705 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U X(p1))||(X((!p0 U (G(!p0)||X(!p3))))&&p2))))'
Support contains 300 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 29 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-05-29 00:29:35] [INFO ] Invariant cache hit.
[2024-05-29 00:29:36] [INFO ] Implicit Places using invariants in 319 ms returned []
[2024-05-29 00:29:36] [INFO ] Invariant cache hit.
[2024-05-29 00:29:36] [INFO ] Implicit Places using invariants and state equation in 652 ms returned []
Implicit Place search using SMT with State Equation took 991 ms to find 0 implicit places.
[2024-05-29 00:29:36] [INFO ] Invariant cache hit.
[2024-05-29 00:29:37] [INFO ] Dead Transitions using invariants and state equation in 881 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1907 ms. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 634 ms :[true, p3, (AND (NOT p1) p3), (OR (AND p0 (NOT p1) p3) (AND (NOT p1) (NOT p2))), (OR (AND p0 (NOT p1) p3) (AND (NOT p1) (NOT p2))), (AND p3 p0 (NOT p1)), (AND p3 p0 (NOT p1)), (AND p3 p0), (AND p3 p0 (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : Philosophers-COL-000100-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p3, acceptance={} source=1 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=2 dest: 9}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=2 dest: 10}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 5}, { cond=(AND p0 p2), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 9}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 10}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 7}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 8}], [{ cond=(AND p0 p3), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p0) p3), acceptance={} source=7 dest: 7}], [{ cond=(AND p0 (NOT p1) p3), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=8 dest: 7}], [{ cond=(NOT p1), acceptance={} source=9 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=10 dest: 9}, { cond=(AND p0 (NOT p1)), acceptance={0} source=10 dest: 10}]], initial=3, aps=[p3:(OR (AND (GEQ s17 1) (GEQ s117 1)) (AND (GEQ s91 1) (GEQ s191 1)) (AND (GEQ s86 1) (GEQ s186 1)) (AND (GEQ s96 1) (GEQ s196 1)) (AND (GEQ s27 1) (GEQ 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, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 28336 reset in 2928 ms.
Product exploration explored 100000 steps with 28346 reset in 2816 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 p3 p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2))), (X (AND p0 (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 6 factoid took 201 ms. Reduced automaton from 11 states, 20 edges and 4 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Finished random walk after 946 steps, including 0 resets, run visited all 3 properties in 17 ms. (steps per millisecond=55 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p3 p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2))), (X (AND p0 (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 345 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 236 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
[2024-05-29 00:29:45] [INFO ] Invariant cache hit.
[2024-05-29 00:29:48] [INFO ] [Real]Absence check using 200 positive place invariants in 199 ms returned sat
[2024-05-29 00:29:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 00:29:50] [INFO ] [Real]Absence check using state equation in 1872 ms returned sat
[2024-05-29 00:29:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 00:29:52] [INFO ] [Nat]Absence check using 200 positive place invariants in 240 ms returned sat
[2024-05-29 00:29:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 00:29:53] [INFO ] [Nat]Absence check using state equation in 1074 ms returned sat
[2024-05-29 00:29:54] [INFO ] Computed and/alt/rep : 300/400/300 causal constraints (skipped 0 transitions) in 56 ms.
[2024-05-29 00:29:54] [INFO ] Added : 13 causal constraints over 3 iterations in 301 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 300 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 15 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-05-29 00:29:54] [INFO ] Invariant cache hit.
[2024-05-29 00:29:54] [INFO ] Implicit Places using invariants in 247 ms returned []
[2024-05-29 00:29:54] [INFO ] Invariant cache hit.
[2024-05-29 00:29:55] [INFO ] Implicit Places using invariants and state equation in 553 ms returned []
Implicit Place search using SMT with State Equation took 805 ms to find 0 implicit places.
[2024-05-29 00:29:55] [INFO ] Invariant cache hit.
[2024-05-29 00:29:55] [INFO ] Dead Transitions using invariants and state equation in 829 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1652 ms. Remains : 500/500 places, 500/500 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 (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 2 factoid took 184 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Finished random walk after 457 steps, including 0 resets, run visited all 3 properties in 15 ms. (steps per millisecond=30 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 301 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 245 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
[2024-05-29 00:29:57] [INFO ] Invariant cache hit.
[2024-05-29 00:30:00] [INFO ] [Real]Absence check using 200 positive place invariants in 287 ms returned sat
[2024-05-29 00:30:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 00:30:02] [INFO ] [Real]Absence check using state equation in 1654 ms returned sat
[2024-05-29 00:30:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 00:30:04] [INFO ] [Nat]Absence check using 200 positive place invariants in 172 ms returned sat
[2024-05-29 00:30:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 00:30:05] [INFO ] [Nat]Absence check using state equation in 732 ms returned sat
[2024-05-29 00:30:05] [INFO ] Computed and/alt/rep : 300/400/300 causal constraints (skipped 0 transitions) in 50 ms.
[2024-05-29 00:30:05] [INFO ] Added : 13 causal constraints over 3 iterations in 251 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 214 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Product exploration explored 100000 steps with 28419 reset in 2637 ms.
Product exploration explored 100000 steps with 28318 reset in 2792 ms.
Applying partial POR strategy [false, false, true, true, false]
Stuttering acceptance computed with spot in 215 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Support contains 300 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 36 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-05-29 00:30:12] [INFO ] Redundant transitions in 57 ms returned []
[2024-05-29 00:30:12] [INFO ] Invariant cache hit.
[2024-05-29 00:30:12] [INFO ] Dead Transitions using invariants and state equation in 843 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 972 ms. Remains : 500/500 places, 500/500 transitions.
Built C files in :
/tmp/ltsmin3347116256884689142
[2024-05-29 00:30:13] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3347116256884689142
Running compilation step : cd /tmp/ltsmin3347116256884689142;'/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 1483 ms.
Running link step : cd /tmp/ltsmin3347116256884689142;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin3347116256884689142;'/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/stateBased12057582601761276862.hoa' '--buchi-type=spotba'
LTSmin run took 1124 ms.
FORMULA Philosophers-COL-000100-LTLFireability-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Philosophers-COL-000100-LTLFireability-02 finished in 39891 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' '!((p0 U X(X((X((G(!p3)||X(p3)||p2))||p1)))))'
Support contains 300 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 6 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-05-29 00:30:15] [INFO ] Invariant cache hit.
[2024-05-29 00:30:16] [INFO ] Implicit Places using invariants in 338 ms returned []
[2024-05-29 00:30:16] [INFO ] Invariant cache hit.
[2024-05-29 00:30:16] [INFO ] Implicit Places using invariants and state equation in 723 ms returned []
Implicit Place search using SMT with State Equation took 1066 ms to find 0 implicit places.
[2024-05-29 00:30:16] [INFO ] Invariant cache hit.
[2024-05-29 00:30:17] [INFO ] Dead Transitions using invariants and state equation in 800 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1873 ms. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 887 ms :[true, (NOT p3), false, false, false, p3, false, false, false, false, false, false, false, false, false, false, false, false]
Running random walk in product with property : Philosophers-COL-000100-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p3), acceptance={} source=1 dest: 0}], [{ cond=(NOT p3), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p2) p3), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=4 dest: 2}], [{ cond=p3, acceptance={} source=5 dest: 0}, { cond=(NOT p3), acceptance={} source=5 dest: 5}], [{ cond=p0, acceptance={} source=6 dest: 10}, { cond=(NOT p0), acceptance={} source=6 dest: 11}], [{ cond=(NOT p1), acceptance={} source=7 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=8 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=9 dest: 3}], [{ cond=(NOT p0), acceptance={} source=10 dest: 12}, { cond=p0, acceptance={} source=10 dest: 13}], [{ cond=true, acceptance={} source=11 dest: 7}], [{ cond=(NOT p1), acceptance={} source=12 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=13 dest: 14}, { cond=(AND p0 (NOT p1)), acceptance={} source=13 dest: 15}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=14 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=15 dest: 16}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=15 dest: 17}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=16 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=17 dest: 16}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=17 dest: 17}]], initial=6, aps=[p3:(OR (GEQ s452 1) (GEQ s448 1) (GEQ s460 1) (GEQ s456 1) (GEQ s407 1) (GEQ s468 1) (GEQ s403 1) (GEQ s464 1) (GEQ s415 1) (GEQ s476 1) (GEQ s411 1) (GEQ...], 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, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 21 steps with 3 reset in 1 ms.
FORMULA Philosophers-COL-000100-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000100-LTLFireability-03 finished in 2815 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(!p1)||p0)))'
Support contains 200 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 97 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-05-29 00:30:18] [INFO ] Invariant cache hit.
[2024-05-29 00:30:19] [INFO ] Implicit Places using invariants in 366 ms returned []
[2024-05-29 00:30:19] [INFO ] Invariant cache hit.
[2024-05-29 00:30:19] [INFO ] Implicit Places using invariants and state equation in 821 ms returned []
Implicit Place search using SMT with State Equation took 1189 ms to find 0 implicit places.
[2024-05-29 00:30:19] [INFO ] Invariant cache hit.
[2024-05-29 00:30:20] [INFO ] Dead Transitions using invariants and state equation in 808 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2096 ms. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 143 ms :[true, (AND p1 (NOT p0)), p1, (AND p1 (NOT p0))]
Running random walk in product with property : Philosophers-COL-000100-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (AND (GEQ s1 1) (GEQ s100 1)) (AND (GEQ s75 1) (GEQ s174 1)) (AND (GEQ s6 1) (GEQ s105 1)) (AND (GEQ s11 1) (GEQ s110 1)) (AND (GEQ s85 1) (GEQ s18...], 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][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1981 ms.
Product exploration explored 100000 steps with 50000 reset in 1758 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), true, (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 17 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Philosophers-COL-000100-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-COL-000100-LTLFireability-04 finished in 6190 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' '!((((!p0 U G((p0&&F(p1)))) U p1)&&F(G(p0))))'
Support contains 300 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 17 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-05-29 00:30:24] [INFO ] Invariant cache hit.
[2024-05-29 00:30:25] [INFO ] Implicit Places using invariants in 435 ms returned []
[2024-05-29 00:30:25] [INFO ] Invariant cache hit.
[2024-05-29 00:30:25] [INFO ] Implicit Places using invariants and state equation in 550 ms returned []
Implicit Place search using SMT with State Equation took 989 ms to find 0 implicit places.
[2024-05-29 00:30:25] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-29 00:30:25] [INFO ] Invariant cache hit.
[2024-05-29 00:30:26] [INFO ] Dead Transitions using invariants and state equation in 527 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1556 ms. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0), true]
Running random walk in product with property : Philosophers-COL-000100-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(NOT p1), acceptance={} source=0 dest: 4}, { cond=p1, acceptance={} source=0 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 5}, { cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(OR (GEQ s452 1) (GEQ s448 1) (GEQ s460 1) (GEQ s456 1) (GEQ s407 1) (GEQ s468 1) (GEQ s403 1) (GEQ s464 1) (GEQ s415 1) (GEQ s476 1) (GEQ s411 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1835 steps with 70 reset in 48 ms.
FORMULA Philosophers-COL-000100-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000100-LTLFireability-05 finished in 1887 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)||(F(p1)&&X(!p0)))))'
Support contains 300 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 4 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-05-29 00:30:26] [INFO ] Invariant cache hit.
[2024-05-29 00:30:26] [INFO ] Implicit Places using invariants in 271 ms returned []
[2024-05-29 00:30:26] [INFO ] Invariant cache hit.
[2024-05-29 00:30:27] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 701 ms to find 0 implicit places.
[2024-05-29 00:30:27] [INFO ] Invariant cache hit.
[2024-05-29 00:30:27] [INFO ] Dead Transitions using invariants and state equation in 429 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1145 ms. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 207 ms :[p0, p0, (NOT p1), (AND (NOT p1) p0), p0, true]
Running random walk in product with property : Philosophers-COL-000100-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (AND (GEQ s115 1) (GEQ s316 1)) (AND (GEQ s189 1) (GEQ s390 1)) (AND (GEQ s110 1) (GEQ s311 1)) (AND (GEQ s184 1) (GEQ s385 1)) (AND (GEQ s194 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10 steps with 2 reset in 1 ms.
FORMULA Philosophers-COL-000100-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000100-LTLFireability-06 finished in 1373 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)) U p0))'
Support contains 200 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 15 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-05-29 00:30:28] [INFO ] Invariant cache hit.
[2024-05-29 00:30:28] [INFO ] Implicit Places using invariants in 398 ms returned []
[2024-05-29 00:30:28] [INFO ] Invariant cache hit.
[2024-05-29 00:30:28] [INFO ] Implicit Places using invariants and state equation in 584 ms returned []
Implicit Place search using SMT with State Equation took 985 ms to find 0 implicit places.
[2024-05-29 00:30:29] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-29 00:30:29] [INFO ] Invariant cache hit.
[2024-05-29 00:30:29] [INFO ] Dead Transitions using invariants and state equation in 422 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1448 ms. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000100-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s115 1) (GEQ s316 1)) (AND (GEQ s189 1) (GEQ s390 1)) (AND (GEQ s110 1) (GEQ s311 1)) (AND (GEQ s184 1) (GEQ s385 1)) (AND (GEQ s194 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 363 reset in 1015 ms.
Product exploration explored 100000 steps with 378 reset in 1096 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), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 292 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 236 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 00:30:32] [INFO ] Invariant cache hit.
[2024-05-29 00:30:35] [INFO ] [Real]Absence check using 200 positive place invariants in 214 ms returned sat
[2024-05-29 00:30:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 00:30:38] [INFO ] [Real]Absence check using state equation in 2897 ms returned sat
[2024-05-29 00:30:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 00:30:40] [INFO ] [Nat]Absence check using 200 positive place invariants in 178 ms returned sat
[2024-05-29 00:30:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 00:30:40] [INFO ] [Nat]Absence check using state equation in 748 ms returned sat
[2024-05-29 00:30:40] [INFO ] Computed and/alt/rep : 300/400/300 causal constraints (skipped 0 transitions) in 81 ms.
[2024-05-29 00:30:41] [INFO ] Added : 10 causal constraints over 2 iterations in 281 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 200 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 22 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-05-29 00:30:41] [INFO ] Invariant cache hit.
[2024-05-29 00:30:41] [INFO ] Implicit Places using invariants in 331 ms returned []
[2024-05-29 00:30:41] [INFO ] Invariant cache hit.
[2024-05-29 00:30:42] [INFO ] Implicit Places using invariants and state equation in 583 ms returned []
Implicit Place search using SMT with State Equation took 935 ms to find 0 implicit places.
[2024-05-29 00:30:42] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-29 00:30:42] [INFO ] Invariant cache hit.
[2024-05-29 00:30:42] [INFO ] Dead Transitions using invariants and state equation in 456 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1443 ms. Remains : 500/500 places, 500/500 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), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 271 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 395 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 00:30:44] [INFO ] Invariant cache hit.
[2024-05-29 00:30:46] [INFO ] [Real]Absence check using 200 positive place invariants in 224 ms returned sat
[2024-05-29 00:30:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 00:30:49] [INFO ] [Real]Absence check using state equation in 3140 ms returned sat
[2024-05-29 00:30:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 00:30:51] [INFO ] [Nat]Absence check using 200 positive place invariants in 160 ms returned sat
[2024-05-29 00:30:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 00:30:52] [INFO ] [Nat]Absence check using state equation in 944 ms returned sat
[2024-05-29 00:30:52] [INFO ] Computed and/alt/rep : 300/400/300 causal constraints (skipped 0 transitions) in 33 ms.
[2024-05-29 00:30:52] [INFO ] Added : 10 causal constraints over 2 iterations in 166 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 363 reset in 1303 ms.
Product exploration explored 100000 steps with 357 reset in 1193 ms.
Built C files in :
/tmp/ltsmin5484315750001100866
[2024-05-29 00:30:55] [INFO ] Computing symmetric may disable matrix : 500 transitions.
[2024-05-29 00:30:55] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:30:55] [INFO ] Computing symmetric may enable matrix : 500 transitions.
[2024-05-29 00:30:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:30:55] [INFO ] Computing Do-Not-Accords matrix : 500 transitions.
[2024-05-29 00:30:55] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:30:55] [INFO ] Built C files in 156ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5484315750001100866
Running compilation step : cd /tmp/ltsmin5484315750001100866;'/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 1904 ms.
Running link step : cd /tmp/ltsmin5484315750001100866;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin5484315750001100866;'/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/stateBased17399833144362279118.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 200 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 20 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-05-29 00:31:10] [INFO ] Invariant cache hit.
[2024-05-29 00:31:10] [INFO ] Implicit Places using invariants in 357 ms returned []
[2024-05-29 00:31:10] [INFO ] Invariant cache hit.
[2024-05-29 00:31:11] [INFO ] Implicit Places using invariants and state equation in 786 ms returned []
Implicit Place search using SMT with State Equation took 1146 ms to find 0 implicit places.
[2024-05-29 00:31:11] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-29 00:31:11] [INFO ] Invariant cache hit.
[2024-05-29 00:31:12] [INFO ] Dead Transitions using invariants and state equation in 659 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1837 ms. Remains : 500/500 places, 500/500 transitions.
Built C files in :
/tmp/ltsmin12015453484741697446
[2024-05-29 00:31:12] [INFO ] Computing symmetric may disable matrix : 500 transitions.
[2024-05-29 00:31:12] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:31:12] [INFO ] Computing symmetric may enable matrix : 500 transitions.
[2024-05-29 00:31:12] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:31:12] [INFO ] Computing Do-Not-Accords matrix : 500 transitions.
[2024-05-29 00:31:12] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:31:12] [INFO ] Built C files in 74ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12015453484741697446
Running compilation step : cd /tmp/ltsmin12015453484741697446;'/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 1973 ms.
Running link step : cd /tmp/ltsmin12015453484741697446;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin12015453484741697446;'/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/stateBased4931045189315116104.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 00:31:27] [INFO ] Flatten gal took : 70 ms
[2024-05-29 00:31:27] [INFO ] Flatten gal took : 67 ms
[2024-05-29 00:31:27] [INFO ] Time to serialize gal into /tmp/LTL8730964479807108952.gal : 11 ms
[2024-05-29 00:31:27] [INFO ] Time to serialize properties into /tmp/LTL9356565019819014898.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8730964479807108952.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10422274239656007020.hoa' '-atoms' '/tmp/LTL9356565019819014898.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/LTL9356565019819014898.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10422274239656007020.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
[2024-05-29 00:31:42] [INFO ] Flatten gal took : 80 ms
[2024-05-29 00:31:43] [INFO ] Flatten gal took : 67 ms
[2024-05-29 00:31:43] [INFO ] Time to serialize gal into /tmp/LTL13293066716365437252.gal : 8 ms
[2024-05-29 00:31:43] [INFO ] Time to serialize properties into /tmp/LTL12834401915702041510.ltl : 4 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/LTL13293066716365437252.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12834401915702041510.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 : !(((G(F("(((((((((Fork_15>=1)&&(Catch2_16>=1))||((Fork_89>=1)&&(Catch2_90>=1)))||(((Fork_10>=1)&&(Catch2_11>=1))||((Fork_84>=1)&&(Catc...6793
Formula 0 simplified : FG!"(((((((((Fork_15>=1)&&(Catch2_16>=1))||((Fork_89>=1)&&(Catch2_90>=1)))||(((Fork_10>=1)&&(Catch2_11>=1))||((Fork_84>=1)&&(Catch2_...6786
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
[2024-05-29 00:31:58] [INFO ] Flatten gal took : 31 ms
[2024-05-29 00:31:58] [INFO ] Applying decomposition
[2024-05-29 00:31:58] [INFO ] Flatten gal took : 65 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/graph5551500358014252937.txt' '-o' '/tmp/graph5551500358014252937.bin' '-w' '/tmp/graph5551500358014252937.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5551500358014252937.bin' '-l' '-1' '-v' '-w' '/tmp/graph5551500358014252937.weights' '-q' '0' '-e' '0.001'
[2024-05-29 00:31:58] [INFO ] Decomposing Gal with order
[2024-05-29 00:31:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 00:31:58] [INFO ] Removed a total of 99 redundant transitions.
[2024-05-29 00:31:58] [INFO ] Flatten gal took : 168 ms
[2024-05-29 00:31:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 322 labels/synchronizations in 49 ms.
[2024-05-29 00:31:59] [INFO ] Time to serialize gal into /tmp/LTL11777748813756791235.gal : 33 ms
[2024-05-29 00:31:59] [INFO ] Time to serialize properties into /tmp/LTL14688241070257013602.ltl : 4 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/LTL11777748813756791235.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14688241070257013602.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...256
Read 1 LTL properties
Checking formula 0 : !(((G(F("(((((((((i0.i1.u67.Fork_15>=1)&&(i0.i1.u68.Catch2_16>=1))||((i7.i0.u47.Fork_89>=1)&&(i7.i0.u47.Catch2_90>=1)))||(((i2.i1.u64....10909
Formula 0 simplified : FG!"(((((((((i0.i1.u67.Fork_15>=1)&&(i0.i1.u68.Catch2_16>=1))||((i7.i0.u47.Fork_89>=1)&&(i7.i0.u47.Catch2_90>=1)))||(((i2.i1.u64.For...10902
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8434035626843519241
[2024-05-29 00:32:14] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8434035626843519241
Running compilation step : cd /tmp/ltsmin8434035626843519241;'/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 1354 ms.
Running link step : cd /tmp/ltsmin8434035626843519241;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin8434035626843519241;'/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' '--ltl' '([](<>((LTLAPp0==true))) U (LTLAPp0==true))' '--buchi-type=spotba'
LTSmin run took 996 ms.
FORMULA Philosophers-COL-000100-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Philosophers-COL-000100-LTLFireability-07 finished in 108541 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 100 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 18 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-05-29 00:32:16] [INFO ] Invariant cache hit.
[2024-05-29 00:32:16] [INFO ] Implicit Places using invariants in 448 ms returned []
[2024-05-29 00:32:17] [INFO ] Invariant cache hit.
[2024-05-29 00:32:17] [INFO ] Implicit Places using invariants and state equation in 787 ms returned []
Implicit Place search using SMT with State Equation took 1238 ms to find 0 implicit places.
[2024-05-29 00:32:17] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-29 00:32:17] [INFO ] Invariant cache hit.
[2024-05-29 00:32:18] [INFO ] Dead Transitions using invariants and state equation in 494 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1772 ms. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-COL-000100-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s452 1) (GEQ s448 1) (GEQ s460 1) (GEQ s456 1) (GEQ s407 1) (GEQ s468 1) (GEQ s403 1) (GEQ s464 1) (GEQ s415 1) (GEQ s476 1) (GEQ s411 1) (GEQ...], 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 5342 reset in 2960 ms.
Product exploration explored 100000 steps with 5299 reset in 3104 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 182 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 66 ms :[(NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 211 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 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
[2024-05-29 00:32:25] [INFO ] Invariant cache hit.
[2024-05-29 00:32:26] [INFO ] [Real]Absence check using 200 positive place invariants in 147 ms returned sat
[2024-05-29 00:32:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 00:32:30] [INFO ] [Real]Absence check using state equation in 4570 ms returned sat
[2024-05-29 00:32:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 00:32:31] [INFO ] [Nat]Absence check using 200 positive place invariants in 138 ms returned sat
[2024-05-29 00:32:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 00:32:32] [INFO ] [Nat]Absence check using state equation in 675 ms returned sat
[2024-05-29 00:32:32] [INFO ] Computed and/alt/rep : 300/400/300 causal constraints (skipped 0 transitions) in 33 ms.
[2024-05-29 00:32:32] [INFO ] Added : 0 causal constraints over 0 iterations in 94 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 100 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 21 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-05-29 00:32:32] [INFO ] Invariant cache hit.
[2024-05-29 00:32:32] [INFO ] Implicit Places using invariants in 479 ms returned []
[2024-05-29 00:32:32] [INFO ] Invariant cache hit.
[2024-05-29 00:32:33] [INFO ] Implicit Places using invariants and state equation in 674 ms returned []
Implicit Place search using SMT with State Equation took 1184 ms to find 0 implicit places.
[2024-05-29 00:32:33] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-29 00:32:33] [INFO ] Invariant cache hit.
[2024-05-29 00:32:33] [INFO ] Dead Transitions using invariants and state equation in 443 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1661 ms. Remains : 500/500 places, 500/500 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 142 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 44 ms :[(NOT p0)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 185 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 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2024-05-29 00:32:34] [INFO ] Invariant cache hit.
[2024-05-29 00:32:35] [INFO ] [Real]Absence check using 200 positive place invariants in 152 ms returned sat
[2024-05-29 00:32:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 00:32:39] [INFO ] [Real]Absence check using state equation in 4564 ms returned sat
[2024-05-29 00:32:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 00:32:40] [INFO ] [Nat]Absence check using 200 positive place invariants in 135 ms returned sat
[2024-05-29 00:32:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 00:32:41] [INFO ] [Nat]Absence check using state equation in 647 ms returned sat
[2024-05-29 00:32:41] [INFO ] Computed and/alt/rep : 300/400/300 causal constraints (skipped 0 transitions) in 35 ms.
[2024-05-29 00:32:41] [INFO ] Added : 0 causal constraints over 0 iterations in 95 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 5302 reset in 2999 ms.
Product exploration explored 100000 steps with 5327 reset in 3111 ms.
Built C files in :
/tmp/ltsmin18303029558279376815
[2024-05-29 00:32:47] [INFO ] Computing symmetric may disable matrix : 500 transitions.
[2024-05-29 00:32:47] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:32:47] [INFO ] Computing symmetric may enable matrix : 500 transitions.
[2024-05-29 00:32:47] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:32:47] [INFO ] Computing Do-Not-Accords matrix : 500 transitions.
[2024-05-29 00:32:47] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:32:47] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18303029558279376815
Running compilation step : cd /tmp/ltsmin18303029558279376815;'/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 1816 ms.
Running link step : cd /tmp/ltsmin18303029558279376815;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin18303029558279376815;'/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/stateBased16417873746603977586.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 100 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 18 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-05-29 00:33:02] [INFO ] Invariant cache hit.
[2024-05-29 00:33:03] [INFO ] Implicit Places using invariants in 554 ms returned []
[2024-05-29 00:33:03] [INFO ] Invariant cache hit.
[2024-05-29 00:33:03] [INFO ] Implicit Places using invariants and state equation in 673 ms returned []
Implicit Place search using SMT with State Equation took 1246 ms to find 0 implicit places.
[2024-05-29 00:33:03] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-29 00:33:03] [INFO ] Invariant cache hit.
[2024-05-29 00:33:04] [INFO ] Dead Transitions using invariants and state equation in 467 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1753 ms. Remains : 500/500 places, 500/500 transitions.
Built C files in :
/tmp/ltsmin14324139447016576502
[2024-05-29 00:33:04] [INFO ] Computing symmetric may disable matrix : 500 transitions.
[2024-05-29 00:33:04] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:33:04] [INFO ] Computing symmetric may enable matrix : 500 transitions.
[2024-05-29 00:33:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:33:04] [INFO ] Computing Do-Not-Accords matrix : 500 transitions.
[2024-05-29 00:33:04] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:33:04] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14324139447016576502
Running compilation step : cd /tmp/ltsmin14324139447016576502;'/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 1763 ms.
Running link step : cd /tmp/ltsmin14324139447016576502;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin14324139447016576502;'/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/stateBased978723548862911286.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 00:33:19] [INFO ] Flatten gal took : 26 ms
[2024-05-29 00:33:19] [INFO ] Flatten gal took : 24 ms
[2024-05-29 00:33:19] [INFO ] Time to serialize gal into /tmp/LTL14841323629629562912.gal : 5 ms
[2024-05-29 00:33:19] [INFO ] Time to serialize properties into /tmp/LTL652111951498100798.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/LTL14841323629629562912.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11934276462037471321.hoa' '-atoms' '/tmp/LTL652111951498100798.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/LTL652111951498100798.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11934276462037471321.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
[2024-05-29 00:33:34] [INFO ] Flatten gal took : 49 ms
[2024-05-29 00:33:34] [INFO ] Flatten gal took : 37 ms
[2024-05-29 00:33:34] [INFO ] Time to serialize gal into /tmp/LTL14036858298354961613.gal : 4 ms
[2024-05-29 00:33:34] [INFO ] Time to serialize properties into /tmp/LTL7959812588035352676.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/LTL14036858298354961613.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7959812588035352676.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...276
Read 1 LTL properties
Checking formula 0 : !((F("((((((((Eat_52>=1)||(Eat_48>=1))||((Eat_60>=1)||(Eat_56>=1)))||(((Eat_7>=1)||(Eat_68>=1))||((Eat_3>=1)||(Eat_64>=1))))||((((Eat_...1517
Formula 0 simplified : G!"((((((((Eat_52>=1)||(Eat_48>=1))||((Eat_60>=1)||(Eat_56>=1)))||(((Eat_7>=1)||(Eat_68>=1))||((Eat_3>=1)||(Eat_64>=1))))||((((Eat_1...1513
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
[2024-05-29 00:33:49] [INFO ] Flatten gal took : 31 ms
[2024-05-29 00:33:49] [INFO ] Applying decomposition
[2024-05-29 00:33:49] [INFO ] Flatten gal took : 31 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/graph14504485322061881610.txt' '-o' '/tmp/graph14504485322061881610.bin' '-w' '/tmp/graph14504485322061881610.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14504485322061881610.bin' '-l' '-1' '-v' '-w' '/tmp/graph14504485322061881610.weights' '-q' '0' '-e' '0.001'
[2024-05-29 00:33:50] [INFO ] Decomposing Gal with order
[2024-05-29 00:33:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 00:33:50] [INFO ] Removed a total of 99 redundant transitions.
[2024-05-29 00:33:50] [INFO ] Flatten gal took : 54 ms
[2024-05-29 00:33:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 324 labels/synchronizations in 18 ms.
[2024-05-29 00:33:50] [INFO ] Time to serialize gal into /tmp/LTL13534006558375662041.gal : 8 ms
[2024-05-29 00:33:50] [INFO ] Time to serialize properties into /tmp/LTL6159318509358384502.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13534006558375662041.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6159318509358384502.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("((((((((i6.i0.u83.Eat_52>=1)||(i16.i0.u80.Eat_48>=1))||((i10.i0.u39.Eat_60>=1)||(i6.i1.u37.Eat_56>=1)))||(((i11.i0.u15.Eat_7>=1)...2551
Formula 0 simplified : G!"((((((((i6.i0.u83.Eat_52>=1)||(i16.i0.u80.Eat_48>=1))||((i10.i0.u39.Eat_60>=1)||(i6.i1.u37.Eat_56>=1)))||(((i11.i0.u15.Eat_7>=1)|...2547
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17569734873497160624
[2024-05-29 00:34:05] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17569734873497160624
Running compilation step : cd /tmp/ltsmin17569734873497160624;'/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 1404 ms.
Running link step : cd /tmp/ltsmin17569734873497160624;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin17569734873497160624;'/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' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Philosophers-COL-000100-LTLFireability-08 finished in 123859 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 200 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 4 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-05-29 00:34:20] [INFO ] Invariant cache hit.
[2024-05-29 00:34:20] [INFO ] Implicit Places using invariants in 431 ms returned []
[2024-05-29 00:34:20] [INFO ] Invariant cache hit.
[2024-05-29 00:34:21] [INFO ] Implicit Places using invariants and state equation in 673 ms returned []
Implicit Place search using SMT with State Equation took 1108 ms to find 0 implicit places.
[2024-05-29 00:34:21] [INFO ] Invariant cache hit.
[2024-05-29 00:34:22] [INFO ] Dead Transitions using invariants and state equation in 611 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1727 ms. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000100-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s165 1) (GEQ s265 1)) (AND (GEQ s160 1) (GEQ s260 1)) (AND (GEQ s101 1) (GEQ s201 1)) (AND (GEQ s150 1) (GEQ s250 1)) (AND (GEQ s170 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 33057 reset in 2942 ms.
Product exploration explored 100000 steps with 33201 reset in 2844 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)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 1 factoid took 168 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 240 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 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
[2024-05-29 00:34:28] [INFO ] Invariant cache hit.
[2024-05-29 00:34:31] [INFO ] [Real]Absence check using 200 positive place invariants in 274 ms returned sat
[2024-05-29 00:34:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 00:34:33] [INFO ] [Real]Absence check using state equation in 1601 ms returned sat
[2024-05-29 00:34:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 00:34:36] [INFO ] [Nat]Absence check using 200 positive place invariants in 251 ms returned sat
[2024-05-29 00:34:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 00:34:37] [INFO ] [Nat]Absence check using state equation in 747 ms returned sat
[2024-05-29 00:34:37] [INFO ] Computed and/alt/rep : 300/400/300 causal constraints (skipped 0 transitions) in 55 ms.
[2024-05-29 00:34:37] [INFO ] Added : 13 causal constraints over 3 iterations in 320 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 200 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 20 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-05-29 00:34:37] [INFO ] Invariant cache hit.
[2024-05-29 00:34:37] [INFO ] Implicit Places using invariants in 461 ms returned []
[2024-05-29 00:34:37] [INFO ] Invariant cache hit.
[2024-05-29 00:34:38] [INFO ] Implicit Places using invariants and state equation in 684 ms returned []
Implicit Place search using SMT with State Equation took 1147 ms to find 0 implicit places.
[2024-05-29 00:34:38] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-29 00:34:38] [INFO ] Invariant cache hit.
[2024-05-29 00:34:39] [INFO ] Dead Transitions using invariants and state equation in 492 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1670 ms. Remains : 500/500 places, 500/500 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 (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 186 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 198 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 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2024-05-29 00:34:39] [INFO ] Invariant cache hit.
[2024-05-29 00:34:43] [INFO ] [Real]Absence check using 200 positive place invariants in 221 ms returned sat
[2024-05-29 00:34:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 00:34:44] [INFO ] [Real]Absence check using state equation in 1589 ms returned sat
[2024-05-29 00:34:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 00:34:46] [INFO ] [Nat]Absence check using 200 positive place invariants in 163 ms returned sat
[2024-05-29 00:34:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 00:34:47] [INFO ] [Nat]Absence check using state equation in 748 ms returned sat
[2024-05-29 00:34:47] [INFO ] Computed and/alt/rep : 300/400/300 causal constraints (skipped 0 transitions) in 47 ms.
[2024-05-29 00:34:47] [INFO ] Added : 13 causal constraints over 3 iterations in 254 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 33083 reset in 3520 ms.
Stack based approach found an accepted trace after 46342 steps with 15283 reset with depth 3 and stack size 3 in 1576 ms.
FORMULA Philosophers-COL-000100-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000100-LTLFireability-09 finished in 32589 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 100 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 11 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-05-29 00:34:52] [INFO ] Invariant cache hit.
[2024-05-29 00:34:53] [INFO ] Implicit Places using invariants in 448 ms returned []
[2024-05-29 00:34:53] [INFO ] Invariant cache hit.
[2024-05-29 00:34:54] [INFO ] Implicit Places using invariants and state equation in 905 ms returned []
Implicit Place search using SMT with State Equation took 1355 ms to find 0 implicit places.
[2024-05-29 00:34:54] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-29 00:34:54] [INFO ] Invariant cache hit.
[2024-05-29 00:34:55] [INFO ] Dead Transitions using invariants and state equation in 654 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2031 ms. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-COL-000100-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s452 1) (GEQ s448 1) (GEQ s460 1) (GEQ s456 1) (GEQ s407 1) (GEQ s468 1) (GEQ s403 1) (GEQ s464 1) (GEQ s415 1) (GEQ s476 1) (GEQ s411 1) (GEQ...], 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 5283 reset in 2847 ms.
Product exploration explored 100000 steps with 5381 reset in 2994 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 167 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 49 ms :[(NOT p0)]
Finished random walk after 18 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=9 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 205 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 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
[2024-05-29 00:35:01] [INFO ] Invariant cache hit.
[2024-05-29 00:35:02] [INFO ] [Real]Absence check using 200 positive place invariants in 148 ms returned sat
[2024-05-29 00:35:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 00:35:06] [INFO ] [Real]Absence check using state equation in 4395 ms returned sat
[2024-05-29 00:35:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 00:35:07] [INFO ] [Nat]Absence check using 200 positive place invariants in 198 ms returned sat
[2024-05-29 00:35:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 00:35:08] [INFO ] [Nat]Absence check using state equation in 827 ms returned sat
[2024-05-29 00:35:08] [INFO ] Computed and/alt/rep : 300/400/300 causal constraints (skipped 0 transitions) in 34 ms.
[2024-05-29 00:35:08] [INFO ] Added : 0 causal constraints over 0 iterations in 89 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 100 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 12 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-05-29 00:35:08] [INFO ] Invariant cache hit.
[2024-05-29 00:35:09] [INFO ] Implicit Places using invariants in 527 ms returned []
[2024-05-29 00:35:09] [INFO ] Invariant cache hit.
[2024-05-29 00:35:10] [INFO ] Implicit Places using invariants and state equation in 1079 ms returned []
Implicit Place search using SMT with State Equation took 1607 ms to find 0 implicit places.
[2024-05-29 00:35:10] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-29 00:35:10] [INFO ] Invariant cache hit.
[2024-05-29 00:35:10] [INFO ] Dead Transitions using invariants and state equation in 672 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2306 ms. Remains : 500/500 places, 500/500 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 147 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 16 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 : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 173 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 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
[2024-05-29 00:35:11] [INFO ] Invariant cache hit.
[2024-05-29 00:35:12] [INFO ] [Real]Absence check using 200 positive place invariants in 155 ms returned sat
[2024-05-29 00:35:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 00:35:17] [INFO ] [Real]Absence check using state equation in 4434 ms returned sat
[2024-05-29 00:35:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 00:35:17] [INFO ] [Nat]Absence check using 200 positive place invariants in 142 ms returned sat
[2024-05-29 00:35:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 00:35:18] [INFO ] [Nat]Absence check using state equation in 687 ms returned sat
[2024-05-29 00:35:18] [INFO ] Computed and/alt/rep : 300/400/300 causal constraints (skipped 0 transitions) in 45 ms.
[2024-05-29 00:35:18] [INFO ] Added : 0 causal constraints over 0 iterations in 118 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5281 reset in 3114 ms.
Product exploration explored 100000 steps with 5360 reset in 2960 ms.
Built C files in :
/tmp/ltsmin8440081834712356767
[2024-05-29 00:35:24] [INFO ] Computing symmetric may disable matrix : 500 transitions.
[2024-05-29 00:35:24] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:35:24] [INFO ] Computing symmetric may enable matrix : 500 transitions.
[2024-05-29 00:35:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:35:24] [INFO ] Computing Do-Not-Accords matrix : 500 transitions.
[2024-05-29 00:35:24] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:35:24] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8440081834712356767
Running compilation step : cd /tmp/ltsmin8440081834712356767;'/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 1739 ms.
Running link step : cd /tmp/ltsmin8440081834712356767;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin8440081834712356767;'/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/stateBased15059677375233942957.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 100 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 21 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-05-29 00:35:39] [INFO ] Invariant cache hit.
[2024-05-29 00:35:40] [INFO ] Implicit Places using invariants in 660 ms returned []
[2024-05-29 00:35:40] [INFO ] Invariant cache hit.
[2024-05-29 00:35:41] [INFO ] Implicit Places using invariants and state equation in 819 ms returned []
Implicit Place search using SMT with State Equation took 1481 ms to find 0 implicit places.
[2024-05-29 00:35:41] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-29 00:35:41] [INFO ] Invariant cache hit.
[2024-05-29 00:35:41] [INFO ] Dead Transitions using invariants and state equation in 479 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1991 ms. Remains : 500/500 places, 500/500 transitions.
Built C files in :
/tmp/ltsmin11542951122240929216
[2024-05-29 00:35:41] [INFO ] Computing symmetric may disable matrix : 500 transitions.
[2024-05-29 00:35:41] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:35:41] [INFO ] Computing symmetric may enable matrix : 500 transitions.
[2024-05-29 00:35:41] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:35:42] [INFO ] Computing Do-Not-Accords matrix : 500 transitions.
[2024-05-29 00:35:42] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:35:42] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11542951122240929216
Running compilation step : cd /tmp/ltsmin11542951122240929216;'/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 2079 ms.
Running link step : cd /tmp/ltsmin11542951122240929216;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin11542951122240929216;'/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/stateBased5034724299617225701.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 00:35:57] [INFO ] Flatten gal took : 18 ms
[2024-05-29 00:35:57] [INFO ] Flatten gal took : 17 ms
[2024-05-29 00:35:57] [INFO ] Time to serialize gal into /tmp/LTL13164734509769768979.gal : 6 ms
[2024-05-29 00:35:57] [INFO ] Time to serialize properties into /tmp/LTL7922808834460072440.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/LTL13164734509769768979.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9105108023875183765.hoa' '-atoms' '/tmp/LTL7922808834460072440.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/LTL7922808834460072440.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9105108023875183765.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
[2024-05-29 00:36:12] [INFO ] Flatten gal took : 15 ms
[2024-05-29 00:36:12] [INFO ] Flatten gal took : 15 ms
[2024-05-29 00:36:12] [INFO ] Time to serialize gal into /tmp/LTL6492025682364290957.gal : 5 ms
[2024-05-29 00:36:12] [INFO ] Time to serialize properties into /tmp/LTL13690926767119206221.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6492025682364290957.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13690926767119206221.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...276
Read 1 LTL properties
Checking formula 0 : !((F("((((((((Eat_52>=1)||(Eat_48>=1))||((Eat_60>=1)||(Eat_56>=1)))||(((Eat_7>=1)||(Eat_68>=1))||((Eat_3>=1)||(Eat_64>=1))))||((((Eat_...1517
Formula 0 simplified : G!"((((((((Eat_52>=1)||(Eat_48>=1))||((Eat_60>=1)||(Eat_56>=1)))||(((Eat_7>=1)||(Eat_68>=1))||((Eat_3>=1)||(Eat_64>=1))))||((((Eat_1...1513
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
[2024-05-29 00:36:27] [INFO ] Flatten gal took : 15 ms
[2024-05-29 00:36:27] [INFO ] Applying decomposition
[2024-05-29 00:36:27] [INFO ] Flatten gal took : 15 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/graph14566431407059503863.txt' '-o' '/tmp/graph14566431407059503863.bin' '-w' '/tmp/graph14566431407059503863.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14566431407059503863.bin' '-l' '-1' '-v' '-w' '/tmp/graph14566431407059503863.weights' '-q' '0' '-e' '0.001'
[2024-05-29 00:36:27] [INFO ] Decomposing Gal with order
[2024-05-29 00:36:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 00:36:27] [INFO ] Removed a total of 100 redundant transitions.
[2024-05-29 00:36:27] [INFO ] Flatten gal took : 43 ms
[2024-05-29 00:36:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 330 labels/synchronizations in 14 ms.
[2024-05-29 00:36:27] [INFO ] Time to serialize gal into /tmp/LTL531240145179466451.gal : 13 ms
[2024-05-29 00:36:27] [INFO ] Time to serialize properties into /tmp/LTL12580395979213818962.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL531240145179466451.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12580395979213818962.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...254
Read 1 LTL properties
Checking formula 0 : !((F("((((((((i7.i0.u31.Eat_52>=1)||(i13.i0.u48.Eat_48>=1))||((i15.i0.u34.Eat_60>=1)||(i14.i1.u76.Eat_56>=1)))||(((i3.i0.u54.Eat_7>=1)...2555
Formula 0 simplified : G!"((((((((i7.i0.u31.Eat_52>=1)||(i13.i0.u48.Eat_48>=1))||((i15.i0.u34.Eat_60>=1)||(i14.i1.u76.Eat_56>=1)))||(((i3.i0.u54.Eat_7>=1)|...2551
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
482 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,4.90595,137708,1,0,350609,334,1876,197599,258,1023,158159
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Philosophers-COL-000100-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property Philosophers-COL-000100-LTLFireability-10 finished in 100172 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 200 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 12 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-05-29 00:36:33] [INFO ] Invariant cache hit.
[2024-05-29 00:36:33] [INFO ] Implicit Places using invariants in 297 ms returned []
[2024-05-29 00:36:33] [INFO ] Invariant cache hit.
[2024-05-29 00:36:34] [INFO ] Implicit Places using invariants and state equation in 674 ms returned []
Implicit Place search using SMT with State Equation took 973 ms to find 0 implicit places.
[2024-05-29 00:36:34] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-29 00:36:34] [INFO ] Invariant cache hit.
[2024-05-29 00:36:34] [INFO ] Dead Transitions using invariants and state equation in 608 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1606 ms. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-COL-000100-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:(OR (AND (GEQ s1 1) (GEQ s100 1)) (AND (GEQ s75 1) (GEQ s174 1)) (AND (GEQ s6 1) (GEQ s105 1)) (AND (GEQ s11 1) (GEQ s110 1)) (AND (GEQ s85 1) (GEQ s18...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 24169 steps with 0 reset in 423 ms.
FORMULA Philosophers-COL-000100-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000100-LTLFireability-11 finished in 2105 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 200 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 19 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-05-29 00:36:35] [INFO ] Invariant cache hit.
[2024-05-29 00:36:35] [INFO ] Implicit Places using invariants in 456 ms returned []
[2024-05-29 00:36:35] [INFO ] Invariant cache hit.
[2024-05-29 00:36:36] [INFO ] Implicit Places using invariants and state equation in 624 ms returned []
Implicit Place search using SMT with State Equation took 1101 ms to find 0 implicit places.
[2024-05-29 00:36:36] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-29 00:36:36] [INFO ] Invariant cache hit.
[2024-05-29 00:36:37] [INFO ] Dead Transitions using invariants and state equation in 667 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1797 ms. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000100-LTLFireability-13 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 (AND (GEQ s1 1) (GEQ s100 1)) (AND (GEQ s75 1) (GEQ s174 1)) (AND (GEQ s6 1) (GEQ s105 1)) (AND (GEQ s11 1) (GEQ s110 1)) (AND (GEQ s85 1) (GEQ s18...], 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 200 reset in 1038 ms.
Product exploration explored 100000 steps with 200 reset in 1109 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Finished random walk after 208 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=29 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Support contains 200 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 18 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-05-29 00:36:39] [INFO ] Invariant cache hit.
[2024-05-29 00:36:40] [INFO ] Implicit Places using invariants in 440 ms returned []
[2024-05-29 00:36:40] [INFO ] Invariant cache hit.
[2024-05-29 00:36:41] [INFO ] Implicit Places using invariants and state equation in 625 ms returned []
Implicit Place search using SMT with State Equation took 1067 ms to find 0 implicit places.
[2024-05-29 00:36:41] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-29 00:36:41] [INFO ] Invariant cache hit.
[2024-05-29 00:36:41] [INFO ] Dead Transitions using invariants and state equation in 819 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1917 ms. Remains : 500/500 places, 500/500 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Finished random walk after 320 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=35 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 205 reset in 1311 ms.
Product exploration explored 100000 steps with 192 reset in 1098 ms.
Built C files in :
/tmp/ltsmin17770748248502820173
[2024-05-29 00:36:45] [INFO ] Computing symmetric may disable matrix : 500 transitions.
[2024-05-29 00:36:45] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:36:45] [INFO ] Computing symmetric may enable matrix : 500 transitions.
[2024-05-29 00:36:45] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:36:45] [INFO ] Computing Do-Not-Accords matrix : 500 transitions.
[2024-05-29 00:36:45] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:36:45] [INFO ] Built C files in 90ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17770748248502820173
Running compilation step : cd /tmp/ltsmin17770748248502820173;'/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 1830 ms.
Running link step : cd /tmp/ltsmin17770748248502820173;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin17770748248502820173;'/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/stateBased14846819204886807173.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 200 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 13 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-05-29 00:37:00] [INFO ] Invariant cache hit.
[2024-05-29 00:37:00] [INFO ] Implicit Places using invariants in 365 ms returned []
[2024-05-29 00:37:00] [INFO ] Invariant cache hit.
[2024-05-29 00:37:01] [INFO ] Implicit Places using invariants and state equation in 553 ms returned []
Implicit Place search using SMT with State Equation took 920 ms to find 0 implicit places.
[2024-05-29 00:37:01] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-29 00:37:01] [INFO ] Invariant cache hit.
[2024-05-29 00:37:01] [INFO ] Dead Transitions using invariants and state equation in 476 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1421 ms. Remains : 500/500 places, 500/500 transitions.
Built C files in :
/tmp/ltsmin10519055936112896814
[2024-05-29 00:37:01] [INFO ] Computing symmetric may disable matrix : 500 transitions.
[2024-05-29 00:37:01] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:37:01] [INFO ] Computing symmetric may enable matrix : 500 transitions.
[2024-05-29 00:37:01] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:37:01] [INFO ] Computing Do-Not-Accords matrix : 500 transitions.
[2024-05-29 00:37:01] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:37:01] [INFO ] Built C files in 89ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10519055936112896814
Running compilation step : cd /tmp/ltsmin10519055936112896814;'/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 2276 ms.
Running link step : cd /tmp/ltsmin10519055936112896814;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin10519055936112896814;'/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/stateBased8857810402229093053.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 00:37:16] [INFO ] Flatten gal took : 16 ms
[2024-05-29 00:37:16] [INFO ] Flatten gal took : 15 ms
[2024-05-29 00:37:16] [INFO ] Time to serialize gal into /tmp/LTL13694542370053118532.gal : 3 ms
[2024-05-29 00:37:16] [INFO ] Time to serialize properties into /tmp/LTL5683527739710314190.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13694542370053118532.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8464568056030809118.hoa' '-atoms' '/tmp/LTL5683527739710314190.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/LTL5683527739710314190.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8464568056030809118.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
[2024-05-29 00:37:31] [INFO ] Flatten gal took : 24 ms
[2024-05-29 00:37:32] [INFO ] Flatten gal took : 24 ms
[2024-05-29 00:37:32] [INFO ] Time to serialize gal into /tmp/LTL9121422334350550717.gal : 5 ms
[2024-05-29 00:37:32] [INFO ] Time to serialize properties into /tmp/LTL4832465536775497690.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9121422334350550717.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4832465536775497690.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...275
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((((((Think_1>=1)&&(Fork_0>=1))||((Think_75>=1)&&(Fork_74>=1)))||(((Think_6>=1)&&(Fork_5>=1))||((Think_11>=1)&&(Fork_10>=1)...3310
Formula 0 simplified : FG!"(((((((((Think_1>=1)&&(Fork_0>=1))||((Think_75>=1)&&(Fork_74>=1)))||(((Think_6>=1)&&(Fork_5>=1))||((Think_11>=1)&&(Fork_10>=1)))...3304
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
[2024-05-29 00:37:47] [INFO ] Flatten gal took : 16 ms
[2024-05-29 00:37:47] [INFO ] Applying decomposition
[2024-05-29 00:37:47] [INFO ] Flatten gal took : 16 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/graph5169587493836003383.txt' '-o' '/tmp/graph5169587493836003383.bin' '-w' '/tmp/graph5169587493836003383.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5169587493836003383.bin' '-l' '-1' '-v' '-w' '/tmp/graph5169587493836003383.weights' '-q' '0' '-e' '0.001'
[2024-05-29 00:37:47] [INFO ] Decomposing Gal with order
[2024-05-29 00:37:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 00:37:47] [INFO ] Removed a total of 100 redundant transitions.
[2024-05-29 00:37:47] [INFO ] Flatten gal took : 38 ms
[2024-05-29 00:37:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 326 labels/synchronizations in 8 ms.
[2024-05-29 00:37:47] [INFO ] Time to serialize gal into /tmp/LTL15108046226584582765.gal : 6 ms
[2024-05-29 00:37:47] [INFO ] Time to serialize properties into /tmp/LTL15089973780593121545.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15108046226584582765.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15089973780593121545.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...256
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((((((i2.i2.u57.Think_1>=1)&&(i2.i2.u10.Fork_0>=1))||((i7.i1.u42.Think_75>=1)&&(i7.i1.u42.Fork_74>=1)))||(((i13.i1.u64.Thin...5396
Formula 0 simplified : FG!"(((((((((i2.i2.u57.Think_1>=1)&&(i2.i2.u10.Fork_0>=1))||((i7.i1.u42.Think_75>=1)&&(i7.i1.u42.Fork_74>=1)))||(((i13.i1.u64.Think_...5390
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2576258920127997121
[2024-05-29 00:38:02] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2576258920127997121
Running compilation step : cd /tmp/ltsmin2576258920127997121;'/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 1338 ms.
Running link step : cd /tmp/ltsmin2576258920127997121;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin2576258920127997121;'/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' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Philosophers-COL-000100-LTLFireability-13 finished in 102180 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0||G(p1)))))'
Support contains 300 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 8 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-05-29 00:38:17] [INFO ] Invariant cache hit.
[2024-05-29 00:38:17] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-05-29 00:38:17] [INFO ] Invariant cache hit.
[2024-05-29 00:38:18] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 702 ms to find 0 implicit places.
[2024-05-29 00:38:18] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-29 00:38:18] [INFO ] Invariant cache hit.
[2024-05-29 00:38:18] [INFO ] Dead Transitions using invariants and state equation in 597 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1320 ms. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : Philosophers-COL-000100-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (GEQ s165 1) (GEQ s265 1)) (AND (GEQ s160 1) (GEQ s260 1)) (AND (GEQ s101 1) (GEQ s201 1)) (AND (GEQ s150 1) (GEQ s250 1)) (AND (GEQ s170 1) (...], 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 181 reset in 1415 ms.
Stack based approach found an accepted trace after 91741 steps with 175 reset with depth 361 and stack size 361 in 1223 ms.
FORMULA Philosophers-COL-000100-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000100-LTLFireability-14 finished in 4078 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F((G(F(p1))||(p2&&X(F(p1)))))&&p0)))'
Support contains 300 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 4 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2024-05-29 00:38:21] [INFO ] Invariant cache hit.
[2024-05-29 00:38:21] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-05-29 00:38:21] [INFO ] Invariant cache hit.
[2024-05-29 00:38:22] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 719 ms to find 0 implicit places.
[2024-05-29 00:38:22] [INFO ] Invariant cache hit.
[2024-05-29 00:38:23] [INFO ] Dead Transitions using invariants and state equation in 760 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1489 ms. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1)]
Running random walk in product with property : Philosophers-COL-000100-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p0 (NOT p1)) (AND p0 p2)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(OR (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s165 1) (LT s265 1)) (OR (LT s160 1) (LT s260 1)) (OR (LT s101 1) (LT s201 1)) (OR (LT s150 1) (LT s250 1)) (OR (LT s170 1) (LT s270 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 6008 ms.
Product exploration explored 100000 steps with 50000 reset in 6420 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 p1), (X (NOT (AND p0 (NOT p2)))), (X (X p1)), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : [(X (OR (AND p0 (NOT p1)) (AND p0 p2))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 p2)))), (X (NOT p0)), (X p0), (X (OR (NOT p1) p2)), (X (NOT (OR (NOT p1) p2))), (X (NOT p2)), (X p2), (X (X (OR (AND p0 (NOT p1)) (AND p0 p2)))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (OR (NOT p1) p2))), (X (X (NOT (OR (NOT p1) p2)))), (X (X (NOT p2))), (X (X p2))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 18 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Philosophers-COL-000100-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-COL-000100-LTLFireability-15 finished in 14748 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))'
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)))'
[2024-05-29 00:38:36] [INFO ] Flatten gal took : 14 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13527759437399476874
[2024-05-29 00:38:36] [INFO ] Computing symmetric may disable matrix : 500 transitions.
[2024-05-29 00:38:36] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:38:36] [INFO ] Computing symmetric may enable matrix : 500 transitions.
[2024-05-29 00:38:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 00:38:36] [INFO ] Applying decomposition
[2024-05-29 00:38:36] [INFO ] Flatten gal took : 25 ms
[2024-05-29 00:38:36] [INFO ] Computing Do-Not-Accords matrix : 500 transitions.
[2024-05-29 00:38:36] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph2640156922177784151.txt' '-o' '/tmp/graph2640156922177784151.bin' '-w' '/tmp/graph2640156922177784151.weights'
[2024-05-29 00:38:36] [INFO ] Built C files in 93ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13527759437399476874
Running compilation step : cd /tmp/ltsmin13527759437399476874;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' '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'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2640156922177784151.bin' '-l' '-1' '-v' '-w' '/tmp/graph2640156922177784151.weights' '-q' '0' '-e' '0.001'
[2024-05-29 00:38:36] [INFO ] Decomposing Gal with order
[2024-05-29 00:38:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 00:38:36] [INFO ] Removed a total of 98 redundant transitions.
[2024-05-29 00:38:36] [INFO ] Flatten gal took : 78 ms
[2024-05-29 00:38:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 324 labels/synchronizations in 13 ms.
[2024-05-29 00:38:36] [INFO ] Time to serialize gal into /tmp/LTLFireability4326191377902356904.gal : 8 ms
[2024-05-29 00:38:36] [INFO ] Time to serialize properties into /tmp/LTLFireability16640041620554781927.ltl : 3 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/LTLFireability4326191377902356904.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16640041620554781927.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...277
Read 2 LTL properties
Checking formula 0 : !((F("((((((((i13.i0.u74.Eat_52>=1)||(i5.i1.u70.Eat_48>=1))||((i14.i1.u31.Eat_60>=1)||(i13.i1.u77.Eat_56>=1)))||(((i8.i1.u55.Eat_7>=1)...2555
Formula 0 simplified : G!"((((((((i13.i0.u74.Eat_52>=1)||(i5.i1.u70.Eat_48>=1))||((i14.i1.u31.Eat_60>=1)||(i13.i1.u77.Eat_56>=1)))||(((i8.i1.u55.Eat_7>=1)|...2551
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
Compilation finished in 2152 ms.
Running link step : cd /tmp/ltsmin13527759437399476874;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin13527759437399476874;'/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' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1299 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,13.1299,318016,1,0,874137,638,2010,356806,342,1729,435039
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Philosophers-COL-000100-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(F("(((((((((i19.i0.u9.Think_1>=1)&&(i19.i0.u9.Fork_0>=1))||((i17.i0.u36.Think_75>=1)&&(i17.i0.u86.Fork_74>=1)))||(((i8.i1.u11.Thi...5392
Formula 1 simplified : FG!"(((((((((i19.i0.u9.Think_1>=1)&&(i19.i0.u9.Fork_0>=1))||((i17.i0.u36.Think_75>=1)&&(i17.i0.u86.Fork_74>=1)))||(((i8.i1.u11.Think...5386
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
15247 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,165.601,2103020,1,0,4.69375e+06,753,3649,2.88386e+06,368,2473,2793685
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Philosophers-COL-000100-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 955704 ms.
BK_STOP 1716943523417
--------------------
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="Philosophers-COL-000100"
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 Philosophers-COL-000100, 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 r285-smll-171654422300258"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-000100.tgz
mv Philosophers-COL-000100 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;