Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r285-smll-171654422400307.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is Philosophers-PT-000010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r285-smll-171654422400307
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 17K Apr 13 09:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 13 09:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 13 09:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 13 09:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 7.6K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 40K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 13 09:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Apr 13 09:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Apr 13 09:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 136K Apr 13 09:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.9K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 22K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Philosophers-PT-000010-LTLCardinality-00
FORMULA_NAME Philosophers-PT-000010-LTLCardinality-01
FORMULA_NAME Philosophers-PT-000010-LTLCardinality-02
FORMULA_NAME Philosophers-PT-000010-LTLCardinality-03
FORMULA_NAME Philosophers-PT-000010-LTLCardinality-04
FORMULA_NAME Philosophers-PT-000010-LTLCardinality-05
FORMULA_NAME Philosophers-PT-000010-LTLCardinality-06
FORMULA_NAME Philosophers-PT-000010-LTLCardinality-07
FORMULA_NAME Philosophers-PT-000010-LTLCardinality-08
FORMULA_NAME Philosophers-PT-000010-LTLCardinality-09
FORMULA_NAME Philosophers-PT-000010-LTLCardinality-10
FORMULA_NAME Philosophers-PT-000010-LTLCardinality-11
FORMULA_NAME Philosophers-PT-000010-LTLCardinality-12
FORMULA_NAME Philosophers-PT-000010-LTLCardinality-13
FORMULA_NAME Philosophers-PT-000010-LTLCardinality-14
FORMULA_NAME Philosophers-PT-000010-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716994103505

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-PT-000010
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-29 14:48:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 14:48:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 14:48:27] [INFO ] Load time of PNML (sax parser for PT used): 180 ms
[2024-05-29 14:48:27] [INFO ] Transformed 50 places.
[2024-05-29 14:48:27] [INFO ] Transformed 50 transitions.
[2024-05-29 14:48:27] [INFO ] Found NUPN structural information;
[2024-05-29 14:48:27] [INFO ] Parsed PT model containing 50 places and 50 transitions and 160 arcs in 380 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA Philosophers-PT-000010-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000010-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000010-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000010-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000010-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000010-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 15 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2024-05-29 14:48:27] [INFO ] Computed 20 invariants in 7 ms
[2024-05-29 14:48:27] [INFO ] Implicit Places using invariants in 243 ms returned []
[2024-05-29 14:48:27] [INFO ] Invariant cache hit.
[2024-05-29 14:48:27] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
[2024-05-29 14:48:27] [INFO ] Invariant cache hit.
[2024-05-29 14:48:28] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 579 ms. Remains : 50/50 places, 50/50 transitions.
Support contains 50 out of 50 places after structural reductions.
[2024-05-29 14:48:28] [INFO ] Flatten gal took : 37 ms
[2024-05-29 14:48:28] [INFO ] Flatten gal took : 15 ms
[2024-05-29 14:48:28] [INFO ] Input system was already deterministic with 50 transitions.
Finished random walk after 189 steps, including 0 resets, run visited all 18 properties in 28 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 20 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 10 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-05-29 14:48:28] [INFO ] Invariant cache hit.
[2024-05-29 14:48:29] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-29 14:48:29] [INFO ] Invariant cache hit.
[2024-05-29 14:48:29] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
[2024-05-29 14:48:29] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 14:48:29] [INFO ] Invariant cache hit.
[2024-05-29 14:48:29] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 383 ms. Remains : 50/50 places, 50/50 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 305 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Philosophers-PT-000010-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 3 (ADD s29 s30 s32 s33 s34 s35 s36 s37 s39 s40)), p0:(LEQ 1 (ADD s38 s41 s42 s43 s44 s45 s46 s47 s48 s49))], 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 52 steps with 0 reset in 7 ms.
FORMULA Philosophers-PT-000010-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-LTLCardinality-01 finished in 800 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||(p0&&(p1||X(F(p2)))))))'
Support contains 40 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-05-29 14:48:29] [INFO ] Invariant cache hit.
[2024-05-29 14:48:29] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-29 14:48:29] [INFO ] Invariant cache hit.
[2024-05-29 14:48:29] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2024-05-29 14:48:29] [INFO ] Invariant cache hit.
[2024-05-29 14:48:29] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 285 ms. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 252 ms :[true, (NOT p2), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : Philosophers-PT-000010-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p2:(LEQ 2 (ADD s10 s11 s12 s13 s14 s15 s16 s17 s18 s20)), p0:(LEQ (ADD s38 s41 s42 s43 s44 s45 s46 s47 s48 s49) (ADD s29 s30 s32 s33 s34 s35 s36 s37 s39 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 749 ms.
Product exploration explored 100000 steps with 33333 reset in 411 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 p2 p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 21 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Philosophers-PT-000010-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-PT-000010-LTLCardinality-02 finished in 1759 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 20 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 5 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-05-29 14:48:31] [INFO ] Invariant cache hit.
[2024-05-29 14:48:31] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-29 14:48:31] [INFO ] Invariant cache hit.
[2024-05-29 14:48:31] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2024-05-29 14:48:31] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 14:48:31] [INFO ] Invariant cache hit.
[2024-05-29 14:48:31] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 290 ms. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Philosophers-PT-000010-LTLCardinality-03 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:(GT 1 (ADD s10 s11 s12 s13 s14 s15 s16 s17 s18 s20)), p1:(LEQ 1 (ADD s38 s41 s42 s43 s44 s45 s46 s47 s48 s49))], 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 282 steps with 1 reset in 9 ms.
FORMULA Philosophers-PT-000010-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-LTLCardinality-03 finished in 453 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(!p0))&&F(p0))))'
Support contains 10 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-05-29 14:48:31] [INFO ] Invariant cache hit.
[2024-05-29 14:48:31] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-29 14:48:31] [INFO ] Invariant cache hit.
[2024-05-29 14:48:32] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2024-05-29 14:48:32] [INFO ] Invariant cache hit.
[2024-05-29 14:48:32] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 284 ms. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 295 ms :[true, true, (NOT p0), p0]
Running random walk in product with property : Philosophers-PT-000010-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 1 (ADD s38 s41 s42 s43 s44 s45 s46 s47 s48 s49))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 83134 steps with 1079 reset in 274 ms.
FORMULA Philosophers-PT-000010-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-LTLCardinality-04 finished in 875 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X((!p1 U (p2||G(!p1))))&&p0))))'
Support contains 50 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-05-29 14:48:32] [INFO ] Invariant cache hit.
[2024-05-29 14:48:32] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-29 14:48:32] [INFO ] Invariant cache hit.
[2024-05-29 14:48:32] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2024-05-29 14:48:32] [INFO ] Invariant cache hit.
[2024-05-29 14:48:32] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 160 ms. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 158 ms :[true, (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : Philosophers-PT-000010-LTLCardinality-06 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: 3}], [{ cond=(OR (NOT p0) (AND (NOT p2) p1)), acceptance={} source=3 dest: 0}, { cond=(OR (AND p0 p2) (AND p0 (NOT p1))), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GT 3 (ADD s29 s30 s32 s33 s34 s35 s36 s37 s39 s40)) (OR (GT 2 (ADD s29 s30 s32 s33 s34 s35 s36 s37 s39 s40)) (GT (ADD s19 s21 s22 s23 s24 s25 s26...], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Philosophers-PT-000010-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-LTLCardinality-06 finished in 337 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 20 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-05-29 14:48:33] [INFO ] Invariant cache hit.
[2024-05-29 14:48:33] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-29 14:48:33] [INFO ] Invariant cache hit.
[2024-05-29 14:48:33] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2024-05-29 14:48:33] [INFO ] Invariant cache hit.
[2024-05-29 14:48:33] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 218 ms. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 191 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-PT-000010-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(GT 3 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9)), p0:(LEQ 2 (ADD s19 s21 s22 s23 s24 s25 s26 s27 s28 s31))], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Philosophers-PT-000010-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-LTLCardinality-07 finished in 424 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 40 transition count 40
Applied a total of 20 rules in 15 ms. Remains 40 /50 variables (removed 10) and now considering 40/50 (removed 10) transitions.
// Phase 1: matrix 40 rows 40 cols
[2024-05-29 14:48:33] [INFO ] Computed 20 invariants in 2 ms
[2024-05-29 14:48:33] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-29 14:48:33] [INFO ] Invariant cache hit.
[2024-05-29 14:48:33] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2024-05-29 14:48:33] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 14:48:33] [INFO ] Invariant cache hit.
[2024-05-29 14:48:33] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/50 places, 40/50 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 264 ms. Remains : 40/50 places, 40/50 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-000010-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s24 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 111 steps with 3 reset in 2 ms.
FORMULA Philosophers-PT-000010-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-LTLCardinality-11 finished in 341 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G(p0)||(p0&&G(!p1)))))'
Support contains 3 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 43 transition count 43
Applied a total of 14 rules in 12 ms. Remains 43 /50 variables (removed 7) and now considering 43/50 (removed 7) transitions.
// Phase 1: matrix 43 rows 43 cols
[2024-05-29 14:48:33] [INFO ] Computed 20 invariants in 1 ms
[2024-05-29 14:48:33] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-29 14:48:33] [INFO ] Invariant cache hit.
[2024-05-29 14:48:34] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
[2024-05-29 14:48:34] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 14:48:34] [INFO ] Invariant cache hit.
[2024-05-29 14:48:34] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/50 places, 43/50 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 258 ms. Remains : 43/50 places, 43/50 transitions.
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (AND (NOT p0) p1), p1]
Running random walk in product with property : Philosophers-PT-000010-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s10 1), p1:(AND (EQ s10 1) (OR (EQ s24 0) (EQ s5 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Philosophers-PT-000010-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-LTLCardinality-12 finished in 443 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G((p0||G(p1))))&&(X(G(p2))||G(p3)))))'
Support contains 4 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 41 transition count 41
Applied a total of 18 rules in 6 ms. Remains 41 /50 variables (removed 9) and now considering 41/50 (removed 9) transitions.
// Phase 1: matrix 41 rows 41 cols
[2024-05-29 14:48:34] [INFO ] Computed 20 invariants in 2 ms
[2024-05-29 14:48:34] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-29 14:48:34] [INFO ] Invariant cache hit.
[2024-05-29 14:48:34] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2024-05-29 14:48:34] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 14:48:34] [INFO ] Invariant cache hit.
[2024-05-29 14:48:34] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/50 places, 41/50 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 254 ms. Remains : 41/50 places, 41/50 transitions.
Stuttering acceptance computed with spot in 773 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : Philosophers-PT-000010-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}, { cond=p3, acceptance={} source=0 dest: 3}], [{ cond=(OR p0 p1), acceptance={0, 1, 3} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1, 2, 3} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={0, 1, 2, 3} source=1 dest: 2}, { cond=(AND p3 (NOT p0) (NOT p1)), acceptance={1, 2, 3} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0, 2, 3} source=1 dest: 4}, { cond=(AND (NOT p3) (NOT p0) p1), acceptance={0, 2, 3} source=1 dest: 5}, { cond=(AND p3 (NOT p0) p1), acceptance={2, 3} source=1 dest: 6}], [{ cond=(NOT p2), acceptance={0, 1, 2, 3} source=2 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={0, 1, 2} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0, 1, 2, 3} source=2 dest: 2}, { cond=(AND p3 p2), acceptance={1, 2} source=2 dest: 3}, { cond=(AND p3 (NOT p2)), acceptance={1, 2, 3} source=2 dest: 3}, { cond=(AND p3 p2), acceptance={0, 1, 2} source=2 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0, 1, 2, 3} source=3 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={0, 1, 2} source=3 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0, 1, 2, 3} source=3 dest: 2}, { cond=(AND p3 p2), acceptance={1, 2} source=3 dest: 3}, { cond=(AND p3 (NOT p2)), acceptance={1, 2, 3} source=3 dest: 3}, { cond=(AND p3 (NOT p2)), acceptance={1, 2, 3} source=3 dest: 8}], [{ cond=(AND p0 (NOT p1)), acceptance={0, 1, 3} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1, 2, 3} source=4 dest: 1}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={0, 1, 2, 3} source=4 dest: 2}, { cond=(AND p3 (NOT p0) (NOT p1)), acceptance={1, 2, 3} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={0, 3} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0, 2, 3} source=4 dest: 4}, { cond=(AND (NOT p3) (NOT p0) p1), acceptance={0, 2, 3} source=4 dest: 5}, { cond=(AND p3 (NOT p0) p1), acceptance={2, 3} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1, 2, 3} source=5 dest: 1}, { cond=(AND (NOT p3) (NOT p1) p2), acceptance={0, 1, 2} source=5 dest: 2}, { cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={0, 1, 2, 3} source=5 dest: 2}, { cond=(AND p3 (NOT p1) p2), acceptance={1, 2} source=5 dest: 3}, { cond=(AND p3 (NOT p1) (NOT p2)), acceptance={1, 2, 3} source=5 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0, 2, 3} source=5 dest: 4}, { cond=(AND (NOT p3) p1 p2), acceptance={0, 2} source=5 dest: 5}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={0, 2, 3} source=5 dest: 5}, { cond=(AND p3 p1 p2), acceptance={2} source=5 dest: 6}, { cond=(AND p3 p1 (NOT p2)), acceptance={2, 3} source=5 dest: 6}, { cond=(AND p3 (NOT p1) p2), acceptance={0, 1, 2} source=5 dest: 7}, { cond=(AND p3 p1 p2), acceptance={0, 2} source=5 dest: 9}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={0, 1, 2, 3} source=6 dest: 1}, { cond=(AND (NOT p3) (NOT p1) p2), acceptance={0, 1, 2} source=6 dest: 2}, { cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={0, 1, 2, 3} source=6 dest: 2}, { cond=(AND p3 (NOT p1) p2), acceptance={1, 2} source=6 dest: 3}, { cond=(AND p3 (NOT p1) (NOT p2)), acceptance={1, 2, 3} source=6 dest: 3}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={0, 2, 3} source=6 dest: 4}, { cond=(AND (NOT p3) p1 p2), acceptance={0, 2} source=6 dest: 5}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={0, 2, 3} source=6 dest: 5}, { cond=(AND p3 p1 p2), acceptance={2} source=6 dest: 6}, { cond=(AND p3 p1 (NOT p2)), acceptance={2, 3} source=6 dest: 6}, { cond=(AND p3 (NOT p1) (NOT p2)), acceptance={1, 2, 3} source=6 dest: 8}, { cond=(AND p3 p1 (NOT p2)), acceptance={2, 3} source=6 dest: 10}], [{ cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={0, 1, 3} source=7 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1, 2, 3} source=7 dest: 1}, { cond=(AND (NOT p3) (NOT p0) (NOT p1) p2), acceptance={0, 1, 2} source=7 dest: 2}, { cond=(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1, 2, 3} source=7 dest: 2}, { cond=(AND p3 (NOT p0) (NOT p1) p2), acceptance={1, 2} source=7 dest: 3}, { cond=(AND p3 (NOT p0) (NOT p1) (NOT p2)), acceptance={1, 2, 3} source=7 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 2, 3} source=7 dest: 4}, { cond=(AND (NOT p3) (NOT p0) p1 p2), acceptance={0, 2} source=7 dest: 5}, { cond=(AND (NOT p3) (NOT p0) p1 (NOT p2)), acceptance={0, 2, 3} source=7 dest: 5}, { cond=(AND p3 (NOT p0) p1 p2), acceptance={2} source=7 dest: 6}, { cond=(AND p3 (NOT p0) p1 (NOT p2)), acceptance={2, 3} source=7 dest: 6}, { cond=(OR (AND p0 p2) (AND p1 p2)), acceptance={0, 1} source=7 dest: 7}, { cond=(AND p3 (NOT p0) (NOT p1) p2), acceptance={0, 1, 2} source=7 dest: 7}, { cond=(AND p3 (NOT p0) p1 p2), acceptance={0, 2} source=7 dest: 9}], [{ cond=(OR (AND (NOT p3) p0) (AND (NOT p3) p1)), acceptance={0, 1, 3} source=8 dest: 1}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={0, 1, 2, 3} source=8 dest: 1}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={0, 1, 2, 3} source=8 dest: 2}, { cond=(AND p3 (NOT p0) (NOT p1)), acceptance={1, 2, 3} source=8 dest: 3}, { cond=(AND (NOT p3) (NOT p0) p1), acceptance={0, 2, 3} source=8 dest: 4}, { cond=(AND (NOT p3) (NOT p0) p1), acceptance={0, 2, 3} source=8 dest: 5}, { cond=(AND p3 (NOT p0) p1), acceptance={2, 3} source=8 dest: 6}, { cond=(OR (AND p3 p0) (AND p3 p1)), acceptance={1, 3} source=8 dest: 8}, { cond=(AND p3 (NOT p0) (NOT p1)), acceptance={1, 2, 3} source=8 dest: 8}, { cond=(AND p3 (NOT p0) p1), acceptance={2, 3} source=8 dest: 10}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1, 3} source=9 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1, 2, 3} source=9 dest: 1}, { cond=(AND (NOT p3) (NOT p0) (NOT p1) p2), acceptance={0, 1, 2} source=9 dest: 2}, { cond=(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1, 2, 3} source=9 dest: 2}, { cond=(AND p3 (NOT p0) (NOT p1) p2), acceptance={1, 2} source=9 dest: 3}, { cond=(AND p3 (NOT p0) (NOT p1) (NOT p2)), acceptance={1, 2, 3} source=9 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 3} source=9 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 2, 3} source=9 dest: 4}, { cond=(AND (NOT p3) (NOT p0) p1 p2), acceptance={0, 2} source=9 dest: 5}, { cond=(AND (NOT p3) (NOT p0) p1 (NOT p2)), acceptance={0, 2, 3} source=9 dest: 5}, { cond=(AND p3 (NOT p0) p1 p2), acceptance={2} source=9 dest: 6}, { cond=(AND p3 (NOT p0) p1 (NOT p2)), acceptance={2, 3} source=9 dest: 6}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 1} source=9 dest: 7}, { cond=(AND p3 (NOT p0) (NOT p1) p2), acceptance={0, 1, 2} source=9 dest: 7}, { cond=(AND p0 p1 p2), acceptance={0} source=9 dest: 9}, { cond=(AND p3 (NOT p0) p1 p2), acceptance={0, 2} source=9 dest: 9}], [{ cond=(AND (NOT p3) p0 (NOT p1)), acceptance={0, 1, 3} source=10 dest: 1}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={0, 1, 2, 3} source=10 dest: 1}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={0, 1, 2, 3} source=10 dest: 2}, { cond=(AND p3 (NOT p0) (NOT p1)), acceptance={1, 2, 3} source=10 dest: 3}, { cond=(AND (NOT p3) p0 p1), acceptance={0, 3} source=10 dest: 4}, { cond=(AND (NOT p3) (NOT p0) p1), acceptance={0, 2, 3} source=10 dest: 4}, { cond=(AND (NOT p3) (NOT p0) p1), acceptance={0, 2, 3} source=10 dest: 5}, { cond=(AND p3 (NOT p0) p1), acceptance={2, 3} source=10 dest: 6}, { cond=(AND p3 p0 (NOT p1)), acceptance={1, 3} source=10 dest: 8}, { cond=(AND p3 (NOT p0) (NOT p1)), acceptance={1, 2, 3} source=10 dest: 8}, { cond=(AND p3 p0 p1), acceptance={3} source=10 dest: 10}, { cond=(AND p3 (NOT p0) p1), acceptance={2, 3} source=10 dest: 10}]], initial=0, aps=[p3:(EQ s32 1), p0:(EQ s32 0), p1:(EQ s28 1), p2:(OR (EQ s5 0) (EQ s19 1))], nbAcceptance=4, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 20080 steps with 199 reset in 123 ms.
FORMULA Philosophers-PT-000010-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000010-LTLCardinality-14 finished in 1204 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 41 transition count 41
Applied a total of 18 rules in 9 ms. Remains 41 /50 variables (removed 9) and now considering 41/50 (removed 9) transitions.
// Phase 1: matrix 41 rows 41 cols
[2024-05-29 14:48:35] [INFO ] Computed 20 invariants in 2 ms
[2024-05-29 14:48:35] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-29 14:48:35] [INFO ] Invariant cache hit.
[2024-05-29 14:48:35] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2024-05-29 14:48:35] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 14:48:35] [INFO ] Invariant cache hit.
[2024-05-29 14:48:35] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/50 places, 41/50 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 267 ms. Remains : 41/50 places, 41/50 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-000010-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s19 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 948 reset in 277 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA Philosophers-PT-000010-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000010-LTLCardinality-15 finished in 603 ms.
All properties solved by simple procedures.
Total runtime 9342 ms.

BK_STOP 1716994117133

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Philosophers-PT-000010"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is Philosophers-PT-000010, 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 r285-smll-171654422400307"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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