Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r159-oct2-162089267700004.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is PhilosophersDyn-COL-03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r159-oct2-162089267700004
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 99K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 28 16:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 09:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 27 09:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 11:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 11:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 31K May 5 16:51 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 PhilosophersDyn-COL-03-00
FORMULA_NAME PhilosophersDyn-COL-03-01
FORMULA_NAME PhilosophersDyn-COL-03-02
FORMULA_NAME PhilosophersDyn-COL-03-03
FORMULA_NAME PhilosophersDyn-COL-03-04
FORMULA_NAME PhilosophersDyn-COL-03-05
FORMULA_NAME PhilosophersDyn-COL-03-06
FORMULA_NAME PhilosophersDyn-COL-03-07
FORMULA_NAME PhilosophersDyn-COL-03-08
FORMULA_NAME PhilosophersDyn-COL-03-09
FORMULA_NAME PhilosophersDyn-COL-03-10
FORMULA_NAME PhilosophersDyn-COL-03-11
FORMULA_NAME PhilosophersDyn-COL-03-12
FORMULA_NAME PhilosophersDyn-COL-03-13
FORMULA_NAME PhilosophersDyn-COL-03-14
FORMULA_NAME PhilosophersDyn-COL-03-15

=== Now, execution of the tool begins

BK_START 1621176436058

