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

About the Execution of ITS-Tools for PhilosophersDyn-COL-03

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
378.300 17331.00 25861.00 844.10 FFTFFTTFFFFFFTFF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 7.5K Feb 26 12:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 12:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 26 12:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 26 12:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 12:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 26 12:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 12:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 12:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 31K Mar 5 18:23 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-LTLCardinality-00
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-01
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-02
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-03
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-04
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-05
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-06
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-07
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-08
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-09
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-10
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-11
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-12
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-13
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-14
FORMULA_NAME PhilosophersDyn-COL-03-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678817961889

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PhilosophersDyn-COL-03
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202303021504
[2023-03-14 18:19:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-14 18:19:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 18:19:23] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-14 18:19:23] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-14 18:19:23] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 419 ms
[2023-03-14 18:19:24] [INFO ] Imported 8 HL places and 7 HL transitions for a total of 30 PT places and 87.0 transition bindings in 221 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2023-03-14 18:19:24] [INFO ] Built PT skeleton of HLPN with 8 places and 7 transitions 33 arcs in 5 ms.
[2023-03-14 18:19:24] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 1 formulas.
FORMULA PhilosophersDyn-COL-03-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 15 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10000 steps, including 1357 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 29) seen :26
Incomplete Best-First random walk after 10001 steps, including 652 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 532 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 258 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 7 rows 8 cols
[2023-03-14 18:19:25] [INFO ] Computed 3 place invariants in 7 ms
[2023-03-14 18:19:26] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-14 18:19:26] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-14 18:19:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-14 18:19:26] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-14 18:19:26] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-14 18:19:26] [INFO ] After 4ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-14 18:19:26] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-14 18:19:26] [INFO ] After 64ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8/8 places, 7/7 transitions.
Applied a total of 0 rules in 8 ms. Remains 8 /8 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-14 18:19:26] [INFO ] Invariant cache hit.
[2023-03-14 18:19:26] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 8/8 places, 7/7 transitions.
Incomplete random walk after 10000 steps, including 1368 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 527 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 259 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Probably explored full state space saw : 42 states, properties seen :0
Probabilistic random walk after 118 steps, saw 42 distinct states, run finished after 14 ms. (steps per millisecond=8 ) properties seen :0
Explored full state space saw : 42 states, properties seen :0
Exhaustive walk after 118 steps, saw 42 distinct states, run finished after 2 ms. (steps per millisecond=59 ) properties seen :0
Successfully simplified 3 atomic propositions for a total of 15 simplifications.
FORMULA PhilosophersDyn-COL-03-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-14 18:19:26] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2023-03-14 18:19:26] [INFO ] Flatten gal took : 21 ms
[2023-03-14 18:19:26] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA PhilosophersDyn-COL-03-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-03-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-14 18:19:26] [INFO ] Flatten gal took : 4 ms
Domain [Philosopher(3), Philosopher(3)] of place Neighbourhood breaks symmetries in sort Philosopher
[2023-03-14 18:19:26] [INFO ] Unfolded HLPN to a Petri net with 30 places and 84 transitions 564 arcs in 11 ms.
[2023-03-14 18:19:26] [INFO ] Unfolded 12 HLPN properties in 0 ms.
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 in LTL mode, iteration 0 : 30/30 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-14 18:19:26] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
// Phase 1: matrix 57 rows 30 cols
[2023-03-14 18:19:26] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-14 18:19:26] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 30 transitions.
Found 30 dead transitions using SMT.
Drop transitions removed 30 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 30 transitions.
// Phase 1: matrix 51 rows 30 cols
[2023-03-14 18:19:26] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-14 18:19:26] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-14 18:19:26] [INFO ] Invariant cache hit.
[2023-03-14 18:19:26] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 18:19:26] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Starting structural reductions in LTL mode, 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.
Finished structural reductions in LTL mode , in 1 iterations and 152 ms. Remains : 30/30 places, 51/81 transitions.
Support contains 30 out of 30 places after structural reductions.
[2023-03-14 18:19:26] [INFO ] Flatten gal took : 9 ms
[2023-03-14 18:19:26] [INFO ] Flatten gal took : 7 ms
[2023-03-14 18:19:26] [INFO ] Input system was already deterministic with 51 transitions.
Incomplete random walk after 10000 steps, including 1433 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 24) seen :23
Incomplete Best-First random walk after 10001 steps, including 414 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-14 18:19:26] [INFO ] Invariant cache hit.
[2023-03-14 18:19:26] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 18:19:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-14 18:19:26] [INFO ] [Nat]Absence check using 3 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-14 18:19:26] [INFO ] After 44ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(p1)))'
Support contains 9 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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.
[2023-03-14 18:19:27] [INFO ] Invariant cache hit.
[2023-03-14 18:19:27] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
[2023-03-14 18:19:27] [INFO ] Invariant cache hit.
[2023-03-14 18:19:27] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-14 18:19:27] [INFO ] Invariant cache hit.
[2023-03-14 18:19:27] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 18:19:27] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2023-03-14 18:19:27] [INFO ] Invariant cache hit.
[2023-03-14 18:19:27] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 209 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 3 (ADD s21 s22 s23)), p1:(AND (LEQ 2 (ADD s12 s13 s14)) (LEQ 1 (ADD s27 s28 s29)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 10 steps with 1 reset in 2 ms.
FORMULA PhilosophersDyn-COL-03-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-LTLCardinality-00 finished in 475 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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.
[2023-03-14 18:19:27] [INFO ] Invariant cache hit.
[2023-03-14 18:19:27] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2023-03-14 18:19:27] [INFO ] Invariant cache hit.
[2023-03-14 18:19:27] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-14 18:19:27] [INFO ] Invariant cache hit.
[2023-03-14 18:19:27] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 18:19:27] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2023-03-14 18:19:27] [INFO ] Invariant cache hit.
[2023-03-14 18:19:27] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 182 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 (ADD s27 s28 s29))], 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]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-COL-03-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-LTLCardinality-01 finished in 262 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((p1||X((p2 U p3)))))))'
Support contains 9 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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.
[2023-03-14 18:19:27] [INFO ] Invariant cache hit.
[2023-03-14 18:19:27] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
[2023-03-14 18:19:27] [INFO ] Invariant cache hit.
[2023-03-14 18:19:27] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-14 18:19:27] [INFO ] Invariant cache hit.
[2023-03-14 18:19:27] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 18:19:28] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-14 18:19:28] [INFO ] Invariant cache hit.
[2023-03-14 18:19:28] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 167 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p1 (NOT p3) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(GT 3 (ADD s12 s13 s14)), p1:(LEQ 2 (ADD s15 s16 s17)), p3:(AND (LEQ (ADD s18 s19 s20) (ADD s12 s13 s14)) (LEQ 2 (ADD s15 s16 s17))), p2:(LEQ (ADD s18 ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 23265 reset in 348 ms.
Product exploration explored 100000 steps with 23285 reset in 241 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND p0 p1 (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p3) p2))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (NOT (AND p0 (NOT p3) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 16 factoid took 847 ms. Reduced automaton from 2 states, 10 edges and 4 AP (stutter sensitive) to 2 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 1453 resets, run finished after 257 ms. (steps per millisecond=38 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 393 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 262 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 359 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 309 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 395 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-14 18:19:30] [INFO ] Invariant cache hit.
[2023-03-14 18:19:30] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-14 18:19:30] [INFO ] [Real]Absence check using 3 positive and 8 generalized place invariants in 1 ms returned sat
[2023-03-14 18:19:30] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND p0 p1 (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p3) p2))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (G (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (G (NOT (AND (NOT p0) p2 (NOT p3) p1))), (G (NOT (AND p0 p2 (NOT p3) p1))), (G (NOT (AND (NOT p0) (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p3) (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (AND p0 (NOT p2) (NOT p3))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (NOT (AND p0 (NOT p3) (NOT p1))))]
Knowledge based reduction with 21 factoid took 1217 ms. Reduced automaton from 2 states, 10 edges and 4 AP (stutter sensitive) to 2 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[false, false]
Stuttering acceptance computed with spot in 70 ms :[false, false]
Support contains 9 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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.
[2023-03-14 18:19:31] [INFO ] Invariant cache hit.
[2023-03-14 18:19:31] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2023-03-14 18:19:31] [INFO ] Invariant cache hit.
[2023-03-14 18:19:31] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-14 18:19:31] [INFO ] Invariant cache hit.
[2023-03-14 18:19:31] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 18:19:31] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2023-03-14 18:19:31] [INFO ] Invariant cache hit.
[2023-03-14 18:19:31] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 168 ms. Remains : 30/30 places, 51/51 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 p3) p2 (NOT p1)), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (OR p0 (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X p1), (X (X (NOT (AND (NOT p3) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (OR p0 (AND (NOT p3) (NOT p2))))), (X (X (NOT (OR p0 (AND (NOT p3) (NOT p2)))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 7 factoid took 482 ms. Reduced automaton from 2 states, 5 edges and 4 AP (stutter sensitive) to 2 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[false, false]
Finished random walk after 7 steps, including 1 resets, run visited all 5 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND p0 (NOT p3) p2 (NOT p1)), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (OR p0 (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X p1), (X (X (NOT (AND (NOT p3) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (OR p0 (AND (NOT p3) (NOT p2))))), (X (X (NOT (OR p0 (AND (NOT p3) (NOT p2)))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT p1))), (X (X p1)), (F (NOT (AND (NOT p1) (NOT p3)))), (F (AND (NOT p2) (NOT p3))), (F (NOT (OR p0 (AND (NOT p2) (NOT p3))))), (F p1), (F (AND (NOT p0) p3))]
Knowledge based reduction with 7 factoid took 657 ms. Reduced automaton from 2 states, 5 edges and 4 AP (stutter sensitive) to 2 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[false, false]
Stuttering acceptance computed with spot in 93 ms :[false, false]
Stuttering acceptance computed with spot in 72 ms :[false, false]
Product exploration explored 100000 steps with 23352 reset in 239 ms.
Product exploration explored 100000 steps with 23254 reset in 196 ms.
Built C files in :
/tmp/ltsmin15002807391204957762
[2023-03-14 18:19:33] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15002807391204957762
Running compilation step : cd /tmp/ltsmin15002807391204957762;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 220 ms.
Running link step : cd /tmp/ltsmin15002807391204957762;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin15002807391204957762;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12234419514736788241.hoa' '--buchi-type=spotba'
LTSmin run took 75 ms.
FORMULA PhilosophersDyn-COL-03-LTLCardinality-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PhilosophersDyn-COL-03-LTLCardinality-02 finished in 6355 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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.
[2023-03-14 18:19:34] [INFO ] Invariant cache hit.
[2023-03-14 18:19:34] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
[2023-03-14 18:19:34] [INFO ] Invariant cache hit.
[2023-03-14 18:19:34] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-14 18:19:34] [INFO ] Invariant cache hit.
[2023-03-14 18:19:34] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 18:19:34] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2023-03-14 18:19:34] [INFO ] Invariant cache hit.
[2023-03-14 18:19:34] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 179 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(GT 3 (ADD s18 s19 s20))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 25 steps with 3 reset in 1 ms.
FORMULA PhilosophersDyn-COL-03-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-LTLCardinality-03 finished in 344 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p0)&&(X(p0)||G(p1))))))'
Support contains 21 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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.
[2023-03-14 18:19:34] [INFO ] Invariant cache hit.
[2023-03-14 18:19:34] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
[2023-03-14 18:19:34] [INFO ] Invariant cache hit.
[2023-03-14 18:19:34] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-14 18:19:34] [INFO ] Invariant cache hit.
[2023-03-14 18:19:34] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 18:19:34] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-03-14 18:19:34] [INFO ] Invariant cache hit.
[2023-03-14 18:19:34] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 136 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ (ADD s27 s28 s29) (ADD s15 s16 s17)), p1:(AND (LEQ (ADD s18 s19 s20) (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8)) (LEQ (ADD s9 s10 s11) (ADD s27 s28 s29)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 150 ms.
Product exploration explored 100000 steps with 33333 reset in 147 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (OR (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 6 factoid took 138 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PhilosophersDyn-COL-03-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-COL-03-LTLCardinality-05 finished in 741 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0)))||G(!p0)))'
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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.
[2023-03-14 18:19:35] [INFO ] Invariant cache hit.
[2023-03-14 18:19:35] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
[2023-03-14 18:19:35] [INFO ] Invariant cache hit.
[2023-03-14 18:19:35] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-14 18:19:35] [INFO ] Invariant cache hit.
[2023-03-14 18:19:35] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 18:19:35] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2023-03-14 18:19:35] [INFO ] Invariant cache hit.
[2023-03-14 18:19:35] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 168 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 235 ms :[true, (NOT p0), p0, false, (NOT p0), false, false]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=p0, acceptance={} source=5 dest: 1}, { cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=p0, acceptance={} source=6 dest: 1}, { cond=(NOT p0), acceptance={} source=6 dest: 2}]], initial=3, aps=[p0:(GT (ADD s21 s22 s23) (ADD s18 s19 s20))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-COL-03-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-LTLCardinality-07 finished in 415 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||(X(!p1)&&((p2||F(p3)) U (G((p2||F(p3)))||((p2||F(p3))&&X(p0)))))))))'
Support contains 21 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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.
[2023-03-14 18:19:35] [INFO ] Invariant cache hit.
[2023-03-14 18:19:35] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2023-03-14 18:19:35] [INFO ] Invariant cache hit.
[2023-03-14 18:19:35] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-14 18:19:35] [INFO ] Invariant cache hit.
[2023-03-14 18:19:35] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 18:19:35] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-03-14 18:19:35] [INFO ] Invariant cache hit.
[2023-03-14 18:19:35] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 138 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 451 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1)), p1, (NOT p3), (AND (NOT p3) (NOT p0) (NOT p2)), true]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={} source=3 dest: 6}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(NOT p0), acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(GT 2 (ADD s9 s10 s11)), p2:(GT (ADD s15 s16 s17) (ADD s18 s19 s20)), p3:(GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8) (ADD s15 s16 s17)), p1:(LEQ (ADD s27 s28 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-COL-03-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-LTLCardinality-09 finished in 617 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&X((p1||X((G(p2) U (p1&&G(p2)))))))))'
Support contains 21 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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.
[2023-03-14 18:19:36] [INFO ] Invariant cache hit.
[2023-03-14 18:19:36] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
[2023-03-14 18:19:36] [INFO ] Invariant cache hit.
[2023-03-14 18:19:36] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-14 18:19:36] [INFO ] Invariant cache hit.
[2023-03-14 18:19:36] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 18:19:36] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-03-14 18:19:36] [INFO ] Invariant cache hit.
[2023-03-14 18:19:36] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 150 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 365 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 1}, { cond=p0, acceptance={0, 1} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={1} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={1} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1} source=3 dest: 1}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={1} source=3 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=3 dest: 5}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 6}, { cond=(AND p0 p1 p2), acceptance={0} source=3 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1} source=4 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=4 dest: 5}, { cond=(AND p0 p1 p2), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1} source=5 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0} source=5 dest: 5}, { cond=(AND p0 p2), acceptance={} source=5 dest: 6}, { cond=(AND p0 p2), acceptance={0} source=5 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=6 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1} source=6 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=6 dest: 5}, { cond=(AND p0 p2), acceptance={} source=6 dest: 6}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=7 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=7 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=7 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=7 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=7 dest: 6}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(GT 1 (ADD s27 s28 s29)), p1:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8) (ADD s12 s13 s14)), p2:(LEQ (ADD s24 s25 s26) (ADD s15 s16 s17))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 11 steps with 1 reset in 0 ms.
FORMULA PhilosophersDyn-COL-03-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-LTLCardinality-10 finished in 536 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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.
[2023-03-14 18:19:36] [INFO ] Invariant cache hit.
[2023-03-14 18:19:36] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-03-14 18:19:36] [INFO ] Invariant cache hit.
[2023-03-14 18:19:36] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-14 18:19:36] [INFO ] Invariant cache hit.
[2023-03-14 18:19:36] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 18:19:36] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2023-03-14 18:19:37] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 18:19:37] [INFO ] Invariant cache hit.
[2023-03-14 18:19:37] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 171 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLCardinality-11 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:(GT (ADD s18 s19 s20) (ADD s9 s10 s11))], 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 4 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-COL-03-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-LTLCardinality-11 finished in 262 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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.
[2023-03-14 18:19:37] [INFO ] Invariant cache hit.
[2023-03-14 18:19:37] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-03-14 18:19:37] [INFO ] Invariant cache hit.
[2023-03-14 18:19:37] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-14 18:19:37] [INFO ] Invariant cache hit.
[2023-03-14 18:19:37] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 18:19:37] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2023-03-14 18:19:37] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 18:19:37] [INFO ] Invariant cache hit.
[2023-03-14 18:19:37] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 183 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s27 s28 s29) (ADD s24 s25 s26))], 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 7 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-COL-03-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-LTLCardinality-12 finished in 220 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(p0)))||(F(G(p1))&&F(p2))))'
Support contains 12 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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.
[2023-03-14 18:19:37] [INFO ] Invariant cache hit.
[2023-03-14 18:19:37] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2023-03-14 18:19:37] [INFO ] Invariant cache hit.
[2023-03-14 18:19:37] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-14 18:19:37] [INFO ] Invariant cache hit.
[2023-03-14 18:19:37] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 18:19:37] [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.
[2023-03-14 18:19:37] [INFO ] Invariant cache hit.
[2023-03-14 18:19:37] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 157 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 321 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (NOT p1), (NOT p2)]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=6 dest: 8}], [{ cond=p1, acceptance={} source=7 dest: 7}, { cond=(NOT p1), acceptance={0} source=7 dest: 7}], [{ cond=(NOT p2), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p2:(GT 1 (ADD s12 s13 s14)), p0:(LEQ (ADD s9 s10 s11) (ADD s27 s28 s29)), p1:(LEQ 1 (ADD s24 s25 s26))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 26 steps with 4 reset in 0 ms.
FORMULA PhilosophersDyn-COL-03-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-LTLCardinality-14 finished in 498 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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.
[2023-03-14 18:19:37] [INFO ] Invariant cache hit.
[2023-03-14 18:19:37] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
[2023-03-14 18:19:37] [INFO ] Invariant cache hit.
[2023-03-14 18:19:37] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-14 18:19:37] [INFO ] Invariant cache hit.
[2023-03-14 18:19:37] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-14 18:19:37] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2023-03-14 18:19:38] [INFO ] Invariant cache hit.
[2023-03-14 18:19:38] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 183 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-COL-03-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GT 1 (ADD s21 s22 s23))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 24 steps with 5 reset in 1 ms.
FORMULA PhilosophersDyn-COL-03-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-COL-03-LTLCardinality-15 finished in 306 ms.
All properties solved by simple procedures.
Total runtime 14848 ms.

BK_STOP 1678817979220

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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="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-5348"
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 r293-tall-167873945200275"
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 ;