Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 5.0K Feb 25 13:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 46K Feb 25 13:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 13:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 13:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 13:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Feb 25 13:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 13:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Feb 25 13:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 9.7K 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 Philosophers-COL-000005-LTLCardinality-00
FORMULA_NAME Philosophers-COL-000005-LTLCardinality-01
FORMULA_NAME Philosophers-COL-000005-LTLCardinality-02
FORMULA_NAME Philosophers-COL-000005-LTLCardinality-03
FORMULA_NAME Philosophers-COL-000005-LTLCardinality-04
FORMULA_NAME Philosophers-COL-000005-LTLCardinality-05
FORMULA_NAME Philosophers-COL-000005-LTLCardinality-06
FORMULA_NAME Philosophers-COL-000005-LTLCardinality-07
FORMULA_NAME Philosophers-COL-000005-LTLCardinality-08
FORMULA_NAME Philosophers-COL-000005-LTLCardinality-09
FORMULA_NAME Philosophers-COL-000005-LTLCardinality-10
FORMULA_NAME Philosophers-COL-000005-LTLCardinality-11
FORMULA_NAME Philosophers-COL-000005-LTLCardinality-12
FORMULA_NAME Philosophers-COL-000005-LTLCardinality-13
FORMULA_NAME Philosophers-COL-000005-LTLCardinality-14
FORMULA_NAME Philosophers-COL-000005-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678787298933

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-COL-000005
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202303021504
[2023-03-14 09:48:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-14 09:48:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 09:48:21] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-14 09:48:21] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-14 09:48:21] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 392 ms
[2023-03-14 09:48:21] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 25 PT places and 25.0 transition bindings in 14 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2023-03-14 09:48:21] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 4 ms.
[2023-03-14 09:48:21] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Philosophers-COL-000005-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000005-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10000 steps, including 1412 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 21) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 5 rows 5 cols
[2023-03-14 09:48:21] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-14 09:48:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 09:48:21] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
[2023-03-14 09:48:21] [INFO ] Flatten gal took : 12 ms
[2023-03-14 09:48:22] [INFO ] Flatten gal took : 1 ms
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 5) 5) 5)]] contains successor/predecessor on variables of sort Philo
[2023-03-14 09:48:22] [INFO ] Unfolded HLPN to a Petri net with 25 places and 25 transitions 80 arcs in 5 ms.
[2023-03-14 09:48:22] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Support contains 25 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 7 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2023-03-14 09:48:22] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-14 09:48:22] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-14 09:48:22] [INFO ] Invariant cache hit.
[2023-03-14 09:48:22] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-14 09:48:22] [INFO ] Invariant cache hit.
[2023-03-14 09:48:22] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 124 ms. Remains : 25/25 places, 25/25 transitions.
Support contains 25 out of 25 places after structural reductions.
[2023-03-14 09:48:22] [INFO ] Flatten gal took : 5 ms
[2023-03-14 09:48:22] [INFO ] Flatten gal took : 10 ms
[2023-03-14 09:48:22] [INFO ] Input system was already deterministic with 25 transitions.
Incomplete random walk after 10000 steps, including 275 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 20) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-14 09:48:22] [INFO ] Invariant cache hit.
[2023-03-14 09:48:22] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 09:48:22] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-14 09:48:22] [INFO ] After 34ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA Philosophers-COL-000005-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
FORMULA Philosophers-COL-000005-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F((p0||X(p1))) U X(p2)))))'
Support contains 20 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-14 09:48:22] [INFO ] Invariant cache hit.
[2023-03-14 09:48:22] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-14 09:48:22] [INFO ] Invariant cache hit.
[2023-03-14 09:48:22] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-14 09:48:22] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 09:48:22] [INFO ] Invariant cache hit.
[2023-03-14 09:48:22] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 124 ms. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 288 ms :[(NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), false]
Running random walk in product with property : Philosophers-COL-000005-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ (ADD s15 s16 s17 s18 s19) (ADD s5 s6 s7 s8 s9)), p1:(LEQ 3 (ADD s10 s11 s12 s13 s14)), p2:(LEQ 1 (ADD s0 s1 s2 s3 s4))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 124 steps with 33 reset in 8 ms.
FORMULA Philosophers-COL-000005-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000005-LTLCardinality-00 finished in 482 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))'
Support contains 10 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-14 09:48:23] [INFO ] Invariant cache hit.
[2023-03-14 09:48:23] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-14 09:48:23] [INFO ] Invariant cache hit.
[2023-03-14 09:48:23] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-14 09:48:23] [INFO ] Invariant cache hit.
[2023-03-14 09:48:23] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 117 ms. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Philosophers-COL-000005-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ (ADD s0 s1 s2 s3 s4) (ADD s20 s21 s22 s23 s24))], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Philosophers-COL-000005-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000005-LTLCardinality-01 finished in 218 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 U p1))))'
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 4 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-14 09:48:23] [INFO ] Invariant cache hit.
[2023-03-14 09:48:23] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-14 09:48:23] [INFO ] Invariant cache hit.
[2023-03-14 09:48:23] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-14 09:48:23] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 09:48:23] [INFO ] Invariant cache hit.
[2023-03-14 09:48:23] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 111 ms. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Philosophers-COL-000005-LTLCardinality-02 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 (ADD s5 s6 s7 s8 s9) (ADD s15 s16 s17 s18 s19)), p0:(GT (ADD s15 s16 s17 s18 s19) (ADD s20 s21 s22 s23 s24))], 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 7278 reset in 363 ms.
Stack based approach found an accepted trace after 21 steps with 3 reset with depth 10 and stack size 10 in 0 ms.
FORMULA Philosophers-COL-000005-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000005-LTLCardinality-02 finished in 573 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(X(F(p0)))) U (G(p1) U p2))))'
Support contains 10 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-14 09:48:24] [INFO ] Invariant cache hit.
[2023-03-14 09:48:24] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-14 09:48:24] [INFO ] Invariant cache hit.
[2023-03-14 09:48:24] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-03-14 09:48:24] [INFO ] Invariant cache hit.
[2023-03-14 09:48:24] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110 ms. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 809 ms :[(NOT p2), (NOT p2), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Philosophers-COL-000005-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p2) p1), acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=8 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=9 dest: 9}]], initial=0, aps=[p2:(LEQ (ADD s5 s6 s7 s8 s9) (ADD s15 s16 s17 s18 s19)), p1:(LEQ 1 (ADD s5 s6 s7 s8 s9)), p0:(AND (LEQ 3 (ADD s5 s6 s7 s8 s9)) (LEQ 1 (ADD s5 s6 s7 s8 s9)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 9 steps with 1 reset in 1 ms.
FORMULA Philosophers-COL-000005-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000005-LTLCardinality-03 finished in 950 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 10 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-14 09:48:24] [INFO ] Invariant cache hit.
[2023-03-14 09:48:25] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-14 09:48:25] [INFO ] Invariant cache hit.
[2023-03-14 09:48:25] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-14 09:48:25] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 09:48:25] [INFO ] Invariant cache hit.
[2023-03-14 09:48:25] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 102 ms. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-COL-000005-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(GT 3 (ADD s0 s1 s2 s3 s4)), p1:(LEQ (ADD s0 s1 s2 s3 s4) (ADD s5 s6 s7 s8 s9))], nbAcceptance=2, 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 2758 reset in 221 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-COL-000005-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000005-LTLCardinality-05 finished in 370 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||G(!p1))))))'
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-14 09:48:25] [INFO ] Invariant cache hit.
[2023-03-14 09:48:25] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-14 09:48:25] [INFO ] Invariant cache hit.
[2023-03-14 09:48:25] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-14 09:48:25] [INFO ] Invariant cache hit.
[2023-03-14 09:48:25] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 104 ms. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 192 ms :[true, p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : Philosophers-COL-000005-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(LEQ (ADD s15 s16 s17 s18 s19) (ADD s5 s6 s7 s8 s9)), p0:(LEQ (ADD s15 s16 s17 s18 s19) (ADD s10 s11 s12 s13 s14))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA Philosophers-COL-000005-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000005-LTLCardinality-06 finished in 316 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)||F((G(F(p1))||(!p1&&F(p1)&&X(!p1)))))))'
Support contains 20 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-14 09:48:25] [INFO ] Invariant cache hit.
[2023-03-14 09:48:25] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-14 09:48:25] [INFO ] Invariant cache hit.
[2023-03-14 09:48:25] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-14 09:48:25] [INFO ] Invariant cache hit.
[2023-03-14 09:48:25] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 96 ms. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 274 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-COL-000005-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 5}, { cond=(AND p0 p1), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={} source=5 dest: 1}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 5}, { cond=(AND p0 p1), acceptance={} source=6 dest: 6}]], initial=4, aps=[p1:(LEQ (ADD s15 s16 s17 s18 s19) (ADD s0 s1 s2 s3 s4)), p0:(LEQ (ADD s20 s21 s22 s23 s24) (ADD s10 s11 s12 s13 s14))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 40 steps with 2 reset in 0 ms.
FORMULA Philosophers-COL-000005-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000005-LTLCardinality-08 finished in 387 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-14 09:48:26] [INFO ] Invariant cache hit.
[2023-03-14 09:48:26] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-14 09:48:26] [INFO ] Invariant cache hit.
[2023-03-14 09:48:26] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-14 09:48:26] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 09:48:26] [INFO ] Invariant cache hit.
[2023-03-14 09:48:26] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 104 ms. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000005-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GT 1 (ADD s5 s6 s7 s8 s9)) (LEQ (ADD s10 s11 s12 s13 s14) (ADD s15 s16 s17 s18 s19)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 8345 reset in 145 ms.
Stack based approach found an accepted trace after 140 steps with 16 reset with depth 7 and stack size 7 in 1 ms.
FORMULA Philosophers-COL-000005-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000005-LTLCardinality-09 finished in 341 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((!p0&&F(p1)&&X((p2&&X(p3))))))))'
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-14 09:48:26] [INFO ] Invariant cache hit.
[2023-03-14 09:48:26] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-14 09:48:26] [INFO ] Invariant cache hit.
[2023-03-14 09:48:26] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-14 09:48:26] [INFO ] Invariant cache hit.
[2023-03-14 09:48:26] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83 ms. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 449 ms :[(OR (NOT p1) (NOT p2) (NOT p3) p0), (OR (NOT p3) (NOT p2) (NOT p1) p0), (OR (NOT p1) (NOT p2) (NOT p3) p0), (NOT p1), (OR (NOT p2) (NOT p3)), (OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (NOT p3), (NOT p3)]
Running random walk in product with property : Philosophers-COL-000005-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 6}, { cond=(AND p0 p2), acceptance={} source=4 dest: 7}], [{ cond=(OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), acceptance={} source=5 dest: 3}], [{ cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2 (NOT p3)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=6 dest: 6}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=6 dest: 7}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=7 dest: 4}]], initial=0, aps=[p0:(GT 3 (ADD s0 s1 s2 s3 s4)), p1:(LEQ (ADD s20 s21 s22 s23 s24) (ADD s5 s6 s7 s8 s9)), p2:(LEQ (ADD s0 s1 s2 s3 s4) (ADD s20 s21 s22 s23 s24)), p3:(GT 2...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, 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 23 steps with 0 reset in 1 ms.
FORMULA Philosophers-COL-000005-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000005-LTLCardinality-11 finished in 560 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 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-14 09:48:26] [INFO ] Invariant cache hit.
[2023-03-14 09:48:26] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-14 09:48:26] [INFO ] Invariant cache hit.
[2023-03-14 09:48:27] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-03-14 09:48:27] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 09:48:27] [INFO ] Invariant cache hit.
[2023-03-14 09:48:27] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 91 ms. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-COL-000005-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ (ADD s10 s11 s12 s13 s14) (ADD s5 s6 s7 s8 s9))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 29 steps with 0 reset in 1 ms.
FORMULA Philosophers-COL-000005-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000005-LTLCardinality-13 finished in 140 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-14 09:48:27] [INFO ] Invariant cache hit.
[2023-03-14 09:48:27] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-14 09:48:27] [INFO ] Invariant cache hit.
[2023-03-14 09:48:27] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-14 09:48:27] [INFO ] Invariant cache hit.
[2023-03-14 09:48:27] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89 ms. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000005-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GT 2 (ADD s5 s6 s7 s8 s9))], 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]]
Product exploration explored 100000 steps with 18893 reset in 107 ms.
Stack based approach found an accepted trace after 1104 steps with 209 reset with depth 6 and stack size 6 in 2 ms.
FORMULA Philosophers-COL-000005-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000005-LTLCardinality-14 finished in 331 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 20 transition count 20
Applied a total of 10 rules in 7 ms. Remains 20 /25 variables (removed 5) and now considering 20/25 (removed 5) transitions.
// Phase 1: matrix 20 rows 20 cols
[2023-03-14 09:48:27] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-14 09:48:27] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-14 09:48:27] [INFO ] Invariant cache hit.
[2023-03-14 09:48:27] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-14 09:48:27] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 09:48:27] [INFO ] Invariant cache hit.
[2023-03-14 09:48:27] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/25 places, 20/25 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 109 ms. Remains : 20/25 places, 20/25 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000005-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 (ADD s15 s16 s17 s18 s19))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 11 steps with 1 reset in 0 ms.
FORMULA Philosophers-COL-000005-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000005-LTLCardinality-15 finished in 206 ms.
All properties solved by simple procedures.
Total runtime 6612 ms.

BK_STOP 1678787309177

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is Philosophers-COL-000005, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r293-tall-167873944900083"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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