Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r140-tall-162298995900203.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
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 r140-tall-162298995900203
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 316K
-rw-r--r-- 1 mcc users 8.4K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 27 07:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 27 07:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 25 08:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K Mar 25 08:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 9.7K May 5 16:51 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-00
FORMULA_NAME Philosophers-COL-000005-01
FORMULA_NAME Philosophers-COL-000005-02
FORMULA_NAME Philosophers-COL-000005-03
FORMULA_NAME Philosophers-COL-000005-04
FORMULA_NAME Philosophers-COL-000005-05
FORMULA_NAME Philosophers-COL-000005-06
FORMULA_NAME Philosophers-COL-000005-07
FORMULA_NAME Philosophers-COL-000005-08
FORMULA_NAME Philosophers-COL-000005-09
FORMULA_NAME Philosophers-COL-000005-10
FORMULA_NAME Philosophers-COL-000005-11
FORMULA_NAME Philosophers-COL-000005-12
FORMULA_NAME Philosophers-COL-000005-13
FORMULA_NAME Philosophers-COL-000005-14
FORMULA_NAME Philosophers-COL-000005-15

=== Now, execution of the tool begins

BK_START 1623437570577

Running Version 0
[2021-06-11 18:52:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-06-11 18:52:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-06-11 18:52:52] [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.
[2021-06-11 18:52:52] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-06-11 18:52:52] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 630 ms
[2021-06-11 18:52:52] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 25 PT places and 25.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
FORMULA Philosophers-COL-000005-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-06-11 18:52:52] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions in 13 ms.
[2021-06-11 18:52:52] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_4441744773658919719.dot
[2021-06-11 18:52:52] [INFO ] Initial state test concluded for 6 properties.
FORMULA Philosophers-COL-000005-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000005-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000005-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 100000 steps, including 14215 resets, run finished after 84 ms. (steps per millisecond=1190 ) properties (out of 22) seen :20
Running SMT prover for 2 properties.
// Phase 1: matrix 5 rows 5 cols
[2021-06-11 18:52:53] [INFO ] Computed 2 place invariants in 5 ms
[2021-06-11 18:52:53] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned unsat
[2021-06-11 18:52:53] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA Philosophers-COL-000005-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000005-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-06-11 18:52:53] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-06-11 18:52:53] [INFO ] Flatten gal took : 17 ms
FORMULA Philosophers-COL-000005-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-06-11 18:52:53] [INFO ] Flatten gal took : 2 ms
[2021-06-11 18:52:53] [INFO ] Unfolded HLPN to a Petri net with 25 places and 25 transitions in 1 ms.
[2021-06-11 18:52:53] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_1865457638172079870.dot
[2021-06-11 18:52:53] [INFO ] Initial state test concluded for 3 properties.
Support contains 25 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 6 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:53] [INFO ] Computed 10 place invariants in 2 ms
[2021-06-11 18:52:53] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:53] [INFO ] Computed 10 place invariants in 2 ms
[2021-06-11 18:52:53] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:53] [INFO ] Computed 10 place invariants in 4 ms
[2021-06-11 18:52:53] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
[2021-06-11 18:52:53] [INFO ] Flatten gal took : 5 ms
[2021-06-11 18:52:53] [INFO ] Flatten gal took : 5 ms
[2021-06-11 18:52:53] [INFO ] Input system was already deterministic with 25 transitions.
Finished random walk after 38 steps, including 1 resets, run visited all 19 properties in 1 ms. (steps per millisecond=38 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)||X(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions, 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.
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:53] [INFO ] Computed 10 place invariants in 9 ms
[2021-06-11 18:52:53] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:53] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-11 18:52:53] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:53] [INFO ] Computed 10 place invariants in 3 ms
[2021-06-11 18:52:53] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 316 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-COL-000005-00 automaton TGBA [mat=[[{ cond=(NOT p1), 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=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(LEQ 2 (ADD s15 s16 s17 s18 s19)), p0:(LEQ 1 (ADD s15 s16 s17 s18 s19))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 54 steps with 6 reset in 10 ms.
FORMULA Philosophers-COL-000005-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000005-00 finished in 470 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0 U (G(p0)||(F(p2)&&p1))))))], workingDir=/home/mcc/execution]
Support contains 20 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 21 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:53] [INFO ] Computed 10 place invariants in 1 ms
[2021-06-11 18:52:53] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:53] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-11 18:52:53] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2021-06-11 18:52:53] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:54] [INFO ] Computed 10 place invariants in 1 ms
[2021-06-11 18:52:54] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Philosophers-COL-000005-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GT (ADD s5 s6 s7 s8 s9) (ADD s10 s11 s12 s13 s14)) (GT (ADD s10 s11 s12 s13 s14) (ADD s15 s16 s17 s18 s19))), p0:(AND (GT (ADD s5 s6 s7 s8 s9) (ADD s10 s11 s12 s13 s14)) (GT (ADD s10 s11 s12 s13 s14) (ADD s15 s16 s17 s18 s19))), p2:(AND (LEQ (ADD s5 s6 s7 s8 s9) (ADD s10 s11 s12 s13 s14)) (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][true, true, true]]
Stuttering criterion allowed to conclude after 43 steps with 1 reset in 3 ms.
FORMULA Philosophers-COL-000005-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000005-01 finished in 267 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((G(p0) U X(p1)))&&F(p2)))], workingDir=/home/mcc/execution]
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions, 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.
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:54] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-11 18:52:54] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:54] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-11 18:52:54] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:54] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-11 18:52:54] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (NOT p2), (NOT p1), true, (NOT p0)]
Running random walk in product with property : Philosophers-COL-000005-03 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ 3 (ADD s10 s11 s12 s13 s14)), p2:(LEQ (ADD s15 s16 s17 s18 s19) (ADD s0 s1 s2 s3 s4)), p1:(GT 1 (ADD s0 s1 s2 s3 s4))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Philosophers-COL-000005-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000005-03 finished in 335 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((!p0||X(X((G(F(p1))||G(p2)))))))], workingDir=/home/mcc/execution]
Support contains 20 out of 25 places. Attempting structural reductions.
Starting structural reductions, 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.
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:54] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-11 18:52:54] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:54] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-11 18:52:54] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:54] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-11 18:52:54] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 197 ms :[(AND p0 (NOT p2) (NOT p1)), (AND p0 (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : Philosophers-COL-000005-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(NOT p2), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ 1 (ADD s15 s16 s17 s18 s19)), p2:(GT (ADD s10 s11 s12 s13 s14) (ADD s20 s21 s22 s23 s24)), p1:(GT 2 (ADD s0 s1 s2 s3 s4))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 15177 reset in 236 ms.
Stack based approach found an accepted trace after 80 steps with 12 reset with depth 10 and stack size 10 in 1 ms.
FORMULA Philosophers-COL-000005-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000005-04 finished in 505 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(!p0)||G((p1||X(G(p2))))))], workingDir=/home/mcc/execution]
Support contains 20 out of 25 places. Attempting structural reductions.
Starting structural reductions, 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.
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:55] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-11 18:52:55] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:55] [INFO ] Computed 10 place invariants in 2 ms
[2021-06-11 18:52:55] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:55] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-11 18:52:55] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p2), (AND (NOT p2) p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) p0 (NOT p1)), true, p0]
Running random walk in product with property : Philosophers-COL-000005-05 automaton TGBA [mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 4}, { cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=3, aps=[p2:(GT 2 (ADD s10 s11 s12 s13 s14)), p0:(GT (ADD s10 s11 s12 s13 s14) (ADD s20 s21 s22 s23 s24)), p1:(GT (ADD s5 s6 s7 s8 s9) (ADD s15 s16 s17 s18 s19))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA Philosophers-COL-000005-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000005-05 finished in 238 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 10 out of 25 places. Attempting structural reductions.
Starting structural reductions, 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.
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:55] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-11 18:52:55] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:55] [INFO ] Computed 10 place invariants in 1 ms
[2021-06-11 18:52:55] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2021-06-11 18:52:55] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:55] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-11 18:52:55] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Philosophers-COL-000005-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (LEQ 1 (ADD s20 s21 s22 s23 s24)) (LEQ 1 (ADD s15 s16 s17 s18 s19))), p1:(AND (LEQ (ADD s15 s16 s17 s18 s19) (ADD s20 s21 s22 s23 s24)) (LEQ 1 (ADD s20 s21 s22 s23 s24)))], 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 16 steps with 1 reset in 0 ms.
FORMULA Philosophers-COL-000005-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000005-07 finished in 168 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 10 out of 25 places. Attempting structural reductions.
Starting structural reductions, 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.
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:55] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-11 18:52:55] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:55] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-11 18:52:55] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:55] [INFO ] Computed 10 place invariants in 1 ms
[2021-06-11 18:52:55] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000005-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s10 s11 s12 s13 s14) (ADD s15 s16 s17 s18 s19))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 42 steps with 12 reset in 0 ms.
FORMULA Philosophers-COL-000005-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000005-11 finished in 154 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 10 out of 25 places. Attempting structural reductions.
Starting structural reductions, 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.
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:55] [INFO ] Computed 10 place invariants in 1 ms
[2021-06-11 18:52:55] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:55] [INFO ] Computed 10 place invariants in 4 ms
[2021-06-11 18:52:55] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2021-06-11 18:52:55] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:55] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-11 18:52:55] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-COL-000005-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ (ADD s0 s1 s2 s3 s4) (ADD s10 s11 s12 s13 s14))], 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]]
Product exploration explored 100000 steps with 13225 reset in 150 ms.
Stack based approach found an accepted trace after 63 steps with 9 reset with depth 7 and stack size 7 in 1 ms.
FORMULA Philosophers-COL-000005-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000005-12 finished in 264 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||(p1 U (p2||G(p1))))))], workingDir=/home/mcc/execution]
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions, 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.
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:55] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-11 18:52:55] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:55] [INFO ] Computed 10 place invariants in 1 ms
[2021-06-11 18:52:55] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2021-06-11 18:52:55] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-11 18:52:55] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-11 18:52:55] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : Philosophers-COL-000005-14 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GT 3 (ADD s15 s16 s17 s18 s19)) (GT (ADD s20 s21 s22 s23 s24) (ADD s15 s16 s17 s18 s19))), p2:(AND (GT (ADD s0 s1 s2 s3 s4) (ADD s20 s21 s22 s23 s24)) (GT (ADD s20 s21 s22 s23 s24) (ADD s15 s16 s17 s18 s19))), p1:(GT (ADD s20 s21 s22 s23 s24) (ADD s15 s16 s17 s18 s19))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 61 steps with 6 reset in 0 ms.
FORMULA Philosophers-COL-000005-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000005-14 finished in 133 ms.
All properties solved without resorting to model-checking.

BK_STOP 1623437576986

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-4028"
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 r140-tall-162298995900203"
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 ;