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-167873950300324.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-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950300324
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 39K Feb 26 12:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 195K Feb 26 12:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 288K Feb 26 12:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.5M Feb 26 12:23 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 11K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 138K Feb 25 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 537K Feb 25 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 89K Feb 26 12:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 443K Feb 26 12:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.3M Feb 26 12:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 6.5M Feb 26 12:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 16:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 14K Feb 25 16:34 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 1.8M 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-10-LTLFireability-00
FORMULA_NAME PhilosophersDyn-PT-10-LTLFireability-01
FORMULA_NAME PhilosophersDyn-PT-10-LTLFireability-02
FORMULA_NAME PhilosophersDyn-PT-10-LTLFireability-03
FORMULA_NAME PhilosophersDyn-PT-10-LTLFireability-04
FORMULA_NAME PhilosophersDyn-PT-10-LTLFireability-05
FORMULA_NAME PhilosophersDyn-PT-10-LTLFireability-06
FORMULA_NAME PhilosophersDyn-PT-10-LTLFireability-07
FORMULA_NAME PhilosophersDyn-PT-10-LTLFireability-08
FORMULA_NAME PhilosophersDyn-PT-10-LTLFireability-09
FORMULA_NAME PhilosophersDyn-PT-10-LTLFireability-10
FORMULA_NAME PhilosophersDyn-PT-10-LTLFireability-11
FORMULA_NAME PhilosophersDyn-PT-10-LTLFireability-12
FORMULA_NAME PhilosophersDyn-PT-10-LTLFireability-13
FORMULA_NAME PhilosophersDyn-PT-10-LTLFireability-14
FORMULA_NAME PhilosophersDyn-PT-10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679493685138

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PhilosophersDyn-PT-10
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 14:01:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 14:01:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 14:01:27] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2023-03-22 14:01:27] [INFO ] Transformed 170 places.
[2023-03-22 14:01:27] [INFO ] Transformed 2310 transitions.
[2023-03-22 14:01:27] [INFO ] Parsed PT model containing 170 places and 2310 transitions and 18190 arcs in 263 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 30 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
[2023-03-22 14:01:27] [INFO ] Reduced 89 identical enabling conditions.
[2023-03-22 14:01:27] [INFO ] Reduced 89 identical enabling conditions.
[2023-03-22 14:01:27] [INFO ] Reduced 89 identical enabling conditions.
[2023-03-22 14:01:27] [INFO ] Reduced 89 identical enabling conditions.
[2023-03-22 14:01:27] [INFO ] Reduced 89 identical enabling conditions.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
FORMULA PhilosophersDyn-PT-10-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-10-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-10-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-10-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 154 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 2265/2265 transitions.
Applied a total of 0 rules in 40 ms. Remains 170 /170 variables (removed 0) and now considering 2265/2265 (removed 0) transitions.
[2023-03-22 14:01:27] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
// Phase 1: matrix 1905 rows 170 cols
[2023-03-22 14:01:27] [INFO ] Computed 39 place invariants in 90 ms
[2023-03-22 14:01:28] [INFO ] Dead Transitions using invariants and state equation in 1198 ms found 380 transitions.
Found 380 dead transitions using SMT.
Drop transitions removed 380 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 380 transitions.
// Phase 1: matrix 1885 rows 170 cols
[2023-03-22 14:01:28] [INFO ] Computed 39 place invariants in 56 ms
[2023-03-22 14:01:36] [INFO ] Implicit Places using invariants in 7757 ms returned []
[2023-03-22 14:01:36] [INFO ] Invariant cache hit.
[2023-03-22 14:01:36] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 14:01:37] [INFO ] Implicit Places using invariants and state equation in 1329 ms returned []
Implicit Place search using SMT with State Equation took 9105 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 170/170 places, 1885/2265 transitions.
Applied a total of 0 rules in 15 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10399 ms. Remains : 170/170 places, 1885/2265 transitions.
Support contains 154 out of 170 places after structural reductions.
[2023-03-22 14:01:39] [INFO ] Flatten gal took : 344 ms
[2023-03-22 14:01:40] [INFO ] Flatten gal took : 236 ms
[2023-03-22 14:01:41] [INFO ] Input system was already deterministic with 1885 transitions.
Incomplete random walk after 10000 steps, including 1187 resets, run finished after 635 ms. (steps per millisecond=15 ) properties (out of 25) seen :21
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 73 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-22 14:01:41] [INFO ] Invariant cache hit.
[2023-03-22 14:01:48] [INFO ] After 26ms SMT Verify possible using all constraints in real 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' '!(X(F((F(p1)&&p0))))'
Support contains 130 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 9 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-22 14:01:52] [INFO ] Invariant cache hit.
[2023-03-22 14:01:53] [INFO ] Dead Transitions using invariants and state equation in 785 ms found 0 transitions.
[2023-03-22 14:01:53] [INFO ] Invariant cache hit.
[2023-03-22 14:01:53] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-22 14:01:53] [INFO ] Invariant cache hit.
[2023-03-22 14:01:54] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 14:01:56] [INFO ] Implicit Places using invariants and state equation in 2369 ms returned []
Implicit Place search using SMT with State Equation took 2465 ms to find 0 implicit places.
[2023-03-22 14:01:56] [INFO ] Invariant cache hit.
[2023-03-22 14:01:57] [INFO ] Dead Transitions using invariants and state equation in 1024 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4293 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 287 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s19 1) (GEQ s43 1) (GEQ s63 1) (GEQ s83 1) (GEQ s107 1) (GEQ s115 1) (GEQ s152 1) (GEQ s153 1) (GEQ s155 1)), p0:(AND (OR (LT s5 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 3 ms.
FORMULA PhilosophersDyn-PT-10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLFireability-00 finished in 4721 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 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 282 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-22 14:01:57] [INFO ] Invariant cache hit.
[2023-03-22 14:01:58] [INFO ] Dead Transitions using invariants and state equation in 876 ms found 0 transitions.
[2023-03-22 14:01:58] [INFO ] Invariant cache hit.
[2023-03-22 14:01:59] [INFO ] Implicit Places using invariants in 337 ms returned []
[2023-03-22 14:01:59] [INFO ] Invariant cache hit.
[2023-03-22 14:01:59] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 14:02:06] [INFO ] Implicit Places using invariants and state equation in 7195 ms returned []
Implicit Place search using SMT with State Equation took 7553 ms to find 0 implicit places.
[2023-03-22 14:02:06] [INFO ] Redundant transitions in 138 ms returned []
[2023-03-22 14:02:06] [INFO ] Invariant cache hit.
[2023-03-22 14:02:07] [INFO ] Dead Transitions using invariants and state equation in 821 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9687 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 33 ms :[p0]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s19 1) (GEQ s43 1) (GEQ s63 1) (GEQ s83 1) (GEQ s107 1) (GEQ s115 1) (GEQ s152 1) (GEQ s153 1) (GEQ s155 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 11951 reset in 1259 ms.
Product exploration explored 100000 steps with 11908 reset in 1145 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[p0]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 187 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[p0]
Stuttering acceptance computed with spot in 35 ms :[p0]
[2023-03-22 14:02:10] [INFO ] Invariant cache hit.
[2023-03-22 14:02:10] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2023-03-22 14:02:10] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 11 ms returned sat
[2023-03-22 14:02:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 14:02:11] [INFO ] [Real]Absence check using state equation in 365 ms returned sat
[2023-03-22 14:02:11] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 14:02:11] [INFO ] [Real]Added 1010 Read/Feed constraints in 224 ms returned sat
[2023-03-22 14:02:12] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 403 ms.
[2023-03-22 14:02:12] [INFO ] Added : 0 causal constraints over 0 iterations in 621 ms. Result :sat
Could not prove EG p0
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 271 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-22 14:02:12] [INFO ] Invariant cache hit.
[2023-03-22 14:02:13] [INFO ] Dead Transitions using invariants and state equation in 1005 ms found 0 transitions.
[2023-03-22 14:02:13] [INFO ] Invariant cache hit.
[2023-03-22 14:02:14] [INFO ] Implicit Places using invariants in 304 ms returned []
[2023-03-22 14:02:14] [INFO ] Invariant cache hit.
[2023-03-22 14:02:14] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 14:02:21] [INFO ] Implicit Places using invariants and state equation in 6873 ms returned []
Implicit Place search using SMT with State Equation took 7185 ms to find 0 implicit places.
[2023-03-22 14:02:21] [INFO ] Redundant transitions in 60 ms returned []
[2023-03-22 14:02:21] [INFO ] Invariant cache hit.
[2023-03-22 14:02:22] [INFO ] Dead Transitions using invariants and state equation in 848 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9413 ms. Remains : 170/170 places, 1885/1885 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 389 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[p0]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 159 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[p0]
Stuttering acceptance computed with spot in 28 ms :[p0]
[2023-03-22 14:02:22] [INFO ] Invariant cache hit.
[2023-03-22 14:02:23] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-22 14:02:23] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 11 ms returned sat
[2023-03-22 14:02:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 14:02:23] [INFO ] [Real]Absence check using state equation in 338 ms returned sat
[2023-03-22 14:02:23] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 14:02:24] [INFO ] [Real]Added 1010 Read/Feed constraints in 185 ms returned sat
[2023-03-22 14:02:24] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1840 transitions) in 226 ms.
[2023-03-22 14:02:24] [INFO ] Added : 0 causal constraints over 0 iterations in 398 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 3176 ms :[p0]
Product exploration explored 100000 steps with 11957 reset in 1124 ms.
Product exploration explored 100000 steps with 11960 reset in 1131 ms.
Support contains 10 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 132 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-22 14:02:30] [INFO ] Invariant cache hit.
[2023-03-22 14:02:31] [INFO ] Dead Transitions using invariants and state equation in 860 ms found 0 transitions.
[2023-03-22 14:02:31] [INFO ] Invariant cache hit.
[2023-03-22 14:02:31] [INFO ] Implicit Places using invariants in 303 ms returned []
[2023-03-22 14:02:31] [INFO ] Invariant cache hit.
[2023-03-22 14:02:31] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 14:02:38] [INFO ] Implicit Places using invariants and state equation in 6941 ms returned []
Implicit Place search using SMT with State Equation took 7272 ms to find 0 implicit places.
[2023-03-22 14:02:38] [INFO ] Redundant transitions in 74 ms returned []
[2023-03-22 14:02:38] [INFO ] Invariant cache hit.
[2023-03-22 14:02:39] [INFO ] Dead Transitions using invariants and state equation in 801 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9166 ms. Remains : 170/170 places, 1885/1885 transitions.
Treatment of property PhilosophersDyn-PT-10-LTLFireability-01 finished in 42338 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((F(p1)||p0))))'
Support contains 120 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 181 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-22 14:02:40] [INFO ] Invariant cache hit.
[2023-03-22 14:02:40] [INFO ] Dead Transitions using invariants and state equation in 858 ms found 0 transitions.
[2023-03-22 14:02:40] [INFO ] Invariant cache hit.
[2023-03-22 14:02:41] [INFO ] Implicit Places using invariants in 180 ms returned []
[2023-03-22 14:02:41] [INFO ] Invariant cache hit.
[2023-03-22 14:02:41] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 14:02:43] [INFO ] Implicit Places using invariants and state equation in 2365 ms returned []
Implicit Place search using SMT with State Equation took 2557 ms to find 0 implicit places.
[2023-03-22 14:02:43] [INFO ] Redundant transitions in 79 ms returned []
[2023-03-22 14:02:43] [INFO ] Invariant cache hit.
[2023-03-22 14:02:44] [INFO ] Dead Transitions using invariants and state equation in 954 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4661 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 3955 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s27 1) (GEQ s39 1) (GEQ s66 1)) (AND (GEQ s71 1) (GEQ s92 1) (GEQ s96 1)) (AND (GEQ s120 1) (GEQ s148 1) (GEQ s159 1)) (AND (GEQ s26 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 2 ms.
FORMULA PhilosophersDyn-PT-10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLFireability-04 finished in 8645 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 U (p1||G(!p0))))))'
Support contains 130 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 146 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-22 14:02:48] [INFO ] Invariant cache hit.
[2023-03-22 14:02:49] [INFO ] Dead Transitions using invariants and state equation in 923 ms found 0 transitions.
[2023-03-22 14:02:49] [INFO ] Invariant cache hit.
[2023-03-22 14:02:49] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-22 14:02:49] [INFO ] Invariant cache hit.
[2023-03-22 14:02:49] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 14:02:51] [INFO ] Implicit Places using invariants and state equation in 2187 ms returned []
Implicit Place search using SMT with State Equation took 2285 ms to find 0 implicit places.
[2023-03-22 14:02:51] [INFO ] Redundant transitions in 77 ms returned []
[2023-03-22 14:02:51] [INFO ] Invariant cache hit.
[2023-03-22 14:02:52] [INFO ] Dead Transitions using invariants and state equation in 821 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4265 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (AND (GEQ s0 1) (GEQ s19 1) (GEQ s43 1) (GEQ s63 1) (GEQ s83 1) (GEQ s107 1) (GEQ s115 1) (GEQ s152 1) (GEQ s153 1) (GEQ s155 1))) (OR (AND (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 19310 reset in 4325 ms.
Product exploration explored 100000 steps with 19281 reset in 4152 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 4 factoid took 9057 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 6 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 351 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 92 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
[2023-03-22 14:03:17] [INFO ] Invariant cache hit.
Could not prove EG (AND p0 (NOT p1))
Support contains 130 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 114 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-22 14:03:32] [INFO ] Invariant cache hit.
[2023-03-22 14:03:33] [INFO ] Dead Transitions using invariants and state equation in 1486 ms found 0 transitions.
[2023-03-22 14:03:33] [INFO ] Invariant cache hit.
[2023-03-22 14:03:33] [INFO ] Implicit Places using invariants in 156 ms returned []
[2023-03-22 14:03:33] [INFO ] Invariant cache hit.
[2023-03-22 14:03:34] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 14:03:36] [INFO ] Implicit Places using invariants and state equation in 2439 ms returned []
Implicit Place search using SMT with State Equation took 2604 ms to find 0 implicit places.
[2023-03-22 14:03:36] [INFO ] Redundant transitions in 79 ms returned []
[2023-03-22 14:03:36] [INFO ] Invariant cache hit.
[2023-03-22 14:03:37] [INFO ] Dead Transitions using invariants and state equation in 808 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5126 ms. Remains : 170/170 places, 1885/1885 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 4 factoid took 2316 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 5 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 245 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 2043 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
[2023-03-22 14:03:44] [INFO ] Invariant cache hit.
Could not prove EG (AND p0 (NOT p1))
Stuttering acceptance computed with spot in 2474 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 19360 reset in 1702 ms.
Product exploration explored 100000 steps with 19360 reset in 1686 ms.
Support contains 130 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 136 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-22 14:04:05] [INFO ] Invariant cache hit.
[2023-03-22 14:04:06] [INFO ] Dead Transitions using invariants and state equation in 822 ms found 0 transitions.
[2023-03-22 14:04:06] [INFO ] Invariant cache hit.
[2023-03-22 14:04:06] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-22 14:04:06] [INFO ] Invariant cache hit.
[2023-03-22 14:04:07] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 14:04:08] [INFO ] Implicit Places using invariants and state equation in 2235 ms returned []
Implicit Place search using SMT with State Equation took 2351 ms to find 0 implicit places.
[2023-03-22 14:04:09] [INFO ] Redundant transitions in 77 ms returned []
[2023-03-22 14:04:09] [INFO ] Invariant cache hit.
[2023-03-22 14:04:09] [INFO ] Dead Transitions using invariants and state equation in 798 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4215 ms. Remains : 170/170 places, 1885/1885 transitions.
Treatment of property PhilosophersDyn-PT-10-LTLFireability-06 finished in 81518 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(G(((p2 U p3)||p1))))))'
Support contains 150 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 134 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-22 14:04:10] [INFO ] Invariant cache hit.
[2023-03-22 14:04:11] [INFO ] Dead Transitions using invariants and state equation in 888 ms found 0 transitions.
[2023-03-22 14:04:11] [INFO ] Invariant cache hit.
[2023-03-22 14:04:11] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-22 14:04:11] [INFO ] Invariant cache hit.
[2023-03-22 14:04:11] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 14:04:12] [INFO ] Implicit Places using invariants and state equation in 1345 ms returned []
Implicit Place search using SMT with State Equation took 1451 ms to find 0 implicit places.
[2023-03-22 14:04:12] [INFO ] Redundant transitions in 77 ms returned []
[2023-03-22 14:04:12] [INFO ] Invariant cache hit.
[2023-03-22 14:04:13] [INFO ] Dead Transitions using invariants and state equation in 847 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3425 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 1113 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLFireability-07 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 (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={1} source=2 dest: 1}, { cond=(OR p1 p3 p2), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={0, 1} source=2 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={1} source=2 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={0, 1} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={1} source=3 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p0 (NOT p3) p2), acceptance={1} source=3 dest: 4}, { cond=(AND p0 (NOT p3) p2), acceptance={0, 1} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={1} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p0 (NOT p3) p2), acceptance={1} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={1} source=5 dest: 1}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={0} source=5 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={1} source=5 dest: 4}, { cond=(AND p1 (NOT p3) p2), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={0, 1} source=5 dest: 5}]], initial=0, aps=[p0:(OR (AND (LT s4 1) (LT s21 1) (LT s22 1) (LT s86 1) (LT s41 1) (LT s72 1) (LT s136 1) (LT s11 1) (LT s58 1) (LT s46 1)) (AND (GEQ s27 1) (GEQ s39 1) (G...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-PT-10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLFireability-07 finished in 4651 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((p0&&F(G(((p2||G(!p0))&&p1))))))'
Support contains 6 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 9 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-22 14:04:14] [INFO ] Invariant cache hit.
[2023-03-22 14:04:15] [INFO ] Dead Transitions using invariants and state equation in 883 ms found 0 transitions.
[2023-03-22 14:04:15] [INFO ] Invariant cache hit.
[2023-03-22 14:04:16] [INFO ] Implicit Places using invariants in 403 ms returned []
[2023-03-22 14:04:16] [INFO ] Invariant cache hit.
[2023-03-22 14:04:16] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 14:04:23] [INFO ] Implicit Places using invariants and state equation in 7277 ms returned []
Implicit Place search using SMT with State Equation took 7706 ms to find 0 implicit places.
[2023-03-22 14:04:23] [INFO ] Invariant cache hit.
[2023-03-22 14:04:24] [INFO ] Dead Transitions using invariants and state equation in 756 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9379 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 886 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (OR (NOT p1) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0, 1} source=2 dest: 2}], [{ cond=(OR (AND p2 p1) (AND p1 (NOT p0))), acceptance={0} source=3 dest: 3}, { cond=(OR (AND (NOT p2) p0) (NOT p1)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={1} source=3 dest: 4}], [{ cond=(AND p2 p1 p0), acceptance={0} source=4 dest: 3}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p1) p0)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s41 1), p2:(GEQ s58 1), p1:(AND (GEQ s3 1) (GEQ s5 1) (GEQ s136 1) (GEQ s142 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-PT-10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLFireability-08 finished in 10306 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(p0)||F(p1)))'
Support contains 4 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 121 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-22 14:04:25] [INFO ] Invariant cache hit.
[2023-03-22 14:04:25] [INFO ] Dead Transitions using invariants and state equation in 859 ms found 0 transitions.
[2023-03-22 14:04:25] [INFO ] Invariant cache hit.
[2023-03-22 14:04:26] [INFO ] Implicit Places using invariants in 347 ms returned []
[2023-03-22 14:04:26] [INFO ] Invariant cache hit.
[2023-03-22 14:04:26] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 14:04:33] [INFO ] Implicit Places using invariants and state equation in 7174 ms returned []
Implicit Place search using SMT with State Equation took 7554 ms to find 0 implicit places.
[2023-03-22 14:04:33] [INFO ] Redundant transitions in 57 ms returned []
[2023-03-22 14:04:33] [INFO ] Invariant cache hit.
[2023-03-22 14:04:34] [INFO ] Dead Transitions using invariants and state equation in 825 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9447 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(AND (GEQ s35 1) (GEQ s81 1) (GEQ s118 1)), p0:(LT s72 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 16 steps with 1 reset in 1 ms.
FORMULA PhilosophersDyn-PT-10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLFireability-09 finished in 9572 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(G(p0))||(!p1 U (p2||G(!p1)))))'
Support contains 15 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 11 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-22 14:04:34] [INFO ] Invariant cache hit.
[2023-03-22 14:04:35] [INFO ] Dead Transitions using invariants and state equation in 819 ms found 0 transitions.
[2023-03-22 14:04:35] [INFO ] Invariant cache hit.
[2023-03-22 14:04:35] [INFO ] Implicit Places using invariants in 292 ms returned []
[2023-03-22 14:04:35] [INFO ] Invariant cache hit.
[2023-03-22 14:04:36] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 14:04:42] [INFO ] Implicit Places using invariants and state equation in 6676 ms returned []
Implicit Place search using SMT with State Equation took 6969 ms to find 0 implicit places.
[2023-03-22 14:04:42] [INFO ] Invariant cache hit.
[2023-03-22 14:04:43] [INFO ] Dead Transitions using invariants and state equation in 695 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8513 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 148 ms :[true, (AND (NOT p2) p1 (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2) p1), (AND (NOT p2) p1)]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(AND (GEQ s26 1) (GEQ s44 1) (GEQ s99 1) (NOT (AND (GEQ s38 1) (GEQ s108 1)))), p1:(AND (GEQ s38 1) (GEQ s108 1)), p0:(AND (GEQ s0 1) (GEQ s19 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 12 steps with 1 reset in 1 ms.
FORMULA PhilosophersDyn-PT-10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLFireability-10 finished in 8681 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((!p0||G(!p1)))&&F(!p1)) U X(p0)))'
Support contains 5 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 8 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-22 14:04:43] [INFO ] Invariant cache hit.
[2023-03-22 14:04:44] [INFO ] Dead Transitions using invariants and state equation in 814 ms found 0 transitions.
[2023-03-22 14:04:44] [INFO ] Invariant cache hit.
[2023-03-22 14:04:44] [INFO ] Implicit Places using invariants in 345 ms returned []
[2023-03-22 14:04:44] [INFO ] Invariant cache hit.
[2023-03-22 14:04:44] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 14:04:51] [INFO ] Implicit Places using invariants and state equation in 7094 ms returned []
Implicit Place search using SMT with State Equation took 7449 ms to find 0 implicit places.
[2023-03-22 14:04:51] [INFO ] Invariant cache hit.
[2023-03-22 14:04:52] [INFO ] Dead Transitions using invariants and state equation in 692 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8987 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 246 ms :[p1, true, (NOT p0), (NOT p0), (NOT p0), (OR (NOT p0) p1), (NOT p0), (OR (NOT p0) p1)]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 0}, { cond=p1, acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 7}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=7 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=7 dest: 1}, { cond=(NOT p0), acceptance={0} source=7 dest: 7}]], initial=2, aps=[p1:(AND (GEQ s77 1) (GEQ s97 1)), p0:(AND (GEQ s12 1) (GEQ s57 1) (GEQ s68 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-PT-10-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLFireability-11 finished in 9272 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(G(p0)))'
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 9 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-22 14:04:52] [INFO ] Invariant cache hit.
[2023-03-22 14:04:53] [INFO ] Dead Transitions using invariants and state equation in 798 ms found 0 transitions.
[2023-03-22 14:04:53] [INFO ] Invariant cache hit.
[2023-03-22 14:04:53] [INFO ] Implicit Places using invariants in 343 ms returned []
[2023-03-22 14:04:53] [INFO ] Invariant cache hit.
[2023-03-22 14:04:54] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 14:05:00] [INFO ] Implicit Places using invariants and state equation in 7193 ms returned []
Implicit Place search using SMT with State Equation took 7561 ms to find 0 implicit places.
[2023-03-22 14:05:00] [INFO ] Invariant cache hit.
[2023-03-22 14:05:01] [INFO ] Dead Transitions using invariants and state equation in 838 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9220 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s28 1) (GEQ s39 1) (GEQ s66 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-PT-10-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLFireability-12 finished in 9317 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 8 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 114 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-22 14:05:01] [INFO ] Invariant cache hit.
[2023-03-22 14:05:02] [INFO ] Dead Transitions using invariants and state equation in 861 ms found 0 transitions.
[2023-03-22 14:05:02] [INFO ] Invariant cache hit.
[2023-03-22 14:05:03] [INFO ] Implicit Places using invariants in 325 ms returned []
[2023-03-22 14:05:03] [INFO ] Invariant cache hit.
[2023-03-22 14:05:03] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 14:05:10] [INFO ] Implicit Places using invariants and state equation in 7080 ms returned []
Implicit Place search using SMT with State Equation took 7426 ms to find 0 implicit places.
[2023-03-22 14:05:10] [INFO ] Redundant transitions in 61 ms returned []
[2023-03-22 14:05:10] [INFO ] Invariant cache hit.
[2023-03-22 14:05:11] [INFO ] Dead Transitions using invariants and state equation in 799 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9288 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLFireability-13 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:(AND (GEQ s13 1) (GEQ s18 1) (GEQ s63 1) (GEQ s108 1)), p1:(AND (GEQ s3 1) (GEQ s125 1) (GEQ s130 1) (GEQ s72 1))], 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 7 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-PT-10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLFireability-13 finished in 9439 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)))&&(G(p1)||X(G(p2)))) U p0))'
Support contains 9 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 8 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-22 14:05:11] [INFO ] Invariant cache hit.
[2023-03-22 14:05:12] [INFO ] Dead Transitions using invariants and state equation in 843 ms found 0 transitions.
[2023-03-22 14:05:12] [INFO ] Invariant cache hit.
[2023-03-22 14:05:12] [INFO ] Implicit Places using invariants in 336 ms returned []
[2023-03-22 14:05:12] [INFO ] Invariant cache hit.
[2023-03-22 14:05:12] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 14:05:19] [INFO ] Implicit Places using invariants and state equation in 7005 ms returned []
Implicit Place search using SMT with State Equation took 7361 ms to find 0 implicit places.
[2023-03-22 14:05:19] [INFO ] Invariant cache hit.
[2023-03-22 14:05:20] [INFO ] Dead Transitions using invariants and state equation in 810 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9032 ms. Remains : 170/170 places, 1885/1885 transitions.
Stuttering acceptance computed with spot in 3455 ms :[(NOT p0), (NOT p0), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p0), (NOT p0), true, (NOT p1)]
Running random walk in product with property : PhilosophersDyn-PT-10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 6}, { cond=p1, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(GEQ s46 1), p1:(AND (GEQ s26 1) (GEQ s99 1) (GEQ s128 1)), p2:(OR (GEQ s22 1) (AND (GEQ s31 1) (GEQ s80 1) (GEQ s108 1) (GEQ s153 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 4 ms.
FORMULA PhilosophersDyn-PT-10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-10-LTLFireability-15 finished in 12519 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)))'
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 U (p1||G(!p0))))))'
[2023-03-22 14:05:24] [INFO ] Flatten gal took : 113 ms
[2023-03-22 14:05:24] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 14 ms.
[2023-03-22 14:05:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 170 places, 1885 transitions and 14300 arcs took 12 ms.
Total runtime 237417 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1213/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1213/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 1785 seconds
MemTotal: 16393216 kB
MemFree: 8308736 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16065812 kB
Could not compute solution for formula : PhilosophersDyn-PT-10-LTLFireability-01
Could not compute solution for formula : PhilosophersDyn-PT-10-LTLFireability-06

BK_STOP 1679495712799

--------------------
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 LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name PhilosophersDyn-PT-10-LTLFireability-01
ltl formula formula --ltl=/tmp/1213/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 170 places, 1885 transitions and 14300 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1213/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1213/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.720 real 0.060 user 0.090 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1213/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1213/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name PhilosophersDyn-PT-10-LTLFireability-06
ltl formula formula --ltl=/tmp/1213/ltl_1_
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 170 places, 1885 transitions and 14300 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1213/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1213/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.610 real 0.080 user 0.100 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1213/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1213/ltl_1_
Killing (15) : 1225 1226 1227 1228 1229
Killing (9) : 1225 1226 1227 1228 1229

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-10"
export BK_EXAMINATION="LTLFireability"
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-10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r297-tall-167873950300324"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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