Running Version 0
[2021-05-16 14:47:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-16 14:47:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 14:47:19] [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.
[2021-05-16 14:47:19] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-16 14:47:19] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 552 ms
[2021-05-16 14:47:19] [INFO ] Imported 8 HL places and 7 HL transitions for a total of 30 PT places and 87.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
[2021-05-16 14:47:20] [INFO ] Built PT skeleton of HLPN with 8 places and 7 transitions in 7 ms.
[2021-05-16 14:47:20] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_18262751966718112875.dot
[2021-05-16 14:47:20] [INFO ] Initial state test concluded for 5 properties.
FORMULA PhilosophersDyn-COL-03-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-03-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-03-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-03-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-03-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 100001 steps, including 13615 resets, run finished after 164 ms. (steps per millisecond=609 ) properties (out of 19) seen :15
Running SMT prover for 4 properties.
// Phase 1: matrix 7 rows 8 cols
[2021-05-16 14:47:20] [INFO ] Computed 3 place invariants in 3 ms
[2021-05-16 14:47:20] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2021-05-16 14:47:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:20] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-16 14:47:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-16 14:47:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:20] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-16 14:47:20] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-16 14:47:20] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2021-05-16 14:47:20] [INFO ] Computed and/alt/rep : 6/25/6 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-16 14:47:20] [INFO ] Added : 5 causal constraints over 1 iterations in 22 ms. Result :sat
[2021-05-16 14:47:20] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
[2021-05-16 14:47:20] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
[2021-05-16 14:47:20] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
FORMULA PhilosophersDyn-COL-03-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 14:47:20] [INFO ] Flatten gal took : 15 ms
[2021-05-16 14:47:20] [INFO ] Flatten gal took : 2 ms
[2021-05-16 14:47:20] [INFO ] Unfolded HLPN to a Petri net with 30 places and 84 transitions in 4 ms.
[2021-05-16 14:47:20] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_8263080549838907734.dot
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 transitions.
Support contains 30 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 81/81 transitions.
Applied a total of 0 rules in 8 ms. Remains 30 /30 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2021-05-16 14:47:20] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
// Phase 1: matrix 57 rows 30 cols
[2021-05-16 14:47:20] [INFO ] Computed 11 place invariants in 5 ms
[2021-05-16 14:47:20] [INFO ] Dead Transitions using invariants and state equation in 77 ms returned [3, 6, 7, 9, 11, 12, 13, 16, 19, 20, 21, 23, 25, 26, 29, 30, 33, 34, 36, 38, 39, 40, 43, 46, 47, 48, 50, 52, 53, 56]
Found 30 dead transitions using SMT.
Drop transitions removed 30 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 30 transitions :[56, 53, 52, 50, 48, 47, 46, 43, 40, 39, 38, 36, 34, 33, 30, 29, 26, 25, 23, 21, 20, 19, 16, 13, 12, 11, 9, 7, 6, 3]
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:20] [INFO ] Computed 11 place invariants in 3 ms
[2021-05-16 14:47:20] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:20] [INFO ] Computed 11 place invariants in 3 ms
[2021-05-16 14:47:20] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:20] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:20] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:20] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Starting structural reductions, iteration 1 : 30/30 places, 51/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:20] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-16 14:47:21] [INFO ] Dead Transitions using invariants and state equation in 115 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/30 places, 51/81 transitions.
[2021-05-16 14:47:21] [INFO ] Flatten gal took : 9 ms
[2021-05-16 14:47:21] [INFO ] Flatten gal took : 7 ms
[2021-05-16 14:47:21] [INFO ] Input system was already deterministic with 51 transitions.
Incomplete random walk after 100000 steps, including 14334 resets, run finished after 290 ms. (steps per millisecond=344 ) properties (out of 18) seen :15
Running SMT prover for 3 properties.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:21] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-16 14:47:21] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 7 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:21] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-16 14:47:21] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:21] [INFO ] [Real]Added 30 Read/Feed constraints in 4 ms returned sat
[2021-05-16 14:47:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:47:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:47:21] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2021-05-16 14:47:21] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 7 ms to minimize.
[2021-05-16 14:47:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2021-05-16 14:47:21] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 5 ms.
[2021-05-16 14:47:21] [INFO ] Added : 7 causal constraints over 2 iterations in 22 ms. Result :sat
[2021-05-16 14:47:21] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 3 ms returned unsat
[2021-05-16 14:47:21] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-16 14:47:21] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||G(p1))))], workingDir=/home/mcc/execution]
Support contains 9 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 4 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:21] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:21] [INFO ] Dead Transitions using invariants and state equation in 67 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:21] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:21] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:21] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:21] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:21] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2021-05-16 14:47:21] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:21] [INFO ] Computed 11 place invariants in 8 ms
[2021-05-16 14:47:21] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 458 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), true]
Running random walk in product with property : PhilosophersDyn-COL-03-00 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(GT 3 (ADD s24 s25 s26)), p0:(GT (ADD s12 s13 s14) (ADD s27 s28 s29))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 14221 reset in 219 ms.
Product exploration explored 100000 steps with 14322 reset in 249 ms.
Knowledge obtained : [p1, (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), true]
Product exploration explored 100000 steps with 14306 reset in 138 ms.
Product exploration explored 100000 steps with 14312 reset in 189 ms.
[2021-05-16 14:47:23] [INFO ] Flatten gal took : 20 ms
[2021-05-16 14:47:23] [INFO ] Flatten gal took : 7 ms
[2021-05-16 14:47:23] [INFO ] Time to serialize gal into /tmp/LTL8597603781239684265.gal : 1 ms
[2021-05-16 14:47:23] [INFO ] Time to serialize properties into /tmp/LTL12225522558278824928.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL8597603781239684265.gal, -t, CGAL, -LTL, /tmp/LTL12225522558278824928.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8597603781239684265.gal -t CGAL -LTL /tmp/LTL12225522558278824928.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(("(((Think_0+Think_1)+Think_2)>((HasRight_0+HasRight_1)+HasRight_2))")||(G("(((HasLeft_0+HasLeft_1)+HasLeft_2)<3)")))))
Formula 0 simplified : !G("(((Think_0+Think_1)+Think_2)>((HasRight_0+HasRight_1)+HasRight_2))" | G"(((HasLeft_0+HasLeft_1)+HasLeft_2)<3)")
Reverse transition relation is NOT exact ! Due to transitions t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :9/30/12/51
Computing Next relation with stutter on 45 deadlock states
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
10 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,0.15679,19756,1,0,111,15169,127,59,1859,14485,148
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA PhilosophersDyn-COL-03-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property PhilosophersDyn-COL-03-00 finished in 2176 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(F(p0))||G(p1)))], workingDir=/home/mcc/execution]
Support contains 9 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:23] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:23] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:23] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:23] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:23] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:23] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:23] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:23] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:23] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PhilosophersDyn-COL-03-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT 1 (ADD s15 s16 s17)), p1:(GT (ADD s9 s10 s11) (ADD s12 s13 s14))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 16977 reset in 197 ms.
Product exploration explored 100000 steps with 16935 reset in 186 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 16995 reset in 176 ms.
Product exploration explored 100000 steps with 16988 reset in 129 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 9 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:25] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:25] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
[2021-05-16 14:47:25] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:25] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:25] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Product exploration explored 100000 steps with 16950 reset in 320 ms.
Product exploration explored 100000 steps with 17023 reset in 232 ms.
[2021-05-16 14:47:26] [INFO ] Flatten gal took : 5 ms
[2021-05-16 14:47:26] [INFO ] Flatten gal took : 4 ms
[2021-05-16 14:47:26] [INFO ] Time to serialize gal into /tmp/LTL2254185521810133667.gal : 1 ms
[2021-05-16 14:47:26] [INFO ] Time to serialize properties into /tmp/LTL6115507684189160281.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL2254185521810133667.gal, -t, CGAL, -LTL, /tmp/LTL6115507684189160281.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2254185521810133667.gal -t CGAL -LTL /tmp/LTL6115507684189160281.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X(F("(((Forks_0+Forks_1)+Forks_2)<1)")))||(G("(((Outside_0+Outside_1)+Outside_2)>((Think_0+Think_1)+Think_2))"))))
Formula 0 simplified : !(XF"(((Forks_0+Forks_1)+Forks_2)<1)" | G"(((Outside_0+Outside_1)+Outside_2)>((Think_0+Think_1)+Think_2))")
Reverse transition relation is NOT exact ! Due to transitions t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :9/30/12/51
Computing Next relation with stutter on 45 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
8 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,0.095481,20308,1,0,121,16870,131,58,1876,15954,165
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA PhilosophersDyn-COL-03-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property PhilosophersDyn-COL-03-02 finished in 2640 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:26] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:26] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:26] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:26] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:26] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:26] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:26] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:26] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:26] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 56 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-03-03 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ (ADD s15 s16 s17) (ADD s27 s28 s29))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-COL-03-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-03 finished in 208 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U X(X((F((p1||X(p1)))&&X(p2))))))], workingDir=/home/mcc/execution]
Support contains 12 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:26] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:26] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:26] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:26] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:26] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-16 14:47:26] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:26] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:26] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:26] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 384 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p2), (NOT p1), true, (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : PhilosophersDyn-COL-03-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 7}, { cond=(NOT p0), acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 5}, { cond=p0, acceptance={} source=7 dest: 9}, { cond=(NOT p0), acceptance={} source=7 dest: 10}], [{ cond=(NOT p1), acceptance={} source=8 dest: 5}, { cond=true, acceptance={} source=8 dest: 11}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=9 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=9 dest: 9}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=9 dest: 10}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=10 dest: 5}, { cond=(NOT p2), acceptance={} source=10 dest: 11}], [{ cond=(NOT p2), acceptance={} source=11 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=11 dest: 5}]], initial=0, aps=[p0:(LEQ (ADD s15 s16 s17) (ADD s18 s19 s20)), p1:(LEQ 3 (ADD s12 s13 s14)), p2:(LEQ 1 (ADD s21 s22 s23))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], 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]]
Stuttering criterion allowed to conclude after 22 steps with 4 reset in 0 ms.
FORMULA PhilosophersDyn-COL-03-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-04 finished in 514 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:27] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:27] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:27] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 14:47:27] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:27] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:27] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:27] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:27] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:27] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-03-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 (ADD s9 s10 s11))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-COL-03-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-06 finished in 196 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 18 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:27] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:27] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:27] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 14:47:27] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:27] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:27] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:27] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2021-05-16 14:47:27] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:27] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:27] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PhilosophersDyn-COL-03-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8) (ADD s15 s16 s17)), p0:(GT (ADD s27 s28 s29) (ADD s9 s10 s11))], 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 15427 reset in 171 ms.
Stack based approach found an accepted trace after 77 steps with 12 reset with depth 5 and stack size 5 in 0 ms.
FORMULA PhilosophersDyn-COL-03-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-08 finished in 364 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 5 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:27] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:27] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:27] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 14:47:27] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:27] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 14:47:27] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:27] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2021-05-16 14:47:27] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:27] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:27] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PhilosophersDyn-COL-03-10 automaton TGBA [mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(GT (ADD s9 s10 s11) (ADD s18 s19 s20)), p1:(LEQ 3 (ADD s9 s10 s11))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-COL-03-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-10 finished in 227 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:27] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:28] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:28] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 14:47:28] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:28] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:28] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:28] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2021-05-16 14:47:28] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:28] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:28] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-03-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 (ADD s27 s28 s29))], 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 6 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-COL-03-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-11 finished in 185 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 9 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:28] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 14:47:28] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:28] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:28] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:28] [INFO ] Computed 11 place invariants in 4 ms
[2021-05-16 14:47:28] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:28] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:28] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:28] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-03-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 109 ms.
Product exploration explored 100000 steps with 50000 reset in 109 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 106 ms.
Product exploration explored 100000 steps with 50000 reset in 122 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Support contains 9 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:29] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:29] [INFO ] Dead Transitions using invariants and state equation in 116 ms returned []
[2021-05-16 14:47:29] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:29] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 14:47:29] [INFO ] Dead Transitions using invariants and state equation in 76 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Product exploration explored 100000 steps with 50000 reset in 228 ms.
Product exploration explored 100000 steps with 50000 reset in 207 ms.
[2021-05-16 14:47:29] [INFO ] Flatten gal took : 4 ms
[2021-05-16 14:47:29] [INFO ] Flatten gal took : 7 ms
[2021-05-16 14:47:29] [INFO ] Time to serialize gal into /tmp/LTL11654621160465934459.gal : 2 ms
[2021-05-16 14:47:29] [INFO ] Time to serialize properties into /tmp/LTL13186320686608823237.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL11654621160465934459.gal, -t, CGAL, -LTL, /tmp/LTL13186320686608823237.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL11654621160465934459.gal -t CGAL -LTL /tmp/LTL13186320686608823237.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(((((((((Neighbourhood_0+Neighbourhood_1)+Neighbourhood_2)+Neighbourhood_3)+Neighbourhood_4)+Neighbourhood_5)+Neighbourhood_6)+Neighbourhood_7)+Neighbourhood_8)>=1)"))))
Formula 0 simplified : !XF"(((((((((Neighbourhood_0+Neighbourhood_1)+Neighbourhood_2)+Neighbourhood_3)+Neighbourhood_4)+Neighbourhood_5)+Neighbourhood_6)+Neighbourhood_7)+Neighbourhood_8)>=1)"
Reverse transition relation is NOT exact ! Due to transitions t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :9/30/12/51
Computing Next relation with stutter on 45 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
8 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,0.108658,18764,1,0,99,12044,119,42,1845,8282,106
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA PhilosophersDyn-COL-03-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property PhilosophersDyn-COL-03-13 finished in 1818 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 9 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:29] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:30] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:30] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-16 14:47:30] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:30] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 14:47:30] [INFO ] State equation strengthened by 30 read => feed constraints.
[2021-05-16 14:47:30] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2021-05-16 14:47:30] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2021-05-16 14:47:30] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-16 14:47:32] [INFO ] Dead Transitions using invariants and state equation in 2464 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-03-15 automaton TGBA [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:(AND (LEQ (ADD s24 s25 s26) (ADD s18 s19 s20)) (LEQ 2 (ADD s15 s16 s17)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 6 steps with 1 reset in 1 ms.
FORMULA PhilosophersDyn-COL-03-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-15 finished in 2864 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621176453475

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="PhilosophersDyn-COL-03"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is PhilosophersDyn-COL-03, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r159-oct2-162089267700004"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-COL-03.tgz
mv PhilosophersDyn-COL-03 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;