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.r297-tall-167873950300315.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 ltsminxred
Input is PhilosophersDyn-PT-03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950300315
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 700K
-rw-r--r-- 1 mcc users 10K Feb 26 12:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 12:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 26 12:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 26 12:07 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 5.8K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 26 12:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 26 12:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 21K Feb 26 12:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 117K Feb 26 12:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 87K 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-PT-03-LTLCardinality-00
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-01
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-02
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-03
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-04
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-05
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-06
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-07
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-08
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-09
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-10
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-11
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-12
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-13
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-14
FORMULA_NAME PhilosophersDyn-PT-03-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679492855783

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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PhilosophersDyn-PT-03
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 13:47:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 13:47:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 13:47:37] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2023-03-22 13:47:37] [INFO ] Transformed 30 places.
[2023-03-22 13:47:37] [INFO ] Transformed 84 transitions.
[2023-03-22 13:47:37] [INFO ] Parsed PT model containing 30 places and 84 transitions and 564 arcs in 123 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 transitions.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 8 ms. Remains 30 /30 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2023-03-22 13:47:37] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
// Phase 1: matrix 57 rows 30 cols
[2023-03-22 13:47:37] [INFO ] Computed 11 place invariants in 9 ms
[2023-03-22 13:47:37] [INFO ] Dead Transitions using invariants and state equation in 187 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-22 13:47:37] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-22 13:47:38] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-22 13:47:38] [INFO ] Invariant cache hit.
[2023-03-22 13:47:38] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 13:47:38] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 103 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 328 ms. Remains : 30/30 places, 51/81 transitions.
Support contains 30 out of 30 places after structural reductions.
[2023-03-22 13:47:38] [INFO ] Flatten gal took : 24 ms
[2023-03-22 13:47:38] [INFO ] Flatten gal took : 10 ms
[2023-03-22 13:47:38] [INFO ] Input system was already deterministic with 51 transitions.
Incomplete random walk after 10000 steps, including 1446 resets, run finished after 426 ms. (steps per millisecond=23 ) properties (out of 28) seen :23
Incomplete Best-First random walk after 10000 steps, including 422 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 366 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 345 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 326 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 409 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-22 13:47:39] [INFO ] Invariant cache hit.
[2023-03-22 13:47:39] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 13:47:39] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-22 13:47:39] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2023-03-22 13:47:39] [INFO ] After 67ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 5 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-22 13:47:49] [INFO ] Invariant cache hit.
[2023-03-22 13:47:49] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
[2023-03-22 13:47:49] [INFO ] Invariant cache hit.
[2023-03-22 13:47:49] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-22 13:47:49] [INFO ] Invariant cache hit.
[2023-03-22 13:47:49] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 13:47:49] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2023-03-22 13:47:49] [INFO ] Invariant cache hit.
[2023-03-22 13:47:49] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 190 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-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 s5 s9 s21)), p1:(AND (LEQ 2 (ADD s3 s7 s10)) (LEQ 1 (ADD s2 s18 s26)))], 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 4 steps with 0 reset in 3 ms.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-03-LTLCardinality-00 finished in 4162 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-22 13:47:49] [INFO ] Invariant cache hit.
[2023-03-22 13:47:49] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
[2023-03-22 13:47:49] [INFO ] Invariant cache hit.
[2023-03-22 13:47:49] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-22 13:47:49] [INFO ] Invariant cache hit.
[2023-03-22 13:47:49] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 13:47:49] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2023-03-22 13:47:49] [INFO ] Invariant cache hit.
[2023-03-22 13:47:49] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 198 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-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 s2 s18 s26))], 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 7 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-03-LTLCardinality-01 finished in 275 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 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-22 13:47:49] [INFO ] Invariant cache hit.
[2023-03-22 13:47:49] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
[2023-03-22 13:47:49] [INFO ] Invariant cache hit.
[2023-03-22 13:47:49] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-22 13:47:49] [INFO ] Invariant cache hit.
[2023-03-22 13:47:49] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 13:47:49] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2023-03-22 13:47:49] [INFO ] Invariant cache hit.
[2023-03-22 13:47:49] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 187 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : PhilosophersDyn-PT-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 s3 s7 s10)), p1:(LEQ 2 (ADD s4 s12 s14)), p3:(AND (LEQ (ADD s1 s20 s24) (ADD s3 s7 s10)) (LEQ 2 (ADD s4 s12 s14))), p2:(LEQ (ADD s1 s20 s24)...], 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 23268 reset in 375 ms.
Product exploration explored 100000 steps with 23335 reset in 289 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 p0 p1 (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X p0), (X (NOT (AND (NOT p0) p1 (NOT p3) p2))), (X (X (NOT (AND p0 p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 16 factoid took 2327 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 97 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 1443 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10000 steps, including 395 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 265 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 359 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 301 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 395 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-22 13:47:53] [INFO ] Invariant cache hit.
[2023-03-22 13:47:53] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-22 13:47:53] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-22 13:47:53] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:1
[2023-03-22 13:47:53] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-22 13:47:53] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2023-03-22 13:47:53] [INFO ] After 21ms SMT Verify possible using all constraints in natural 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 p0 p1 (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X p0), (X (NOT (AND (NOT p0) p1 (NOT p3) p2))), (X (X (NOT (AND p0 p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (G (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (G (NOT (AND p1 p2 (NOT p0) (NOT p3)))), (G (NOT (AND p1 p2 p0 (NOT p3)))), (G (NOT (AND (NOT p1) (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0) (NOT p3))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X p0)), (X (X (NOT p0))), (F (AND (NOT p2) p0 (NOT p3))), (F (NOT p0)), (F (NOT (AND (NOT p1) p0))), (F (NOT (AND (NOT p1) p0 (NOT p3))))]
Knowledge based reduction with 21 factoid took 1198 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 88 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 3 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-22 13:47:55] [INFO ] Invariant cache hit.
[2023-03-22 13:47:55] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2023-03-22 13:47:55] [INFO ] Invariant cache hit.
[2023-03-22 13:47:55] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-22 13:47:55] [INFO ] Invariant cache hit.
[2023-03-22 13:47:55] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 13:47:55] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2023-03-22 13:47:55] [INFO ] Invariant cache hit.
[2023-03-22 13:47:55] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 186 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 p1), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (OR p0 (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (OR p0 (AND (NOT p3) (NOT p2))))), (X (X (NOT (OR p0 (AND (NOT p3) (NOT p2))))))]
Knowledge based reduction with 7 factoid took 1602 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 92 ms :[false, false]
Finished random walk after 6 steps, including 0 resets, run visited all 5 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND p0 (NOT p3) p2 (NOT p1)), (X p1), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (OR p0 (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (OR p0 (AND (NOT p3) (NOT p2))))), (X (X (NOT (OR p0 (AND (NOT p3) (NOT p2)))))), (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 597 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 82 ms :[false, false]
Stuttering acceptance computed with spot in 84 ms :[false, false]
Stuttering acceptance computed with spot in 74 ms :[false, false]
Product exploration explored 100000 steps with 23255 reset in 238 ms.
Product exploration explored 100000 steps with 23159 reset in 204 ms.
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-22 13:47:58] [INFO ] Invariant cache hit.
[2023-03-22 13:47:58] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
[2023-03-22 13:47:58] [INFO ] Invariant cache hit.
[2023-03-22 13:47:58] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-22 13:47:58] [INFO ] Invariant cache hit.
[2023-03-22 13:47:58] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 13:47:58] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2023-03-22 13:47:58] [INFO ] Invariant cache hit.
[2023-03-22 13:47:58] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 192 ms. Remains : 30/30 places, 51/51 transitions.
Treatment of property PhilosophersDyn-PT-03-LTLCardinality-02 finished in 8994 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-22 13:47:58] [INFO ] Invariant cache hit.
[2023-03-22 13:47:58] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2023-03-22 13:47:58] [INFO ] Invariant cache hit.
[2023-03-22 13:47:58] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-22 13:47:58] [INFO ] Invariant cache hit.
[2023-03-22 13:47:58] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 13:47:58] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2023-03-22 13:47:58] [INFO ] Invariant cache hit.
[2023-03-22 13:47:58] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 202 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 17289 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-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 s1 s20 s24))], 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 5 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-03-LTLCardinality-03 finished in 17504 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 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-22 13:48:16] [INFO ] Invariant cache hit.
[2023-03-22 13:48:16] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
[2023-03-22 13:48:16] [INFO ] Invariant cache hit.
[2023-03-22 13:48:16] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-22 13:48:16] [INFO ] Invariant cache hit.
[2023-03-22 13:48:16] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 13:48:16] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-22 13:48:16] [INFO ] Invariant cache hit.
[2023-03-22 13:48:16] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 164 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PhilosophersDyn-PT-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 s2 s18 s26) (ADD s4 s12 s14)), p1:(AND (LEQ (ADD s1 s20 s24) (ADD s0 s6 s15 s16 s17 s19 s22 s25 s27)) (LEQ (ADD s8 s28 s29) (ADD s2 s18 s26))...], 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 167 ms.
Product exploration explored 100000 steps with 33333 reset in 167 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 148 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-PT-03-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-PT-03-LTLCardinality-05 finished in 818 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 4 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-22 13:48:17] [INFO ] Invariant cache hit.
[2023-03-22 13:48:17] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
[2023-03-22 13:48:17] [INFO ] Invariant cache hit.
[2023-03-22 13:48:17] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-22 13:48:17] [INFO ] Invariant cache hit.
[2023-03-22 13:48:17] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 13:48:17] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2023-03-22 13:48:17] [INFO ] Invariant cache hit.
[2023-03-22 13:48:17] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 200 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 245 ms :[true, (NOT p0), p0, false, (NOT p0), false, false]
Running random walk in product with property : PhilosophersDyn-PT-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 s5 s9 s21) (ADD s1 s20 s24))], 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 5 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-03-LTLCardinality-07 finished in 469 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)&&F(G(p1)))))'
Support contains 4 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 13 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-22 13:48:17] [INFO ] Invariant cache hit.
[2023-03-22 13:48:17] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
[2023-03-22 13:48:17] [INFO ] Invariant cache hit.
[2023-03-22 13:48:17] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-22 13:48:17] [INFO ] Invariant cache hit.
[2023-03-22 13:48:17] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 13:48:17] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2023-03-22 13:48:17] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 13:48:17] [INFO ] Invariant cache hit.
[2023-03-22 13:48:17] [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 223 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PhilosophersDyn-PT-03-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s18 s16), p1:(GT s9 s29)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-03-LTLCardinality-08 finished in 353 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)&&F(p1))))'
Support contains 4 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 6 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-22 13:48:17] [INFO ] Invariant cache hit.
[2023-03-22 13:48:17] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-03-22 13:48:17] [INFO ] Invariant cache hit.
[2023-03-22 13:48:17] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-22 13:48:17] [INFO ] Invariant cache hit.
[2023-03-22 13:48:18] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 13:48:18] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2023-03-22 13:48:18] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 13:48:18] [INFO ] Invariant cache hit.
[2023-03-22 13:48:18] [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 185 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PhilosophersDyn-PT-03-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (LEQ s11 s29) (LEQ s12 s28)), p1:(LEQ s11 s29)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 145 steps with 23 reset in 1 ms.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-03-LTLCardinality-09 finished in 320 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&&G(F(p1))))))'
Support contains 4 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-22 13:48:18] [INFO ] Invariant cache hit.
[2023-03-22 13:48:18] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2023-03-22 13:48:18] [INFO ] Invariant cache hit.
[2023-03-22 13:48:18] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-22 13:48:18] [INFO ] Invariant cache hit.
[2023-03-22 13:48:18] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 13:48:18] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2023-03-22 13:48:18] [INFO ] Invariant cache hit.
[2023-03-22 13:48:18] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 189 ms. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-03-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GT s7 s23), p0:(GT s22 s8)], 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][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 16 steps with 1 reset in 0 ms.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-03-LTLCardinality-11 finished in 402 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 2 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-22 13:48:18] [INFO ] Invariant cache hit.
[2023-03-22 13:48:18] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2023-03-22 13:48:18] [INFO ] Invariant cache hit.
[2023-03-22 13:48:18] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-22 13:48:18] [INFO ] Invariant cache hit.
[2023-03-22 13:48:18] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 13:48:18] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2023-03-22 13:48:18] [INFO ] Invariant cache hit.
[2023-03-22 13:48:18] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 185 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-PT-03-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s13 s14)], 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 4 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-PT-03-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-03-LTLCardinality-15 finished in 278 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)))))))'
Found a Lengthening insensitive property : PhilosophersDyn-PT-03-LTLCardinality-02
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Support contains 9 out of 30 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 6 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-22 13:48:19] [INFO ] Invariant cache hit.
[2023-03-22 13:48:19] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
[2023-03-22 13:48:19] [INFO ] Invariant cache hit.
[2023-03-22 13:48:19] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-22 13:48:19] [INFO ] Invariant cache hit.
[2023-03-22 13:48:19] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 13:48:19] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2023-03-22 13:48:19] [INFO ] Invariant cache hit.
[2023-03-22 13:48:19] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 192 ms. Remains : 30/30 places, 51/51 transitions.
Running random walk in product with property : PhilosophersDyn-PT-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 s3 s7 s10)), p1:(LEQ 2 (ADD s4 s12 s14)), p3:(AND (LEQ (ADD s1 s20 s24) (ADD s3 s7 s10)) (LEQ 2 (ADD s4 s12 s14))), p2:(LEQ (ADD s1 s20 s24)...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 23259 reset in 225 ms.
Product exploration explored 100000 steps with 23311 reset in 230 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) p2), (X (NOT (AND p0 p1 (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X p0), (X (NOT (AND (NOT p0) p1 (NOT p3) p2))), (X (X (NOT (AND p0 p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 16 factoid took 16750 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 95 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 1413 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 394 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 255 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 364 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 306 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 394 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-22 13:48:37] [INFO ] Invariant cache hit.
[2023-03-22 13:48:37] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-22 13:48:37] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2023-03-22 13:48:37] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:1
[2023-03-22 13:48:37] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-22 13:48:37] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-22 13:48:37] [INFO ] After 25ms SMT Verify possible using all constraints in natural 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 p0 p1 (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X p0), (X (NOT (AND (NOT p0) p1 (NOT p3) p2))), (X (X (NOT (AND p0 p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (G (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (G (NOT (AND p1 p2 (NOT p0) (NOT p3)))), (G (NOT (AND p1 p2 p0 (NOT p3)))), (G (NOT (AND (NOT p1) (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0) (NOT p3))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X p0)), (X (X (NOT p0))), (F (AND (NOT p2) p0 (NOT p3))), (F (NOT p0)), (F (NOT (AND (NOT p1) p0))), (F (NOT (AND (NOT p1) p0 (NOT p3))))]
Knowledge based reduction with 21 factoid took 1180 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 94 ms :[false, false]
Stuttering acceptance computed with spot in 71 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 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-22 13:48:38] [INFO ] Invariant cache hit.
[2023-03-22 13:48:38] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
[2023-03-22 13:48:38] [INFO ] Invariant cache hit.
[2023-03-22 13:48:38] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-22 13:48:38] [INFO ] Invariant cache hit.
[2023-03-22 13:48:38] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 13:48:38] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2023-03-22 13:48:38] [INFO ] Invariant cache hit.
[2023-03-22 13:48:38] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 179 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 p1), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (OR p0 (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (OR p0 (AND (NOT p3) (NOT p2))))), (X (X (NOT (OR p0 (AND (NOT p3) (NOT p2))))))]
Knowledge based reduction with 7 factoid took 506 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 84 ms :[false, false]
Finished random walk after 29 steps, including 3 resets, run visited all 5 properties in 2 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND p0 (NOT p3) p2 (NOT p1)), (X p1), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (OR p0 (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (OR p0 (AND (NOT p3) (NOT p2))))), (X (X (NOT (OR p0 (AND (NOT p3) (NOT p2)))))), (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 745 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 73 ms :[false, false]
Stuttering acceptance computed with spot in 74 ms :[false, false]
Stuttering acceptance computed with spot in 80 ms :[false, false]
Product exploration explored 100000 steps with 23096 reset in 187 ms.
Product exploration explored 100000 steps with 23138 reset in 197 ms.
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 0 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-22 13:48:40] [INFO ] Invariant cache hit.
[2023-03-22 13:48:40] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
[2023-03-22 13:48:40] [INFO ] Invariant cache hit.
[2023-03-22 13:48:40] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-22 13:48:40] [INFO ] Invariant cache hit.
[2023-03-22 13:48:40] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 13:48:40] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2023-03-22 13:48:40] [INFO ] Invariant cache hit.
[2023-03-22 13:48:40] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 176 ms. Remains : 30/30 places, 51/51 transitions.
Treatment of property PhilosophersDyn-PT-03-LTLCardinality-02 finished in 22004 ms.
[2023-03-22 13:48:40] [INFO ] Flatten gal took : 6 ms
[2023-03-22 13:48:40] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-22 13:48:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 30 places, 51 transitions and 321 arcs took 1 ms.
Total runtime 63453 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1531/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : PhilosophersDyn-PT-03-LTLCardinality-02

BK_STOP 1679492938928

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name PhilosophersDyn-PT-03-LTLCardinality-02
ltl formula formula --ltl=/tmp/1531/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 30 places, 51 transitions and 321 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1531/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1531/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1531/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1531/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:

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-PT-03"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is PhilosophersDyn-PT-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 r297-tall-167873950300315"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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